{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15860133,0.016357308,0.5154684,0.008859808,0.0026508565,0.00013054059,0.00039500018,0.0004102099,0.2971266],"genre_scores_gemma":[0.8339418,0.006625287,0.100087345,0.0011014505,0.0026138523,0.00019488145,0.0002536989,0.00022452098,0.054957125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989273,0.00038967657,0.00008423506,0.00021776707,0.00025680798,0.00012418292],"domain_scores_gemma":[0.99627423,0.0021390503,0.00025936856,0.00027460096,0.0005359399,0.0005168023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027224116,0.0008713673,0.0011938517,0.004831441,0.0030094031,0.0038425655,0.0014205071,0.0021130282,0.009116259],"category_scores_gemma":[0.008728922,0.0008312913,0.0014189829,0.0030585506,0.0064441785,0.00991506,0.0047009797,0.005223588,0.00084295636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012676075,0.000014830224,0.00004432565,0.000013530349,0.000002201205,0.000021819025,0.000110957684,0.000111198795,0.0000995328,0.99670655,0.00043396725,0.0024284597],"study_design_scores_gemma":[0.0000071411155,0.0000044961203,0.00002379557,0.000009154861,0.0000028866282,0.000043117478,0.00006169865,0.0015023303,0.00009567508,0.9961188,0.0021256884,0.0000052934824],"about_ca_topic_score_codex":0.00080706744,"about_ca_topic_score_gemma":0.0005528137,"teacher_disagreement_score":0.009116259,"about_ca_system_score_codex":0.0015132028,"about_ca_system_score_gemma":0.00082631706,"threshold_uncertainty_score":0.030496955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11916555,0.00074336026,0.80316424,0.00048802598,0.0004386493,0.00012311758,0.00039984327,0.0015706641,0.07390653],"genre_scores_gemma":[0.7294308,0.0005755649,0.24407458,0.0002804103,0.00013899931,0.00014457638,0.000488484,0.00035444112,0.02451204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883956,0.00026647834,0.000082988845,0.0001926531,0.00044891675,0.00016948284],"domain_scores_gemma":[0.99907076,0.000298673,0.00007257387,0.00027671066,0.000115540184,0.00016573649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011789876,0.0005651313,0.00063764106,0.0014194065,0.0013894148,0.0030699696,0.0013080032,0.0005560981,0.00653082],"category_scores_gemma":[0.002337987,0.0006806283,0.00089322473,0.0011401637,0.002212665,0.0061078123,0.005575302,0.0022872428,0.0017732362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044040557,0.000023456869,0.0001966861,0.0000449799,0.000009599451,0.0000650072,0.00027542128,0.0006941231,0.002940229,0.9810042,0.00088165497,0.013820482],"study_design_scores_gemma":[0.000039125494,0.00011603241,0.0004286713,0.00007015769,0.00005234192,0.00046879653,0.00028512534,0.009512502,0.01444179,0.9392866,0.035238873,0.000059998343],"about_ca_topic_score_codex":0.0003815286,"about_ca_topic_score_gemma":0.00044770722,"teacher_disagreement_score":0.00653082,"about_ca_system_score_codex":0.0008932465,"about_ca_system_score_gemma":0.00045721568,"threshold_uncertainty_score":0.021847785},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027324609,0.06908127,0.07163747,0.007779266,0.0055244677,0.00012218025,0.00028362984,0.0010529251,0.84178615],"genre_scores_gemma":[0.068418086,0.07401796,0.076769724,0.0052406113,0.0074563925,0.00031878916,0.00086543796,0.0011101704,0.7658029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991254,0.00022275125,0.000040591905,0.00013422983,0.0004053338,0.00007166431],"domain_scores_gemma":[0.99902844,0.0005154606,0.000043922817,0.000121689314,0.00019863388,0.00009187887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373273,0.0008144411,0.0007447522,0.001873019,0.0018200497,0.005590988,0.0008890518,0.00085493154,0.033394974],"category_scores_gemma":[0.0028870269,0.00053231453,0.0007193191,0.0034094949,0.0023640953,0.007959901,0.0021789665,0.0030256882,0.011020459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000976453,0.000014931248,0.00009455956,0.00024046161,0.000008127879,0.000056546596,0.00044563378,0.00058840134,0.00043029318,0.8222,0.111162014,0.06474932],"study_design_scores_gemma":[0.0000033512142,0.000008938003,0.00016511286,0.00017534485,0.0000051924576,0.00018134652,0.00014973257,0.0013474807,0.00020100568,0.30798334,0.6897701,0.000009110561],"about_ca_topic_score_codex":0.0011092051,"about_ca_topic_score_gemma":0.0015337273,"teacher_disagreement_score":0.033394974,"about_ca_system_score_codex":0.0028090924,"about_ca_system_score_gemma":0.0017098149,"threshold_uncertainty_score":0.111717284},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16518527,0.009346278,0.62642455,0.0039346414,0.0007178235,0.00012636214,0.00035264227,0.0009928285,0.19291957],"genre_scores_gemma":[0.88658214,0.0032302078,0.0780928,0.00095256657,0.0007832117,0.00021388919,0.00029579943,0.0003692211,0.029480059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981774,0.0006252217,0.00016315609,0.000338936,0.00045440154,0.00024083121],"domain_scores_gemma":[0.9969009,0.00195945,0.00012680971,0.0005827114,0.00027516336,0.00015504548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026744276,0.001207713,0.0016554074,0.0023209688,0.002233256,0.004200995,0.0015092173,0.0016288457,0.0053508235],"category_scores_gemma":[0.005440379,0.0011095454,0.0018635392,0.0025750005,0.010211309,0.013758823,0.0033502786,0.0059595634,0.00078083837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011422145,0.0000038079788,0.000033268516,0.000020315198,0.0000036915415,0.000026592537,0.00026053496,0.0004192428,0.00027426588,0.99621516,0.00027745386,0.0024541675],"study_design_scores_gemma":[0.0000038251837,0.0000037978493,0.000014493273,0.000005997074,0.0000022202657,0.000018176192,0.00001827708,0.00056498335,0.00008946175,0.9983151,0.0009596179,0.000004016067],"about_ca_topic_score_codex":0.0011524984,"about_ca_topic_score_gemma":0.0011022593,"teacher_disagreement_score":0.0053508235,"about_ca_system_score_codex":0.0022456977,"about_ca_system_score_gemma":0.0008968056,"threshold_uncertainty_score":0.017900288},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070165596,0.0029849429,0.84047866,0.0028793104,0.0006814862,0.0000770654,0.00036567365,0.00019008097,0.14532623],"genre_scores_gemma":[0.42792696,0.00948285,0.47387767,0.0012711276,0.0025980356,0.0004932176,0.0008877832,0.0002655325,0.083196774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985453,0.0004573236,0.0001550177,0.00018891173,0.00056547316,0.00008814752],"domain_scores_gemma":[0.99883145,0.0005806917,0.000078789366,0.00015595759,0.000289071,0.0000639929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014885241,0.00077101984,0.0008518634,0.0018414047,0.0017601781,0.0041398476,0.001464246,0.00089961436,0.016100125],"category_scores_gemma":[0.0032261072,0.00079187966,0.001595505,0.0037791817,0.0033978086,0.011559489,0.0020878064,0.0046016676,0.002656649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035972237,0.0000053028625,0.000012079409,0.000028316816,0.0000033193646,0.000012189588,0.00005195817,0.00032080896,0.00010670869,0.9909648,0.0009956931,0.0074952603],"study_design_scores_gemma":[0.0000051952306,0.00000653346,0.000024034625,0.000011528442,0.000005284341,0.000055266013,0.000030438705,0.0017296361,0.00010146418,0.98440254,0.013621609,0.0000064152596],"about_ca_topic_score_codex":0.0011600975,"about_ca_topic_score_gemma":0.0014313665,"teacher_disagreement_score":0.016100125,"about_ca_system_score_codex":0.0020779832,"about_ca_system_score_gemma":0.0009503297,"threshold_uncertainty_score":0.053860307},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22236262,0.0035724626,0.14643076,0.0031653633,0.0008262318,0.00008995801,0.0016725489,0.0011183176,0.6207617],"genre_scores_gemma":[0.9041466,0.0009709215,0.015642615,0.00075381005,0.00047763818,0.000053375174,0.0011435299,0.00034895618,0.076462485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877626,0.00019230205,0.00007983239,0.00044972773,0.0002718354,0.00022996936],"domain_scores_gemma":[0.9974868,0.00083528727,0.00022750233,0.00053666235,0.0005735274,0.0003401857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008337406,0.0005157126,0.00081540673,0.0018629,0.0027107876,0.0043083606,0.00086451595,0.001205774,0.023700954],"category_scores_gemma":[0.004336778,0.000488916,0.000929838,0.0016202596,0.0030688143,0.010358083,0.0032956474,0.0027807476,0.0025011436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003520993,0.00001413034,0.0004036548,0.000046190733,0.000013609143,0.000073516676,0.00022344208,0.00019542193,0.00060007913,0.98786956,0.003638413,0.0068868673],"study_design_scores_gemma":[0.000014595398,0.000015813494,0.00064469106,0.000026151978,0.000021346028,0.00033234054,0.00020236504,0.001280733,0.00090335484,0.9752829,0.021260522,0.000015136758],"about_ca_topic_score_codex":0.0017171704,"about_ca_topic_score_gemma":0.0018096596,"teacher_disagreement_score":0.023700954,"about_ca_system_score_codex":0.0019116492,"about_ca_system_score_gemma":0.00050306483,"threshold_uncertainty_score":0.07928759},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64928496,0.0032134927,0.27452865,0.005085614,0.0001539212,0.00012540742,0.0018052029,0.00070824014,0.06509448],"genre_scores_gemma":[0.9284992,0.00079127256,0.059082627,0.0005997983,0.00020491885,0.00019642962,0.0015716716,0.00011549078,0.008938482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963356,0.00076111464,0.00034755928,0.0012615772,0.00080233184,0.00049181154],"domain_scores_gemma":[0.98919666,0.0061879163,0.0008734329,0.0018474763,0.0009450738,0.0009494678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029256039,0.00041772932,0.0013338139,0.0009553627,0.0030179194,0.0030827308,0.0010749445,0.0017142148,0.007250109],"category_scores_gemma":[0.013053168,0.000749344,0.0012214751,0.001182054,0.0042207893,0.009532007,0.0044329213,0.0017992295,0.00062221184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026090097,0.000030346788,0.0048589446,0.00019950168,0.00003279062,0.00025906,0.0014536511,0.0013616633,0.0036053725,0.96336204,0.002167198,0.022408525],"study_design_scores_gemma":[0.00004086592,0.00007749283,0.002501035,0.000081057886,0.00005488894,0.0012583607,0.001360504,0.003972219,0.0046475814,0.9596743,0.026290158,0.000041659456],"about_ca_topic_score_codex":0.00085685984,"about_ca_topic_score_gemma":0.00072749524,"teacher_disagreement_score":0.007250109,"about_ca_system_score_codex":0.0016120785,"about_ca_system_score_gemma":0.0010181934,"threshold_uncertainty_score":0.024254024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.913867,0.00029683957,0.011524443,0.00049452385,0.0000848992,0.000017584083,0.00014606294,0.00006795803,0.073500805],"genre_scores_gemma":[0.9917217,0.00011940219,0.0022359546,0.000073620504,0.000036492303,0.000009025883,0.000092196846,0.000018432089,0.0056931153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999713,0.000042507974,0.00001218686,0.000050699033,0.00008560486,0.00009603972],"domain_scores_gemma":[0.9997359,0.000056356308,0.000055437307,0.00004264306,0.00002982012,0.000079890495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020346015,0.00033762018,0.00025553725,0.000934292,0.00096445024,0.0014500205,0.0004054043,0.00036370984,0.0041341702],"category_scores_gemma":[0.0009487546,0.0001775219,0.0002966959,0.00038287693,0.0015589508,0.0012471897,0.0015192725,0.001007369,0.00043075232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038045706,0.000058153833,0.0040754993,0.000114080096,0.000013284069,0.001179473,0.00056491926,0.0035516093,0.013464997,0.9514205,0.0017363383,0.023440635],"study_design_scores_gemma":[0.000086121145,0.00015367506,0.0038820698,0.0000912185,0.000030561074,0.0032931836,0.00080766075,0.013119459,0.012913923,0.93554455,0.030010048,0.000067564775],"about_ca_topic_score_codex":0.00037358116,"about_ca_topic_score_gemma":0.00038291945,"teacher_disagreement_score":0.0041341702,"about_ca_system_score_codex":0.00053480576,"about_ca_system_score_gemma":0.00026699642,"threshold_uncertainty_score":0.013830185},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002938029,0.016821515,0.012332625,0.002246871,0.0008818126,0.000017550155,0.00022755805,0.00023127893,0.9643028],"genre_scores_gemma":[0.25173897,0.026487364,0.019555,0.0012230619,0.0033710762,0.0001314271,0.0011293936,0.0005188934,0.6958448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996501,0.000101138816,0.000012784076,0.000056086934,0.00014441986,0.00003544342],"domain_scores_gemma":[0.9998172,0.00006598286,0.000010321878,0.000037405065,0.000043260647,0.000025856587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030801079,0.0005887653,0.00044922763,0.0016880005,0.0014337582,0.004687841,0.0006479807,0.0004891299,0.021024564],"category_scores_gemma":[0.00081522804,0.00038662067,0.00035997987,0.001955493,0.0032878297,0.004009223,0.0012803046,0.0023377724,0.005519234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043912046,0.0000038924322,0.000027718377,0.000024200273,0.0000012519108,0.000007946637,0.0001590254,0.000084985666,0.00008342062,0.9693608,0.019076925,0.011165352],"study_design_scores_gemma":[0.000005115685,0.000003332877,0.000087541506,0.000035775294,0.0000022163563,0.00006137174,0.00009347191,0.00022622911,0.00008351405,0.719928,0.2794692,0.0000041229036],"about_ca_topic_score_codex":0.0014827105,"about_ca_topic_score_gemma":0.0018428803,"teacher_disagreement_score":0.021024564,"about_ca_system_score_codex":0.0019390587,"about_ca_system_score_gemma":0.00089807407,"threshold_uncertainty_score":0.07033414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33733904,0.0010575217,0.47480118,0.00069279596,0.00045907722,0.00009655755,0.00029685203,0.00040295403,0.18485393],"genre_scores_gemma":[0.8192859,0.0007714081,0.08342684,0.0003715055,0.00048891123,0.0001591564,0.00057582115,0.0002844109,0.09463602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967647,0.00007417828,0.000021490503,0.000062399646,0.00011642201,0.000049071925],"domain_scores_gemma":[0.999569,0.00010176381,0.000036681504,0.000057252357,0.000121174235,0.00011405466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005716074,0.0006469634,0.00060673023,0.0013953595,0.0008157386,0.0020461094,0.00072146894,0.00044885694,0.0061354428],"category_scores_gemma":[0.000679172,0.00041945494,0.0007222153,0.0005433793,0.0015270524,0.0032094365,0.0014888516,0.0021005066,0.0011979943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018088967,0.000011045233,0.00004611609,0.000017200193,0.000004158519,0.00003207085,0.00010025348,0.00033018418,0.0013396578,0.9946924,0.0003715256,0.003037403],"study_design_scores_gemma":[0.00000662722,0.00002156929,0.00011969765,0.000007917845,0.0000075856706,0.00010841331,0.000048986138,0.0037031341,0.001250104,0.9910188,0.0036994985,0.000007541749],"about_ca_topic_score_codex":0.00016688685,"about_ca_topic_score_gemma":0.00025332562,"teacher_disagreement_score":0.0061354428,"about_ca_system_score_codex":0.0005330411,"about_ca_system_score_gemma":0.00037754307,"threshold_uncertainty_score":0.020525098},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178588,0.00054913707,0.034317657,0.0018871935,0.00015382412,0.000039192673,0.00017345688,0.00015864952,0.044862095],"genre_scores_gemma":[0.99070215,0.00015142879,0.0035769145,0.000085919404,0.00011630008,0.000018132097,0.00014263415,0.00002035608,0.0051860255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990294,0.00027208688,0.00005748706,0.00013578543,0.0002613888,0.0002437769],"domain_scores_gemma":[0.99754286,0.0009523685,0.00045147704,0.00027661017,0.00029320022,0.0004833582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096039544,0.00046593224,0.00048255202,0.0014182748,0.0016271261,0.0026997663,0.0008038427,0.0006838728,0.0048305835],"category_scores_gemma":[0.0028587733,0.00031476098,0.0005582474,0.0010575327,0.0048983744,0.0044785966,0.0023975256,0.0016464768,0.0004109263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008887545,0.000015767468,0.0005648492,0.000022247446,0.000005469662,0.00022247584,0.0005770298,0.00083674735,0.0015229426,0.99360067,0.00050412567,0.002038758],"study_design_scores_gemma":[0.000028463515,0.000038630424,0.00030345249,0.000010345775,0.0000060348325,0.00018989191,0.0006516563,0.0036646284,0.0012975655,0.9900412,0.0037553234,0.0000128086795],"about_ca_topic_score_codex":0.0016292444,"about_ca_topic_score_gemma":0.0013753532,"teacher_disagreement_score":0.0048305835,"about_ca_system_score_codex":0.0015274326,"about_ca_system_score_gemma":0.0006730654,"threshold_uncertainty_score":0.016159892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5674974,0.003150154,0.36384875,0.0018203252,0.00036641545,0.00013159482,0.00045253048,0.00026004142,0.062472977],"genre_scores_gemma":[0.9729428,0.0007416656,0.020343918,0.0002223586,0.00043196988,0.000119884164,0.00020072723,0.000036707355,0.0049599158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878126,0.0002580027,0.00008460796,0.00026630098,0.00045814112,0.00015161974],"domain_scores_gemma":[0.99828774,0.0005565288,0.00028464833,0.00017624158,0.0004376482,0.00025712472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011294467,0.00037307883,0.0004557851,0.0023130167,0.0016546801,0.0022833082,0.0007765305,0.0005937639,0.003647037],"category_scores_gemma":[0.0023667826,0.00034875516,0.00082312804,0.0012329104,0.0036803323,0.006462942,0.0032116966,0.0014836356,0.00041297858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021301496,0.000018244617,0.0005686881,0.00006916655,0.000012504685,0.00014885874,0.00038658804,0.0003574484,0.0023137082,0.99112344,0.00024525155,0.0047347876],"study_design_scores_gemma":[0.00001808798,0.000074424344,0.0017452633,0.000018996723,0.000018678818,0.00073697243,0.00016338019,0.003562961,0.0023510936,0.98135465,0.009922002,0.000033386867],"about_ca_topic_score_codex":0.0003652608,"about_ca_topic_score_gemma":0.00015010525,"teacher_disagreement_score":0.003647037,"about_ca_system_score_codex":0.00070069975,"about_ca_system_score_gemma":0.0006047659,"threshold_uncertainty_score":0.012200534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25034675,0.003454253,0.4643038,0.004085806,0.0013499451,0.00015507668,0.0023033624,0.0014872306,0.27251387],"genre_scores_gemma":[0.7552176,0.0022613094,0.15369776,0.0019397549,0.0008307358,0.00031313344,0.001903182,0.0007399406,0.083096676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728024,0.0008454702,0.00021976065,0.00053792656,0.00071667234,0.00039988442],"domain_scores_gemma":[0.9965127,0.0014898469,0.00024460084,0.0004690909,0.0008451176,0.00043867296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662666,0.00071770244,0.00083018583,0.002264682,0.0028081948,0.004242113,0.0009849388,0.0012000228,0.009758349],"category_scores_gemma":[0.0037754907,0.00090845587,0.0020248217,0.0016087956,0.0039039222,0.008490067,0.0046301424,0.0028721222,0.002484416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004041083,0.000014772231,0.0001575822,0.000035358255,0.0000074157424,0.00011023074,0.00030421434,0.00039576204,0.0007193502,0.9907499,0.0013643292,0.0061007156],"study_design_scores_gemma":[0.000019064759,0.00002712547,0.00025886553,0.000034392808,0.000009610053,0.0001679286,0.00024318838,0.0022953316,0.00095758925,0.98231804,0.013642322,0.000026461226],"about_ca_topic_score_codex":0.0026559618,"about_ca_topic_score_gemma":0.002611013,"teacher_disagreement_score":0.009758349,"about_ca_system_score_codex":0.0025564618,"about_ca_system_score_gemma":0.0014530185,"threshold_uncertainty_score":0.032644928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45126843,0.0029782252,0.24204041,0.0037893867,0.00033021386,0.0001008049,0.0011055644,0.00047051138,0.29791662],"genre_scores_gemma":[0.9390192,0.00073851185,0.027969426,0.00053440384,0.00021500817,0.000062892505,0.0006435514,0.00012974191,0.030687263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945325,0.0001520932,0.000027959215,0.00010304084,0.00014846599,0.00011517388],"domain_scores_gemma":[0.9985348,0.00079086394,0.0001083958,0.00016076595,0.00021008024,0.00019502686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345555,0.0003587958,0.00044981105,0.00097133924,0.0013494695,0.0023248154,0.0009025008,0.0009233785,0.0106953215],"category_scores_gemma":[0.0023653924,0.00037073687,0.0004702456,0.0011470879,0.0023575816,0.0062751155,0.0018554262,0.0020252417,0.0010019987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003391233,0.000014296201,0.00027342216,0.000029068007,0.0000071096106,0.00007348832,0.00014311896,0.0007502033,0.00077810645,0.9901563,0.0015513822,0.006189547],"study_design_scores_gemma":[0.0000094685165,0.00001229843,0.0002799964,0.000010840561,0.000008546532,0.00013384092,0.0000918076,0.0039003717,0.00055251864,0.9906002,0.0043943087,0.000005742332],"about_ca_topic_score_codex":0.0019842887,"about_ca_topic_score_gemma":0.0024339524,"teacher_disagreement_score":0.0106953215,"about_ca_system_score_codex":0.0012686737,"about_ca_system_score_gemma":0.00041823395,"threshold_uncertainty_score":0.035779357},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011979061,0.15171404,0.0182995,0.43567705,0.012331808,0.00009847961,0.0014775557,0.00040809132,0.36801445],"genre_scores_gemma":[0.39469916,0.1461774,0.017498365,0.09538083,0.01798269,0.0007973149,0.0020606453,0.0009539921,0.32444963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988594,0.0003276883,0.000085373504,0.00024150977,0.00037512506,0.000111006215],"domain_scores_gemma":[0.99683434,0.0019718981,0.0001962601,0.00019656432,0.0007116851,0.00008925088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017985215,0.00083705207,0.0011140815,0.0019133532,0.004893071,0.003539801,0.0012114231,0.0031655473,0.028496707],"category_scores_gemma":[0.0067184535,0.00055039994,0.0010024722,0.0023522736,0.004431857,0.011100286,0.0025888102,0.007232134,0.0064973524],"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.00012988498,0.000035875888,0.00062228425,0.0002786404,0.000028819526,0.00018577382,0.0018091172,0.0003879987,0.00036618102,0.6885843,0.296045,0.011526152],"study_design_scores_gemma":[0.000039929408,0.000029606024,0.0017060554,0.0003274581,0.000030019584,0.00021712462,0.0009772417,0.00057482254,0.00076341146,0.5629205,0.43233114,0.00008258194],"about_ca_topic_score_codex":0.0149662085,"about_ca_topic_score_gemma":0.022988202,"teacher_disagreement_score":0.028496707,"about_ca_system_score_codex":0.0050088936,"about_ca_system_score_gemma":0.0014694255,"threshold_uncertainty_score":0.09533101},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017562538,0.0016625044,0.9527574,0.0015371166,0.0006334508,0.00039435743,0.002738724,0.006776665,0.015937218],"genre_scores_gemma":[0.13000624,0.0017170499,0.8451891,0.0007816459,0.00037677345,0.0003521045,0.0055340272,0.0011385175,0.014904592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597013,0.0007394721,0.000674358,0.0007929357,0.0015294881,0.00029362625],"domain_scores_gemma":[0.9937808,0.0015416105,0.0003298451,0.0021246648,0.0016477625,0.0005753182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037495955,0.0007670219,0.0019047499,0.004704102,0.003718303,0.009881604,0.004256458,0.002486511,0.013848995],"category_scores_gemma":[0.013425299,0.0022046694,0.0015796346,0.0058606775,0.0025202911,0.021520564,0.0097241625,0.0044031534,0.005232573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026146468,0.00023244151,0.0012306193,0.000553673,0.00008431973,0.00054661,0.0014462549,0.00469818,0.0037017714,0.7409057,0.027456615,0.21888225],"study_design_scores_gemma":[0.00012783447,0.0000586784,0.00039534108,0.00038658665,0.00020531111,0.00071077596,0.0009301456,0.034954816,0.0076912963,0.78342223,0.17098671,0.00013021725],"about_ca_topic_score_codex":0.0044172183,"about_ca_topic_score_gemma":0.005654576,"teacher_disagreement_score":0.013848995,"about_ca_system_score_codex":0.0017849826,"about_ca_system_score_gemma":0.0032701525,"threshold_uncertainty_score":0.0463295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62277627,0.0020054632,0.27995598,0.0016662873,0.00032364542,0.000080348414,0.0008515284,0.00074782514,0.09159262],"genre_scores_gemma":[0.9564857,0.0004263692,0.024381671,0.00031107446,0.00011055964,0.00004892089,0.0005644863,0.00011592286,0.017555283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984231,0.00026307045,0.000112200905,0.00037183182,0.00041184732,0.00041801034],"domain_scores_gemma":[0.9983311,0.00052124495,0.00019818333,0.00028493392,0.00035869874,0.00030587873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010355243,0.00062557886,0.0007887535,0.0021298088,0.0021870066,0.0029889797,0.0008858783,0.0008446774,0.007667536],"category_scores_gemma":[0.00268483,0.00047357703,0.0014614377,0.0015123232,0.0045758924,0.0058712023,0.0035286054,0.0019443026,0.000760808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003438102,0.000008176768,0.00041761732,0.000027385177,0.00000821662,0.00011212204,0.00037786175,0.0008393969,0.0006315975,0.993335,0.00035474982,0.0038534235],"study_design_scores_gemma":[0.000014314248,0.00004633798,0.00057085924,0.000023162105,0.0000158035,0.0001395469,0.00046564147,0.0057704826,0.0010998666,0.9845451,0.00728661,0.000022231825],"about_ca_topic_score_codex":0.0071746293,"about_ca_topic_score_gemma":0.0047190925,"teacher_disagreement_score":0.007667536,"about_ca_system_score_codex":0.002414546,"about_ca_system_score_gemma":0.00088331767,"threshold_uncertainty_score":0.025650501},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004789965,0.03544634,0.091551386,0.008056113,0.001438644,0.00006737935,0.0005566136,0.00045918985,0.8576343],"genre_scores_gemma":[0.21715206,0.042684026,0.038323373,0.0027723801,0.0033637711,0.0005200511,0.0017351403,0.0005083666,0.69294083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997253,0.000057200345,0.000012102853,0.000055220382,0.00012224964,0.000027872862],"domain_scores_gemma":[0.99969363,0.00017204073,0.000013597028,0.00005468582,0.000045508674,0.000020614874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003440708,0.0012993723,0.0009838571,0.001276826,0.001180793,0.003784638,0.0010226639,0.0009259414,0.024547797],"category_scores_gemma":[0.0010774513,0.0005127784,0.00070406037,0.0027896704,0.002829513,0.0073591345,0.00077716156,0.0025743516,0.0053855944],"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.0000035161675,0.0000077999175,0.000011272411,0.000036605674,0.0000021388125,0.000007942811,0.000057922647,0.0004212793,0.000078215526,0.9724478,0.015856782,0.011068778],"study_design_scores_gemma":[0.0000039157603,0.0000037829557,0.000029385099,0.00003285879,0.000003989505,0.000025296897,0.000026202806,0.0010057974,0.000083341394,0.9246606,0.07412153,0.0000033375586],"about_ca_topic_score_codex":0.002359113,"about_ca_topic_score_gemma":0.0024123036,"teacher_disagreement_score":0.024547797,"about_ca_system_score_codex":0.0026802334,"about_ca_system_score_gemma":0.0012423369,"threshold_uncertainty_score":0.08212054},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3300494,0.00160339,0.5182228,0.0010247896,0.00031165173,0.000067504334,0.000305977,0.0013272278,0.14708723],"genre_scores_gemma":[0.9470385,0.0005272487,0.027948685,0.00016550762,0.00028664403,0.00005178248,0.00023704369,0.00026552062,0.02347915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989159,0.00028166754,0.00006397731,0.00027169974,0.00029328003,0.00017345604],"domain_scores_gemma":[0.9984016,0.0005223273,0.00023692557,0.00042193758,0.00018505743,0.00023206642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084108,0.0005404514,0.0005015865,0.0014190794,0.00085128087,0.0023724323,0.0005246946,0.00043646584,0.0065368493],"category_scores_gemma":[0.002526643,0.00024057383,0.00080071203,0.0006918916,0.004364748,0.005492782,0.002171565,0.0016003349,0.0012773771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023817825,0.000009927327,0.0002787284,0.000029217352,0.0000046779023,0.000064651875,0.00056752894,0.0004495695,0.0017079405,0.9896159,0.00035264055,0.0068954173],"study_design_scores_gemma":[0.000008287589,0.000032809574,0.00048434339,0.000022459868,0.000013566151,0.00014555723,0.00032105384,0.0045738546,0.0034243197,0.9824563,0.008497998,0.000019462661],"about_ca_topic_score_codex":0.00048905046,"about_ca_topic_score_gemma":0.00049940747,"teacher_disagreement_score":0.0065368493,"about_ca_system_score_codex":0.00068555376,"about_ca_system_score_gemma":0.0003672076,"threshold_uncertainty_score":0.02186793},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11859709,0.0044340487,0.285422,0.0032031247,0.0017132547,0.00013079401,0.00036330876,0.0005640221,0.5855723],"genre_scores_gemma":[0.83314735,0.0025113046,0.05343458,0.0004636223,0.0010496787,0.00017846041,0.00029450198,0.00020180295,0.10871875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987544,0.00037119756,0.00009467076,0.00022226523,0.00039668995,0.00016079102],"domain_scores_gemma":[0.99858826,0.0007910424,0.00006144676,0.00023771389,0.00019499377,0.00012657765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014209611,0.00066770666,0.000859409,0.0016395716,0.003465595,0.0053033233,0.0011757247,0.00088457984,0.009093613],"category_scores_gemma":[0.0028894958,0.00085934886,0.00087873463,0.0028122251,0.0065072775,0.011913062,0.003250748,0.0046038325,0.0014719308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011627752,0.000008920648,0.00003671752,0.000017950599,0.000001799876,0.000022911157,0.00017765215,0.00015160118,0.00015865517,0.99381655,0.0006368831,0.0049588117],"study_design_scores_gemma":[0.000009503049,0.000008166625,0.00010096287,0.000012953959,0.000006989669,0.00008112556,0.000094950636,0.00062561966,0.00035621045,0.984263,0.014433289,0.0000072064577],"about_ca_topic_score_codex":0.0009793997,"about_ca_topic_score_gemma":0.0015308318,"teacher_disagreement_score":0.009093613,"about_ca_system_score_codex":0.0018008351,"about_ca_system_score_gemma":0.00087898667,"threshold_uncertainty_score":0.030421138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06167876,0.0042713443,0.8261126,0.0066896197,0.00066526234,0.00014738594,0.00079125824,0.0008540806,0.09878966],"genre_scores_gemma":[0.8012026,0.0024918248,0.17539433,0.0013668516,0.0007143893,0.00023110275,0.0004409279,0.00027979305,0.0178781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982658,0.00054484146,0.00016184423,0.0003272107,0.0004859253,0.00021441103],"domain_scores_gemma":[0.9982333,0.000762565,0.00013840669,0.0003075654,0.0003496735,0.00020854527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030032862,0.00095368206,0.0014259341,0.002784651,0.00307711,0.007002317,0.0020693846,0.002207709,0.006172919],"category_scores_gemma":[0.003684641,0.00097368937,0.0023923113,0.0021777549,0.0066183233,0.014037607,0.004031894,0.0054475307,0.0013499884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007187225,0.000005462879,0.000020619067,0.000015491174,0.0000036853412,0.000019390469,0.000089615736,0.00032422747,0.0001472878,0.99799085,0.00026393693,0.0011122029],"study_design_scores_gemma":[0.00000940974,0.0000054458833,0.00002421234,0.000009869058,0.000004468678,0.000029675453,0.000032480035,0.0012885311,0.000116738316,0.995933,0.0025359462,0.000010161391],"about_ca_topic_score_codex":0.0017766672,"about_ca_topic_score_gemma":0.0014361427,"teacher_disagreement_score":0.007002317,"about_ca_system_score_codex":0.002893934,"about_ca_system_score_gemma":0.0014735066,"threshold_uncertainty_score":0.020997107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37268913,0.0046271533,0.5667186,0.0019401539,0.00031943968,0.00008903158,0.0004396445,0.00023325595,0.052943602],"genre_scores_gemma":[0.94622594,0.0019898594,0.04206083,0.00023103265,0.00045177955,0.00013747928,0.00022605709,0.000068405694,0.008608699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984316,0.000360565,0.00014191247,0.0004208491,0.00047810856,0.00016690692],"domain_scores_gemma":[0.9944964,0.0030359537,0.0005149265,0.00046369043,0.0010149067,0.0004740998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029185861,0.00045180714,0.00081515114,0.0029822006,0.0013863437,0.0026918794,0.00075507275,0.0009466417,0.0036582819],"category_scores_gemma":[0.0062938044,0.00031529466,0.0011426188,0.0012495011,0.0043310476,0.007626293,0.0017609206,0.0021133511,0.00024222452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019912222,0.00001296074,0.00065730175,0.000058322636,0.000019256786,0.000121689816,0.00032577035,0.0009030072,0.0017503758,0.99232966,0.00021055511,0.003591103],"study_design_scores_gemma":[0.00002407958,0.00020648878,0.0055251988,0.0000717424,0.000043492306,0.0010544942,0.0004037808,0.037171178,0.0046295645,0.93814296,0.012659754,0.000067208384],"about_ca_topic_score_codex":0.001022396,"about_ca_topic_score_gemma":0.00048497203,"teacher_disagreement_score":0.0036582819,"about_ca_system_score_codex":0.0015881774,"about_ca_system_score_gemma":0.000675735,"threshold_uncertainty_score":0.015435159},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0962455,0.00319672,0.64662206,0.0024609636,0.0004018723,0.00016416793,0.00045281465,0.0008639655,0.24959198],"genre_scores_gemma":[0.84282595,0.001768218,0.09916864,0.0008646423,0.00042072142,0.00018181873,0.0006110445,0.00028427827,0.05387471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985862,0.0004378782,0.00012449893,0.00019235513,0.0004249849,0.00023408713],"domain_scores_gemma":[0.9969277,0.0015480148,0.00020603166,0.00055937364,0.00054656377,0.00021235905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029326463,0.00069697754,0.00087708497,0.0018977609,0.0025458182,0.003002908,0.0016922494,0.001279241,0.008057093],"category_scores_gemma":[0.00440419,0.0008135712,0.0014243346,0.0022543503,0.0065248045,0.010572354,0.0029915953,0.00397303,0.0010358617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007923945,0.0000032390735,0.000027993656,0.000010626157,0.0000018820947,0.000016013038,0.00013146621,0.00025454856,0.00016839933,0.99798155,0.00018421431,0.0012120814],"study_design_scores_gemma":[0.0000046332116,0.000003854601,0.000023466553,0.000006047413,0.0000029348794,0.000017502658,0.000027751272,0.000928361,0.00018462047,0.99723697,0.0015597905,0.0000041267863],"about_ca_topic_score_codex":0.0036416678,"about_ca_topic_score_gemma":0.0031751734,"teacher_disagreement_score":0.008057093,"about_ca_system_score_codex":0.002196538,"about_ca_system_score_gemma":0.0013724517,"threshold_uncertainty_score":0.026953638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030064134,0.0031522238,0.6194298,0.00990831,0.0039126,0.00019200286,0.0017526096,0.0014451449,0.3301431],"genre_scores_gemma":[0.6084709,0.0035078465,0.22154917,0.008465399,0.0030174004,0.000708988,0.0051894546,0.0022039013,0.14688689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986765,0.0001531912,0.00005952873,0.00034962397,0.00046584863,0.00029530993],"domain_scores_gemma":[0.998312,0.0007265377,0.000083515944,0.00022010363,0.0005127572,0.00014497644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010864534,0.0008837575,0.0008534482,0.0013986789,0.0028079012,0.002350447,0.0018081728,0.0010225845,0.02707417],"category_scores_gemma":[0.0033612938,0.0008789976,0.002351475,0.0017348116,0.003076244,0.0063533364,0.0046477057,0.0048078424,0.0056348504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000427693,0.000017084674,0.00013686933,0.00010008009,0.000020653304,0.00008695084,0.0002912829,0.00040237574,0.0010466456,0.97254306,0.013106373,0.012205846],"study_design_scores_gemma":[0.000034998073,0.000025411913,0.00036992034,0.000045347926,0.000028982371,0.00018012365,0.00011908877,0.0021083949,0.0019524995,0.91713566,0.07797676,0.000022793325],"about_ca_topic_score_codex":0.0041590016,"about_ca_topic_score_gemma":0.003081456,"teacher_disagreement_score":0.02707417,"about_ca_system_score_codex":0.002915531,"about_ca_system_score_gemma":0.0010117134,"threshold_uncertainty_score":0.09057206},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016392449,0.011779767,0.20895371,0.002655974,0.0011698004,0.00009040814,0.0011964963,0.00070696394,0.7570544],"genre_scores_gemma":[0.29697612,0.021621322,0.19219972,0.0012021591,0.001302648,0.00025382472,0.002748626,0.00096867,0.4827269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972564,0.000060450147,0.000013779267,0.000057466317,0.00011719226,0.000025458752],"domain_scores_gemma":[0.9997824,0.000079819576,0.000021662529,0.000032603984,0.0000613219,0.000022094588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002640505,0.00055290747,0.00038729055,0.0009917459,0.0009331342,0.0033141437,0.00080107764,0.00045970717,0.01795937],"category_scores_gemma":[0.0008603521,0.0005008047,0.0003669964,0.0020725254,0.0015546378,0.0044253604,0.0009674269,0.0018586676,0.0057118107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098895625,0.000007755923,0.000020323863,0.00007245644,0.0000018460679,0.000015541647,0.00012459127,0.00039367008,0.00049392175,0.9584586,0.010451743,0.029949643],"study_design_scores_gemma":[0.0000055396076,0.0000073245246,0.000042847965,0.00003488415,0.000003187947,0.00012818893,0.000094394934,0.00082878623,0.0005851601,0.8266996,0.17156236,0.000007752118],"about_ca_topic_score_codex":0.0007153149,"about_ca_topic_score_gemma":0.001074641,"teacher_disagreement_score":0.01795937,"about_ca_system_score_codex":0.0011886016,"about_ca_system_score_gemma":0.00077168585,"threshold_uncertainty_score":0.06008005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010170387,0.022557197,0.05304043,0.014962038,0.0019863157,0.00014470088,0.0024180657,0.001169817,0.90270436],"genre_scores_gemma":[0.15784328,0.046004914,0.119013526,0.020314405,0.006171798,0.0008861452,0.007999828,0.0014634845,0.6403026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818414,0.00041605716,0.00014884972,0.00043349375,0.0006496159,0.00016780772],"domain_scores_gemma":[0.9988557,0.00043084705,0.000064833264,0.00023500915,0.00032362793,0.000089988476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013683679,0.0011212742,0.0010774831,0.0017661646,0.002923129,0.0067592175,0.0021940386,0.0021730256,0.07259987],"category_scores_gemma":[0.0028387506,0.00057295104,0.0010370368,0.0022833755,0.0052526337,0.0096536,0.0032855412,0.004598611,0.039242946],"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.00001029789,0.000007914423,0.000041131898,0.00016611713,0.000006127953,0.00004286146,0.0001563307,0.000104641345,0.000107708285,0.92507166,0.053403135,0.020882063],"study_design_scores_gemma":[0.0000057412026,0.0000050969215,0.000048266786,0.00009946353,0.000004015833,0.00010486713,0.000050778955,0.0001752473,0.00009233397,0.48325107,0.51615626,0.000006985827],"about_ca_topic_score_codex":0.00342047,"about_ca_topic_score_gemma":0.0027752183,"teacher_disagreement_score":0.07259987,"about_ca_system_score_codex":0.004318307,"about_ca_system_score_gemma":0.0026800258,"threshold_uncertainty_score":0.24287075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22210059,0.024150198,0.5402578,0.008760569,0.0009226951,0.00008782999,0.00025348188,0.00022270398,0.20324418],"genre_scores_gemma":[0.91991305,0.0033158248,0.067038864,0.00063122355,0.00058818667,0.00005408492,0.000102955324,0.000047601538,0.008308181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834585,0.0006877872,0.00009740023,0.000385182,0.000352482,0.00013126535],"domain_scores_gemma":[0.9979907,0.00095343014,0.00026023528,0.0002931532,0.00023847348,0.00026413306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018572995,0.0004838929,0.0005467565,0.0018512275,0.0016203168,0.003310086,0.0007157619,0.0011480948,0.0034719952],"category_scores_gemma":[0.0038681782,0.0005385746,0.0007884259,0.0015598217,0.0055689528,0.007829368,0.0038471206,0.0036247496,0.00039331737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008261905,0.000008829133,0.00008156152,0.000020803236,0.000002547292,0.0000331103,0.00012527019,0.00022990209,0.0001879017,0.9964437,0.00014255708,0.0027156507],"study_design_scores_gemma":[0.0000063092884,0.000010397875,0.00006402478,0.000019878606,0.000003568755,0.00014540995,0.00011411214,0.0019379185,0.00028856512,0.9914596,0.0059441687,0.0000060905527],"about_ca_topic_score_codex":0.00043743532,"about_ca_topic_score_gemma":0.00031364008,"teacher_disagreement_score":0.0034719952,"about_ca_system_score_codex":0.0013412143,"about_ca_system_score_gemma":0.00043033017,"threshold_uncertainty_score":0.011614978},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020434836,0.10851473,0.085647225,0.10138878,0.015736887,0.00007756478,0.00093868206,0.00051673205,0.66674453],"genre_scores_gemma":[0.7077687,0.054094296,0.01712713,0.018638648,0.01600385,0.00021976109,0.0017827464,0.00031115976,0.1840538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861944,0.0003210194,0.000070711205,0.0004907816,0.00035012685,0.00014799183],"domain_scores_gemma":[0.9966923,0.0016833029,0.00022755536,0.00058682566,0.0005395893,0.00027052415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018839057,0.00073644187,0.0010822528,0.0008079604,0.0019362983,0.004849589,0.0014057431,0.0020887395,0.029173099],"category_scores_gemma":[0.0073231496,0.0004259138,0.00084356096,0.0015778488,0.005784051,0.0127418935,0.0035905426,0.0055300617,0.0069511253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043158903,0.000024289806,0.0002928196,0.00024869508,0.00002003394,0.0000897626,0.00024923572,0.0002555787,0.00019874898,0.96015126,0.019958997,0.01846756],"study_design_scores_gemma":[0.0000085817765,0.000016990007,0.00029448955,0.0001390004,0.000022445874,0.00012592634,0.00012242084,0.0003947047,0.00023793332,0.9349614,0.06366493,0.000011212415],"about_ca_topic_score_codex":0.0010267944,"about_ca_topic_score_gemma":0.0011203863,"teacher_disagreement_score":0.029173099,"about_ca_system_score_codex":0.0016838394,"about_ca_system_score_gemma":0.0014133602,"threshold_uncertainty_score":0.097593784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0732399,0.0018969672,0.70015424,0.0038880093,0.00088998815,0.000075106545,0.0009433467,0.0014951322,0.21741745],"genre_scores_gemma":[0.8090621,0.0015046542,0.12407822,0.0017959764,0.00083641894,0.00020606461,0.0017820953,0.0008271026,0.059907343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982462,0.00033631574,0.000109863104,0.00051297486,0.00046939228,0.00032533798],"domain_scores_gemma":[0.9971642,0.0014842922,0.00012749615,0.00039411528,0.0006306521,0.00019924052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023271479,0.0008459078,0.0009198026,0.0019348401,0.0021644402,0.0035302625,0.0016784541,0.0009959086,0.01587736],"category_scores_gemma":[0.00447245,0.0005024102,0.0026408553,0.0014356578,0.0044108443,0.009850084,0.004128928,0.0051762494,0.0037317025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017727334,0.000011858223,0.0001480315,0.00003981327,0.000008583112,0.000038407674,0.00014940253,0.00027794554,0.0004300319,0.99310243,0.0012231697,0.0045526326],"study_design_scores_gemma":[0.000014924246,0.000020611238,0.0001624815,0.00003061331,0.000018486668,0.000094212206,0.00010769885,0.0036026826,0.0013335833,0.98564607,0.008953771,0.000014888749],"about_ca_topic_score_codex":0.0028033692,"about_ca_topic_score_gemma":0.0022762907,"teacher_disagreement_score":0.01587736,"about_ca_system_score_codex":0.0023400343,"about_ca_system_score_gemma":0.0011533024,"threshold_uncertainty_score":0.05311507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001899504,0.024321148,0.91550475,0.0051477496,0.00506813,0.00012453855,0.0010079573,0.0029972857,0.04392894],"genre_scores_gemma":[0.034686834,0.021577407,0.8977556,0.0023449007,0.008161903,0.0002601872,0.0018929663,0.0029287816,0.03039142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540627,0.001252547,0.0007272982,0.0006805633,0.0017251337,0.00020819955],"domain_scores_gemma":[0.992855,0.0034579693,0.00020864716,0.0016905958,0.0015113745,0.000276367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061771357,0.0011858959,0.0016356247,0.0030608342,0.0018196972,0.0072821863,0.004219651,0.001527709,0.01781217],"category_scores_gemma":[0.011493068,0.0019620508,0.0017149249,0.0055969507,0.005383983,0.012203562,0.0035214298,0.00675331,0.010936476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005995283,0.000042751337,0.00013382752,0.0007030226,0.00003227554,0.000109194865,0.00042063076,0.0035408083,0.0009669923,0.66959065,0.07021901,0.25418088],"study_design_scores_gemma":[0.00001983584,0.00004445486,0.00014684627,0.00019417955,0.000033795935,0.0002894808,0.00007213465,0.008307036,0.0011485239,0.37480906,0.6148694,0.00006532466],"about_ca_topic_score_codex":0.0012481094,"about_ca_topic_score_gemma":0.0025172865,"teacher_disagreement_score":0.01781217,"about_ca_system_score_codex":0.0020133972,"about_ca_system_score_gemma":0.0023082823,"threshold_uncertainty_score":0.059587598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028955678,0.0053732055,0.8622826,0.0014743299,0.00064061757,0.00016150843,0.0007158161,0.000603652,0.0997926],"genre_scores_gemma":[0.5436281,0.0046176333,0.38851246,0.0011977976,0.0010883567,0.0004928221,0.0013535334,0.00044321644,0.058666155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580705,0.0011931519,0.00030189636,0.0011580223,0.001165422,0.0003744655],"domain_scores_gemma":[0.99756587,0.00077811023,0.00028535185,0.00045271518,0.00060746283,0.00031047256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003194283,0.0010842321,0.00089363,0.0029766625,0.002475191,0.004237573,0.0016012051,0.0010225299,0.011289708],"category_scores_gemma":[0.0042195553,0.00048513085,0.0014646016,0.0020154486,0.0047303215,0.011040742,0.0063937563,0.0034157496,0.002710598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012394582,0.000007802195,0.00010983458,0.000051484618,0.00000918475,0.00005682248,0.00028589542,0.00046467985,0.00036323373,0.9905342,0.00068246276,0.0074220863],"study_design_scores_gemma":[0.000010605,0.000052720447,0.00020480456,0.000054170076,0.000018980318,0.00033972735,0.0003872583,0.0033026808,0.00092058093,0.91893685,0.07574399,0.00002770148],"about_ca_topic_score_codex":0.00072768977,"about_ca_topic_score_gemma":0.000688799,"teacher_disagreement_score":0.011289708,"about_ca_system_score_codex":0.0019014946,"about_ca_system_score_gemma":0.0010180378,"threshold_uncertainty_score":0.037767887},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00801839,0.87013376,0.029782012,0.0063071805,0.0010585259,0.000026222126,0.00027975254,0.00013726747,0.08425693],"genre_scores_gemma":[0.14640766,0.8066371,0.02548536,0.0019340612,0.0064467667,0.00008604829,0.00087488367,0.00007967119,0.012048413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987344,0.0003120213,0.0001262369,0.0002505873,0.00043692737,0.0001398287],"domain_scores_gemma":[0.9968054,0.002265662,0.00013325478,0.000278913,0.00032671986,0.00019004768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020050872,0.00069529674,0.0014820604,0.0047134925,0.0014358951,0.005105921,0.001263122,0.0015300383,0.0076331096],"category_scores_gemma":[0.0034789215,0.0007620408,0.0006739779,0.0083616795,0.005219118,0.011574318,0.002162683,0.0032931266,0.0020665044],"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.000046188816,0.00010387194,0.00081459095,0.001281031,0.000025720652,0.00008101861,0.00039988247,0.0005852358,0.0003654028,0.8182743,0.019611761,0.15841088],"study_design_scores_gemma":[0.0000231747,0.000046094727,0.0008132262,0.0006552453,0.000016717855,0.00084312115,0.0004229321,0.0012187632,0.00038685018,0.6847625,0.31078315,0.000028242835],"about_ca_topic_score_codex":0.0013834469,"about_ca_topic_score_gemma":0.0014006884,"teacher_disagreement_score":0.0076331096,"about_ca_system_score_codex":0.00235371,"about_ca_system_score_gemma":0.0019709293,"threshold_uncertainty_score":0.025535345},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089655444,0.2895172,0.29121697,0.08214858,0.0059110024,0.00021898792,0.0014477076,0.0012251071,0.23865904],"genre_scores_gemma":[0.77673495,0.07209798,0.09749443,0.0072627235,0.003867041,0.00033749733,0.0016814095,0.00053724117,0.03998674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693406,0.00086185045,0.00018849001,0.0005269889,0.0012020932,0.00028652107],"domain_scores_gemma":[0.98961455,0.006177527,0.0008732329,0.0009546758,0.0020931493,0.00028683545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035414887,0.00069017604,0.0018432006,0.0032187584,0.003690822,0.003243969,0.0023300238,0.0021526099,0.010219438],"category_scores_gemma":[0.01896737,0.00097495003,0.001220314,0.004315575,0.003967733,0.010955159,0.0030978909,0.004633103,0.0018632315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003515696,0.000077692144,0.00093166623,0.00037152262,0.00006753584,0.00026889626,0.00097299396,0.0013742399,0.0011113682,0.9009896,0.05066372,0.042819146],"study_design_scores_gemma":[0.000084178806,0.000079373945,0.0016332625,0.00022778903,0.00011596076,0.0005424892,0.0006360928,0.0039035315,0.004577803,0.88561565,0.10245691,0.00012697499],"about_ca_topic_score_codex":0.0039227116,"about_ca_topic_score_gemma":0.002454041,"teacher_disagreement_score":0.010219438,"about_ca_system_score_codex":0.0041191615,"about_ca_system_score_gemma":0.0010711419,"threshold_uncertainty_score":0.034187376},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070200555,0.0043937196,0.19510762,0.008211125,0.001401807,0.00012690475,0.0012528418,0.0007079704,0.7185974],"genre_scores_gemma":[0.79802406,0.0040170276,0.05716429,0.0009470155,0.0016461379,0.0003432227,0.0014719308,0.000664228,0.13572201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979126,0.00064494775,0.00019526143,0.00039010428,0.00058756204,0.0002695924],"domain_scores_gemma":[0.9972433,0.0016094104,0.00014561105,0.0005864696,0.00026415303,0.00015100474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606622,0.0007682172,0.00132483,0.0025595534,0.004300617,0.006706792,0.0014268387,0.0017597325,0.018692615],"category_scores_gemma":[0.0052380688,0.0011874252,0.0011873381,0.0039489237,0.00795526,0.019773893,0.0047829016,0.006160339,0.0029751982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005951386,0.0000044844573,0.00004743911,0.000017477321,0.0000019334298,0.000012552526,0.00021954898,0.00012274577,0.00006275414,0.99418503,0.0013067465,0.0040132594],"study_design_scores_gemma":[0.0000034257412,0.0000030671645,0.0000716098,0.000020805188,0.0000051454676,0.000050752034,0.00009117915,0.00027820523,0.00012333256,0.9810947,0.018250903,0.0000068736454],"about_ca_topic_score_codex":0.0010409446,"about_ca_topic_score_gemma":0.001234732,"teacher_disagreement_score":0.018692615,"about_ca_system_score_codex":0.002662386,"about_ca_system_score_gemma":0.0010092763,"threshold_uncertainty_score":0.06253302},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090933754,0.9222832,0.013237137,0.019702438,0.006072321,0.00002354794,0.00051451876,0.0003101404,0.03694741],"genre_scores_gemma":[0.043739334,0.7904638,0.023934726,0.0065599927,0.010254863,0.00010749188,0.0011361046,0.0007288738,0.123074815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992399,0.00016608136,0.00008270664,0.00014221577,0.00029836994,0.000070704555],"domain_scores_gemma":[0.99851185,0.00078237377,0.00011685724,0.00012253708,0.0003476928,0.000118649485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115859,0.0015196204,0.0014463327,0.005213113,0.0019867376,0.002462858,0.0013231548,0.0024160072,0.026675252],"category_scores_gemma":[0.0029522101,0.001327466,0.0010104593,0.0048688306,0.0029747582,0.008669328,0.0014701484,0.0044628554,0.014287983],"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.000095441006,0.00005665029,0.00036267264,0.0010689583,0.000069940295,0.00016249467,0.0007587887,0.00042216523,0.00066077494,0.17575543,0.68137044,0.13921621],"study_design_scores_gemma":[0.00003268687,0.000022477443,0.0011805277,0.000578629,0.000034982248,0.0004110146,0.00022520614,0.0004087837,0.00079891674,0.32999587,0.66626555,0.00004542591],"about_ca_topic_score_codex":0.0060828184,"about_ca_topic_score_gemma":0.009088841,"teacher_disagreement_score":0.026675252,"about_ca_system_score_codex":0.0021718969,"about_ca_system_score_gemma":0.0010426695,"threshold_uncertainty_score":0.08923763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14224572,0.00602067,0.5012046,0.013429876,0.00097304716,0.00013340863,0.0016361967,0.00087082665,0.3334857],"genre_scores_gemma":[0.8643344,0.0032399122,0.091198616,0.002384723,0.0014675203,0.0002653212,0.0016492695,0.00047048036,0.034989677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978886,0.00065800996,0.0001243044,0.0004655535,0.00061017997,0.00025339503],"domain_scores_gemma":[0.9938153,0.0038399324,0.00020234191,0.0007605579,0.0010052078,0.00037664833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004308639,0.00089176116,0.0014330352,0.002928352,0.0028266136,0.0043807784,0.0014246671,0.0016684596,0.007047413],"category_scores_gemma":[0.005066484,0.0011662991,0.0020963158,0.0018889101,0.0058434,0.01881251,0.0053267577,0.008733471,0.0011413646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026589045,0.000026439278,0.00013506958,0.000046672572,0.000013231387,0.00002072458,0.00013385637,0.00024540347,0.00025682797,0.99369437,0.0015520224,0.0038488135],"study_design_scores_gemma":[0.00001712072,0.0000055593964,0.00008504408,0.000008672594,0.000008674273,0.00003536429,0.000030565112,0.0010037936,0.00025256842,0.99608094,0.0024656502,0.000006018954],"about_ca_topic_score_codex":0.00094134506,"about_ca_topic_score_gemma":0.0010068916,"teacher_disagreement_score":0.007047413,"about_ca_system_score_codex":0.001634047,"about_ca_system_score_gemma":0.0012242886,"threshold_uncertainty_score":0.023575962},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2266372,0.004431022,0.28942993,0.00670805,0.0030633635,0.00031494675,0.0031519511,0.0014346342,0.46482888],"genre_scores_gemma":[0.816025,0.0020318443,0.10018957,0.0018652962,0.0013102732,0.00046647928,0.0024331808,0.0003506633,0.0753277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00014971563,0.00005291886,0.00015705333,0.00015950162,0.00015062404],"domain_scores_gemma":[0.9993869,0.00015581887,0.00010083898,0.00012307869,0.000118467055,0.000114953255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889351,0.0005116794,0.0003386198,0.0008162518,0.0019004405,0.002216047,0.0004322456,0.00046466925,0.012723966],"category_scores_gemma":[0.0007255296,0.00020999358,0.0004912686,0.00085902214,0.003232071,0.0041243993,0.002130435,0.0015516394,0.002208266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030317347,0.000014551056,0.0002535457,0.000055006156,0.0000050440417,0.00014018225,0.0006375622,0.000071875846,0.0010700016,0.9849895,0.0044284933,0.008303873],"study_design_scores_gemma":[0.000023709043,0.000074446565,0.0017209369,0.000038436734,0.000021268503,0.0012242816,0.00090579776,0.0010519791,0.004554852,0.7098731,0.28047782,0.000033425447],"about_ca_topic_score_codex":0.0004607445,"about_ca_topic_score_gemma":0.00040148047,"teacher_disagreement_score":0.012723966,"about_ca_system_score_codex":0.0006026952,"about_ca_system_score_gemma":0.0005014932,"threshold_uncertainty_score":0.042565882},"labels":[],"label_agreement":null},{"id":"W1611875164","doi":"10.1016/j.apal.2007.03.001","title":"First-order Gödel logics","year":2007,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Uncountable set; Negation; Mathematics; Interpretation (philosophy); Order (exchange); Combinatorics; Discrete mathematics; Finite set; Countable set; Computer science; Mathematical analysis","score_opus":0.04747162189864145,"score_gpt":0.2948686843336565,"score_spread":0.24739706243501502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611875164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10510611,0.0162437,0.49258614,0.01553479,0.0015628478,0.0000567293,0.0009789394,0.0013313395,0.3665994],"genre_scores_gemma":[0.87451667,0.0051594707,0.06296078,0.0011523758,0.0013716918,0.000039125047,0.000633656,0.00016017786,0.054005936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993538,0.00014079227,0.00003824254,0.00013245876,0.00025046855,0.00008430696],"domain_scores_gemma":[0.9988673,0.000540064,0.00006399776,0.00018730026,0.00020700856,0.00013443918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287335,0.0005110389,0.00072605046,0.0016619579,0.002026989,0.004189869,0.0009808999,0.0008705192,0.007322615],"category_scores_gemma":[0.001978238,0.00051175815,0.000765266,0.0016857946,0.0038032965,0.009724985,0.0015994613,0.0033700524,0.001044479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008908724,0.0000054951565,0.00004518566,0.000012230061,0.0000033745116,0.0000117276195,0.00007400373,0.00011985992,0.00012177611,0.9955444,0.0010076849,0.0030454064],"study_design_scores_gemma":[0.000003446139,0.0000020128814,0.000041703952,0.000004615641,0.000004241941,0.000027458813,0.000018999604,0.0005925493,0.00018112987,0.9931264,0.00599378,0.0000036406361],"about_ca_topic_score_codex":0.00078708783,"about_ca_topic_score_gemma":0.0011464729,"teacher_disagreement_score":0.007322615,"about_ca_system_score_codex":0.0017236712,"about_ca_system_score_gemma":0.001026043,"threshold_uncertainty_score":0.024496555},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14851178,0.0047458853,0.6229075,0.0049930257,0.0010804726,0.00032163784,0.004767437,0.0019081892,0.21076414],"genre_scores_gemma":[0.75824493,0.0034148216,0.16848359,0.0009712311,0.000763046,0.00027247175,0.0044980636,0.00063373754,0.0627181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.0002183159,0.000056239845,0.00029121182,0.00025437542,0.0001542203],"domain_scores_gemma":[0.99710053,0.0014520022,0.00038150037,0.00042864043,0.0003931419,0.00024409387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010204396,0.0007453926,0.0005749135,0.0035541297,0.0015918799,0.0028703737,0.0010702095,0.0010826328,0.016991314],"category_scores_gemma":[0.0048875827,0.0003797207,0.00082363834,0.003016799,0.0027658762,0.0060018087,0.0018988468,0.0023933027,0.0029221063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007835828,0.00002516068,0.00055367703,0.00007837681,0.000018935922,0.00005770465,0.00019160715,0.0038125352,0.0006562329,0.95193714,0.0069405176,0.0356496],"study_design_scores_gemma":[0.0000122877345,0.000017442553,0.00035037182,0.000021233245,0.000012210752,0.00015109351,0.00008390378,0.00915152,0.00049916434,0.9757742,0.013910018,0.000016552056],"about_ca_topic_score_codex":0.0034308413,"about_ca_topic_score_gemma":0.004012814,"teacher_disagreement_score":0.016991314,"about_ca_system_score_codex":0.0021905568,"about_ca_system_score_gemma":0.00086314185,"threshold_uncertainty_score":0.05684161},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22516055,0.016094448,0.33842677,0.015704986,0.0018275701,0.00014955564,0.0018839936,0.00065924326,0.40009278],"genre_scores_gemma":[0.81102127,0.008787735,0.091171056,0.0022307676,0.003345676,0.00020396672,0.0017092035,0.0003774925,0.08115293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980167,0.00069749466,0.00012824345,0.0003237832,0.0005321585,0.0003015543],"domain_scores_gemma":[0.9947284,0.002772745,0.0007232107,0.0006611169,0.00047256076,0.0006420249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016859559,0.00089098874,0.0011746689,0.0027810703,0.0026603914,0.0048422744,0.0013773424,0.0017352543,0.0103557175],"category_scores_gemma":[0.0073693683,0.00089825084,0.0012228079,0.0032256974,0.006185625,0.015391334,0.0049095834,0.0049758935,0.002169506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002257603,0.0000149041525,0.00018923043,0.000039793293,0.000007747422,0.00006682509,0.00013868047,0.0007848636,0.00019627504,0.9919001,0.0026881641,0.0039508673],"study_design_scores_gemma":[0.000005453941,0.000006274622,0.000105801984,0.000014010732,0.0000038208645,0.000100779,0.00006438965,0.0014623982,0.00007334828,0.99478275,0.0033749624,0.0000059763897],"about_ca_topic_score_codex":0.001528,"about_ca_topic_score_gemma":0.0023524987,"teacher_disagreement_score":0.0103557175,"about_ca_system_score_codex":0.0023553832,"about_ca_system_score_gemma":0.00072319125,"threshold_uncertainty_score":0.034643292},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2420213,0.003275266,0.34636325,0.0052430313,0.0011082173,0.00013725468,0.0019535637,0.0014078959,0.3984902],"genre_scores_gemma":[0.8691008,0.0014224713,0.06533606,0.0007880304,0.00073172175,0.00016159743,0.0019502777,0.00034792183,0.0601611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969387,0.00086881535,0.00019767735,0.0005877555,0.0009363598,0.0004707271],"domain_scores_gemma":[0.9975973,0.0006929697,0.00023095784,0.00031009407,0.0007950167,0.00037365145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013277605,0.00051796244,0.0006760651,0.0017374742,0.0021954586,0.0039702253,0.0007427354,0.0006027958,0.010178705],"category_scores_gemma":[0.0031395375,0.0003961301,0.001211891,0.0019129151,0.0039081573,0.0058922754,0.0033471119,0.0023078246,0.002150633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001605595,0.000010468431,0.000119189004,0.00002110714,0.0000051918164,0.00003030135,0.00020262614,0.00041114638,0.0002609927,0.9918297,0.0013777144,0.005715551],"study_design_scores_gemma":[0.000009085193,0.0000163754,0.00018258298,0.00001076969,0.0000034487516,0.00007372321,0.00021053407,0.0020397634,0.00045427398,0.9837505,0.013232052,0.00001671268],"about_ca_topic_score_codex":0.0028396768,"about_ca_topic_score_gemma":0.0020953703,"teacher_disagreement_score":0.010178705,"about_ca_system_score_codex":0.0022839438,"about_ca_system_score_gemma":0.0012550683,"threshold_uncertainty_score":0.03405118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.484893,0.0049869977,0.36495915,0.0026031516,0.0010449976,0.000111330846,0.00042175318,0.00095036847,0.14002934],"genre_scores_gemma":[0.93550354,0.0010525844,0.042962432,0.00061506144,0.00040027467,0.00013222374,0.00021712722,0.00014136109,0.018975334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985312,0.00050478615,0.00007589385,0.00024159787,0.0003607998,0.00028564243],"domain_scores_gemma":[0.9984347,0.0004806597,0.00016369617,0.0002132101,0.0003256651,0.0003820531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020182368,0.00055654516,0.0005511007,0.0014634598,0.002076214,0.002460211,0.0006360824,0.000723937,0.003707267],"category_scores_gemma":[0.002603272,0.0003943415,0.0010456259,0.000839942,0.0039421963,0.007522213,0.004963432,0.0023357982,0.0006281326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031624983,0.000011870616,0.00026551343,0.000037099868,0.000005586316,0.00012657438,0.0005929006,0.00038818587,0.0010703533,0.99455947,0.00027781495,0.002633034],"study_design_scores_gemma":[0.000018816503,0.000053103926,0.00048400927,0.00006032385,0.000015249612,0.0003820221,0.0005020757,0.0028029128,0.0010109885,0.9776563,0.016989626,0.000024556235],"about_ca_topic_score_codex":0.0007124565,"about_ca_topic_score_gemma":0.0009841467,"teacher_disagreement_score":0.003707267,"about_ca_system_score_codex":0.0012538204,"about_ca_system_score_gemma":0.00053048576,"threshold_uncertainty_score":0.012401998},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07679143,0.0076587214,0.16989996,0.005830319,0.0034267718,0.0001823294,0.0011936803,0.00068757887,0.73432916],"genre_scores_gemma":[0.83333164,0.0027773571,0.03687568,0.0011346259,0.0025157905,0.000307642,0.001142102,0.00045207504,0.12146312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982327,0.00050981494,0.0001493229,0.0003206244,0.00047788525,0.00030951135],"domain_scores_gemma":[0.9985942,0.00044648835,0.00015706822,0.00016504245,0.0003393172,0.00029792442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012728628,0.0009801049,0.00092987873,0.0021322635,0.0029185528,0.0062273387,0.0007230937,0.0010041905,0.014616893],"category_scores_gemma":[0.0022924128,0.0005381795,0.0014425664,0.0019734898,0.0045057377,0.0055047455,0.0027318955,0.0038412956,0.0037863085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023817016,0.000013426415,0.000052155025,0.000025653626,0.000004399034,0.000035991685,0.00013002267,0.000058483707,0.000278203,0.99507976,0.0014620774,0.0028360996],"study_design_scores_gemma":[0.000019560723,0.000007831354,0.00007311968,0.000009331519,0.000006119188,0.000106590705,0.00008425669,0.00035347816,0.00035043765,0.9898634,0.009119708,0.000006303235],"about_ca_topic_score_codex":0.0010740423,"about_ca_topic_score_gemma":0.0006061967,"teacher_disagreement_score":0.014616893,"about_ca_system_score_codex":0.0021472424,"about_ca_system_score_gemma":0.001022061,"threshold_uncertainty_score":0.0488984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8246929,0.00042770564,0.14486027,0.00023409039,0.000046542023,0.00010630902,0.000831825,0.0004121588,0.028388316],"genre_scores_gemma":[0.93310857,0.00032674114,0.04849479,0.000106006126,0.000052800577,0.0002754768,0.0016608657,0.0001337261,0.015840953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991749,0.00012325376,0.00007955274,0.00020339938,0.0002093151,0.00020957016],"domain_scores_gemma":[0.9972274,0.001080141,0.00035630737,0.0003153564,0.00061641244,0.00040438847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060030835,0.0005465559,0.00055858324,0.0008407087,0.0014551412,0.0019284711,0.00060334353,0.0006472551,0.005241981],"category_scores_gemma":[0.0029490313,0.00049537845,0.0009216448,0.0008936998,0.0015444572,0.0029773815,0.0019877516,0.0009442928,0.0009346272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007057968,0.00013349178,0.011175514,0.0003153433,0.000092088114,0.001862465,0.001855098,0.006433767,0.061858304,0.8776123,0.001509751,0.03644607],"study_design_scores_gemma":[0.00011862258,0.00046688196,0.007843167,0.00017168978,0.0001632824,0.0023195636,0.0012675177,0.03493268,0.13479076,0.7801519,0.037667815,0.00010623194],"about_ca_topic_score_codex":0.0005626329,"about_ca_topic_score_gemma":0.0006796495,"teacher_disagreement_score":0.005241981,"about_ca_system_score_codex":0.0008498921,"about_ca_system_score_gemma":0.00062132085,"threshold_uncertainty_score":0.017536223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22411667,0.043050937,0.4732578,0.014995633,0.0021404973,0.00009761788,0.0006558916,0.0008856154,0.24079934],"genre_scores_gemma":[0.92617583,0.00792222,0.03187591,0.00094780524,0.0014660216,0.0001344621,0.0003860523,0.00017983397,0.030911783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985127,0.0005122752,0.000114808245,0.00030707844,0.00034354278,0.00020957613],"domain_scores_gemma":[0.99740016,0.0012421838,0.00035294224,0.00034331318,0.00033977037,0.00032165254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025047578,0.000842884,0.0012642576,0.004688618,0.004348177,0.0071099885,0.0015592359,0.0022971337,0.008685275],"category_scores_gemma":[0.0044684773,0.00094635086,0.0011552772,0.0053013563,0.010694106,0.015317362,0.0049905526,0.004232982,0.0008929031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057560005,0.000005394437,0.00007509492,0.000016185031,0.0000035375624,0.000022722432,0.00014215356,0.00011835527,0.00007850113,0.99789834,0.00034670017,0.001287219],"study_design_scores_gemma":[0.000003901118,0.0000061867886,0.00009671687,0.000010092265,0.0000048549364,0.000037065554,0.000093434974,0.00036667893,0.00007275127,0.9966061,0.0026961237,0.00000610883],"about_ca_topic_score_codex":0.0015683128,"about_ca_topic_score_gemma":0.0012094001,"teacher_disagreement_score":0.008685275,"about_ca_system_score_codex":0.0019012612,"about_ca_system_score_gemma":0.0009932441,"threshold_uncertainty_score":0.029055119},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21497528,0.010865564,0.33315036,0.004944374,0.00160354,0.00018645427,0.00036491198,0.00059676403,0.43331277],"genre_scores_gemma":[0.907357,0.0030028624,0.03339396,0.00052309624,0.0009932958,0.00015225596,0.00020941586,0.00019351093,0.054174617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988979,0.00024484308,0.00007931118,0.0002492487,0.00034499276,0.00018364168],"domain_scores_gemma":[0.9988374,0.0005047948,0.00011197098,0.00018690889,0.00017325178,0.0001857053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009260667,0.0005980075,0.0004934669,0.0019316274,0.0012433988,0.003542714,0.0005721614,0.0011294403,0.005832972],"category_scores_gemma":[0.002969756,0.00043998176,0.0007524618,0.0011083896,0.0065172547,0.007054133,0.0032037743,0.0029367763,0.0011508836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007606868,0.0000045888955,0.00006136017,0.000017135722,0.0000017846979,0.000038869443,0.00021505548,0.00012230447,0.0003040782,0.9966126,0.0002989676,0.0023155145],"study_design_scores_gemma":[0.000006518253,0.000010777245,0.00017586155,0.000012554128,0.000004128077,0.000081917555,0.00011926916,0.0005810124,0.00044875927,0.99096644,0.00758683,0.0000061042892],"about_ca_topic_score_codex":0.00073249184,"about_ca_topic_score_gemma":0.0005289466,"teacher_disagreement_score":0.005832972,"about_ca_system_score_codex":0.0011780816,"about_ca_system_score_gemma":0.00050987577,"threshold_uncertainty_score":0.01951325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38068518,0.005226179,0.43475845,0.0032908407,0.0005880003,0.00011373459,0.00070021086,0.0006348027,0.17400257],"genre_scores_gemma":[0.960326,0.00067381485,0.022945387,0.00038181842,0.00021788766,0.00007467137,0.00015631363,0.00003526163,0.01518897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994074,0.00017217052,0.00003870559,0.00011022391,0.00020160759,0.000069907604],"domain_scores_gemma":[0.9991646,0.00025168623,0.00008857476,0.000116243384,0.00023988327,0.00013896242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068251195,0.0002276781,0.000332313,0.0011428392,0.0014177704,0.0021716955,0.00052223704,0.0005214213,0.004131868],"category_scores_gemma":[0.0012779776,0.0001676617,0.00042794013,0.0007558063,0.002185177,0.0032006495,0.0019159183,0.00070869917,0.0005502344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012374289,0.000006073232,0.0002657719,0.00004602169,0.00000815985,0.00013667232,0.0003510619,0.00020969743,0.0016804817,0.9909338,0.00054249354,0.005807448],"study_design_scores_gemma":[0.000010890478,0.000037273516,0.00088859344,0.000023560837,0.000008826849,0.00042704336,0.00027268784,0.003626201,0.0012614522,0.9705931,0.022827439,0.000022916995],"about_ca_topic_score_codex":0.0008187294,"about_ca_topic_score_gemma":0.00033635568,"teacher_disagreement_score":0.004131868,"about_ca_system_score_codex":0.00096176297,"about_ca_system_score_gemma":0.0006695537,"threshold_uncertainty_score":0.013822436},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17374855,0.0019948252,0.76191115,0.0020799455,0.00033517147,0.00011007508,0.00041931093,0.0012879326,0.058113005],"genre_scores_gemma":[0.8971018,0.0006826622,0.08689367,0.0003434177,0.0001555925,0.0001451405,0.00029555452,0.0002080174,0.014174056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99598855,0.0010115383,0.00028462367,0.0006078739,0.0015809629,0.0005265076],"domain_scores_gemma":[0.99401796,0.0025883892,0.0004575391,0.0019682453,0.0007282894,0.0002396626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029742888,0.00043674553,0.00077226403,0.0014921338,0.0014352245,0.005673133,0.0014115127,0.001807345,0.0054367785],"category_scores_gemma":[0.009269432,0.00044218768,0.0018425673,0.0012341929,0.0048181936,0.012305393,0.00270815,0.0025571075,0.00063615665],"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.000018890547,0.000004665013,0.0002744419,0.000022565275,0.0000039190845,0.000014612163,0.00020438578,0.0012289307,0.00037497378,0.9952329,0.0001857018,0.0024341221],"study_design_scores_gemma":[0.00002574542,0.00004927295,0.00044254397,0.00004719226,0.000023668217,0.0001589193,0.00014051772,0.031697493,0.0026141813,0.953602,0.011167454,0.000031130545],"about_ca_topic_score_codex":0.0029091004,"about_ca_topic_score_gemma":0.0020495758,"teacher_disagreement_score":0.005673133,"about_ca_system_score_codex":0.0028623543,"about_ca_system_score_gemma":0.0027133308,"threshold_uncertainty_score":0.020767868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23649761,0.0041675568,0.6182405,0.0014822882,0.0011018888,0.00014613185,0.00050580886,0.0006041271,0.13725418],"genre_scores_gemma":[0.92681414,0.0012342326,0.047298074,0.00037547314,0.00050704955,0.00013739995,0.00021467515,0.00010649063,0.023312425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874383,0.00028243123,0.000118894,0.00031592333,0.0004190768,0.00011980421],"domain_scores_gemma":[0.9988004,0.00030173667,0.00011194099,0.00026505644,0.0003747675,0.00014610443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615294,0.00045049528,0.0005426304,0.0015228783,0.0015218069,0.002798331,0.00068596745,0.00070970255,0.005849242],"category_scores_gemma":[0.00194819,0.0003554664,0.0007282068,0.00093739096,0.003429249,0.004516704,0.0029407134,0.0014412818,0.00084654073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000951121,0.000006318128,0.00012996694,0.000035674708,0.00000829664,0.000070762755,0.00020423303,0.00013824699,0.0013393183,0.99419606,0.00024986741,0.003611789],"study_design_scores_gemma":[0.000008188,0.00005597713,0.000503739,0.000028505976,0.000017050874,0.00040038544,0.00018390217,0.0027736707,0.0028959892,0.97085416,0.022251736,0.00002664535],"about_ca_topic_score_codex":0.0003841269,"about_ca_topic_score_gemma":0.00023219042,"teacher_disagreement_score":0.005849242,"about_ca_system_score_codex":0.000795493,"about_ca_system_score_gemma":0.00058578746,"threshold_uncertainty_score":0.019567668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5938776,0.00096893864,0.14394513,0.0021597564,0.00034722476,0.0001556889,0.001052098,0.0003046754,0.2571889],"genre_scores_gemma":[0.95240706,0.00042064942,0.013191208,0.00026694764,0.0002803821,0.0001576745,0.00072567875,0.00010222396,0.032448202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901986,0.0002799854,0.000050645576,0.00014920313,0.00020966039,0.0002906954],"domain_scores_gemma":[0.99737203,0.0014126274,0.0002848625,0.0002735692,0.0002564974,0.0004004857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017116144,0.00046800898,0.0006055635,0.002818934,0.0027003968,0.00407832,0.0009833754,0.001370576,0.010293094],"category_scores_gemma":[0.005502052,0.00041749503,0.0010060233,0.0012254278,0.0031912134,0.0052153487,0.0019787513,0.0021378745,0.001614302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015250447,0.000014165287,0.00026361004,0.0000081164935,0.0000021215465,0.000037847625,0.00018844716,0.00010601821,0.00018190993,0.99648213,0.00077491865,0.0019254222],"study_design_scores_gemma":[0.000014908252,0.000007641633,0.00039624865,0.000013799519,0.0000055053533,0.00017913367,0.00013125225,0.00206224,0.00038313054,0.993651,0.0031443303,0.000010805852],"about_ca_topic_score_codex":0.0009486308,"about_ca_topic_score_gemma":0.0010436912,"teacher_disagreement_score":0.010293094,"about_ca_system_score_codex":0.0016043229,"about_ca_system_score_gemma":0.0008243415,"threshold_uncertainty_score":0.03443384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46300352,0.0011578081,0.5055457,0.0007540603,0.0003089332,0.00021931477,0.0009328743,0.00054185005,0.027536051],"genre_scores_gemma":[0.82688975,0.00044646693,0.16027255,0.00033338432,0.00029112314,0.00029621745,0.0012912323,0.00019460717,0.009984695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998192,0.00043785776,0.00017297712,0.00031262214,0.00048756902,0.00039693154],"domain_scores_gemma":[0.99588495,0.0016501471,0.00039995098,0.00039154416,0.0010593382,0.0006140529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023859662,0.0005312873,0.0008420512,0.0013822932,0.0014201299,0.0033431835,0.0013909824,0.0007163863,0.003865377],"category_scores_gemma":[0.005489626,0.00077213964,0.0015472244,0.00083143194,0.0026975768,0.004021269,0.0018355971,0.0023834535,0.0010778625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059598766,0.000069784815,0.00057888305,0.000072450915,0.000023028091,0.00009336727,0.00048630874,0.0006110584,0.0042744614,0.9850535,0.0005978241,0.008079717],"study_design_scores_gemma":[0.000056145676,0.000059816033,0.0005355969,0.00004818327,0.000026928408,0.00014110851,0.00020320572,0.0068543428,0.0059872568,0.98239625,0.0036473265,0.000043804936],"about_ca_topic_score_codex":0.0013969458,"about_ca_topic_score_gemma":0.001844754,"teacher_disagreement_score":0.003865377,"about_ca_system_score_codex":0.0013644231,"about_ca_system_score_gemma":0.0018230279,"threshold_uncertainty_score":0.012931049},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37884155,0.0009431179,0.4893021,0.0042575505,0.00022608961,0.00011228446,0.0004669569,0.00055043225,0.12529987],"genre_scores_gemma":[0.9647939,0.00020316921,0.02987763,0.00018937686,0.00007181255,0.00007627213,0.0001399134,0.00005174038,0.00459629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998992,0.00028231667,0.00004904048,0.00018831185,0.0003093795,0.00017892507],"domain_scores_gemma":[0.9986571,0.000464189,0.00015259915,0.00037643476,0.00018933383,0.00016037768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012439775,0.000358505,0.0005457168,0.0011462998,0.0013433415,0.0029328833,0.0011661801,0.0012114985,0.0028255293],"category_scores_gemma":[0.0020182992,0.0004955877,0.0013269641,0.00089583156,0.006621127,0.0058683255,0.0024749965,0.002457944,0.00027510646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038422913,0.000005808912,0.00006252677,0.0000066062194,0.0000018661689,0.000020804895,0.00022503018,0.00044091538,0.00021379619,0.9985275,0.0000894058,0.00040182823],"study_design_scores_gemma":[0.000012513869,0.00001694826,0.00013899022,0.000013406638,0.000008269821,0.00010026874,0.00014889958,0.007593959,0.0006547638,0.9855828,0.0057173576,0.000011859469],"about_ca_topic_score_codex":0.0026049835,"about_ca_topic_score_gemma":0.0021251037,"teacher_disagreement_score":0.0029328833,"about_ca_system_score_codex":0.0019661635,"about_ca_system_score_gemma":0.001431593,"threshold_uncertainty_score":0.014265597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06694477,0.0016782263,0.8402215,0.0038455888,0.0003153856,0.00010845817,0.00046937048,0.0011750355,0.085241646],"genre_scores_gemma":[0.690042,0.0015764042,0.28955463,0.000699328,0.0005350387,0.000095372736,0.001064953,0.00028442862,0.016147926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956066,0.0017252539,0.00040025142,0.0007106971,0.0011833468,0.0003738753],"domain_scores_gemma":[0.9953296,0.0030537674,0.00026342773,0.00082981185,0.00036391008,0.00015950266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004163798,0.0013154403,0.0011559817,0.0020167574,0.0024038397,0.007224954,0.003169614,0.0030409142,0.008511693],"category_scores_gemma":[0.010979526,0.0014788201,0.003308186,0.002263831,0.008244628,0.022776093,0.0060442206,0.0065539028,0.0015415759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004121951,0.000012878137,0.00023253393,0.00006777412,0.000018210718,0.0002020415,0.0004972956,0.0018302259,0.000511066,0.98638994,0.0017277249,0.0084690675],"study_design_scores_gemma":[0.000010441955,0.0000044531994,0.000036924008,0.000014410915,0.000011101209,0.00009958972,0.00011114296,0.0038240103,0.00039823278,0.9928221,0.0026589863,0.000008644163],"about_ca_topic_score_codex":0.0017170486,"about_ca_topic_score_gemma":0.00208879,"teacher_disagreement_score":0.008511693,"about_ca_system_score_codex":0.0019302488,"about_ca_system_score_gemma":0.0008030495,"threshold_uncertainty_score":0.02847445},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078228384,0.13064067,0.18292749,0.33878058,0.097243235,0.0002701518,0.001754949,0.0014003702,0.16875416],"genre_scores_gemma":[0.59537345,0.04354696,0.045781136,0.01371986,0.06712754,0.00019532563,0.0012834079,0.0010142924,0.23195808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827087,0.0003249023,0.00005952874,0.00087829604,0.0003063016,0.0001601045],"domain_scores_gemma":[0.9970655,0.0013739903,0.00019967786,0.0001898,0.0005831356,0.000587932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025101344,0.00090122776,0.0009873558,0.0005952567,0.00190881,0.0018316384,0.0006949059,0.0007357982,0.009450536],"category_scores_gemma":[0.0050892564,0.00055102876,0.0007358708,0.0008732042,0.002436276,0.0029755165,0.0028576006,0.003869202,0.004458921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028155308,0.00012957648,0.0023743869,0.0005195778,0.00009528247,0.0006485232,0.0023402853,0.0028092973,0.005989714,0.4636865,0.4061283,0.11499702],"study_design_scores_gemma":[0.00003217398,0.00014331363,0.0027128463,0.00018510822,0.00006504085,0.000978583,0.00040650665,0.0020694418,0.004221649,0.17958347,0.80948985,0.000111949],"about_ca_topic_score_codex":0.0014771346,"about_ca_topic_score_gemma":0.0013697396,"teacher_disagreement_score":0.009450536,"about_ca_system_score_codex":0.0029657744,"about_ca_system_score_gemma":0.00090567773,"threshold_uncertainty_score":0.031615138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014127219,0.0065569067,0.08503134,0.0016201901,0.000598271,0.00005908193,0.00036185616,0.0003142191,0.89133084],"genre_scores_gemma":[0.6986571,0.012912773,0.06951863,0.0011283874,0.0025552656,0.00038781995,0.0013199408,0.0005890701,0.21293107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993969,0.00016746995,0.00004186645,0.00011177139,0.0002132817,0.000068713016],"domain_scores_gemma":[0.9992093,0.00042505402,0.000031202006,0.00015894466,0.00013839133,0.00003703394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008141983,0.00072114967,0.0006652203,0.0014636668,0.0018982404,0.0043254583,0.0008614972,0.0007655137,0.0117155025],"category_scores_gemma":[0.0018679802,0.00062003575,0.00076491345,0.0017295725,0.006422994,0.007158656,0.0013727726,0.0035901347,0.0030245995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033444137,0.0000034353218,0.00001670312,0.000019601177,0.000001446412,0.000007070792,0.00011474308,0.000057114175,0.00012007531,0.9930113,0.0020293256,0.00461587],"study_design_scores_gemma":[0.0000034594375,0.0000033164358,0.00006106841,0.000014831347,0.0000035703379,0.00004381319,0.000039266284,0.00018252606,0.00024644742,0.96488136,0.034516823,0.000003484549],"about_ca_topic_score_codex":0.00065224495,"about_ca_topic_score_gemma":0.000633493,"teacher_disagreement_score":0.0117155025,"about_ca_system_score_codex":0.0015445565,"about_ca_system_score_gemma":0.00077339564,"threshold_uncertainty_score":0.03919226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112556785,0.00046280416,0.60486704,0.0016410594,0.0008157982,0.00022431949,0.0017414445,0.003518999,0.27417177],"genre_scores_gemma":[0.6316029,0.00060799235,0.13265043,0.0011609216,0.0006080138,0.00058246293,0.0027927551,0.0045413272,0.22545321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997995,0.0003179304,0.00010137341,0.00052736705,0.0005596506,0.00049872004],"domain_scores_gemma":[0.9955693,0.0014420821,0.00036760082,0.00062974554,0.0013467642,0.000644527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010712938,0.0006439286,0.0007915485,0.002940645,0.006078006,0.0051363423,0.0013484848,0.0015033495,0.061538953],"category_scores_gemma":[0.008690532,0.0011406743,0.00096127373,0.0020373487,0.0030062746,0.0086902445,0.003545688,0.0025800697,0.013450162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052739313,0.000025672196,0.00036758333,0.000028966553,0.00000736259,0.00010267928,0.00041675632,0.00039898016,0.00059049093,0.9806646,0.007854284,0.009489846],"study_design_scores_gemma":[0.000021114523,0.000023184988,0.00046784012,0.000047400146,0.000015973183,0.00013066526,0.00031291024,0.009757797,0.0020958344,0.95555556,0.031541564,0.000030069516],"about_ca_topic_score_codex":0.0045149764,"about_ca_topic_score_gemma":0.007324539,"teacher_disagreement_score":0.061538953,"about_ca_system_score_codex":0.0021497419,"about_ca_system_score_gemma":0.0015980729,"threshold_uncertainty_score":0.2058683},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28215322,0.012520346,0.19080716,0.011166897,0.0019124355,0.00006611037,0.00057075144,0.0004938195,0.5003092],"genre_scores_gemma":[0.93106747,0.0030526964,0.017508099,0.0011907782,0.0012227339,0.000054231194,0.0002616036,0.00013527056,0.04550711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906534,0.00019221741,0.0000488723,0.00018451095,0.00025134513,0.000257804],"domain_scores_gemma":[0.9974361,0.0013599427,0.00026129867,0.00025397772,0.00027860285,0.0004100265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012341934,0.0006938557,0.0007386337,0.0027122847,0.0029818108,0.0029663413,0.00077160157,0.0013152062,0.01660543],"category_scores_gemma":[0.006203373,0.0004216336,0.0008518906,0.0016841206,0.0067505534,0.010032535,0.0029535536,0.003334399,0.0016301366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024012435,0.000008540629,0.00020049456,0.000025587055,0.0000045737893,0.000057825422,0.00019064975,0.00029124334,0.00019111959,0.9934104,0.0017783437,0.0038172663],"study_design_scores_gemma":[0.000004558923,0.00000608008,0.0001736328,0.00001629359,0.000003982071,0.00007798974,0.000091803275,0.0006506897,0.00010237626,0.994624,0.004240896,0.000007685252],"about_ca_topic_score_codex":0.0024483723,"about_ca_topic_score_gemma":0.0024665724,"teacher_disagreement_score":0.01660543,"about_ca_system_score_codex":0.001677939,"about_ca_system_score_gemma":0.0005320903,"threshold_uncertainty_score":0.055550694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19646728,0.0024858292,0.49811387,0.0013493067,0.00060600037,0.00013875673,0.0007062566,0.0007679845,0.29936475],"genre_scores_gemma":[0.9054041,0.0012532015,0.043726236,0.00029840926,0.00034457655,0.00008045713,0.00044165712,0.00012722661,0.0483241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935514,0.00009905656,0.000041620715,0.00011112137,0.00027239815,0.000120686585],"domain_scores_gemma":[0.9992385,0.00016786455,0.00008217684,0.00016549832,0.00022663108,0.00011927925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005389163,0.000320309,0.0004560493,0.0011724327,0.0012045118,0.002485392,0.00067106966,0.0005947194,0.011714299],"category_scores_gemma":[0.0015144402,0.00019846216,0.0005426836,0.0010353043,0.0015971313,0.0043611745,0.0017744208,0.001090766,0.0017478092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011365917,0.0000062967606,0.00006326234,0.0000151364075,0.0000023881355,0.000028991988,0.000053253334,0.0006284109,0.00062563934,0.994395,0.00043627873,0.0037339185],"study_design_scores_gemma":[0.000008547252,0.000016824624,0.000094812,0.00001304254,0.000006301062,0.00007333711,0.000047338344,0.010529449,0.0011190821,0.9775519,0.010528842,0.000010701145],"about_ca_topic_score_codex":0.0014155242,"about_ca_topic_score_gemma":0.0014732953,"teacher_disagreement_score":0.011714299,"about_ca_system_score_codex":0.0011068945,"about_ca_system_score_gemma":0.0007110904,"threshold_uncertainty_score":0.039188266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29371923,0.00052948855,0.66694593,0.0071576904,0.00038970463,0.0003760513,0.0020314895,0.0074672955,0.021383148],"genre_scores_gemma":[0.7920797,0.0003752076,0.19265859,0.0010398972,0.00023430635,0.00017552568,0.0032459015,0.0011956515,0.008995288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962394,0.0006228283,0.00029044144,0.0014326014,0.0008109918,0.00060365495],"domain_scores_gemma":[0.9663274,0.025316954,0.0016350001,0.003579884,0.0022173603,0.00092344696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032755286,0.0011479296,0.0018688402,0.0009341194,0.0031719287,0.0060383454,0.0039571472,0.0027190335,0.009378434],"category_scores_gemma":[0.017072551,0.001132007,0.0039829775,0.0011729817,0.0044182106,0.01674446,0.0039553866,0.00548073,0.0024017892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018193925,0.0010466811,0.014995088,0.0014768137,0.00035648127,0.0019528355,0.0023364837,0.03269543,0.02102494,0.7815818,0.029890098,0.11082389],"study_design_scores_gemma":[0.00012468742,0.00017592803,0.00083599123,0.00009590159,0.00015558676,0.0006395394,0.0006282836,0.08932523,0.020787,0.8772222,0.009909292,0.00010038254],"about_ca_topic_score_codex":0.005134547,"about_ca_topic_score_gemma":0.005925548,"teacher_disagreement_score":0.009378434,"about_ca_system_score_codex":0.0022470783,"about_ca_system_score_gemma":0.004051599,"threshold_uncertainty_score":0.031373978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28045008,0.0036796478,0.43459228,0.005227924,0.00059123675,0.00017651379,0.0029881138,0.00084511156,0.27144915],"genre_scores_gemma":[0.86057633,0.0029802185,0.07137418,0.0015326828,0.00118598,0.00022964984,0.0036753125,0.00046909953,0.057976615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990766,0.00018253685,0.00006690462,0.00022450704,0.00027401166,0.00017535039],"domain_scores_gemma":[0.9974362,0.001065218,0.00038357833,0.00027741614,0.00039702386,0.0004405421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009214007,0.00075556943,0.0007368027,0.00265025,0.0014941684,0.0039934632,0.0010105103,0.0011923754,0.020559423],"category_scores_gemma":[0.0046162196,0.0005013688,0.0005995185,0.0027774666,0.0020155378,0.009778814,0.0028819619,0.002239363,0.0032576385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056910907,0.00003158206,0.00048799632,0.000058840662,0.00000937014,0.000060632086,0.0001709394,0.00074098614,0.0017510011,0.9780613,0.0048729572,0.01369751],"study_design_scores_gemma":[0.000014304939,0.00003289811,0.0004959687,0.000035321154,0.000011683794,0.00025355094,0.0001619708,0.0039491085,0.0008933419,0.9789797,0.015159335,0.000012785376],"about_ca_topic_score_codex":0.00081235735,"about_ca_topic_score_gemma":0.0009081898,"teacher_disagreement_score":0.020559423,"about_ca_system_score_codex":0.0013965413,"about_ca_system_score_gemma":0.00041034343,"threshold_uncertainty_score":0.06877816},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059967242,0.016404532,0.2013647,0.009186684,0.0027163804,0.00008910024,0.0014184543,0.00054830464,0.7083046],"genre_scores_gemma":[0.64332426,0.01944178,0.0875422,0.0030341002,0.0021579692,0.0001474589,0.0015857755,0.00031468578,0.24245168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997335,0.000042662243,0.000017718938,0.00005010921,0.000108729386,0.00004729689],"domain_scores_gemma":[0.9996792,0.00014575293,0.000036532736,0.000049033046,0.00005369401,0.000035650228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093775,0.00049943576,0.00032205248,0.0009511499,0.00092319027,0.001522531,0.0005077873,0.0005278569,0.011774936],"category_scores_gemma":[0.0009985084,0.00028261062,0.0005923175,0.0011743075,0.002700611,0.0030875513,0.0015963794,0.0028452722,0.003047945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030993044,0.000009028648,0.00005804483,0.00008559976,0.000005118046,0.000087948094,0.00020748547,0.0008345811,0.0015942925,0.9731367,0.006634317,0.017315928],"study_design_scores_gemma":[0.000007560013,0.000022941987,0.00023368289,0.000021402442,0.00000656472,0.00014960127,0.00023612405,0.0005954221,0.0016448782,0.92503685,0.07203395,0.000011012873],"about_ca_topic_score_codex":0.0013775444,"about_ca_topic_score_gemma":0.0015690557,"teacher_disagreement_score":0.011774936,"about_ca_system_score_codex":0.0011394921,"about_ca_system_score_gemma":0.0004265387,"threshold_uncertainty_score":0.03939104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355402,0.00091739005,0.22829536,0.008698531,0.00015764673,0.0006221186,0.002402067,0.002357463,0.021009143],"genre_scores_gemma":[0.920575,0.00046842333,0.07163566,0.0005733709,0.00025150023,0.00024095691,0.002438933,0.00039548468,0.003420582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98800164,0.0032694968,0.0009199802,0.002312862,0.003678835,0.0018172484],"domain_scores_gemma":[0.8872479,0.09560525,0.0047469377,0.0070113754,0.0029098294,0.002478674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076301876,0.0009462459,0.0023708912,0.00222955,0.0039067324,0.007836657,0.003478548,0.003006822,0.012357218],"category_scores_gemma":[0.056363158,0.0014074127,0.0037131328,0.0023972725,0.00793606,0.024529397,0.0075946837,0.0061031072,0.00113169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021816795,0.00064481626,0.015218577,0.00083153124,0.00022701698,0.0010264568,0.0020004492,0.08416395,0.011905632,0.81645656,0.007841409,0.05750196],"study_design_scores_gemma":[0.0001935516,0.00011994065,0.0013797609,0.000050035098,0.00007330412,0.00030091085,0.00047438263,0.12076533,0.0069353306,0.8677043,0.0019210582,0.00008209054],"about_ca_topic_score_codex":0.003474098,"about_ca_topic_score_gemma":0.0027661843,"teacher_disagreement_score":0.012357218,"about_ca_system_score_codex":0.0032044763,"about_ca_system_score_gemma":0.0033019264,"threshold_uncertainty_score":0.04133898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25317633,0.0044432976,0.51655585,0.003540866,0.0012064517,0.00011897193,0.0013049594,0.0014751815,0.21817817],"genre_scores_gemma":[0.91344446,0.0012870338,0.041496247,0.0004481866,0.00074452965,0.00009496542,0.00089654967,0.00020212297,0.04138593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911934,0.0002315402,0.00006739766,0.00014251277,0.0002568162,0.00018240232],"domain_scores_gemma":[0.99908507,0.0002318783,0.00013199697,0.00015516511,0.00020733566,0.00018855439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013269129,0.0006509415,0.0009329119,0.0018342851,0.0017648233,0.0051880884,0.0013848565,0.0010078643,0.010736235],"category_scores_gemma":[0.002077128,0.00050343515,0.0011151263,0.0018463219,0.0019403951,0.0074465256,0.0018950531,0.0026150816,0.0014611747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001534592,0.0000076485485,0.000039411007,0.000011836715,0.000004053789,0.000013755339,0.0001071715,0.0001760074,0.00025934403,0.9967673,0.00040513003,0.0021930488],"study_design_scores_gemma":[0.000011505309,0.000008120899,0.00006462088,0.000009437332,0.0000069913253,0.00003489221,0.000069201385,0.0015330971,0.00021895555,0.99408925,0.003945854,0.000008147352],"about_ca_topic_score_codex":0.0012622578,"about_ca_topic_score_gemma":0.0014445914,"teacher_disagreement_score":0.010736235,"about_ca_system_score_codex":0.0016178131,"about_ca_system_score_gemma":0.0006827078,"threshold_uncertainty_score":0.03591627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4934982,0.0038446723,0.32240203,0.0030186418,0.00066699774,0.00010330534,0.0013092564,0.0008052107,0.17435159],"genre_scores_gemma":[0.9407457,0.001149697,0.026097802,0.0002605868,0.00042565214,0.000065107255,0.0005001255,0.00013145519,0.030623874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991997,0.00018006546,0.00008502333,0.0001323906,0.00024935752,0.00015357198],"domain_scores_gemma":[0.9987362,0.00042395914,0.00019302117,0.00017952698,0.00023496512,0.00023227908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120381,0.00059138105,0.0006755846,0.0033376429,0.0016544807,0.0037958564,0.0007567876,0.0008082719,0.009516874],"category_scores_gemma":[0.0024734961,0.00048092255,0.0008679268,0.0027136882,0.0024617082,0.006887446,0.0018335452,0.002054068,0.0015300987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001946071,0.000008706423,0.00008037881,0.000010949031,0.0000037540217,0.00002621576,0.00022301529,0.00011340517,0.0002611566,0.99576205,0.00034177207,0.003149118],"study_design_scores_gemma":[0.000009335972,0.000013172186,0.00012351823,0.000010415565,0.000007119407,0.00008925255,0.00012483104,0.0011661896,0.00034058062,0.9939406,0.004165615,0.0000094941315],"about_ca_topic_score_codex":0.0008573891,"about_ca_topic_score_gemma":0.0007160007,"teacher_disagreement_score":0.009516874,"about_ca_system_score_codex":0.00094115635,"about_ca_system_score_gemma":0.00047589763,"threshold_uncertainty_score":0.031837106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981942,0.0006050805,0.25952303,0.00043065098,0.00007177513,0.00012822344,0.00029472288,0.0002606706,0.040491693],"genre_scores_gemma":[0.9664247,0.00022217177,0.027022496,0.00009000038,0.00010943487,0.00010699364,0.00028442364,0.00007175312,0.005668074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977221,0.00039942245,0.00016864012,0.0008565208,0.0006432231,0.00021004824],"domain_scores_gemma":[0.99656963,0.0011529914,0.0005529698,0.0005127293,0.0007165901,0.00049503264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015390231,0.00041110907,0.0005683502,0.0015621352,0.0029458392,0.0033514474,0.0008446577,0.00067130884,0.0028889861],"category_scores_gemma":[0.0043821703,0.00046337987,0.0007931341,0.0014852236,0.0042513395,0.006518857,0.0030184344,0.0015905624,0.00042097352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070103786,0.000030922052,0.003657432,0.000039176128,0.000017225902,0.00038563242,0.0010551114,0.00068493513,0.009243831,0.97719836,0.00029768277,0.007319728],"study_design_scores_gemma":[0.000046555895,0.0001732284,0.0036021615,0.000050751645,0.00005621066,0.0024909575,0.00111368,0.007913609,0.022772295,0.9379276,0.023787001,0.00006587473],"about_ca_topic_score_codex":0.0005516499,"about_ca_topic_score_gemma":0.0003194036,"teacher_disagreement_score":0.0033514474,"about_ca_system_score_codex":0.0010955026,"about_ca_system_score_gemma":0.0007070346,"threshold_uncertainty_score":0.009664595},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057541765,0.017036347,0.25849554,0.046314098,0.009517688,0.000099098106,0.0014136955,0.0009475733,0.6086342],"genre_scores_gemma":[0.66201854,0.022353897,0.12622024,0.00905193,0.013768012,0.00022653166,0.0013894199,0.0007141985,0.16425714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929786,0.00017431051,0.000038178816,0.00014765718,0.00023299358,0.000109048175],"domain_scores_gemma":[0.9990025,0.00053346425,0.000057496152,0.0001603308,0.0001482019,0.00009807708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079931883,0.0007196557,0.0010361105,0.001018582,0.0027334848,0.003082549,0.0014833326,0.0011683796,0.013847303],"category_scores_gemma":[0.0026836747,0.00049646,0.0010601853,0.002705725,0.003987291,0.012768175,0.004184745,0.0059301415,0.0023325635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020946602,0.000006475206,0.000028104867,0.00004288223,0.0000030878152,0.000031106047,0.000065217144,0.00031911334,0.00020453073,0.98485965,0.0076263086,0.0067926603],"study_design_scores_gemma":[0.0000061162546,0.000008595723,0.00004989526,0.0000112037005,0.0000054808183,0.00005724253,0.000054426724,0.0005889809,0.00025591327,0.9664825,0.032472108,0.000007453479],"about_ca_topic_score_codex":0.0016920553,"about_ca_topic_score_gemma":0.0018627535,"teacher_disagreement_score":0.013847303,"about_ca_system_score_codex":0.0017404527,"about_ca_system_score_gemma":0.00071361917,"threshold_uncertainty_score":0.046323776},"labels":[],"label_agreement":null},{"id":"W1966402460","doi":"10.1016/j.apal.2008.09.019","title":"Definable principal congruences and solvability","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Congruence relation; Mathematics; Principal (computer security); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.06344789465245204,"score_gpt":0.2813684653132636,"score_spread":0.21792057066081155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966402460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27538216,0.0041412823,0.42231718,0.014112081,0.0012040663,0.00036705632,0.0010419183,0.0014076626,0.28002644],"genre_scores_gemma":[0.92070866,0.0012358881,0.042158656,0.0007052087,0.0011523787,0.000244476,0.00088446576,0.0002501046,0.032660156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688905,0.00075701973,0.0002594314,0.0008528217,0.000698305,0.00054345065],"domain_scores_gemma":[0.99402726,0.0038455543,0.00035023305,0.0005634652,0.00068113685,0.0005322955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030353868,0.0008955888,0.0019320771,0.0016800171,0.0043371445,0.006589369,0.0014888906,0.001935729,0.010445249],"category_scores_gemma":[0.009043557,0.001374804,0.002384372,0.0019822055,0.0098221125,0.016525976,0.005404841,0.0084068375,0.0015615588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043756372,0.000040838317,0.00013884054,0.000029265488,0.000009296894,0.000057231813,0.00050824496,0.00017933371,0.00041602817,0.9945604,0.00092653756,0.0030902368],"study_design_scores_gemma":[0.000034640067,0.0000054734837,0.000054522978,0.000005020658,0.000006517446,0.00003271165,0.00007624881,0.0004628316,0.00026571556,0.99735767,0.0016929224,0.000005744066],"about_ca_topic_score_codex":0.0011328058,"about_ca_topic_score_gemma":0.0014455795,"teacher_disagreement_score":0.010445249,"about_ca_system_score_codex":0.0020667964,"about_ca_system_score_gemma":0.0018688774,"threshold_uncertainty_score":0.034942806},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4752108,0.0027169294,0.44322857,0.0010986163,0.0005758237,0.00016678378,0.00041496096,0.00086387893,0.07572356],"genre_scores_gemma":[0.9409534,0.0006177113,0.040507533,0.0002695304,0.00028964333,0.000108838045,0.0002581867,0.00021670702,0.016778441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767154,0.0005018461,0.00022331577,0.0004199446,0.0008011779,0.00038217416],"domain_scores_gemma":[0.9973224,0.00067745184,0.00039472626,0.00033735594,0.00048161924,0.00078653044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023047698,0.000784383,0.0009888272,0.0027916036,0.0018674309,0.004996466,0.0014423961,0.0008085904,0.005496368],"category_scores_gemma":[0.0042020064,0.0007489295,0.0014387134,0.0014739268,0.0033782576,0.008544363,0.004398703,0.0026687013,0.00075078855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043787088,0.000017205617,0.00023211022,0.000024243642,0.000013212478,0.00007250596,0.00030809993,0.00046247305,0.001333382,0.9933915,0.0002526185,0.003848956],"study_design_scores_gemma":[0.00002111151,0.000032633787,0.0002617887,0.000017870996,0.000021513224,0.0001467877,0.00022942886,0.004197074,0.0017566589,0.9899927,0.0033060545,0.000016318752],"about_ca_topic_score_codex":0.0007474558,"about_ca_topic_score_gemma":0.0007800136,"teacher_disagreement_score":0.005496368,"about_ca_system_score_codex":0.0013058989,"about_ca_system_score_gemma":0.00052205584,"threshold_uncertainty_score":0.018387139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05239474,0.0040266104,0.91481346,0.0062139593,0.00029329408,0.00023972211,0.003211882,0.0016953124,0.017111022],"genre_scores_gemma":[0.5249846,0.009734002,0.4348734,0.001779948,0.00071734464,0.0007934794,0.014979541,0.0012154633,0.010922257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.985458,0.0046675154,0.0013929339,0.002455428,0.005433889,0.00059231883],"domain_scores_gemma":[0.91351885,0.050261315,0.00665059,0.021434912,0.007241861,0.0008924826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013489892,0.0014111652,0.0023510742,0.0056647165,0.003067211,0.0060476367,0.0044748923,0.002532136,0.0075846673],"category_scores_gemma":[0.077586085,0.0021783414,0.0026365283,0.004717167,0.00691796,0.013883246,0.006989408,0.004138812,0.0017711207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043290504,0.00009303139,0.007935859,0.0012024452,0.00040788713,0.0016397989,0.0019374684,0.12998119,0.0023653673,0.75688624,0.013490246,0.083627515],"study_design_scores_gemma":[0.000028650744,0.00004426158,0.00083833135,0.00035954497,0.000097564305,0.00048459801,0.00036505237,0.12176076,0.0019163975,0.8533247,0.02073601,0.000044057197],"about_ca_topic_score_codex":0.005053638,"about_ca_topic_score_gemma":0.0045291283,"teacher_disagreement_score":0.013489892,"about_ca_system_score_codex":0.0031858257,"about_ca_system_score_gemma":0.0030985111,"threshold_uncertainty_score":0.07134217},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1148958,0.0036692738,0.2205816,0.013605226,0.002886866,0.00006874163,0.0005739932,0.0010261965,0.6426924],"genre_scores_gemma":[0.9024531,0.0010388567,0.017018873,0.001637354,0.002396101,0.00007497504,0.00032147078,0.00035236691,0.074706756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894303,0.00022352638,0.00004757677,0.00023929594,0.00033891303,0.00020757067],"domain_scores_gemma":[0.99921596,0.00021617215,0.000082057515,0.00017845847,0.00016771436,0.00013962394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010911048,0.0004748174,0.000813584,0.0016114817,0.0024456729,0.0033544481,0.0006475004,0.0014548039,0.013185524],"category_scores_gemma":[0.00263883,0.0003978395,0.00069778267,0.0010946206,0.0045414637,0.007511541,0.0024839728,0.003795714,0.0019677896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057671955,0.0000027765414,0.000024889458,0.000004767768,0.0000014013643,0.0000119149945,0.000046404337,0.000023061479,0.00016752539,0.99681926,0.0009224039,0.0019698995],"study_design_scores_gemma":[0.000004216096,0.0000030758167,0.00008250406,0.000003976309,0.0000023726873,0.00006316065,0.000023269386,0.00047011464,0.00026609914,0.99138683,0.007688824,0.000005635925],"about_ca_topic_score_codex":0.00066830445,"about_ca_topic_score_gemma":0.00035069324,"teacher_disagreement_score":0.013185524,"about_ca_system_score_codex":0.0013153846,"about_ca_system_score_gemma":0.00069209473,"threshold_uncertainty_score":0.04411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35324308,0.0016825788,0.47452128,0.007877625,0.0009135368,0.00014389539,0.001351836,0.0011214373,0.15914477],"genre_scores_gemma":[0.91045153,0.0009891384,0.05548764,0.00055173476,0.00053514994,0.00016750554,0.000706846,0.000474568,0.030635815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963362,0.0012560675,0.00034993133,0.00071105646,0.000692299,0.00065438007],"domain_scores_gemma":[0.9904144,0.0060871914,0.0006241974,0.0015236558,0.0007246557,0.00062583387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00356645,0.00077286,0.0014797358,0.00414075,0.0051690354,0.00853672,0.0020762873,0.0023548915,0.011832001],"category_scores_gemma":[0.014067999,0.0014368492,0.0018982268,0.0053181346,0.008097935,0.032372236,0.0065148654,0.0063754637,0.0015741821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013484831,0.000008542004,0.0002310393,0.000012549002,0.0000031013392,0.000023471199,0.00026715794,0.0002357364,0.00009062137,0.99576735,0.0004319228,0.0029149244],"study_design_scores_gemma":[0.0000064937576,0.0000047651506,0.00017172926,0.000016222793,0.000010438654,0.000069914415,0.0001630252,0.0011617844,0.00022157897,0.9938455,0.004317436,0.000011084074],"about_ca_topic_score_codex":0.0016495694,"about_ca_topic_score_gemma":0.0017007686,"teacher_disagreement_score":0.011832001,"about_ca_system_score_codex":0.002798842,"about_ca_system_score_gemma":0.0011795475,"threshold_uncertainty_score":0.039581954},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15451443,0.011209332,0.24220164,0.013534812,0.0010855778,0.0001601427,0.0017588665,0.0014501236,0.57408506],"genre_scores_gemma":[0.9008117,0.0032231517,0.025322638,0.0014342328,0.0013524407,0.00014570192,0.0012722859,0.00092676515,0.06551112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944458,0.0017662476,0.00043807758,0.0013173887,0.0012400035,0.00079253543],"domain_scores_gemma":[0.99026734,0.0047466257,0.00085905055,0.0019927146,0.0016724295,0.00046191397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048228875,0.0007687946,0.0010718692,0.00482283,0.0034405964,0.009977271,0.0016114723,0.0012898952,0.03348979],"category_scores_gemma":[0.0125110485,0.00094739604,0.0013356686,0.005364039,0.010743739,0.03325483,0.0065511367,0.0048986673,0.003262989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024947554,0.000009482995,0.0005336284,0.000036935096,0.000012162318,0.000050634877,0.0006260189,0.00011227519,0.00015966139,0.99028873,0.002000414,0.0061451457],"study_design_scores_gemma":[0.0000123094605,0.000012923625,0.0007734065,0.000058734335,0.000028151657,0.0001979101,0.0004511408,0.0006236427,0.00046121186,0.9676032,0.029758327,0.000019052142],"about_ca_topic_score_codex":0.0016754502,"about_ca_topic_score_gemma":0.0009879303,"teacher_disagreement_score":0.03348979,"about_ca_system_score_codex":0.0028200827,"about_ca_system_score_gemma":0.0014122986,"threshold_uncertainty_score":0.1120345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9414624,0.000640502,0.0434041,0.00040200687,0.000057095054,0.000025535875,0.0003906672,0.0000903814,0.013527236],"genre_scores_gemma":[0.9906392,0.00016743272,0.0075342255,0.000029341965,0.000081214035,0.00003234463,0.00022088687,0.000018709516,0.0012766074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.00018360595,0.00009923528,0.00034112748,0.00030706718,0.00028822396],"domain_scores_gemma":[0.99667656,0.0013511027,0.00048405826,0.00043333857,0.00041964784,0.00063529663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011515734,0.0003012668,0.0007166366,0.003534131,0.0014440618,0.0033851038,0.0008633709,0.0005500522,0.002118004],"category_scores_gemma":[0.00278315,0.00036322474,0.00079615694,0.0013302453,0.004701178,0.004612671,0.0022585648,0.0011488764,0.00018322431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011310171,0.00003803728,0.0061381483,0.000051708404,0.000032812142,0.00016602123,0.0007952188,0.0014956767,0.004373851,0.98157436,0.00050793384,0.0047131716],"study_design_scores_gemma":[0.000043622003,0.000117150616,0.011783744,0.000072778916,0.00006964649,0.0012668894,0.0009865438,0.017913913,0.009448597,0.9490461,0.0091384,0.00011267146],"about_ca_topic_score_codex":0.00040964634,"about_ca_topic_score_gemma":0.00018879493,"teacher_disagreement_score":0.003534131,"about_ca_system_score_codex":0.0011717405,"about_ca_system_score_gemma":0.0004692379,"threshold_uncertainty_score":0.008501589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7676742,0.00024230148,0.15856789,0.00094763096,0.00023611818,0.00018226076,0.00015819573,0.00075800245,0.07123344],"genre_scores_gemma":[0.9596669,0.000115553856,0.024567643,0.00022033542,0.00010515941,0.000104169834,0.00020861036,0.0001231992,0.014888422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00014945275,0.00003090772,0.000097268654,0.0001503736,0.00014254123],"domain_scores_gemma":[0.99918455,0.0002711409,0.00010468426,0.0001625196,0.00006813273,0.00020899758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093413534,0.00063227216,0.00081593805,0.0011390755,0.0014224999,0.0020632285,0.0010075638,0.000982204,0.004281413],"category_scores_gemma":[0.0010815514,0.00053866446,0.0010173412,0.0007119678,0.0026309844,0.0022058485,0.0025967886,0.002012968,0.0007016058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045290428,0.000023177488,0.00017552465,0.00001160026,0.0000059306667,0.00009880505,0.0004507223,0.00047606442,0.002787567,0.9927119,0.00031031104,0.0029031907],"study_design_scores_gemma":[0.000063384,0.000057116726,0.00026168715,0.000010377779,0.00001544989,0.00015300703,0.00027333037,0.0037075637,0.003373281,0.98764384,0.0044243094,0.000016709138],"about_ca_topic_score_codex":0.0002686813,"about_ca_topic_score_gemma":0.00034063013,"teacher_disagreement_score":0.004281413,"about_ca_system_score_codex":0.0006895853,"about_ca_system_score_gemma":0.0003639747,"threshold_uncertainty_score":0.014322698},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4632019,0.0037784546,0.47462824,0.0017203275,0.00021760244,0.00009013837,0.0004054809,0.0003246484,0.055633344],"genre_scores_gemma":[0.9545731,0.00063175755,0.03921394,0.00016385895,0.00018802582,0.00007390352,0.00016875306,0.000029405368,0.004957178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967399,0.00073121546,0.00026757552,0.00039185528,0.0015177428,0.0003516939],"domain_scores_gemma":[0.99562234,0.0018826688,0.0007666187,0.0004430466,0.0008207368,0.00046463267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025469966,0.0003438308,0.00045867893,0.0017331782,0.0019884252,0.0036247135,0.0008070074,0.0007493797,0.0022425652],"category_scores_gemma":[0.0056905914,0.0003943502,0.0009429258,0.0016179217,0.0048518106,0.005661846,0.002176316,0.0011700201,0.00028150645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002866977,0.000010592631,0.00022519486,0.000024192612,0.000009673819,0.000105685314,0.00027397473,0.0020729273,0.0007723075,0.9926041,0.00020042468,0.0036723232],"study_design_scores_gemma":[0.000009018729,0.000014147999,0.000155762,0.000011870701,0.000007675755,0.00010324077,0.00013463065,0.011345632,0.0008035941,0.9851333,0.0022674815,0.0000137135985],"about_ca_topic_score_codex":0.0020325312,"about_ca_topic_score_gemma":0.0018095261,"teacher_disagreement_score":0.0036247135,"about_ca_system_score_codex":0.0024912483,"about_ca_system_score_gemma":0.00128313,"threshold_uncertainty_score":0.018075347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6852562,0.0016130954,0.17713773,0.0019992911,0.000565063,0.000119284065,0.0005832948,0.0007989119,0.13192728],"genre_scores_gemma":[0.9669103,0.00027584375,0.0120225,0.0001998052,0.0003262068,0.00004539109,0.000270671,0.000055392804,0.019893909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989017,0.00021134428,0.00010161793,0.00020590365,0.00031766586,0.00026174504],"domain_scores_gemma":[0.99841654,0.00044869797,0.00029333643,0.00023783512,0.00024159407,0.0003619052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720245,0.00070795463,0.00093624665,0.0018609717,0.0022285655,0.0032670985,0.0010571042,0.00083336094,0.006513594],"category_scores_gemma":[0.0023628508,0.0006803601,0.0009575822,0.0013637345,0.0038886687,0.0069293072,0.0033413202,0.0017085319,0.0011650244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009079885,0.000016665279,0.00026041328,0.00002115043,0.00001220966,0.00007404661,0.00022963315,0.00019365636,0.0007083622,0.99516416,0.00041085941,0.0028181633],"study_design_scores_gemma":[0.00003126333,0.00003554003,0.0002521869,0.000009388655,0.00002580215,0.00019496359,0.00015031219,0.0009849577,0.0012816101,0.9935335,0.0034837509,0.000016781023],"about_ca_topic_score_codex":0.00052888354,"about_ca_topic_score_gemma":0.0005672024,"teacher_disagreement_score":0.006513594,"about_ca_system_score_codex":0.0008273102,"about_ca_system_score_gemma":0.00075029646,"threshold_uncertainty_score":0.021790147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1987582,0.001998066,0.6141813,0.006070773,0.00094569003,0.0001487482,0.0011000232,0.0005329589,0.17626426],"genre_scores_gemma":[0.9142945,0.001322311,0.05277736,0.0011275809,0.0022586172,0.0002733796,0.0014454818,0.00024975886,0.026251089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964586,0.00072522764,0.00023666304,0.0009007717,0.0011038433,0.000574854],"domain_scores_gemma":[0.9905289,0.0055275294,0.00055146293,0.0015345187,0.0009672957,0.00089033775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033037271,0.00082530355,0.0015838917,0.0018214796,0.0033432518,0.005085127,0.0013882706,0.0013947078,0.004930919],"category_scores_gemma":[0.007247501,0.0014800224,0.0028139278,0.0017028643,0.00829618,0.013294551,0.005796593,0.008092164,0.0011471481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066374654,0.000026980246,0.00031476858,0.000033564906,0.00001880868,0.000048414295,0.00019956894,0.0005288285,0.000727697,0.9935656,0.0009803277,0.003489057],"study_design_scores_gemma":[0.000020225307,0.000008643803,0.00022156486,0.00000432199,0.000008856688,0.000052297706,0.000025722778,0.0013595448,0.00051423215,0.9957146,0.0020615899,0.000008339862],"about_ca_topic_score_codex":0.0010872218,"about_ca_topic_score_gemma":0.001144849,"teacher_disagreement_score":0.005085127,"about_ca_system_score_codex":0.0015280478,"about_ca_system_score_gemma":0.0013321101,"threshold_uncertainty_score":0.01747197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058501076,0.0024637922,0.60714585,0.005012262,0.0012112957,0.00026096732,0.0047098375,0.00095083175,0.3197442],"genre_scores_gemma":[0.5364486,0.001692284,0.31362358,0.0026493166,0.0015204897,0.00087118085,0.007048094,0.00079333415,0.13535322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967224,0.00097273703,0.00032440544,0.00074703066,0.00079735153,0.00043609084],"domain_scores_gemma":[0.9952976,0.0021947043,0.00045764755,0.00033703487,0.0012416783,0.00047135804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029512264,0.00081483234,0.00063517183,0.0023588121,0.0024435937,0.0045749433,0.00122134,0.0007615344,0.02885696],"category_scores_gemma":[0.005503456,0.00077198993,0.0012566844,0.0017327714,0.0029412196,0.008105222,0.0022563783,0.0033323178,0.0056321505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047984395,0.000026449106,0.00012158538,0.00007618335,0.000010309841,0.00005684426,0.00022017612,0.00027560655,0.0010034741,0.9870675,0.0037430818,0.0073507237],"study_design_scores_gemma":[0.000021602573,0.000031788444,0.00028615227,0.0000421098,0.0000102637605,0.00012802685,0.00023446139,0.0039426787,0.0018623071,0.9683321,0.025083292,0.000025242723],"about_ca_topic_score_codex":0.002936035,"about_ca_topic_score_gemma":0.0051954943,"teacher_disagreement_score":0.02885696,"about_ca_system_score_codex":0.00243961,"about_ca_system_score_gemma":0.0013954719,"threshold_uncertainty_score":0.09653616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44864124,0.0009671006,0.34664026,0.0013700651,0.00030845392,0.00011223577,0.0012222641,0.0010701343,0.1996682],"genre_scores_gemma":[0.9299872,0.00044104859,0.021954646,0.00022448698,0.0001284288,0.00008496522,0.0014070247,0.0002153101,0.045556985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987993,0.00023014493,0.000104481165,0.0003104165,0.00033382105,0.00022171292],"domain_scores_gemma":[0.9984561,0.0005059753,0.00012853359,0.00024789677,0.00027757406,0.00038389183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948019,0.0009957772,0.00091180066,0.002027614,0.0024278644,0.005028249,0.0009434138,0.00082486327,0.021157322],"category_scores_gemma":[0.0017785914,0.00075459405,0.0009324058,0.002509713,0.002950491,0.008946635,0.0053719264,0.0032178834,0.0025654875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041792708,0.000040072206,0.00037160414,0.00003592892,0.000011639344,0.00019175133,0.00068609783,0.00041555363,0.0010610871,0.99154526,0.00094645924,0.0046528196],"study_design_scores_gemma":[0.000019269752,0.000024691277,0.0002216881,0.000018567274,0.000014784301,0.00042240287,0.0006118944,0.0016363248,0.0010345594,0.9885361,0.007446435,0.000013341226],"about_ca_topic_score_codex":0.00043245463,"about_ca_topic_score_gemma":0.00063166744,"teacher_disagreement_score":0.021157322,"about_ca_system_score_codex":0.00079402945,"about_ca_system_score_gemma":0.0004453432,"threshold_uncertainty_score":0.07077831},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8504371,0.0012356096,0.08805585,0.0008598743,0.0001585391,0.000048722046,0.00043726093,0.00044191463,0.05832512],"genre_scores_gemma":[0.98284596,0.00023651516,0.006416185,0.00015027597,0.00011777132,0.000039716615,0.00021277768,0.000057508492,0.009923385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990138,0.00017753315,0.000053708747,0.00028160997,0.00020135031,0.0002720157],"domain_scores_gemma":[0.99876654,0.00028975133,0.0001670897,0.0001169283,0.00016808507,0.00049168436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012420333,0.0006840807,0.000639079,0.002234035,0.0020650288,0.0030132458,0.0010831652,0.0006914934,0.0043373876],"category_scores_gemma":[0.0018075351,0.0006995495,0.0010092868,0.0012016366,0.0045919693,0.0054271184,0.0037198826,0.0014464299,0.00036755187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056449193,0.000016664386,0.00074687984,0.000021712725,0.000010837056,0.0001481803,0.00044484835,0.00047605007,0.0011608338,0.99403906,0.0003018223,0.002576685],"study_design_scores_gemma":[0.00004084544,0.000042719115,0.0018023384,0.000026684138,0.000023414575,0.00038116134,0.000413281,0.0027857984,0.0015148002,0.988632,0.0043044174,0.000032593627],"about_ca_topic_score_codex":0.0018820156,"about_ca_topic_score_gemma":0.001215238,"teacher_disagreement_score":0.0043373876,"about_ca_system_score_codex":0.0017961834,"about_ca_system_score_gemma":0.0005206304,"threshold_uncertainty_score":0.0145100355},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12860915,0.0040312987,0.15044856,0.028868124,0.0026592112,0.00007186683,0.001100408,0.0012211577,0.68299025],"genre_scores_gemma":[0.8955106,0.0014856186,0.033946887,0.0038196314,0.001092485,0.00008851196,0.00044258853,0.00044087862,0.06317278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926203,0.0001515899,0.000028625944,0.00019469523,0.00021274811,0.00015034697],"domain_scores_gemma":[0.9991553,0.00023891486,0.000056039768,0.00026124404,0.00016244278,0.00012606315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188662,0.00027348535,0.0006526277,0.0011190845,0.0038535618,0.0045168046,0.00088508014,0.0015926658,0.019193955],"category_scores_gemma":[0.0035896196,0.00036175761,0.0004552495,0.00096941344,0.0061349887,0.01044586,0.003140254,0.0027354273,0.0027809169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068639447,0.0000023382568,0.000038162587,0.0000060586403,0.0000013671228,0.000009787289,0.00008007942,0.00004079367,0.00009189315,0.9950206,0.0021661269,0.002535731],"study_design_scores_gemma":[0.00000444986,0.0000021496705,0.000052636,0.0000059361496,0.0000014431599,0.000029613202,0.00006766548,0.0002631258,0.00007984417,0.9843441,0.015145883,0.0000032279117],"about_ca_topic_score_codex":0.0015252938,"about_ca_topic_score_gemma":0.0017404543,"teacher_disagreement_score":0.019193955,"about_ca_system_score_codex":0.0012578233,"about_ca_system_score_gemma":0.00095507107,"threshold_uncertainty_score":0.06421018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17442329,0.010564985,0.49472466,0.008872356,0.0014856444,0.00016905257,0.0015407907,0.0010821216,0.30713716],"genre_scores_gemma":[0.910241,0.0023506267,0.046339072,0.0009857164,0.0012000743,0.00010679553,0.0005296603,0.00012913032,0.038118023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998466,0.00039853406,0.00014947593,0.00025995675,0.00051325426,0.00021275612],"domain_scores_gemma":[0.9983272,0.0005995134,0.00020507073,0.000233004,0.0003815339,0.00025368706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020522752,0.0005447761,0.0009849023,0.002386335,0.0026669062,0.0046583214,0.0014505901,0.0013576767,0.008748654],"category_scores_gemma":[0.0039666556,0.00062849314,0.0010383041,0.0025642614,0.0055100317,0.010675059,0.003074848,0.0029829866,0.001190474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045759084,0.0000024205917,0.000023741099,0.000008650255,0.000001944761,0.000007733841,0.000046977708,0.000047929483,0.000050447954,0.99857354,0.00026520327,0.0009668311],"study_design_scores_gemma":[0.000004144761,0.000003938916,0.000032007847,0.0000049654236,0.0000037363177,0.000028609107,0.000026336145,0.00037690013,0.000098249926,0.9971011,0.0023159215,0.000003981593],"about_ca_topic_score_codex":0.0011369258,"about_ca_topic_score_gemma":0.0007848346,"teacher_disagreement_score":0.008748654,"about_ca_system_score_codex":0.0017010075,"about_ca_system_score_gemma":0.0011175823,"threshold_uncertainty_score":0.029267132},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009940307,0.0338888,0.03752386,0.010529654,0.0058260737,0.000033651424,0.0012483858,0.0004467323,0.90056247],"genre_scores_gemma":[0.41619352,0.02359769,0.026816886,0.0045462074,0.009473299,0.00017087646,0.00200568,0.00069602596,0.5164998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999589,0.000098329234,0.000016905311,0.00009781408,0.00014818272,0.00004963069],"domain_scores_gemma":[0.99967766,0.00007637903,0.00003370395,0.000066575856,0.00009632443,0.000049399492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050475216,0.0006314483,0.0005803342,0.0013976477,0.0016245284,0.0033909709,0.00056664477,0.0007190771,0.02902681],"category_scores_gemma":[0.0009401606,0.00027359437,0.0004985774,0.0012976922,0.0022152574,0.0038772838,0.0013978328,0.0028931112,0.009547299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001135479,0.000009415445,0.000082306644,0.000043251774,0.000004327403,0.000013531811,0.00009824602,0.00009976795,0.00015951862,0.9603536,0.029098207,0.01002648],"study_design_scores_gemma":[0.0000058564533,0.0000070259407,0.00021660325,0.000033881704,0.0000052530563,0.00009843823,0.000080559075,0.0003988353,0.00019143886,0.8733489,0.12560803,0.000005214334],"about_ca_topic_score_codex":0.0011431685,"about_ca_topic_score_gemma":0.000992251,"teacher_disagreement_score":0.02902681,"about_ca_system_score_codex":0.0013440312,"about_ca_system_score_gemma":0.0006953365,"threshold_uncertainty_score":0.09710437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027134696,0.00011215629,0.99621934,0.000030488476,0.000024290177,0.000024831601,0.000010246299,0.000058075486,0.0008071496],"genre_scores_gemma":[0.06425483,0.0002192688,0.9316961,0.000038695267,0.00004150565,0.000096105294,0.000053987722,0.00007327919,0.0035261253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.00022150432,0.000059387938,0.00014227553,0.000310812,0.00006561651],"domain_scores_gemma":[0.9991849,0.00031029482,0.000044113956,0.00011895875,0.0002883796,0.00005339026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095956,0.00061073375,0.00068406446,0.0011797493,0.0005479272,0.0009296891,0.00092142087,0.0009002035,0.0032224688],"category_scores_gemma":[0.002588399,0.00033698126,0.0013577983,0.0007408787,0.0007080977,0.0010843854,0.0010631563,0.0011521752,0.0007304198],"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.00030956304,0.00016737069,0.00081248546,0.0003602657,0.00014388477,0.00014455526,0.0008359334,0.06290715,0.06327231,0.22126076,0.0030422604,0.6467435],"study_design_scores_gemma":[0.00005084533,0.00018479602,0.0008699942,0.000045652283,0.000102392245,0.0003317936,0.00012860722,0.90434396,0.026963238,0.056446306,0.010457035,0.00007542511],"about_ca_topic_score_codex":0.0016589684,"about_ca_topic_score_gemma":0.002203197,"teacher_disagreement_score":0.0032224688,"about_ca_system_score_codex":0.00051512325,"about_ca_system_score_gemma":0.0007842066,"threshold_uncertainty_score":0.010780215},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51560736,0.00038473596,0.40952918,0.0015960077,0.00046088142,0.00011986501,0.00042653966,0.0011385363,0.0707369],"genre_scores_gemma":[0.91692203,0.00016465008,0.06511723,0.00039872708,0.00015768375,0.0001174908,0.00037075658,0.00029575377,0.016455652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984817,0.00036145624,0.00009957409,0.0003018931,0.00039889166,0.00035645967],"domain_scores_gemma":[0.99702305,0.001246265,0.0002288666,0.00059610774,0.00057694205,0.00032869403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013581533,0.000533176,0.00091627135,0.0008350119,0.0017169572,0.0029330784,0.0013943586,0.0010732674,0.006430546],"category_scores_gemma":[0.0034262743,0.0007425192,0.001317173,0.0005987872,0.003832549,0.00608792,0.0022949816,0.003390273,0.0012110203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003629115,0.000024181758,0.00014572818,0.00002436491,0.000007806082,0.000083469524,0.00010960369,0.00022638208,0.0024934637,0.99316794,0.00054189627,0.0031389256],"study_design_scores_gemma":[0.000034075223,0.000029434745,0.00016582051,0.000009068039,0.000014365939,0.0001617286,0.00008047844,0.002866484,0.0039619487,0.98987365,0.0027878825,0.0000149733005],"about_ca_topic_score_codex":0.00068469637,"about_ca_topic_score_gemma":0.0012045519,"teacher_disagreement_score":0.006430546,"about_ca_system_score_codex":0.00074451877,"about_ca_system_score_gemma":0.0010707618,"threshold_uncertainty_score":0.02151227},"labels":[],"label_agreement":null},{"id":"W1981329023","doi":"10.1016/j.apal.2003.11.009","title":"Boolean algebras arising from information systems","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interior algebra; Mathematics; Stone's representation theorem for Boolean algebras; Modal operator; Complete Boolean algebra; Boolean algebras canonically defined; Free Boolean algebra; Connection (principal bundle); Set (abstract data type); Algebra over a field; Modal; Discrete mathematics; Two-element Boolean algebra; Pure mathematics; Modal logic; Computer science; Subalgebra; Division algebra; Algebra representation","score_opus":0.03007391690818214,"score_gpt":0.25807795959950447,"score_spread":0.22800404269132232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981329023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11733071,0.019235829,0.60982645,0.019430421,0.0018364589,0.00016814,0.0013525583,0.0005925545,0.23022693],"genre_scores_gemma":[0.89478344,0.009400022,0.0520535,0.0021957303,0.0025950507,0.00021915138,0.0008402397,0.00014950642,0.037763283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980197,0.0006242157,0.00015259311,0.0002242351,0.0007981712,0.00018097773],"domain_scores_gemma":[0.9967698,0.0020481898,0.0002519864,0.00025735787,0.00045134727,0.00022139664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023022722,0.00079148856,0.0014393637,0.0031607058,0.002115017,0.007813755,0.0012086781,0.0021570872,0.008002457],"category_scores_gemma":[0.007435151,0.00078412774,0.0012773619,0.0041817734,0.004282802,0.013518763,0.0027494074,0.004680836,0.001249841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003809532,0.0000031860384,0.00002073981,0.000013890837,0.0000023593498,0.000014924383,0.000044790893,0.0001514277,0.000053981006,0.9981729,0.0003815366,0.0011363963],"study_design_scores_gemma":[0.0000024218518,0.0000011606162,0.000009614926,0.0000034221696,0.0000023538876,0.00001978211,0.000011386321,0.0009824436,0.00004339103,0.9977822,0.0011398402,0.0000021441815],"about_ca_topic_score_codex":0.0010723823,"about_ca_topic_score_gemma":0.0008833324,"teacher_disagreement_score":0.008002457,"about_ca_system_score_codex":0.0027868713,"about_ca_system_score_gemma":0.0013264922,"threshold_uncertainty_score":0.02677089},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056037806,0.0013936826,0.78154814,0.009050178,0.0020074253,0.00017918975,0.0009900976,0.0015917259,0.14720175],"genre_scores_gemma":[0.8065155,0.0012962054,0.14519203,0.0044107838,0.0016110659,0.00055057846,0.0012289139,0.0015310732,0.037663925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692494,0.0004791568,0.00024314462,0.0011098968,0.0006607957,0.0005821358],"domain_scores_gemma":[0.9974483,0.0010308094,0.00008719749,0.0006881992,0.0004945519,0.0002509759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028659087,0.0012978832,0.0021386365,0.002158615,0.0040860884,0.0037510116,0.0027395384,0.0028827076,0.009031215],"category_scores_gemma":[0.004833037,0.0013264625,0.0056828884,0.0018459896,0.008954824,0.018435165,0.011149164,0.010213459,0.0021711828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003592471,0.000021425902,0.00009179323,0.00004659989,0.000023865763,0.0000661419,0.0002761954,0.0003799225,0.00088629837,0.99300545,0.00165578,0.0035106475],"study_design_scores_gemma":[0.000027244121,0.000014695026,0.00011331405,0.000017276474,0.000033097884,0.00010297564,0.00007058356,0.0016655014,0.0008965486,0.9909875,0.006042145,0.000029119723],"about_ca_topic_score_codex":0.002708249,"about_ca_topic_score_gemma":0.0017084164,"teacher_disagreement_score":0.009031215,"about_ca_system_score_codex":0.0019524754,"about_ca_system_score_gemma":0.0015382079,"threshold_uncertainty_score":0.030212402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5771226,0.0022114245,0.24609733,0.002598233,0.0008993617,0.00016602219,0.0011505502,0.0007501599,0.16900435],"genre_scores_gemma":[0.9480491,0.00044688588,0.020950096,0.00032255356,0.00043190664,0.000111029316,0.00054965075,0.00012948828,0.029009193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901617,0.00021860673,0.000083177845,0.00020025502,0.00022668246,0.00025524077],"domain_scores_gemma":[0.9984617,0.00044598166,0.0001735421,0.00011558103,0.0002264614,0.00057664106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011695977,0.0010201003,0.0009773374,0.002674176,0.0033659774,0.004617462,0.0013317923,0.0010912046,0.016405886],"category_scores_gemma":[0.0017711839,0.0006973762,0.0015233823,0.0018664348,0.004182381,0.00813246,0.0036442447,0.0024058667,0.0015935168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006709493,0.000022419248,0.00012554997,0.000026860644,0.000017679156,0.00009360267,0.00021781027,0.00022822926,0.0009273579,0.9960431,0.00046618903,0.0017641187],"study_design_scores_gemma":[0.000028624938,0.000032549066,0.0001570669,0.00000962502,0.000019693041,0.00019788103,0.00013455005,0.001338678,0.001345498,0.9944119,0.0023081251,0.000015805947],"about_ca_topic_score_codex":0.000687962,"about_ca_topic_score_gemma":0.0006339605,"teacher_disagreement_score":0.016405886,"about_ca_system_score_codex":0.0009976513,"about_ca_system_score_gemma":0.0010047676,"threshold_uncertainty_score":0.054883122},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17366076,0.044774767,0.24723029,0.018702572,0.0023520943,0.00009190765,0.001322179,0.00055645243,0.5113091],"genre_scores_gemma":[0.9002643,0.009526243,0.021478217,0.001187704,0.0023546917,0.000105229155,0.0009780583,0.00012897127,0.06397657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999238,0.00025160203,0.000051003863,0.00017593925,0.00018244624,0.000101005375],"domain_scores_gemma":[0.99935204,0.00025751104,0.000083939056,0.00008328107,0.00012898417,0.00009420886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011693637,0.00097194227,0.0012056137,0.0025286411,0.0028505547,0.0053503993,0.0010839909,0.0017904209,0.010903624],"category_scores_gemma":[0.0018930321,0.00068414037,0.0009958361,0.0032219007,0.004163076,0.011256411,0.0018474102,0.003623751,0.0013525602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057072234,0.000004258904,0.000028397311,0.000007993583,0.0000032489145,0.000008912818,0.00007202401,0.00007404247,0.00006130118,0.99804246,0.0005088203,0.0011827594],"study_design_scores_gemma":[0.0000041802004,0.000002541549,0.000037349004,0.0000047388344,0.0000041986227,0.000011684996,0.000030130095,0.00019864939,0.000027676815,0.9963708,0.0033052834,0.0000029478213],"about_ca_topic_score_codex":0.0027036178,"about_ca_topic_score_gemma":0.0020530908,"teacher_disagreement_score":0.010903624,"about_ca_system_score_codex":0.0024597873,"about_ca_system_score_gemma":0.00080185133,"threshold_uncertainty_score":0.036476254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94672173,0.00016149215,0.03753783,0.00032659073,0.00003114302,0.000021272883,0.00023631919,0.00017729746,0.01478632],"genre_scores_gemma":[0.99423087,0.00004553309,0.0046345126,0.00002784234,0.00005297079,0.000026155683,0.00014376054,0.000026298201,0.00081194035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977215,0.00039733248,0.0001905001,0.0004781637,0.0008250711,0.00038738686],"domain_scores_gemma":[0.9893919,0.005646865,0.00138524,0.0007047876,0.0011307093,0.0017403598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024505847,0.00028788642,0.0005536278,0.00275601,0.0015542894,0.0047696847,0.0006544215,0.00048027962,0.004443306],"category_scores_gemma":[0.009848531,0.00059345446,0.00051223376,0.0010896486,0.003960697,0.0046076756,0.0016943329,0.0008954539,0.00028811628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002818418,0.00008070392,0.013669593,0.00004948419,0.000024150871,0.00027547972,0.0012771955,0.0021188685,0.01403689,0.958584,0.00080192654,0.008799842],"study_design_scores_gemma":[0.00010924397,0.000124906,0.01735733,0.00006935002,0.000039804923,0.00091558916,0.00120861,0.03472292,0.012881468,0.92659456,0.005909589,0.00006665778],"about_ca_topic_score_codex":0.0013333738,"about_ca_topic_score_gemma":0.00094863895,"teacher_disagreement_score":0.0047696847,"about_ca_system_score_codex":0.0018166034,"about_ca_system_score_gemma":0.0006263195,"threshold_uncertainty_score":0.014864385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38591886,0.0013316897,0.3294835,0.015888367,0.0021080612,0.0002233437,0.0011581401,0.0027391445,0.26114893],"genre_scores_gemma":[0.962519,0.00036501142,0.019695744,0.00090749026,0.00053714076,0.0001316674,0.0004071484,0.00018387494,0.01525304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512154,0.0008753332,0.000635771,0.001368243,0.0011459055,0.0008531851],"domain_scores_gemma":[0.98296,0.0069885296,0.0017526789,0.0038105766,0.002790194,0.0016980873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055476776,0.00093649776,0.0012004593,0.0024076116,0.0039086253,0.004892899,0.0015100439,0.0019680986,0.009621794],"category_scores_gemma":[0.014607884,0.0008031624,0.0016874454,0.0016063076,0.012242064,0.015288361,0.005513401,0.0049479906,0.0018936401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006470396,0.000041091294,0.00094403094,0.00006748119,0.000024519328,0.0002641018,0.0009480498,0.00015963927,0.002652689,0.9886664,0.0011752604,0.004992042],"study_design_scores_gemma":[0.000017996037,0.00005917439,0.0005244393,0.000016604328,0.000025767911,0.0003909147,0.00046631947,0.0006972803,0.0024487758,0.98787373,0.0074526025,0.000026490357],"about_ca_topic_score_codex":0.00047383353,"about_ca_topic_score_gemma":0.00046664986,"teacher_disagreement_score":0.009621794,"about_ca_system_score_codex":0.0008972654,"about_ca_system_score_gemma":0.001267906,"threshold_uncertainty_score":0.032188118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47870117,0.0012116163,0.3770849,0.002624667,0.00080230326,0.00013556478,0.00083656755,0.0013254845,0.13727783],"genre_scores_gemma":[0.9265026,0.0005663582,0.026485456,0.0004360161,0.00039116116,0.000059216134,0.0006256609,0.00024481403,0.04468871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876046,0.00018655704,0.000109201574,0.00022566773,0.00040476167,0.00031329246],"domain_scores_gemma":[0.998517,0.00030292643,0.00013563737,0.00035878806,0.0003519545,0.00033370024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015164352,0.00064537575,0.0008878823,0.0014076072,0.0022763805,0.003667465,0.00065237336,0.00092191,0.007758098],"category_scores_gemma":[0.0018938729,0.0008127147,0.0010329777,0.0013447515,0.002401243,0.010107987,0.0029998957,0.0026775405,0.0020613375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056968318,0.000022548913,0.00029832873,0.000013427872,0.000008823277,0.000085962514,0.00022872281,0.000117647294,0.002311892,0.9927819,0.0008592035,0.003214566],"study_design_scores_gemma":[0.00001999075,0.00002034704,0.00045265243,0.000008822094,0.000022562495,0.0002498669,0.00013305445,0.0011944836,0.0033130613,0.984845,0.009722076,0.000018156881],"about_ca_topic_score_codex":0.00047402465,"about_ca_topic_score_gemma":0.0005613158,"teacher_disagreement_score":0.007758098,"about_ca_system_score_codex":0.001059953,"about_ca_system_score_gemma":0.0008949234,"threshold_uncertainty_score":0.025953472},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5289125,0.0015186899,0.20606172,0.015343476,0.0009377128,0.00009418708,0.0004260756,0.00091244956,0.24579322],"genre_scores_gemma":[0.98075736,0.00025848308,0.0047141626,0.00067382766,0.00035295423,0.000027096765,0.00010952996,0.00007994987,0.013026539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998696,0.00035934933,0.00008363178,0.00026340852,0.00027526217,0.0003223599],"domain_scores_gemma":[0.99648064,0.0019272096,0.00025308214,0.00047072896,0.0005598901,0.00030839173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020066681,0.00032399013,0.0009853063,0.0011639716,0.0025407872,0.0030963183,0.00077546376,0.0015306977,0.01585408],"category_scores_gemma":[0.0092028985,0.00033538594,0.00090558204,0.0014263842,0.006494195,0.008430506,0.002665637,0.0029338442,0.0011604849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022467579,0.000009296292,0.00017321305,0.000017778031,0.000004429136,0.000068701964,0.0002499602,0.0002174869,0.00016990348,0.9955778,0.000897113,0.0025919087],"study_design_scores_gemma":[0.0000053388685,0.000008844548,0.00005449433,0.000006301484,0.0000023871887,0.000052196745,0.00008377184,0.0013935389,0.00019271685,0.99696857,0.0012264664,0.00000538865],"about_ca_topic_score_codex":0.0012909515,"about_ca_topic_score_gemma":0.0004342462,"teacher_disagreement_score":0.01585408,"about_ca_system_score_codex":0.0010848333,"about_ca_system_score_gemma":0.0008245764,"threshold_uncertainty_score":0.053037226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20354994,0.006685051,0.573725,0.007507952,0.0011701883,0.00015026239,0.0008722913,0.00054657203,0.20579271],"genre_scores_gemma":[0.90475374,0.0024350602,0.072122104,0.0013801076,0.0010844237,0.00022234756,0.0006111305,0.0001950899,0.017196063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977871,0.00071499735,0.00014056163,0.00051594817,0.00040898452,0.00043238385],"domain_scores_gemma":[0.9948453,0.00328804,0.00046681447,0.00046956487,0.00047044206,0.00045992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042578164,0.0010792619,0.0018030582,0.0051344596,0.0034310648,0.0063829804,0.0018912283,0.0026703468,0.006339919],"category_scores_gemma":[0.0073197116,0.0013084318,0.002979497,0.004365896,0.008390442,0.018754384,0.0059139277,0.008943553,0.0009887828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015125886,0.00001089775,0.000090422975,0.00002416082,0.0000041205194,0.0000263649,0.00016838017,0.00019030488,0.00013169368,0.99691784,0.0005700948,0.0018504746],"study_design_scores_gemma":[0.0000054626507,0.000005789066,0.000056022694,0.000010073719,0.000004959789,0.000042959375,0.0000549001,0.0006425812,0.00011594253,0.9979025,0.0011538633,0.000004976011],"about_ca_topic_score_codex":0.0010271354,"about_ca_topic_score_gemma":0.0006868928,"teacher_disagreement_score":0.0063829804,"about_ca_system_score_codex":0.0024477816,"about_ca_system_score_gemma":0.00077830587,"threshold_uncertainty_score":0.02251774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50129247,0.0011111024,0.36433333,0.0023351712,0.00054885686,0.00018956738,0.0007997451,0.0014066878,0.12798297],"genre_scores_gemma":[0.9403411,0.00043413634,0.03950325,0.00026072623,0.00040104665,0.00010126731,0.00047896436,0.00021245626,0.018267054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971787,0.00063230656,0.00021355851,0.0006508118,0.00083672116,0.00048786294],"domain_scores_gemma":[0.99519676,0.001600625,0.0004741469,0.0009722982,0.00071484887,0.0010412363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029290246,0.0006061329,0.0010970801,0.0013833288,0.0023474323,0.005163279,0.0014223129,0.00078264857,0.004515231],"category_scores_gemma":[0.0065667373,0.00078898657,0.0013009667,0.0013098813,0.0042966353,0.009406096,0.004004551,0.0034824742,0.0007692882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001181843,0.00003968014,0.00015997657,0.000024153494,0.000008717726,0.00008929514,0.0003918567,0.0004536687,0.0013443042,0.99263364,0.00054372667,0.0041928417],"study_design_scores_gemma":[0.000048772312,0.000025288919,0.000109357534,0.000009804058,0.000010529008,0.00011022931,0.00013710438,0.0020705669,0.001412235,0.99157363,0.0044805272,0.0000118653],"about_ca_topic_score_codex":0.0007530603,"about_ca_topic_score_gemma":0.0008292265,"teacher_disagreement_score":0.005163279,"about_ca_system_score_codex":0.0013207487,"about_ca_system_score_gemma":0.0010665399,"threshold_uncertainty_score":0.015490413},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2383166,0.009777831,0.21025296,0.17987272,0.0038281681,0.00016253933,0.0036216245,0.0021232287,0.35204425],"genre_scores_gemma":[0.9581434,0.0015574173,0.01624898,0.008353353,0.00085848506,0.00008342724,0.00068372994,0.0003578505,0.013713347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554116,0.0011187651,0.00043742315,0.0012313013,0.0008827691,0.00078858883],"domain_scores_gemma":[0.9857837,0.0063252505,0.001171685,0.0028989445,0.0027107212,0.0011097195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061091757,0.0005568593,0.0015045546,0.0014634862,0.003894782,0.0046733306,0.0014235862,0.0025777651,0.017266726],"category_scores_gemma":[0.024134105,0.0009881369,0.0014254928,0.0015833224,0.013803705,0.035893653,0.005143321,0.0064223157,0.0024114912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011363531,0.000035655634,0.0013648253,0.00012597405,0.00004611058,0.00008654893,0.0006049728,0.000113390124,0.0005659367,0.97964925,0.0076595405,0.0096342405],"study_design_scores_gemma":[0.000020691821,0.000022230524,0.0005312243,0.000039747152,0.000029097364,0.0002239641,0.0007173341,0.00032338424,0.0005264108,0.9877772,0.009771652,0.000017093505],"about_ca_topic_score_codex":0.0016551921,"about_ca_topic_score_gemma":0.0022603495,"teacher_disagreement_score":0.017266726,"about_ca_system_score_codex":0.0016832766,"about_ca_system_score_gemma":0.00171779,"threshold_uncertainty_score":0.05776292},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86641693,0.00046178428,0.10754895,0.000358483,0.000076539,0.00007254429,0.00024381571,0.00022984605,0.024591068],"genre_scores_gemma":[0.97734445,0.0001183864,0.017890463,0.00003835922,0.000060672304,0.000057356014,0.00016701719,0.000031011437,0.0042923233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.00008923088,0.000035719677,0.00011642164,0.00013692935,0.00006759238],"domain_scores_gemma":[0.9987865,0.00046193495,0.0001973326,0.00013831984,0.00014624641,0.00026973404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055881223,0.00026735457,0.00035769708,0.0011347142,0.00080441235,0.002367512,0.0003854671,0.0003230716,0.0033453957],"category_scores_gemma":[0.0014805116,0.00026191448,0.0005336208,0.0005426813,0.0019173694,0.002397618,0.0014311377,0.0007067894,0.0003710045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007569296,0.00002508249,0.0011665554,0.000032128883,0.000008278762,0.00032022322,0.0007244078,0.0012350192,0.0070558744,0.9835556,0.0003841444,0.005416961],"study_design_scores_gemma":[0.0000630115,0.00007625228,0.001905395,0.000020246856,0.000017856884,0.0008153778,0.0006216395,0.013491773,0.007537064,0.96638805,0.009028505,0.00003474689],"about_ca_topic_score_codex":0.0003289322,"about_ca_topic_score_gemma":0.0003486834,"teacher_disagreement_score":0.0033453957,"about_ca_system_score_codex":0.0006338394,"about_ca_system_score_gemma":0.0003083654,"threshold_uncertainty_score":0.011191487},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26063153,0.0028733683,0.335225,0.0037795173,0.00080522033,0.00014470742,0.001518607,0.00062465126,0.39439744],"genre_scores_gemma":[0.88993675,0.0017244444,0.05593922,0.0008577725,0.0010376177,0.00020060787,0.0011876479,0.00023902401,0.04887692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993554,0.00013206668,0.00003977337,0.0001806829,0.00017036364,0.00012175572],"domain_scores_gemma":[0.99925834,0.0003351454,0.000055256423,0.000099055935,0.00013652562,0.00011564148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009299638,0.0005471217,0.0006451581,0.0012862319,0.0016470914,0.0024109671,0.0007793675,0.00059850933,0.009763082],"category_scores_gemma":[0.0017258805,0.00038017816,0.0013533424,0.0012639649,0.0021512788,0.005486992,0.0031138107,0.0029451083,0.0012131522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048797458,0.000015778693,0.00013844755,0.000051218904,0.00000798125,0.000062413135,0.00013335937,0.00046644907,0.0005366874,0.98957705,0.0012556545,0.0077061383],"study_design_scores_gemma":[0.000024798668,0.000019789388,0.00020075309,0.000015780364,0.000012391089,0.00018616607,0.00006966489,0.0019818994,0.00056888413,0.98662776,0.010282048,0.000010169912],"about_ca_topic_score_codex":0.0007321523,"about_ca_topic_score_gemma":0.00053197594,"teacher_disagreement_score":0.009763082,"about_ca_system_score_codex":0.001208978,"about_ca_system_score_gemma":0.0006245709,"threshold_uncertainty_score":0.032660782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092692785,0.0036014135,0.48483077,0.002169987,0.0016888855,0.00011302555,0.0018057514,0.0017713021,0.4113261],"genre_scores_gemma":[0.65217185,0.0026303357,0.18223692,0.0019172954,0.0009998556,0.00032893562,0.0033429333,0.00092376984,0.15544815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986039,0.0002898036,0.00009022733,0.0003125436,0.0004344526,0.00026899503],"domain_scores_gemma":[0.9991109,0.00035097328,0.000054815602,0.00018479618,0.00020429806,0.00009429307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010916309,0.0010984458,0.0009378234,0.0019391091,0.0022012417,0.00370742,0.0011023086,0.0009808419,0.022502251],"category_scores_gemma":[0.0023700409,0.0006065701,0.0015742884,0.0018867644,0.0023465492,0.004420558,0.0041046785,0.003442935,0.0067470125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004520546,0.000019893028,0.00008824932,0.00006656956,0.000009955203,0.00006811696,0.00026089497,0.0013712832,0.0006510651,0.973215,0.0039626737,0.020241229],"study_design_scores_gemma":[0.00001167527,0.000023615235,0.00010257099,0.00004231643,0.000008925943,0.000072289426,0.00010724355,0.0029045048,0.0008460006,0.9764889,0.019375617,0.000016356455],"about_ca_topic_score_codex":0.0018285504,"about_ca_topic_score_gemma":0.0028296812,"teacher_disagreement_score":0.022502251,"about_ca_system_score_codex":0.0017003306,"about_ca_system_score_gemma":0.00067378965,"threshold_uncertainty_score":0.07527751},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1043296,0.01859075,0.28040892,0.031844623,0.0045405277,0.00008534527,0.0012055946,0.00096227985,0.5580324],"genre_scores_gemma":[0.8816259,0.008044407,0.025842592,0.0024006944,0.006019047,0.0001544076,0.00062354456,0.00025809844,0.07503133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990363,0.00028493645,0.00006471063,0.00021152015,0.00031112658,0.00009148613],"domain_scores_gemma":[0.9985852,0.00064539537,0.00011870099,0.00015290792,0.0003257807,0.00017201099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012175002,0.00067732914,0.0012177577,0.0035439848,0.0030875702,0.005523952,0.0007378855,0.001713881,0.015622136],"category_scores_gemma":[0.0026428679,0.0005085485,0.00062084646,0.0030665814,0.006206202,0.014823667,0.0034476798,0.003711856,0.002357514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004247899,0.0000019425686,0.000018343078,0.000009664399,0.0000012992962,0.000014363689,0.00006144475,0.000026761989,0.00007577348,0.99761045,0.00074902695,0.0014267414],"study_design_scores_gemma":[0.0000037010157,0.0000037141265,0.000023617871,0.0000039855654,0.0000020466605,0.000053709005,0.000048441456,0.00022300822,0.000068361114,0.9928497,0.006716601,0.0000030541082],"about_ca_topic_score_codex":0.00066706043,"about_ca_topic_score_gemma":0.0004067363,"teacher_disagreement_score":0.015622136,"about_ca_system_score_codex":0.0014620103,"about_ca_system_score_gemma":0.00082387275,"threshold_uncertainty_score":0.052261233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51064384,0.00074282923,0.44995734,0.007592934,0.00026120036,0.00072799454,0.0025861242,0.0019374589,0.025550311],"genre_scores_gemma":[0.8685217,0.00040484773,0.12434493,0.0006051017,0.00023887907,0.00029463076,0.0025871922,0.00027902715,0.0027237006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99023575,0.001946523,0.0007834484,0.001611193,0.003720349,0.0017027867],"domain_scores_gemma":[0.947975,0.04042802,0.0026748653,0.004475039,0.003277279,0.001169677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057908115,0.00068913586,0.0015441218,0.0017294046,0.0028932847,0.0065693515,0.0034575448,0.002127541,0.009909406],"category_scores_gemma":[0.04204828,0.00093141716,0.0028361725,0.0016201332,0.003976247,0.011424294,0.004930622,0.0048309276,0.00086066365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015520278,0.00036535648,0.013833705,0.00084466866,0.00022317197,0.0009259422,0.0010168051,0.076577485,0.008795327,0.8054069,0.0097460365,0.08071261],"study_design_scores_gemma":[0.00013442514,0.000090350906,0.002297124,0.000088095636,0.000093531155,0.0004637307,0.00067503407,0.2213671,0.011968981,0.7593509,0.0033812663,0.000089463654],"about_ca_topic_score_codex":0.0028795744,"about_ca_topic_score_gemma":0.003203462,"teacher_disagreement_score":0.009909406,"about_ca_system_score_codex":0.00326005,"about_ca_system_score_gemma":0.0036659422,"threshold_uncertainty_score":0.033150315},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04728983,0.0031843877,0.055177495,0.063989565,0.001904501,0.000027071852,0.00032452328,0.00039159504,0.8277109],"genre_scores_gemma":[0.8784484,0.0012254674,0.0067172325,0.008619485,0.0017515598,0.00004753715,0.00019564311,0.00024442447,0.102750294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979249,0.00085581053,0.000057647925,0.00035618042,0.00048150317,0.00032385407],"domain_scores_gemma":[0.9961565,0.001205052,0.00020785394,0.0010824963,0.000960286,0.00038775644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034764048,0.000282189,0.00079274114,0.0013403025,0.0061310884,0.006802018,0.00097617874,0.0027357643,0.016572999],"category_scores_gemma":[0.010037948,0.00033361829,0.0005544088,0.0012987698,0.010433373,0.010532912,0.003330774,0.0072099417,0.0037612251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006509992,0.00000297572,0.000097821525,0.0000028701509,0.0000012770224,0.000005119555,0.00020813734,0.000025249083,0.000016845986,0.9943633,0.0031730693,0.0020969508],"study_design_scores_gemma":[0.0000063455623,0.0000039455535,0.00018037485,0.000011319073,0.0000023653522,0.000025353387,0.00017104213,0.00018963158,0.00007504306,0.9674856,0.03184461,0.000004290184],"about_ca_topic_score_codex":0.004143537,"about_ca_topic_score_gemma":0.0032842173,"teacher_disagreement_score":0.016572999,"about_ca_system_score_codex":0.003222558,"about_ca_system_score_gemma":0.001953481,"threshold_uncertainty_score":0.055442274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16280797,0.004971337,0.47152257,0.03170662,0.00529654,0.00008927893,0.0008195829,0.0008831706,0.321903],"genre_scores_gemma":[0.93158627,0.0012865056,0.033493336,0.002300341,0.0017640622,0.000085960404,0.00030163015,0.000244196,0.02893766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987766,0.0003185586,0.000074520656,0.00031439358,0.00028820787,0.00022769417],"domain_scores_gemma":[0.9966941,0.0015888172,0.00016743327,0.00046868165,0.00070577406,0.0003752891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021240048,0.00055282365,0.0009698743,0.0018754534,0.0029242965,0.0032113483,0.001250671,0.0023168437,0.013030703],"category_scores_gemma":[0.008567147,0.0004803684,0.0009067523,0.0014036816,0.0064932755,0.010468207,0.0039726323,0.004514481,0.0014998885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000942301,0.0000033713843,0.000051226227,0.000010357732,0.0000016316591,0.000022614953,0.00003190604,0.000048261296,0.00020446553,0.9974734,0.0008784292,0.0012649935],"study_design_scores_gemma":[0.000006929831,0.000005897464,0.000078486904,0.000007364557,0.0000025885186,0.00008857833,0.000040091127,0.00084777863,0.0003452581,0.99477506,0.0037950333,0.0000068993063],"about_ca_topic_score_codex":0.0009988253,"about_ca_topic_score_gemma":0.00077005464,"teacher_disagreement_score":0.013030703,"about_ca_system_score_codex":0.0017250872,"about_ca_system_score_gemma":0.0010989504,"threshold_uncertainty_score":0.043592036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562417,0.0026022296,0.111907996,0.0027548093,0.00025390813,0.000054233824,0.00044403653,0.0006108563,0.12513037],"genre_scores_gemma":[0.98781455,0.00029567824,0.002797293,0.00008592205,0.00012296537,0.000023551713,0.00010447438,0.00004999406,0.008705679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990508,0.00020427722,0.000043514705,0.00021852154,0.0002639553,0.00021906552],"domain_scores_gemma":[0.9977145,0.0012662639,0.0001834731,0.00019059853,0.00020439502,0.00044067675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866828,0.00046772935,0.0011265755,0.0024178766,0.0031914408,0.0050769267,0.0010263651,0.00090718304,0.0068600574],"category_scores_gemma":[0.0038463385,0.0007050867,0.0007234032,0.0019760365,0.006216559,0.009090478,0.0029630105,0.0027930404,0.00043418576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015900006,0.0000086271,0.00024256167,0.0000143763,0.0000034163188,0.000025035986,0.00031134606,0.00016362876,0.00020373912,0.996711,0.0003838445,0.0019163657],"study_design_scores_gemma":[0.0000130350945,0.000006144221,0.00035922127,0.000011863032,0.00001091655,0.00005918515,0.00016323008,0.0011946895,0.00029758958,0.995628,0.0022480846,0.000008030375],"about_ca_topic_score_codex":0.0017855724,"about_ca_topic_score_gemma":0.001689968,"teacher_disagreement_score":0.0068600574,"about_ca_system_score_codex":0.0026415875,"about_ca_system_score_gemma":0.0006429055,"threshold_uncertainty_score":0.02294916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43185228,0.0005626281,0.3843709,0.0015899347,0.001567362,0.00029592655,0.0009427295,0.0011928628,0.17762533],"genre_scores_gemma":[0.83747923,0.0004860186,0.07103791,0.00045251867,0.0005057123,0.0002775989,0.0010041276,0.0002852926,0.08847164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990176,0.00019246926,0.00006177667,0.0002644038,0.00025176205,0.00021194124],"domain_scores_gemma":[0.9990951,0.00030767982,0.00012072009,0.00019492091,0.00012481626,0.00015672749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050160347,0.00069123314,0.0006785457,0.0016729111,0.0020764107,0.0030438993,0.0007460752,0.0010358735,0.010140171],"category_scores_gemma":[0.0011499209,0.0003977885,0.000991444,0.0014447304,0.002522715,0.0027554557,0.0012653285,0.0012474688,0.002987515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012334395,0.0000406668,0.00021241148,0.000037073052,0.000016165155,0.00034317424,0.00031482478,0.0005101501,0.005586089,0.9799341,0.0013953847,0.011486625],"study_design_scores_gemma":[0.00006378763,0.00010135568,0.0002954313,0.000017389113,0.000024058776,0.00062272453,0.00020601135,0.0027431622,0.007406761,0.96665233,0.021827288,0.00003963396],"about_ca_topic_score_codex":0.00055012794,"about_ca_topic_score_gemma":0.00034823938,"teacher_disagreement_score":0.010140171,"about_ca_system_score_codex":0.0006687205,"about_ca_system_score_gemma":0.0010551955,"threshold_uncertainty_score":0.033922255},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16686583,0.12205196,0.12908685,0.030400498,0.0026079325,0.000068561574,0.0008342455,0.0006088835,0.5474752],"genre_scores_gemma":[0.9114178,0.015975054,0.015348737,0.001638337,0.0033203564,0.00006480428,0.00036705512,0.000080561214,0.05178738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.00021200204,0.000036844292,0.00014700477,0.00015353166,0.000073090625],"domain_scores_gemma":[0.99923,0.00040115986,0.000084234474,0.00009789726,0.00010754003,0.000079162965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014041261,0.0005235835,0.00082208,0.0018099197,0.002724525,0.0045418646,0.00068785576,0.0012973049,0.007503394],"category_scores_gemma":[0.0022571094,0.00055675366,0.0005501686,0.0022660538,0.0071997773,0.009464835,0.0018191506,0.0031992958,0.0009744127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006353119,0.000004044713,0.000037558024,0.000013872954,0.0000024920537,0.000013051128,0.00015069645,0.000081412334,0.000067054425,0.99751544,0.0007213229,0.0013867386],"study_design_scores_gemma":[0.0000037399623,0.0000023467114,0.000060741284,0.000005796231,0.0000030590923,0.000021960464,0.00003765302,0.0001609351,0.00004820816,0.9926611,0.0069912793,0.000003041522],"about_ca_topic_score_codex":0.0012907881,"about_ca_topic_score_gemma":0.0011059954,"teacher_disagreement_score":0.007503394,"about_ca_system_score_codex":0.0016097333,"about_ca_system_score_gemma":0.0006615716,"threshold_uncertainty_score":0.025101364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1340707,0.0008568872,0.81979674,0.0013802244,0.00021238287,0.00010405843,0.0001373557,0.0005183562,0.042923365],"genre_scores_gemma":[0.7551857,0.0008064952,0.23293293,0.00087896164,0.00025694215,0.00009104882,0.0002069535,0.00007647829,0.009564579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917835,0.00024141691,0.000057642384,0.00017245655,0.00026648157,0.00008369252],"domain_scores_gemma":[0.9991918,0.0002457375,0.00011015863,0.00013227182,0.00022120644,0.00009876995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016044184,0.00030962419,0.00027774004,0.0007975728,0.0007807271,0.0014187909,0.0008869476,0.00058897975,0.0013935732],"category_scores_gemma":[0.0016795116,0.00016097318,0.0010796177,0.0006299579,0.0021294754,0.0037977376,0.0019486109,0.0011288191,0.00029866007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010827463,0.000073898445,0.0006926563,0.00016082333,0.000029864279,0.00072673225,0.00042667883,0.004414347,0.013332564,0.9444027,0.0007539079,0.03487762],"study_design_scores_gemma":[0.000053624866,0.00026361726,0.00073144,0.00005892416,0.00009184082,0.000933093,0.0002890954,0.05837377,0.016542168,0.8898888,0.03272684,0.000046722198],"about_ca_topic_score_codex":0.0012528128,"about_ca_topic_score_gemma":0.0012912829,"teacher_disagreement_score":0.0016044184,"about_ca_system_score_codex":0.0008224996,"about_ca_system_score_gemma":0.0009872044,"threshold_uncertainty_score":0.008485079},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053031784,0.009539823,0.5127667,0.024786584,0.001273569,0.00007737606,0.0005595533,0.0003209358,0.3976436],"genre_scores_gemma":[0.8173392,0.0052050212,0.104370564,0.0045119007,0.0021693648,0.00033195046,0.00054008357,0.00034928363,0.06518252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973066,0.0010005812,0.00016421365,0.00061153044,0.0006741137,0.0002430061],"domain_scores_gemma":[0.995631,0.0027640313,0.00017898757,0.00076423725,0.0004682188,0.00019360923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035955084,0.00060894416,0.0012094335,0.0015398161,0.0021717637,0.0030489045,0.0012021804,0.0025310246,0.008031862],"category_scores_gemma":[0.0068317377,0.0008071016,0.001769849,0.0015099123,0.013910331,0.011932836,0.004167837,0.0062887575,0.0011916041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004935565,0.0000015069428,0.000018869607,0.0000068103777,0.0000017912428,0.000009049136,0.00004424387,0.000072568284,0.00005911119,0.99823195,0.00041620768,0.0011329969],"study_design_scores_gemma":[0.00000466186,0.0000022841057,0.00002491437,0.0000039839806,0.0000013190024,0.000017316834,0.000011356472,0.0001825461,0.000040611885,0.996231,0.00347764,0.0000022726115],"about_ca_topic_score_codex":0.0010451095,"about_ca_topic_score_gemma":0.00078738417,"teacher_disagreement_score":0.008031862,"about_ca_system_score_codex":0.0014348496,"about_ca_system_score_gemma":0.0010154684,"threshold_uncertainty_score":0.026869297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2299704,0.034369174,0.39232776,0.039050583,0.0025527766,0.00012351738,0.0007267074,0.0005597306,0.30031934],"genre_scores_gemma":[0.9516027,0.0061371387,0.020537378,0.0029203244,0.0025041231,0.00010882265,0.00032355642,0.00017757501,0.01568848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970078,0.0010352365,0.0002175365,0.00082376617,0.00049321743,0.00042246707],"domain_scores_gemma":[0.9907224,0.006361348,0.0004833527,0.0011353276,0.00080728286,0.0004903345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006512366,0.0011307881,0.0020508333,0.00447993,0.0038531192,0.004126805,0.0020645692,0.0025511915,0.008668369],"category_scores_gemma":[0.010221069,0.0012748429,0.0024240434,0.005949225,0.01934192,0.038497437,0.0074793175,0.0077641727,0.0008903472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096821395,0.000005847294,0.00007176847,0.000021195043,0.0000056963754,0.00001549202,0.00015796963,0.00009090286,0.000080195794,0.9977865,0.00032734193,0.0014274681],"study_design_scores_gemma":[0.0000037248315,0.000003894442,0.000064353815,0.000007769103,0.000005659554,0.000015694917,0.00003189256,0.00013837666,0.000043466018,0.9984023,0.0012787032,0.000004122065],"about_ca_topic_score_codex":0.0018296246,"about_ca_topic_score_gemma":0.0010103846,"teacher_disagreement_score":0.008668369,"about_ca_system_score_codex":0.003315368,"about_ca_system_score_gemma":0.0009085992,"threshold_uncertainty_score":0.034441054},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16074964,0.002261139,0.62246275,0.010441391,0.0012795684,0.0005471688,0.0049849465,0.001956959,0.19531642],"genre_scores_gemma":[0.8316564,0.0012385988,0.1432379,0.002199282,0.0011724189,0.000558136,0.0044272207,0.0020906131,0.013419327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98221624,0.00872914,0.0027349873,0.0023128993,0.0026627034,0.0013440182],"domain_scores_gemma":[0.94648737,0.032840766,0.0021963452,0.0072841356,0.0099539785,0.0012374003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011329062,0.0011400616,0.0016436419,0.0031836743,0.004705533,0.012300618,0.003425171,0.0035517479,0.016341323],"category_scores_gemma":[0.044103347,0.0030824845,0.0017655686,0.0032157518,0.0062600435,0.027064744,0.0067729647,0.0076904707,0.0037105654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001693073,0.00007083942,0.0008466984,0.00019103165,0.000044326203,0.00023428378,0.0014581145,0.0007036501,0.004395461,0.9702088,0.0042551025,0.01742245],"study_design_scores_gemma":[0.000057431644,0.000032876087,0.0008353662,0.0001396274,0.00006553023,0.00017492767,0.0010733104,0.0035603426,0.0031614653,0.9719087,0.018938402,0.000051997267],"about_ca_topic_score_codex":0.0039728167,"about_ca_topic_score_gemma":0.0056197355,"teacher_disagreement_score":0.016341323,"about_ca_system_score_codex":0.0025879005,"about_ca_system_score_gemma":0.0035451844,"threshold_uncertainty_score":0.05991459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02748324,0.00066528964,0.9243234,0.0015482454,0.00039925068,0.00013954402,0.00036746653,0.0018815306,0.04319207],"genre_scores_gemma":[0.47549927,0.0009523206,0.49448997,0.0015825765,0.00049400795,0.00030342408,0.0006009408,0.0002794154,0.025798138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00031567988,0.00007416539,0.00027747976,0.00037984122,0.00014261901],"domain_scores_gemma":[0.99937636,0.00020926307,0.000049526618,0.00014704806,0.00015318807,0.00006454913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017760382,0.0005645332,0.00047199678,0.0012799742,0.0010707715,0.0016393055,0.001670495,0.0008270465,0.0044534295],"category_scores_gemma":[0.0017863314,0.00042826618,0.00093052705,0.0009795014,0.0029134236,0.0053510675,0.003224885,0.0028270225,0.000911181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037309917,0.000018883671,0.000107423504,0.00007907162,0.000009573777,0.0000756869,0.00016233049,0.0013175298,0.0045159836,0.97745526,0.0011674777,0.015053531],"study_design_scores_gemma":[0.000034139946,0.00006153811,0.00024045949,0.000035897734,0.000034671386,0.00017855207,0.000056941568,0.021000491,0.007131751,0.91396797,0.057227083,0.00003056761],"about_ca_topic_score_codex":0.0015627912,"about_ca_topic_score_gemma":0.0020065114,"teacher_disagreement_score":0.0044534295,"about_ca_system_score_codex":0.0012449513,"about_ca_system_score_gemma":0.0010597894,"threshold_uncertainty_score":0.014898181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075312786,0.0067440625,0.71197957,0.014939964,0.000366195,0.00015550423,0.00107734,0.0004307254,0.1889939],"genre_scores_gemma":[0.8916296,0.0027625565,0.08695362,0.0022026743,0.0010402738,0.00029402328,0.0007198372,0.00011423196,0.01428321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938784,0.002260788,0.00037657315,0.001456782,0.0014631366,0.0005644478],"domain_scores_gemma":[0.98949486,0.0061829,0.00078833394,0.0017872473,0.0012187673,0.0005278893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074643907,0.0008793117,0.0014683441,0.0020805004,0.003085321,0.0050770855,0.002247643,0.0025707544,0.006519036],"category_scores_gemma":[0.009002105,0.0006416071,0.0018178906,0.0015052223,0.0089321695,0.010646673,0.0058761165,0.0061852178,0.0006079044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060083826,0.0000056687036,0.00008392559,0.000036468286,0.000011782412,0.00012862215,0.00010896228,0.00158046,0.000094583695,0.9963799,0.00065044936,0.0009131182],"study_design_scores_gemma":[0.000007739183,0.000005109886,0.000055455203,0.000012800355,0.0000061479477,0.00006637587,0.000039664486,0.0030584848,0.00006745542,0.99331,0.0033649143,0.0000058263695],"about_ca_topic_score_codex":0.0024139683,"about_ca_topic_score_gemma":0.0023041922,"teacher_disagreement_score":0.0074643907,"about_ca_system_score_codex":0.0042069773,"about_ca_system_score_gemma":0.0021285566,"threshold_uncertainty_score":0.039475977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8422834,0.0009378349,0.09728227,0.001297241,0.00010114611,0.000051967138,0.00038128012,0.00019035493,0.05747459],"genre_scores_gemma":[0.9949136,0.00009600326,0.0027692008,0.00006564898,0.000050324255,0.000023837421,0.0000935894,0.000014107105,0.0019736595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980263,0.000369135,0.00013374629,0.00044832245,0.00065824384,0.00036414654],"domain_scores_gemma":[0.997065,0.0012309764,0.00030867205,0.00029482527,0.0006769244,0.00042362543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017103683,0.0003039084,0.00068229344,0.0026128788,0.0016961357,0.0037313725,0.00080298295,0.00062361057,0.004128171],"category_scores_gemma":[0.00332838,0.00036484422,0.000733784,0.001197518,0.004735852,0.0061265924,0.0028161472,0.0017282474,0.0002620419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021535083,0.000014918552,0.00042532673,0.000013894312,0.0000068379145,0.000043539418,0.00031137577,0.00043935064,0.00085779425,0.99646866,0.0001820661,0.0012146014],"study_design_scores_gemma":[0.000020822457,0.000018959136,0.00084730773,0.000016174336,0.0000080393565,0.00011027262,0.00021122396,0.0065323836,0.0008791511,0.9896283,0.0017078145,0.000019445773],"about_ca_topic_score_codex":0.0012143239,"about_ca_topic_score_gemma":0.0005218407,"teacher_disagreement_score":0.004128171,"about_ca_system_score_codex":0.0017541844,"about_ca_system_score_gemma":0.00059297326,"threshold_uncertainty_score":0.013810039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32671618,0.0026656922,0.55976945,0.0051984624,0.0002646417,0.00013338531,0.001430804,0.0006416572,0.10317963],"genre_scores_gemma":[0.92745376,0.0010643225,0.04817021,0.0005240175,0.000370678,0.00019586016,0.0012126358,0.0002499825,0.020758355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759066,0.0005638166,0.00015517672,0.0007927174,0.00057583756,0.00032185143],"domain_scores_gemma":[0.99568474,0.002047597,0.00040437307,0.0008667557,0.00045297982,0.00054363284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022651248,0.0006744537,0.001220189,0.0023139855,0.003179006,0.0066641443,0.0026842514,0.0016806688,0.009188435],"category_scores_gemma":[0.008634846,0.0006677732,0.001074295,0.0036870209,0.00767804,0.015755193,0.003838979,0.0032938547,0.00064132654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016394182,0.0000064510473,0.00016577207,0.000015058356,0.0000058104656,0.0000119159695,0.00013222414,0.0005756474,0.0001136407,0.9951132,0.00070689264,0.0031371715],"study_design_scores_gemma":[0.000007159755,0.0000030095364,0.00010631122,0.000006143747,0.000004658999,0.000022186097,0.00007133097,0.002162073,0.0001336182,0.9952171,0.002261522,0.0000050517233],"about_ca_topic_score_codex":0.004313807,"about_ca_topic_score_gemma":0.0033834714,"teacher_disagreement_score":0.009188435,"about_ca_system_score_codex":0.0029527675,"about_ca_system_score_gemma":0.0013541946,"threshold_uncertainty_score":0.030738413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.709263,0.0011580342,0.22213636,0.00073708745,0.0002558359,0.00012197679,0.00042009953,0.00056908134,0.0653384],"genre_scores_gemma":[0.97010314,0.0002581177,0.022371469,0.0001577061,0.00012469098,0.000057523856,0.00028261708,0.000065819666,0.0065789423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902105,0.0002161815,0.00008556307,0.00022823586,0.00023759453,0.00021142718],"domain_scores_gemma":[0.9989285,0.00025434245,0.00023185258,0.00015573626,0.00026265974,0.00016684178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272186,0.00030235187,0.00037424703,0.0015301352,0.0017616944,0.0021434166,0.0008004935,0.000521268,0.0024084384],"category_scores_gemma":[0.0016848769,0.00023178231,0.0005734043,0.0010216243,0.0037804493,0.0050323615,0.0018590674,0.0011128729,0.00034305805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017732897,0.000012694867,0.000716384,0.000021287899,0.000003323864,0.00013313543,0.00057137583,0.00033760915,0.0009283265,0.99316204,0.0003780948,0.0037179694],"study_design_scores_gemma":[0.000009648683,0.000023565231,0.0008065798,0.00001400779,0.000010455931,0.00025967517,0.00034606553,0.0024146796,0.0015339997,0.9893538,0.0052094096,0.000018095267],"about_ca_topic_score_codex":0.0014355999,"about_ca_topic_score_gemma":0.0011774023,"teacher_disagreement_score":0.0024084384,"about_ca_system_score_codex":0.0012159883,"about_ca_system_score_gemma":0.0005895588,"threshold_uncertainty_score":0.0088226795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73776716,0.0019711656,0.09346803,0.0021309827,0.00028243818,0.00005798586,0.0008043131,0.0005236056,0.16299437],"genre_scores_gemma":[0.9760838,0.0005532934,0.005397298,0.00015119479,0.00037106476,0.00003223451,0.00038657465,0.00007939856,0.016945114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.0001276004,0.000019133226,0.00012129762,0.00017220346,0.00011633682],"domain_scores_gemma":[0.9995285,0.00014076855,0.00010451996,0.00004336413,0.000057962407,0.00012490028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055126724,0.00063675566,0.0008015113,0.0021228348,0.0013376654,0.003298686,0.0008751362,0.000594788,0.006684956],"category_scores_gemma":[0.0012329145,0.0004143971,0.0006169821,0.001697244,0.0030600955,0.0043080784,0.0023977777,0.0015670746,0.0010203988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006588239,0.000008717655,0.00018406156,0.000021228523,0.0000074163368,0.00006606,0.00014903783,0.0006818489,0.00097554224,0.9926093,0.00073827576,0.004492549],"study_design_scores_gemma":[0.000045498447,0.00002627416,0.0003802029,0.000011061966,0.000013666115,0.00018112424,0.000116994794,0.0027817576,0.0009262631,0.9910774,0.0044232425,0.000016543729],"about_ca_topic_score_codex":0.000477392,"about_ca_topic_score_gemma":0.00035171077,"teacher_disagreement_score":0.006684956,"about_ca_system_score_codex":0.0009993397,"about_ca_system_score_gemma":0.00036424803,"threshold_uncertainty_score":0.022363424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37880224,0.0012998475,0.57824945,0.0042962953,0.00023693302,0.00014817207,0.00065639697,0.00019874792,0.036111828],"genre_scores_gemma":[0.948791,0.0005911158,0.045002498,0.0004263543,0.0003276319,0.00013917715,0.0002578638,0.000077343575,0.004386968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99533904,0.0019389768,0.0006542902,0.0009426245,0.0008034042,0.0003216997],"domain_scores_gemma":[0.95851874,0.029899681,0.0025971136,0.004928618,0.0028883691,0.0011675137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075410646,0.00066767866,0.001368596,0.0019070657,0.0016763924,0.003914059,0.0014897855,0.0016367907,0.006149089],"category_scores_gemma":[0.030586163,0.0012141799,0.0024898127,0.0017707767,0.0056747408,0.0171923,0.002160665,0.0035754677,0.00045266567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015416971,0.000038095975,0.00072220695,0.00008730467,0.00004610295,0.00012131113,0.00043328264,0.0012572644,0.001161587,0.9872502,0.0004206825,0.008307714],"study_design_scores_gemma":[0.000034843986,0.00005283958,0.0005875428,0.000011650456,0.000025387983,0.00017087744,0.00007288323,0.0072053564,0.0005642293,0.9905969,0.000660309,0.000017345295],"about_ca_topic_score_codex":0.0011484617,"about_ca_topic_score_gemma":0.0008873922,"teacher_disagreement_score":0.0075410646,"about_ca_system_score_codex":0.001259029,"about_ca_system_score_gemma":0.001248277,"threshold_uncertainty_score":0.03988141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94687617,0.0005121552,0.023607716,0.00021253184,0.00006769038,0.000042388692,0.00010745033,0.000107899694,0.028465929],"genre_scores_gemma":[0.99275875,0.0001054006,0.0033078464,0.00003260926,0.00006137465,0.000017914059,0.000116081064,0.000007939899,0.00359207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934655,0.00018961495,0.00006173021,0.00011976384,0.00020193667,0.00008046225],"domain_scores_gemma":[0.9988568,0.0004075105,0.0002099679,0.00012844788,0.00016602242,0.00023131959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008672493,0.00022058048,0.00041118904,0.00089231884,0.0008138085,0.0015177802,0.00032772426,0.00016451659,0.0019644315],"category_scores_gemma":[0.0010954827,0.0002855909,0.0005210385,0.0003952787,0.0022253902,0.0018547041,0.0016826702,0.00044094154,0.00021649576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020287136,0.000031492593,0.0022360312,0.00006804977,0.000022782644,0.0005996449,0.0015218959,0.0025890125,0.015936028,0.97033465,0.0005690884,0.005888537],"study_design_scores_gemma":[0.0001218316,0.00034899477,0.0066039218,0.000042964115,0.00003829589,0.001143934,0.0009588438,0.007821897,0.012061593,0.953901,0.016885664,0.00007112516],"about_ca_topic_score_codex":0.00038631138,"about_ca_topic_score_gemma":0.0003756507,"teacher_disagreement_score":0.0019644315,"about_ca_system_score_codex":0.00056224887,"about_ca_system_score_gemma":0.00033967526,"threshold_uncertainty_score":0.0065716505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34144622,0.0026309418,0.5564937,0.0018134724,0.0002702092,0.00010742614,0.0003294989,0.00038573277,0.09652281],"genre_scores_gemma":[0.9497512,0.0005737578,0.03960393,0.000214497,0.00013549125,0.00008903114,0.0001227153,0.00004307293,0.0094662905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879336,0.0003708278,0.00009284347,0.00026850883,0.00033351642,0.00014088195],"domain_scores_gemma":[0.99825484,0.0006281426,0.00026055623,0.0002882456,0.00031324738,0.00025495238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014571992,0.000309251,0.00034158115,0.0013863894,0.0017557206,0.0040779016,0.00046048185,0.0005522786,0.0028285566],"category_scores_gemma":[0.0026355656,0.00026561547,0.0007252199,0.0010780061,0.005911733,0.008085699,0.0027046273,0.0015037361,0.00046676217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001026272,0.0000042978163,0.00028392315,0.000015430636,0.000004000015,0.000045981687,0.00033096713,0.00028162551,0.00055820623,0.9959772,0.00011248279,0.0023756672],"study_design_scores_gemma":[0.000008619504,0.000023584073,0.00040704475,0.000017309625,0.0000075990215,0.00017885673,0.00041862257,0.0028861635,0.0015972338,0.984073,0.010368843,0.00001305752],"about_ca_topic_score_codex":0.0008727712,"about_ca_topic_score_gemma":0.00094636495,"teacher_disagreement_score":0.0040779016,"about_ca_system_score_codex":0.0012104235,"about_ca_system_score_gemma":0.00070259074,"threshold_uncertainty_score":0.009462476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38276565,0.0062980694,0.30306512,0.0071819327,0.0012546199,0.00013489599,0.0018779043,0.0021259433,0.29529583],"genre_scores_gemma":[0.9403238,0.0014735188,0.021760019,0.0006633753,0.0006399044,0.00011059261,0.0010002302,0.00014483322,0.03388357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989863,0.0002510486,0.000070146285,0.0002438373,0.00028493686,0.0001637093],"domain_scores_gemma":[0.9985178,0.00054107246,0.0001539973,0.00014249407,0.00026944914,0.000375103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010421928,0.00057360076,0.00073586137,0.0029744953,0.002295021,0.0050351867,0.0009556382,0.0010872688,0.010630403],"category_scores_gemma":[0.0016646382,0.00042720686,0.0009703056,0.0024172636,0.004195091,0.0074478295,0.003235122,0.0013498663,0.0012907025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029978257,0.000009584468,0.00020797565,0.000034107812,0.0000057276247,0.00007213933,0.00027941863,0.00015179042,0.0005596487,0.99202204,0.0015514451,0.0050761104],"study_design_scores_gemma":[0.000018677212,0.000030793693,0.00026211058,0.000020045865,0.000007948731,0.0002856657,0.00022118325,0.001228094,0.00055191206,0.9834494,0.013909667,0.000014380738],"about_ca_topic_score_codex":0.001028517,"about_ca_topic_score_gemma":0.0005993182,"teacher_disagreement_score":0.010630403,"about_ca_system_score_codex":0.0011946742,"about_ca_system_score_gemma":0.0009934296,"threshold_uncertainty_score":0.035562217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508115,0.0014272244,0.23116167,0.001444225,0.0006515457,0.00013549434,0.00038009623,0.0007819709,0.25590274],"genre_scores_gemma":[0.9595174,0.00026444907,0.020340402,0.0002352007,0.00021847372,0.00006800291,0.00022516992,0.00011389605,0.019017031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808264,0.00054221915,0.00009603464,0.0004478138,0.00048318275,0.00034818714],"domain_scores_gemma":[0.9990734,0.00018029407,0.00009004337,0.00014041974,0.00031376266,0.00020214019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012897919,0.0003477507,0.0004947131,0.0013495956,0.0019492537,0.0035577947,0.0006834854,0.0006356294,0.005902938],"category_scores_gemma":[0.0024628171,0.00042703343,0.0008292632,0.00070630125,0.0041212277,0.0045020115,0.0031351934,0.0018893821,0.0010041642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027628254,0.000013203769,0.00013644506,0.00001544123,0.0000036474214,0.00006894694,0.00041537284,0.00014934738,0.001018585,0.99547946,0.00032037005,0.0023514414],"study_design_scores_gemma":[0.00002379915,0.000046866993,0.00021530934,0.000012726758,0.000008909434,0.00026505132,0.0003008869,0.0016693223,0.002413862,0.9837673,0.011259998,0.000015963815],"about_ca_topic_score_codex":0.0005893057,"about_ca_topic_score_gemma":0.00034300084,"teacher_disagreement_score":0.005902938,"about_ca_system_score_codex":0.0016207318,"about_ca_system_score_gemma":0.00065786456,"threshold_uncertainty_score":0.019747317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.546739,0.002200083,0.25397092,0.0022850926,0.00072178105,0.000118722666,0.00070334715,0.0006980503,0.19256306],"genre_scores_gemma":[0.95219785,0.0006266258,0.022727128,0.0003012033,0.0002945081,0.000110661196,0.0004090244,0.00018042052,0.023152536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801934,0.00049142924,0.00013854484,0.00048190248,0.00047956387,0.0003891969],"domain_scores_gemma":[0.9976459,0.0007484588,0.00025197156,0.00041253422,0.00039127376,0.00054977473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016466485,0.00072464655,0.0009810078,0.0031458535,0.004281946,0.007011354,0.0018650779,0.0014513741,0.010852814],"category_scores_gemma":[0.003835583,0.0011168646,0.0011158373,0.0030665698,0.006268423,0.009796399,0.005378498,0.004299188,0.0016710573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001452836,0.000008054103,0.000098315104,0.000009229444,0.0000041803664,0.000043933396,0.00024587227,0.00013690832,0.00021631025,0.9975038,0.00025960917,0.0014593467],"study_design_scores_gemma":[0.0000069685157,0.0000067862384,0.00008332212,0.0000052802056,0.0000036274719,0.000041567142,0.00009354213,0.00045524168,0.00027810087,0.9976121,0.0014059269,0.000007495666],"about_ca_topic_score_codex":0.0009982194,"about_ca_topic_score_gemma":0.0011819723,"teacher_disagreement_score":0.010852814,"about_ca_system_score_codex":0.0017791264,"about_ca_system_score_gemma":0.0007882516,"threshold_uncertainty_score":0.036306262},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014633231,0.015763376,0.015082448,0.02390704,0.050523177,0.0006614239,0.019976946,0.0056008203,0.8670214],"genre_scores_gemma":[0.003956783,0.0064728134,0.0043279044,0.0025290854,0.005134375,0.0003088249,0.020674469,0.0016089389,0.95498693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974605,0.00028581326,0.0001924326,0.0005177453,0.0012625703,0.00028100298],"domain_scores_gemma":[0.99485415,0.00028862676,0.00012787853,0.0006748884,0.0031443662,0.0009101536],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002135004,0.0014599902,0.0013872485,0.0030989028,0.0029789784,0.01081779,0.0025783253,0.0026630887,0.5769815],"category_scores_gemma":[0.005714216,0.0007202822,0.0013942478,0.0037632252,0.00069121737,0.004663956,0.003713738,0.0033809014,0.46321952],"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.00002798607,0.000021699838,0.000050591047,0.00009782577,0.000004732163,0.000021131846,0.000021166477,0.00006711109,0.0001944867,0.003318779,0.9593028,0.036871683],"study_design_scores_gemma":[0.000005752723,0.000006058093,0.00014560319,0.000065894295,0.0000028183147,0.000026204489,0.000028596338,0.000084373845,0.00009077452,0.0012373121,0.99830186,0.0000048255724],"about_ca_topic_score_codex":0.014701934,"about_ca_topic_score_gemma":0.017483817,"teacher_disagreement_score":0.42301852,"about_ca_system_score_codex":0.0049865595,"about_ca_system_score_gemma":0.0062869163,"threshold_uncertainty_score":0.60338455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49804878,0.0021792476,0.16962929,0.0025372715,0.0006352992,0.00006431186,0.0004274204,0.0003311674,0.3261471],"genre_scores_gemma":[0.963588,0.00042260814,0.0133508425,0.00020164035,0.00019588997,0.00002224156,0.00013166615,0.000050210634,0.022036972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00016576258,0.00003406127,0.0001266603,0.00010490599,0.0001566291],"domain_scores_gemma":[0.99945766,0.00016459466,0.000069182344,0.00006661124,0.00011905945,0.0001228511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063316885,0.00041557438,0.00038766806,0.0010878661,0.0014150619,0.0027081526,0.0004158282,0.0002868024,0.003882366],"category_scores_gemma":[0.0011735203,0.00024638642,0.00035587107,0.0016042007,0.0029412434,0.0029454916,0.0016529299,0.0021463824,0.00048686666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026857637,0.0000070444225,0.00012522959,0.000009405879,0.0000022934762,0.00006058959,0.00020337742,0.00014063474,0.0007114347,0.99608743,0.00034925193,0.0022764935],"study_design_scores_gemma":[0.0000151775,0.000020161551,0.0004121738,0.000006738676,0.000010474378,0.00011673257,0.00018903635,0.0010031917,0.00179226,0.9886825,0.0077379094,0.000013683774],"about_ca_topic_score_codex":0.0016696554,"about_ca_topic_score_gemma":0.0019098932,"teacher_disagreement_score":0.003882366,"about_ca_system_score_codex":0.0012819897,"about_ca_system_score_gemma":0.00055554055,"threshold_uncertainty_score":0.012987852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5825431,0.0010477412,0.24401718,0.0020367585,0.00030150983,0.00011654421,0.00077190786,0.00043352437,0.1687317],"genre_scores_gemma":[0.95954114,0.0002905172,0.023409937,0.0001489168,0.000114593444,0.00006716837,0.000291091,0.000050344457,0.016086267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979225,0.00051038637,0.00013912348,0.00040644384,0.0007003021,0.00032132908],"domain_scores_gemma":[0.99811614,0.00036538005,0.00021807179,0.00032654474,0.00051000685,0.0004638522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012052957,0.00028762224,0.00043279998,0.0018186884,0.002204837,0.0049683442,0.0006393587,0.00052746205,0.0048479117],"category_scores_gemma":[0.0026370136,0.0003610954,0.00047884742,0.0009062993,0.0041689416,0.006510811,0.0038091,0.0014028824,0.0007329101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019373116,0.000009244455,0.0002684029,0.000011312099,0.0000035689934,0.000034557102,0.0002323589,0.00030807196,0.00042092364,0.99496526,0.00025192826,0.00347509],"study_design_scores_gemma":[0.0000104130095,0.000023147439,0.00028892787,0.000012454661,0.000008854945,0.00016127824,0.0003823389,0.0035343596,0.00096157816,0.97874063,0.01586017,0.000015851723],"about_ca_topic_score_codex":0.00079972344,"about_ca_topic_score_gemma":0.0006909298,"teacher_disagreement_score":0.0049683442,"about_ca_system_score_codex":0.0011924544,"about_ca_system_score_gemma":0.0008449809,"threshold_uncertainty_score":0.016217887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81657284,0.0020463692,0.12083234,0.0016682287,0.00031088898,0.000087124215,0.0008042047,0.00021279043,0.05746508],"genre_scores_gemma":[0.96978205,0.0011107874,0.013272639,0.00021681901,0.00041680553,0.000083296734,0.000605395,0.000069312206,0.014442943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858946,0.00033614915,0.00008546968,0.00024693127,0.00042726324,0.0003146739],"domain_scores_gemma":[0.99657154,0.0016250546,0.00048780988,0.00026290285,0.0003946782,0.00065800373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017070937,0.0009475603,0.0011064332,0.0032455933,0.0031576995,0.004653537,0.0011999054,0.0015375649,0.005891549],"category_scores_gemma":[0.0026987202,0.00062947447,0.0011963699,0.0022609388,0.004200973,0.008922976,0.002365093,0.001795979,0.000589715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000741933,0.000022794058,0.0004945005,0.00003188623,0.000010238297,0.00012137908,0.00041242287,0.00061678543,0.0010059815,0.993936,0.00043628493,0.0028376486],"study_design_scores_gemma":[0.000026712938,0.000048596332,0.00088266935,0.00002600207,0.000014067858,0.00021981543,0.00018785804,0.004255138,0.00067171914,0.9908455,0.0027971715,0.000024850824],"about_ca_topic_score_codex":0.0018831769,"about_ca_topic_score_gemma":0.001823151,"teacher_disagreement_score":0.005891549,"about_ca_system_score_codex":0.0020324113,"about_ca_system_score_gemma":0.0011631093,"threshold_uncertainty_score":0.01970923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19758822,0.00089143723,0.4643742,0.008135553,0.0004538575,0.00023107945,0.0003748217,0.0008699935,0.32708094],"genre_scores_gemma":[0.9252226,0.00031349223,0.050108265,0.00096719724,0.00021502712,0.00007814527,0.0001514159,0.00007342721,0.022870317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982843,0.00048072755,0.00010960274,0.00046101565,0.00042427215,0.0002401357],"domain_scores_gemma":[0.99825376,0.0005744169,0.00023595367,0.00026883202,0.0005012418,0.00016572354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113546,0.00031054538,0.00038237884,0.0007631679,0.0022669672,0.0025101665,0.0011110853,0.0011617773,0.008041088],"category_scores_gemma":[0.0031037456,0.00026922696,0.0006888873,0.0006215003,0.0065211332,0.00537846,0.0025340058,0.0023601311,0.00077560975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007713695,0.0000037706575,0.00010997251,0.000012916134,0.0000014779067,0.000037169615,0.0003382443,0.00012158333,0.00047457454,0.9968779,0.00034138781,0.0016732696],"study_design_scores_gemma":[0.000024488469,0.00006060746,0.00031966332,0.000019636695,0.000010470746,0.00013518652,0.00041918512,0.004189561,0.0018624933,0.9624847,0.030453272,0.000020717553],"about_ca_topic_score_codex":0.00437861,"about_ca_topic_score_gemma":0.0034652196,"teacher_disagreement_score":0.008041088,"about_ca_system_score_codex":0.002084698,"about_ca_system_score_gemma":0.0019557674,"threshold_uncertainty_score":0.026900113},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006141857,0.004438429,0.0032924442,0.12242781,0.84823465,0.000046966434,0.0005728265,0.0005594505,0.019813191],"genre_scores_gemma":[0.033525944,0.01583363,0.00809411,0.18189909,0.35969228,0.0002999627,0.0018480077,0.0010800784,0.39772692],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804664,0.00044139684,0.00021371382,0.00034043557,0.0008296168,0.00012816099],"domain_scores_gemma":[0.9922652,0.0025324037,0.00026106523,0.0005331534,0.004123672,0.00028439923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913385,0.0015990448,0.0013264352,0.0027327687,0.002934098,0.0030321172,0.002446507,0.0032825728,0.030064212],"category_scores_gemma":[0.017487038,0.0006922161,0.0013552384,0.0018498852,0.00271787,0.0028982083,0.0014623704,0.0050027207,0.013958907],"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.000024678837,0.0000070998153,0.000045603065,0.00013343364,0.000011425876,0.0001606015,0.000038551745,0.000050606974,0.00007015143,0.0049815006,0.9895477,0.0049284482],"study_design_scores_gemma":[0.000056514018,0.000055273093,0.0018811122,0.0002846701,0.00009339622,0.0007244305,0.0001562612,0.00096965814,0.00079392246,0.022165267,0.9727533,0.00006621862],"about_ca_topic_score_codex":0.011982892,"about_ca_topic_score_gemma":0.013194022,"teacher_disagreement_score":0.030064212,"about_ca_system_score_codex":0.002864962,"about_ca_system_score_gemma":0.0018868848,"threshold_uncertainty_score":0.10057485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6125591,0.000570658,0.24930227,0.0011821118,0.00032829784,0.00021042684,0.00048412828,0.0012565844,0.13410649],"genre_scores_gemma":[0.9741746,0.0000959816,0.01357606,0.0001767862,0.00009775331,0.00005652749,0.00014668186,0.00006226142,0.011613344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808395,0.0005091666,0.00013789287,0.0003915779,0.00048771128,0.00038977704],"domain_scores_gemma":[0.9973695,0.00069367694,0.00033663271,0.0004523499,0.00075525825,0.00039258847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017733697,0.00039315296,0.00045768882,0.0010436589,0.0010742203,0.0035626274,0.00058896595,0.00055761,0.0071182023],"category_scores_gemma":[0.00294964,0.00046475165,0.000783575,0.00045016038,0.003244287,0.0047356538,0.0031698444,0.0021728105,0.0009616072],"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.00014054238,0.00007525046,0.0007032661,0.0000760858,0.000023293727,0.00017633481,0.0005285977,0.00055394607,0.00875924,0.97981274,0.0007430652,0.008407546],"study_design_scores_gemma":[0.00005634636,0.00014271605,0.0006874668,0.000026356473,0.000039941573,0.0004258269,0.0003797155,0.004265746,0.012995202,0.96914077,0.011807478,0.00003243655],"about_ca_topic_score_codex":0.00032889764,"about_ca_topic_score_gemma":0.00031322052,"teacher_disagreement_score":0.0071182023,"about_ca_system_score_codex":0.00083123945,"about_ca_system_score_gemma":0.0005976833,"threshold_uncertainty_score":0.023812711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2921163,0.004980194,0.51280195,0.011352072,0.0019657677,0.00016174905,0.0008773081,0.00082444557,0.17492017],"genre_scores_gemma":[0.90201956,0.0020173779,0.055579066,0.002933871,0.001640801,0.00019619116,0.0007181218,0.00044841607,0.034446623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985104,0.00046916335,0.00013566262,0.00033253373,0.0002576055,0.0002945442],"domain_scores_gemma":[0.9958333,0.0022022799,0.00028066122,0.0007222151,0.0005837083,0.00037781976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031618448,0.0010651874,0.0012319044,0.0033250942,0.004177306,0.003927561,0.0022067986,0.002503804,0.008440525],"category_scores_gemma":[0.0065458417,0.0009839099,0.0033197778,0.0021385928,0.0071167233,0.019537691,0.005853159,0.0056952015,0.0009837839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003176212,0.000010170611,0.00016780045,0.000025782603,0.0000074638415,0.000067513225,0.00024781542,0.00012580864,0.00033435403,0.9953063,0.0007721386,0.0029030894],"study_design_scores_gemma":[0.000009496399,0.000013383541,0.000111772126,0.000008304657,0.000011633146,0.00008955501,0.00006757672,0.0007169865,0.00035464714,0.9965616,0.0020456568,0.000009415706],"about_ca_topic_score_codex":0.0011427772,"about_ca_topic_score_gemma":0.0007911499,"teacher_disagreement_score":0.008440525,"about_ca_system_score_codex":0.0010074514,"about_ca_system_score_gemma":0.0006896536,"threshold_uncertainty_score":0.02823639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3899891,0.00750337,0.42127803,0.034397565,0.0007492361,0.00059953635,0.0039800876,0.0030209913,0.13848211],"genre_scores_gemma":[0.8987901,0.0037424178,0.07781673,0.0008373869,0.0012605505,0.00029908482,0.0022338144,0.00077863457,0.014241165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9812244,0.006181676,0.0013767878,0.0017634543,0.007914206,0.0015394506],"domain_scores_gemma":[0.85314286,0.12622333,0.0039355033,0.009855903,0.0049517676,0.0018906817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008336129,0.0010082882,0.0022795147,0.0026306955,0.0033736115,0.012885012,0.003519809,0.0032002372,0.021920266],"category_scores_gemma":[0.091675036,0.0019236314,0.004025337,0.0051480317,0.0050944234,0.032556478,0.0076711834,0.0058177668,0.0026751466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000886239,0.0002475495,0.0040663634,0.0009389671,0.00029903057,0.00075341563,0.0013952008,0.055548806,0.0019157211,0.85180897,0.018671783,0.06346785],"study_design_scores_gemma":[0.000089304005,0.00003094596,0.00045595173,0.00005290664,0.00008776057,0.00029098152,0.00010640977,0.058873504,0.00080190896,0.9356983,0.0034733803,0.000038736645],"about_ca_topic_score_codex":0.0051123174,"about_ca_topic_score_gemma":0.0027859425,"teacher_disagreement_score":0.021920266,"about_ca_system_score_codex":0.0051530926,"about_ca_system_score_gemma":0.0059142695,"threshold_uncertainty_score":0.07333058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11077315,0.0069055855,0.78137124,0.0041640825,0.0007792591,0.0000675887,0.00026782195,0.00042923636,0.095242],"genre_scores_gemma":[0.7442316,0.005030313,0.2064157,0.00070900423,0.00095583266,0.00019008639,0.00042904107,0.00037500352,0.041663364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877423,0.00047761807,0.00009804578,0.0003252643,0.00021005949,0.000114815964],"domain_scores_gemma":[0.9973425,0.0015340289,0.00013499318,0.00043888003,0.00033723007,0.00021240326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018556126,0.00090262294,0.00095181935,0.002408763,0.0020696013,0.0026957172,0.0012442239,0.0016485096,0.009295611],"category_scores_gemma":[0.005373682,0.00076289417,0.0013559309,0.003119765,0.004067533,0.009802089,0.004515227,0.0039059585,0.0011339238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002086074,0.000016428636,0.000096126285,0.000031085732,0.0000065874706,0.000059368143,0.00027662425,0.00074302574,0.000357799,0.98338425,0.00094137946,0.014066513],"study_design_scores_gemma":[0.0000034091006,0.000005059066,0.000032633692,0.000006091845,0.0000037657685,0.000047755173,0.00005977902,0.0017944152,0.00014101877,0.99540883,0.0024938816,0.0000033770268],"about_ca_topic_score_codex":0.000433189,"about_ca_topic_score_gemma":0.00046590314,"teacher_disagreement_score":0.009295611,"about_ca_system_score_codex":0.0008602213,"about_ca_system_score_gemma":0.00041202028,"threshold_uncertainty_score":0.031096935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17730255,0.001558706,0.7021165,0.001750792,0.0010238746,0.00018176097,0.001103919,0.002128716,0.112833224],"genre_scores_gemma":[0.7629952,0.0011899818,0.16923262,0.00074842264,0.00097351894,0.00030217876,0.0015643545,0.00089448027,0.06209919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981927,0.00044486023,0.0001730726,0.0002796037,0.0006716773,0.0002381079],"domain_scores_gemma":[0.99706846,0.001206022,0.00026857763,0.00043644742,0.00055760803,0.00046293685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016542524,0.00069410965,0.0007817284,0.002529975,0.0017433546,0.0046886797,0.001017628,0.00075615576,0.011395835],"category_scores_gemma":[0.002702082,0.00069728243,0.0012194784,0.001666185,0.0028103015,0.009449536,0.0026510528,0.002301774,0.0036472878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119204284,0.000052830786,0.00014986585,0.000053534706,0.000010705746,0.00011645281,0.00043499365,0.00032854336,0.0036460424,0.98163605,0.0015835179,0.011868238],"study_design_scores_gemma":[0.000053072512,0.000047073703,0.0001285332,0.000023540386,0.000017054559,0.00031523494,0.00022310016,0.00417331,0.006907041,0.9715308,0.016551292,0.000029979281],"about_ca_topic_score_codex":0.00043606223,"about_ca_topic_score_gemma":0.00062838354,"teacher_disagreement_score":0.011395835,"about_ca_system_score_codex":0.000982606,"about_ca_system_score_gemma":0.0008931243,"threshold_uncertainty_score":0.038122892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099572,0.002173906,0.17695628,0.0093496125,0.000977246,0.00009406654,0.0015581766,0.0018882845,0.19704525],"genre_scores_gemma":[0.9677679,0.00036014998,0.0156295,0.0005778455,0.00020479593,0.00003385644,0.00060536613,0.00020500345,0.014615658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988716,0.00024702933,0.00005425774,0.00023892881,0.0002244171,0.0003636925],"domain_scores_gemma":[0.9969356,0.0014763732,0.00033988053,0.00052514597,0.00038829405,0.00033475718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491256,0.00055525545,0.00093884877,0.0011404945,0.0029352645,0.004825607,0.0012688646,0.0018074499,0.0124303335],"category_scores_gemma":[0.0055185906,0.000622985,0.0010688296,0.0011166274,0.0052358233,0.013159411,0.0018008566,0.0019579867,0.0026694427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022311532,0.00004997532,0.0017330059,0.000077453355,0.000021015076,0.00029669053,0.0008674509,0.0004751095,0.0013676279,0.972868,0.00473536,0.017285239],"study_design_scores_gemma":[0.00001623915,0.000009643517,0.00022816673,0.000019538302,0.00001109382,0.0002583222,0.00048545477,0.0009854058,0.0017029037,0.98773926,0.008522866,0.000021122338],"about_ca_topic_score_codex":0.0017774809,"about_ca_topic_score_gemma":0.0015114653,"teacher_disagreement_score":0.0124303335,"about_ca_system_score_codex":0.0015650301,"about_ca_system_score_gemma":0.00094554876,"threshold_uncertainty_score":0.041583657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45762852,0.0022415188,0.41070485,0.0014831185,0.0011417713,0.00012732879,0.00047894605,0.0010013925,0.12519267],"genre_scores_gemma":[0.92280614,0.00057222694,0.045985207,0.00031632083,0.0005116867,0.00008092188,0.00026545007,0.00039474812,0.029067246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987723,0.00030946935,0.00011881906,0.00019441302,0.00039161486,0.00021339105],"domain_scores_gemma":[0.9974421,0.0010487436,0.00037012735,0.00046686677,0.00040207262,0.0002701224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018353105,0.0004585373,0.0012375336,0.0022542481,0.0022500353,0.0041831476,0.0014867653,0.0012766502,0.00822551],"category_scores_gemma":[0.006173054,0.0006670618,0.00094382913,0.002410199,0.0023538251,0.008456955,0.0022983428,0.0018454269,0.0014234831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049216593,0.000013759664,0.00014811229,0.000028006902,0.00000603758,0.000112911745,0.00022321736,0.00033574426,0.0010017484,0.9921909,0.000677101,0.005213239],"study_design_scores_gemma":[0.000010824283,0.00002280613,0.00010820109,0.000009311505,0.0000140549,0.00028741325,0.000072924515,0.0038861046,0.0009450725,0.99215674,0.0024704374,0.000015981732],"about_ca_topic_score_codex":0.0003643564,"about_ca_topic_score_gemma":0.0005247566,"teacher_disagreement_score":0.00822551,"about_ca_system_score_codex":0.00081589643,"about_ca_system_score_gemma":0.0005713108,"threshold_uncertainty_score":0.02751702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13765241,0.0051036654,0.554639,0.010701599,0.0016927044,0.00010865994,0.00056227634,0.0006359169,0.28890377],"genre_scores_gemma":[0.8825573,0.0026317085,0.06320012,0.0022852255,0.002287407,0.00028954633,0.00045481624,0.00039668038,0.045897223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.00041895575,0.00013720305,0.00043015165,0.0005087299,0.0002618827],"domain_scores_gemma":[0.99636143,0.0018444748,0.0003010217,0.0005186284,0.00048964616,0.00048486513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037706208,0.00081181293,0.0015478624,0.0042068055,0.005384287,0.005620684,0.0021212697,0.0026422637,0.011936777],"category_scores_gemma":[0.007161307,0.00077959226,0.0018847738,0.0036824937,0.011330755,0.026687078,0.005198102,0.005934438,0.0014754941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006423779,0.0000059721942,0.000017989185,0.0000044537737,0.0000012588471,0.00001584116,0.000077581135,0.000022960186,0.000050292187,0.9985796,0.00033262814,0.0008850147],"study_design_scores_gemma":[0.000006697809,0.0000036074057,0.00002427791,0.0000032433554,0.0000027285523,0.00003606427,0.000034545777,0.00037249445,0.00007853773,0.99788,0.0015537019,0.000004260266],"about_ca_topic_score_codex":0.0012499486,"about_ca_topic_score_gemma":0.000658255,"teacher_disagreement_score":0.011936777,"about_ca_system_score_codex":0.0017484099,"about_ca_system_score_gemma":0.0010745048,"threshold_uncertainty_score":0.03993255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86777276,0.0009373088,0.06006662,0.0006459245,0.0002549504,0.00006499836,0.00039459293,0.0002773199,0.06958552],"genre_scores_gemma":[0.9786012,0.00049671874,0.0057277195,0.00011741969,0.00026769863,0.00004312397,0.00039627258,0.000088475186,0.014261359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990087,0.00017869273,0.00004099641,0.00020212808,0.0002551033,0.00031445947],"domain_scores_gemma":[0.99826294,0.00051779905,0.00040754004,0.00013677908,0.00014145642,0.00053336145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010540024,0.0012604306,0.0012380577,0.0034182211,0.0028406924,0.0039610527,0.0012851714,0.00086437265,0.0052730762],"category_scores_gemma":[0.0025179773,0.0007171066,0.0011898369,0.0023967389,0.0045098546,0.0061615505,0.004346245,0.0024250308,0.00088728184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015587296,0.00004236236,0.0008420573,0.000042247455,0.000018005872,0.00021804371,0.00077819877,0.00066430646,0.001608674,0.9910754,0.0005073521,0.004047327],"study_design_scores_gemma":[0.00007023312,0.00007174653,0.0016635164,0.000048632504,0.000046780755,0.00039362512,0.00045524462,0.0033358762,0.0018128398,0.9888558,0.0032092421,0.0000364705],"about_ca_topic_score_codex":0.00057389744,"about_ca_topic_score_gemma":0.00060936593,"teacher_disagreement_score":0.0052730762,"about_ca_system_score_codex":0.0014286492,"about_ca_system_score_gemma":0.0004189554,"threshold_uncertainty_score":0.017640173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29090726,0.0012804919,0.570155,0.0029733784,0.00048444592,0.00013350103,0.0007641192,0.0011266089,0.13217522],"genre_scores_gemma":[0.9490635,0.0005142692,0.030418105,0.0002565902,0.0003475421,0.00011101612,0.0004185084,0.00016592369,0.018704543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00025908332,0.00005558544,0.00020831375,0.00030903146,0.0001524703],"domain_scores_gemma":[0.9972314,0.0011576251,0.00036826334,0.00038861786,0.00032468414,0.0005293859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011408667,0.0005458388,0.00069392443,0.002273214,0.0022602817,0.0072153667,0.0012594975,0.0013153413,0.012019558],"category_scores_gemma":[0.0033767328,0.0005507061,0.00060048397,0.0028866383,0.0046193996,0.011173458,0.0027591966,0.0026100334,0.0012712186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019023173,0.000013801641,0.00006246013,0.000009346953,0.0000012736738,0.00003388635,0.000145653,0.00021089966,0.00015899014,0.996999,0.00040647495,0.0019391789],"study_design_scores_gemma":[0.000016818545,0.000009526596,0.00005698144,0.000005304676,0.0000039928614,0.00007184681,0.00017978951,0.0031721606,0.0003237699,0.993361,0.0027926408,0.000006211691],"about_ca_topic_score_codex":0.00047393382,"about_ca_topic_score_gemma":0.0005649194,"teacher_disagreement_score":0.012019558,"about_ca_system_score_codex":0.0013622099,"about_ca_system_score_gemma":0.00078902196,"threshold_uncertainty_score":0.040209413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46265528,0.0022717274,0.26293236,0.00457102,0.0011282444,0.00010209265,0.0005982474,0.00105289,0.26468813],"genre_scores_gemma":[0.9128762,0.0010555997,0.021637665,0.00046460226,0.00072283164,0.00008549684,0.00031778746,0.00028405522,0.06255584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836785,0.0003453392,0.00009965983,0.0003236081,0.00054878264,0.00031483913],"domain_scores_gemma":[0.9971444,0.001129567,0.00026252214,0.00035889953,0.000431063,0.00067355874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284454,0.000796785,0.0009928803,0.0040465435,0.0032817975,0.0048405584,0.0010583805,0.0010844242,0.0093767075],"category_scores_gemma":[0.0033402692,0.0007646581,0.0010629684,0.002529365,0.005283223,0.011621005,0.0055403877,0.004102005,0.0014035739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023431272,0.000012558181,0.00007666248,0.00001016463,0.0000024824053,0.000042949858,0.00025268612,0.00009381674,0.000272693,0.99657357,0.00034109387,0.0022978487],"study_design_scores_gemma":[0.0000084922385,0.000009170678,0.00008923463,0.0000059824715,0.0000047115486,0.00006473016,0.000119497876,0.00061575475,0.00040069094,0.99591845,0.002755716,0.000007579115],"about_ca_topic_score_codex":0.0011356572,"about_ca_topic_score_gemma":0.00090896984,"teacher_disagreement_score":0.0093767075,"about_ca_system_score_codex":0.0018796308,"about_ca_system_score_gemma":0.0006890367,"threshold_uncertainty_score":0.031368196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7384681,0.00069464237,0.19760658,0.0013978762,0.000523331,0.0001681482,0.0004044933,0.0002362863,0.060500544],"genre_scores_gemma":[0.96093833,0.00026709048,0.026788857,0.00023811635,0.00041383255,0.00017649865,0.00039423155,0.000054295127,0.010728673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990767,0.00023689821,0.00007755213,0.00019915753,0.00025037548,0.00015934746],"domain_scores_gemma":[0.9964774,0.0015098335,0.00042863286,0.0004495158,0.00047135993,0.00066324766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001806042,0.0004398788,0.0006680443,0.0019621153,0.0028558997,0.0026646587,0.0007369902,0.0008598263,0.0057478617],"category_scores_gemma":[0.0033510828,0.00042960185,0.0009881821,0.0011400107,0.003908609,0.0042704823,0.0017758632,0.0015499605,0.00048897165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016474986,0.00003823295,0.00059821,0.00003852473,0.000012783092,0.000164841,0.0010740433,0.00028684724,0.0038869085,0.98778546,0.0005058512,0.0054435185],"study_design_scores_gemma":[0.0000642129,0.00019411101,0.001573317,0.000020997204,0.000027653497,0.00047883025,0.0007803335,0.0039346037,0.0035442128,0.98073006,0.008615642,0.0000359737],"about_ca_topic_score_codex":0.00051608065,"about_ca_topic_score_gemma":0.00035691482,"teacher_disagreement_score":0.0057478617,"about_ca_system_score_codex":0.0006683169,"about_ca_system_score_gemma":0.0004681868,"threshold_uncertainty_score":0.019228518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91611445,0.0016203189,0.02257499,0.0017639975,0.00026610494,0.00027528955,0.0016562785,0.00029390425,0.055434648],"genre_scores_gemma":[0.9836453,0.00032702013,0.010730254,0.000871116,0.000107364256,0.00018982618,0.0007408558,0.00036634263,0.0030217445],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942703,0.002084535,0.000555741,0.0012121142,0.0015956641,0.00028152307],"domain_scores_gemma":[0.93845123,0.03408574,0.003935471,0.018781109,0.0035226133,0.001223926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057898783,0.00055744423,0.00094992685,0.000896542,0.0015331003,0.0029094203,0.0019598373,0.0022482835,0.018167002],"category_scores_gemma":[0.0676007,0.00048711197,0.00041916716,0.0008935491,0.0030856042,0.0062718424,0.0028494191,0.0020531095,0.0024730465],"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.019579614,0.007449974,0.04454418,0.005662128,0.0007099967,0.0018861336,0.025647765,0.0056350697,0.43637383,0.3089997,0.018422225,0.12508945],"study_design_scores_gemma":[0.0022234314,0.006715673,0.072254635,0.0007867063,0.0008533771,0.00631787,0.010495644,0.021395482,0.26602402,0.5403869,0.071946144,0.0006001161],"about_ca_topic_score_codex":0.0007242106,"about_ca_topic_score_gemma":0.00053317065,"teacher_disagreement_score":0.018167002,"about_ca_system_score_codex":0.0006314339,"about_ca_system_score_gemma":0.0006508342,"threshold_uncertainty_score":0.060774624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56728894,0.0011986637,0.27885315,0.0017907878,0.00084119005,0.00011692636,0.0006387986,0.00037763407,0.14889391],"genre_scores_gemma":[0.9249271,0.00054666353,0.046107817,0.0006727258,0.0002651989,0.00011434009,0.00034893083,0.00016535058,0.026851859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787617,0.00048251555,0.00022082798,0.00048037292,0.00047452023,0.00046560453],"domain_scores_gemma":[0.9972421,0.0009344436,0.00034865332,0.0004941409,0.0004303652,0.00055032107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022373036,0.0005535036,0.001023039,0.0015138908,0.003408573,0.003715254,0.0010276271,0.00080137193,0.0051921043],"category_scores_gemma":[0.002667207,0.00069306063,0.0010328518,0.001604585,0.005555496,0.005096928,0.004120864,0.002424423,0.0009317713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006081395,0.0000236346,0.0002426071,0.000022027643,0.0000068213603,0.000113187154,0.00025797577,0.0002572341,0.00076392555,0.9940923,0.0005242073,0.0036353485],"study_design_scores_gemma":[0.000023462811,0.000016243288,0.00020164797,0.000008621877,0.0000068868726,0.0001637958,0.00011878864,0.0010398853,0.0005622542,0.9950659,0.0027790912,0.00001338367],"about_ca_topic_score_codex":0.001467161,"about_ca_topic_score_gemma":0.0021919424,"teacher_disagreement_score":0.0051921043,"about_ca_system_score_codex":0.001398868,"about_ca_system_score_gemma":0.0011833649,"threshold_uncertainty_score":0.01736933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.761801,0.0019285586,0.1419934,0.0010667839,0.00034393457,0.000111741174,0.00043525943,0.00073573244,0.0915837],"genre_scores_gemma":[0.98335695,0.00025989662,0.0075272294,0.00009333331,0.00016854508,0.00004121192,0.00020242043,0.00003792675,0.008312557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988587,0.00020200331,0.00006649481,0.0003354575,0.00024020168,0.00029729027],"domain_scores_gemma":[0.9988757,0.0003527755,0.00014627495,0.00012707485,0.00012431228,0.0003738872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014123531,0.0008765641,0.0010521375,0.0021092861,0.0031039123,0.005137366,0.0013047502,0.00072314235,0.0041268677],"category_scores_gemma":[0.0017913748,0.0007211376,0.0011630999,0.0015358346,0.0048833755,0.009024756,0.0036702033,0.0022515785,0.00048452706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015160376,0.000047433638,0.00056688505,0.0000386797,0.000025330217,0.00028074608,0.0007879747,0.00047139544,0.0019652473,0.99112165,0.00042299926,0.0041201315],"study_design_scores_gemma":[0.00008985666,0.00007077435,0.00078401546,0.00002940811,0.000056945202,0.0005094903,0.00058026414,0.0023016613,0.003268908,0.9858948,0.0063839746,0.000029898152],"about_ca_topic_score_codex":0.00060653774,"about_ca_topic_score_gemma":0.0005877844,"teacher_disagreement_score":0.005137366,"about_ca_system_score_codex":0.0015700706,"about_ca_system_score_gemma":0.0006427198,"threshold_uncertainty_score":0.013805807},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15705734,0.003790353,0.18736665,0.007821802,0.0019653838,0.000114239,0.0018128364,0.0016737877,0.6383976],"genre_scores_gemma":[0.8236078,0.001172611,0.025827631,0.0011347856,0.0009112173,0.000095551906,0.0010158172,0.0003837753,0.14585076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989479,0.00017165714,0.0000624264,0.00023461453,0.0003885413,0.00019483609],"domain_scores_gemma":[0.9985018,0.00047232833,0.00012470622,0.00023303165,0.00028031267,0.00038787696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010137883,0.00080039847,0.0010161129,0.0019705053,0.0037338429,0.0063010673,0.0013362997,0.0007958922,0.026015049],"category_scores_gemma":[0.0026214211,0.0008894865,0.0009754708,0.0015664368,0.003367515,0.00830967,0.0032861363,0.004114352,0.0047149486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044403456,0.000019173842,0.00010351679,0.000020445554,0.000007537786,0.000026833048,0.00011634033,0.00013425497,0.00034772116,0.99211556,0.0022767158,0.0047875703],"study_design_scores_gemma":[0.0000111400905,0.000005669522,0.000067485926,0.0000062333233,0.0000066482403,0.00006844579,0.000050855473,0.00036997473,0.00039774593,0.9899963,0.0090107685,0.000008709942],"about_ca_topic_score_codex":0.0010494776,"about_ca_topic_score_gemma":0.001032025,"teacher_disagreement_score":0.026015049,"about_ca_system_score_codex":0.0017845291,"about_ca_system_score_gemma":0.001045602,"threshold_uncertainty_score":0.08702898},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38527623,0.0021308926,0.33258635,0.0034750516,0.00096127216,0.00017978564,0.00066153356,0.00022622579,0.27450264],"genre_scores_gemma":[0.9351908,0.00060732954,0.029495249,0.000718559,0.00059697055,0.00013609811,0.0003019068,0.0000477141,0.032905366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990958,0.00024165955,0.000078583565,0.00015299908,0.00025160267,0.0001792405],"domain_scores_gemma":[0.99886936,0.00032223357,0.00019869205,0.00007787046,0.00020665688,0.00032511444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018870267,0.00060084386,0.0005706678,0.0025930975,0.0024428684,0.004111112,0.00095466163,0.0012326604,0.006694455],"category_scores_gemma":[0.0018889181,0.00045619564,0.0010592983,0.0012083224,0.0035544406,0.0062671276,0.0028283726,0.0028261112,0.0007812012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022139786,0.000015956335,0.00006415787,0.000010443672,0.0000033705367,0.000039493472,0.00011244208,0.0002174589,0.0004884322,0.99778867,0.00021127291,0.0010260943],"study_design_scores_gemma":[0.000016543385,0.000014182584,0.00010484949,0.0000057111324,0.000004305192,0.00006917939,0.000072367984,0.0024228788,0.00035945146,0.9954853,0.0014357882,0.000009404883],"about_ca_topic_score_codex":0.000789557,"about_ca_topic_score_gemma":0.0009835617,"teacher_disagreement_score":0.006694455,"about_ca_system_score_codex":0.001761329,"about_ca_system_score_gemma":0.00082484796,"threshold_uncertainty_score":0.022395194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34360504,0.0045318045,0.45378363,0.006134781,0.002207184,0.00018030984,0.0008543376,0.0006724082,0.18803063],"genre_scores_gemma":[0.9011481,0.001564575,0.062147908,0.0008277521,0.0013634029,0.00017020472,0.00068965595,0.00020230302,0.031886138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973099,0.00084232277,0.00024980522,0.00053621235,0.00066319533,0.00039857175],"domain_scores_gemma":[0.9966186,0.0015131403,0.00041059754,0.0005724782,0.0004421137,0.00044299915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031126225,0.00076318503,0.001315007,0.0018463824,0.0041955668,0.005144219,0.0009716006,0.0010267098,0.007008503],"category_scores_gemma":[0.004585028,0.0011600726,0.0013837717,0.002292318,0.008703054,0.011379419,0.0038502153,0.0044116355,0.0010453351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002326384,0.000015099599,0.00006751262,0.000010661102,0.0000027008032,0.00003525656,0.00021623207,0.00008883477,0.0002406003,0.9965947,0.00039866308,0.002306449],"study_design_scores_gemma":[0.000011445228,0.0000052354208,0.00004538952,0.000004070202,0.000003624562,0.000039802504,0.00006234724,0.00029785224,0.0002020378,0.9969164,0.0024061382,0.000005607795],"about_ca_topic_score_codex":0.0010240463,"about_ca_topic_score_gemma":0.0014026186,"teacher_disagreement_score":0.007008503,"about_ca_system_score_codex":0.0014502571,"about_ca_system_score_gemma":0.0010924746,"threshold_uncertainty_score":0.023445725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83314013,0.0018716292,0.0873784,0.00060897577,0.0001337202,0.00007203366,0.0004105212,0.0004184699,0.075966164],"genre_scores_gemma":[0.98859614,0.00027949634,0.005938079,0.00005804477,0.0000882031,0.000028464829,0.0002017707,0.000028315104,0.0047815363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992391,0.000104938474,0.000054323686,0.00022896181,0.00022607858,0.00014660935],"domain_scores_gemma":[0.9994431,0.00011117186,0.0000751217,0.00011135479,0.000117205855,0.00014189174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060186663,0.00027650883,0.0006112436,0.001593752,0.0016997302,0.002434778,0.0005909067,0.00032249247,0.0026855296],"category_scores_gemma":[0.0014862069,0.00026032762,0.00065161247,0.0010641295,0.0033296705,0.0042314227,0.0029844332,0.0012386935,0.00021288349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023010154,0.000010488492,0.0007882591,0.00002840199,0.000009528493,0.00017814383,0.0006605327,0.00060525216,0.0012627845,0.99204963,0.00035464286,0.0040293215],"study_design_scores_gemma":[0.000029253828,0.000043082768,0.0021006446,0.000044331275,0.000034003842,0.00087291707,0.0007145377,0.0047371094,0.002456158,0.9677654,0.02117679,0.00002583752],"about_ca_topic_score_codex":0.00080776215,"about_ca_topic_score_gemma":0.00033468418,"teacher_disagreement_score":0.0026855296,"about_ca_system_score_codex":0.00077283056,"about_ca_system_score_gemma":0.0003356879,"threshold_uncertainty_score":0.00898397},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017801451,0.016614867,0.0007811274,0.050768234,0.8921578,0.000050146886,0.0002705419,0.00016524558,0.039014086],"genre_scores_gemma":[0.0026829904,0.010597452,0.0003669359,0.018023366,0.85587806,0.000057095047,0.00048631002,0.00028252281,0.11162523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983797,0.000193881,0.00018827755,0.00036653134,0.00069135125,0.00018019037],"domain_scores_gemma":[0.99479103,0.0014788699,0.00029005847,0.0002716881,0.0020925237,0.0010758542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018066061,0.0021671392,0.0019580696,0.002898503,0.0026842593,0.009093051,0.0015402914,0.005640927,0.11800517],"category_scores_gemma":[0.005620111,0.000570577,0.0017657821,0.0017939354,0.0016526853,0.0058720205,0.0016586478,0.00652991,0.063329056],"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.000014648637,0.000010887365,0.00002879259,0.00011095785,0.000005673075,0.000030891766,0.0000109092225,0.000018676663,0.00008345846,0.0020068483,0.99215686,0.0055215517],"study_design_scores_gemma":[0.000011040442,0.000020700356,0.00025187142,0.00018123616,0.000010381827,0.000113572176,0.000023837281,0.00006967115,0.0000862301,0.004701456,0.9945227,0.0000073150545],"about_ca_topic_score_codex":0.00083238835,"about_ca_topic_score_gemma":0.0013292758,"teacher_disagreement_score":0.11800517,"about_ca_system_score_codex":0.0036142045,"about_ca_system_score_gemma":0.0022745999,"threshold_uncertainty_score":0.39476663},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04525831,0.0050942986,0.072682165,0.012272526,0.004566256,0.00004717229,0.0013965962,0.0003298154,0.8583528],"genre_scores_gemma":[0.67350805,0.0074806996,0.03932938,0.0044816425,0.004053903,0.0001613421,0.0017144037,0.00029238334,0.2689782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996792,0.000087938366,0.000019531304,0.000053920307,0.00011580034,0.00004356234],"domain_scores_gemma":[0.9993449,0.00026496433,0.000061155515,0.00006813756,0.00017460555,0.00008627156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006869776,0.00034061488,0.00027847374,0.0012316381,0.0010954557,0.0022071388,0.000438042,0.00046576172,0.02415602],"category_scores_gemma":[0.0016220665,0.00022443735,0.00040740066,0.001205414,0.0018986941,0.003197499,0.0013424162,0.0022559373,0.0027721676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011497393,0.0000051735656,0.00008458632,0.00002545166,0.0000028098157,0.000037075235,0.00008640348,0.00014111245,0.00022689339,0.988296,0.007237719,0.0038452984],"study_design_scores_gemma":[0.000007805539,0.000012219754,0.00033459082,0.000023711962,0.00000402213,0.000117009695,0.00013202673,0.00041966452,0.00027389987,0.95609,0.04257948,0.00000554168],"about_ca_topic_score_codex":0.0012053732,"about_ca_topic_score_gemma":0.001290968,"teacher_disagreement_score":0.02415602,"about_ca_system_score_codex":0.0009102047,"about_ca_system_score_gemma":0.00073922833,"threshold_uncertainty_score":0.08080989},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009912312,0.838633,0.006684819,0.06840263,0.05011874,0.000065196546,0.00023654895,0.00014125535,0.03472658],"genre_scores_gemma":[0.02956083,0.85614586,0.0051598577,0.02050373,0.04573009,0.00016032033,0.0006525664,0.00023318063,0.041853562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994242,0.0014247868,0.0005011862,0.0003739683,0.0031979107,0.00026011886],"domain_scores_gemma":[0.97602737,0.0066549564,0.0013315968,0.0013449978,0.01364547,0.0009955078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007208484,0.00040991392,0.0009904141,0.007420231,0.00077432627,0.003969607,0.0010911074,0.0016169093,0.009135957],"category_scores_gemma":[0.023927147,0.0003839497,0.00070095324,0.0056539564,0.00274847,0.005883244,0.0019290018,0.0020500019,0.003074462],"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.000040261624,0.00001210583,0.00030029856,0.0031395103,0.000072925315,0.00011914652,0.00023268831,0.00025638493,0.00051229156,0.06196437,0.7636375,0.16971248],"study_design_scores_gemma":[0.000007671511,0.000012905152,0.0003977092,0.0015460508,0.000034054745,0.00017722303,0.00011276042,0.00010735537,0.00013695729,0.017912494,0.9795415,0.000013318692],"about_ca_topic_score_codex":0.003892594,"about_ca_topic_score_gemma":0.0060181622,"teacher_disagreement_score":0.009135957,"about_ca_system_score_codex":0.004295201,"about_ca_system_score_gemma":0.00806697,"threshold_uncertainty_score":0.038122535},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036146652,0.059759453,0.17406799,0.26138017,0.011456596,0.000050564922,0.000818529,0.0004328224,0.45588735],"genre_scores_gemma":[0.52878785,0.058146887,0.07014999,0.047477614,0.030547153,0.0002003493,0.0012987024,0.0006406135,0.2627508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983797,0.000604321,0.0000855061,0.00034287188,0.0004100883,0.00017750017],"domain_scores_gemma":[0.99646497,0.001948814,0.00013593186,0.00065840164,0.0005216966,0.00027022682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031307167,0.00083173066,0.0013103923,0.0025229047,0.003772914,0.0049455306,0.0022037474,0.0035205332,0.032799337],"category_scores_gemma":[0.0061249956,0.00047046278,0.0013229273,0.004033334,0.009326502,0.03313488,0.0034033952,0.00628577,0.003208843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008877708,0.000014784015,0.00008470235,0.000056432757,0.00000532934,0.000029604893,0.00034546052,0.00017288889,0.0000876282,0.98122656,0.010725092,0.007242718],"study_design_scores_gemma":[0.000004860835,0.0000063867665,0.000070923,0.000029661267,0.0000022733875,0.000030710493,0.00017510942,0.00014205076,0.000049945178,0.9703314,0.02914769,0.000009072717],"about_ca_topic_score_codex":0.0025483344,"about_ca_topic_score_gemma":0.003553789,"teacher_disagreement_score":0.032799337,"about_ca_system_score_codex":0.0019559313,"about_ca_system_score_gemma":0.0008416148,"threshold_uncertainty_score":0.1097247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078983806,0.0022221461,0.8066866,0.004285636,0.00046157878,0.00012111876,0.00062540435,0.00081131444,0.10580245],"genre_scores_gemma":[0.8027222,0.0017531381,0.166272,0.0012827995,0.001016151,0.0002159674,0.0006120002,0.00034596943,0.02577975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982646,0.0005711293,0.00016612443,0.00034473083,0.00050212524,0.00015135614],"domain_scores_gemma":[0.99718934,0.0015373715,0.00021997587,0.00044959507,0.00042268267,0.00018109361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466176,0.00056503405,0.00071732636,0.0019322231,0.0021046004,0.005071356,0.0015628166,0.0011376321,0.00710369],"category_scores_gemma":[0.0060196687,0.0008651856,0.0013259774,0.0022912933,0.0070359237,0.014114761,0.0027270203,0.004118082,0.0010041173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004255874,0.0000069855428,0.00007043061,0.000009086785,0.0000021599749,0.000010847398,0.00018942398,0.00010308542,0.00007263459,0.99769294,0.00023713433,0.0016010423],"study_design_scores_gemma":[0.0000062698955,0.0000050185336,0.000056200006,0.0000058981504,0.0000054951643,0.000023968767,0.00005252634,0.00090966816,0.00014579424,0.9962656,0.0025186318,0.000004927261],"about_ca_topic_score_codex":0.0020908825,"about_ca_topic_score_gemma":0.0016227955,"teacher_disagreement_score":0.00710369,"about_ca_system_score_codex":0.0014587715,"about_ca_system_score_gemma":0.0008540672,"threshold_uncertainty_score":0.023764193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39179766,0.0012414211,0.49844596,0.002409042,0.0007800482,0.0002064552,0.0010625644,0.0007448271,0.10331203],"genre_scores_gemma":[0.87493294,0.00069612416,0.10715424,0.00029061918,0.00070403767,0.00018359616,0.00080824003,0.00034487306,0.014885272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510056,0.0012183606,0.00043818628,0.0007624677,0.0017001138,0.00078034366],"domain_scores_gemma":[0.9887334,0.0043676966,0.0013087606,0.0012676688,0.0024278513,0.0018945859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003709559,0.0007900098,0.0010050016,0.0032908234,0.0027175636,0.007199603,0.0011283599,0.00088213047,0.006543582],"category_scores_gemma":[0.009408202,0.0007526934,0.0013141187,0.0020800794,0.0069299927,0.011244678,0.0029653795,0.0031380397,0.0015345329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070680515,0.00003810398,0.000525953,0.000042066353,0.000007886873,0.00010275524,0.0004890931,0.0005052232,0.0024250676,0.99119663,0.0006093681,0.0039872443],"study_design_scores_gemma":[0.000022325548,0.00004059424,0.0002540208,0.00001982708,0.000008396915,0.000109110224,0.00026171538,0.0036170513,0.0019479801,0.9894577,0.0042395545,0.000021657492],"about_ca_topic_score_codex":0.0016024238,"about_ca_topic_score_gemma":0.0017468642,"teacher_disagreement_score":0.007199603,"about_ca_system_score_codex":0.001812085,"about_ca_system_score_gemma":0.0013364608,"threshold_uncertainty_score":0.021890461},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11741786,0.01847493,0.63806665,0.018478723,0.0011027887,0.000083382816,0.00050409866,0.00031241355,0.2055592],"genre_scores_gemma":[0.89552945,0.0031463644,0.08907187,0.0008748081,0.00097522116,0.000113342154,0.00018644881,0.00012853814,0.009973944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712986,0.0014536896,0.00019130133,0.00038375138,0.0006181045,0.00022331908],"domain_scores_gemma":[0.99529546,0.0030990734,0.00028673018,0.0006825384,0.00039607316,0.00024010474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00414087,0.00041100898,0.00083178736,0.003335049,0.0023309195,0.005882828,0.0017374768,0.0018482526,0.003204423],"category_scores_gemma":[0.005260014,0.0006829597,0.0012941875,0.0032630744,0.022005608,0.014252267,0.0035713508,0.004597803,0.00046251543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029126104,0.0000012988983,0.00002549325,0.000009760112,0.0000015728035,0.000009991186,0.00015520286,0.00013259322,0.000040137274,0.9989907,0.000116567375,0.00051376177],"study_design_scores_gemma":[0.0000040197538,0.000004198784,0.00003829417,0.000009944842,0.0000030062295,0.000016220649,0.000055106386,0.0010119202,0.000052188007,0.99541473,0.0033865045,0.0000038088765],"about_ca_topic_score_codex":0.002451886,"about_ca_topic_score_gemma":0.0016880336,"teacher_disagreement_score":0.005882828,"about_ca_system_score_codex":0.0039916565,"about_ca_system_score_gemma":0.0010338667,"threshold_uncertainty_score":0.028961658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37722212,0.0036055676,0.46207488,0.008628979,0.0005931396,0.000069704765,0.0003643627,0.0005429019,0.14689836],"genre_scores_gemma":[0.97415656,0.0005166588,0.019802358,0.0005512265,0.00010073344,0.000024803168,0.000101227866,0.00003653832,0.0047099134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989812,0.00027418073,0.00006906989,0.00022732484,0.00024502396,0.00020317694],"domain_scores_gemma":[0.9982943,0.000816621,0.00017243433,0.00025435796,0.00025812536,0.00020417412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018622571,0.00029693867,0.0004850985,0.0008815238,0.0016285628,0.0050939913,0.0008627376,0.0012183865,0.0044489205],"category_scores_gemma":[0.004019919,0.00019695483,0.0008764902,0.0007721595,0.006971991,0.010917702,0.0017343856,0.0017092559,0.0010510425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012051941,0.000006760262,0.00020410164,0.000019835283,0.0000051984252,0.000046386383,0.00033443677,0.00022507005,0.00040753072,0.99559194,0.00021593376,0.0029306877],"study_design_scores_gemma":[0.0000034141813,0.000012487057,0.00011326192,0.000016374652,0.000008155854,0.00011953857,0.00024363807,0.0010607779,0.0007154477,0.9938292,0.003866949,0.000010850061],"about_ca_topic_score_codex":0.0013162306,"about_ca_topic_score_gemma":0.0007043331,"teacher_disagreement_score":0.0050939913,"about_ca_system_score_codex":0.00088811584,"about_ca_system_score_gemma":0.0006219794,"threshold_uncertainty_score":0.014883101},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010857697,0.29074967,0.15967391,0.21385019,0.013120798,0.00004680426,0.00045660892,0.00037274725,0.31087157],"genre_scores_gemma":[0.6401243,0.107027926,0.12945946,0.03922594,0.019296473,0.00023976024,0.00038345822,0.00039115586,0.063851476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754274,0.0014400411,0.00009019164,0.00023132635,0.000585577,0.000110275614],"domain_scores_gemma":[0.9903604,0.0075957747,0.00034541,0.00070255157,0.00075001427,0.0002457949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003857985,0.0007509964,0.0008498904,0.0028170056,0.0029517878,0.00517608,0.0011150558,0.0027573498,0.003929268],"category_scores_gemma":[0.01024866,0.00075138296,0.00070949865,0.0021838062,0.021623986,0.015404332,0.0033985563,0.0055544665,0.0009405652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055485875,0.000002696728,0.000019087582,0.000018641544,0.0000023823384,0.000008252232,0.00015613034,0.000072100665,0.00004080539,0.9896152,0.006562647,0.0034964636],"study_design_scores_gemma":[0.000005903625,0.000001987667,0.000019255624,0.000026169124,0.0000015868009,0.000024456267,0.000057883375,0.00028512697,0.000072579176,0.97386575,0.025634266,0.0000049428018],"about_ca_topic_score_codex":0.0015241983,"about_ca_topic_score_gemma":0.0019323261,"teacher_disagreement_score":0.00517608,"about_ca_system_score_codex":0.0025157938,"about_ca_system_score_gemma":0.0015329403,"threshold_uncertainty_score":0.020403206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3344915,0.0021867848,0.3997521,0.0048644645,0.00046169988,0.00014842699,0.0006977939,0.0004776345,0.2569196],"genre_scores_gemma":[0.93125635,0.0013839353,0.04295346,0.0010447298,0.0011592915,0.00022890762,0.001024225,0.00019493393,0.020754172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981705,0.00044731007,0.0000876548,0.00043542418,0.00053512165,0.0003239035],"domain_scores_gemma":[0.99337363,0.0043851724,0.00048100238,0.0006911709,0.00047524075,0.0005937961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00290192,0.00070489186,0.0010033542,0.0020824932,0.0026426304,0.0036139318,0.0012922285,0.001304726,0.0076291445],"category_scores_gemma":[0.0066630235,0.00082647847,0.0021983206,0.0013534114,0.0065701474,0.010793462,0.006100357,0.005601095,0.0014239827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006407978,0.00004164954,0.0005303995,0.00004054494,0.000018881725,0.00015190127,0.00029925702,0.0005088247,0.00083555427,0.9931813,0.0008904232,0.003437123],"study_design_scores_gemma":[0.00004018556,0.000029059243,0.00065199303,0.000014473962,0.000023267778,0.00023162494,0.00007385506,0.0030920033,0.0011907138,0.9906284,0.004010765,0.000013681996],"about_ca_topic_score_codex":0.00072027836,"about_ca_topic_score_gemma":0.0005748554,"teacher_disagreement_score":0.0076291445,"about_ca_system_score_codex":0.0015870989,"about_ca_system_score_gemma":0.00066040904,"threshold_uncertainty_score":0.025522053},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11482131,0.012248163,0.40455484,0.012306878,0.0017671464,0.0001363433,0.00074973516,0.00058992015,0.4528257],"genre_scores_gemma":[0.8923197,0.0029672163,0.04109415,0.0010253238,0.0013691958,0.00010476449,0.00050338346,0.00013178146,0.060484502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986791,0.00029576902,0.000116493124,0.0004430411,0.00028415196,0.00018136692],"domain_scores_gemma":[0.9976325,0.0011566504,0.00013222935,0.0004680214,0.00043666226,0.00017390141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020017999,0.00057802116,0.0012846342,0.0016824965,0.0041849455,0.0053546596,0.00091798976,0.0011908743,0.012710795],"category_scores_gemma":[0.0041725957,0.00092130504,0.0011937022,0.002098156,0.01027392,0.019353816,0.0026802565,0.0036510555,0.001493165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007859922,0.000008140828,0.000046173656,0.00000878609,0.0000022589068,0.000016279537,0.00019274138,0.000052343818,0.00005428583,0.99699557,0.0005385041,0.0020771292],"study_design_scores_gemma":[0.0000049800706,0.0000023931996,0.000036211357,0.0000030723431,0.0000022398442,0.000031906835,0.000037543632,0.00015577572,0.000050332397,0.9962567,0.0034163727,0.0000024563303],"about_ca_topic_score_codex":0.002180713,"about_ca_topic_score_gemma":0.0019010847,"teacher_disagreement_score":0.012710795,"about_ca_system_score_codex":0.0017149682,"about_ca_system_score_gemma":0.001197526,"threshold_uncertainty_score":0.042521775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6146016,0.0007819477,0.25974992,0.00060004886,0.0001595034,0.00018190306,0.0015306267,0.0017134205,0.120681055],"genre_scores_gemma":[0.9501911,0.0003199416,0.031869315,0.00010008899,0.00004642795,0.000101613114,0.00093884417,0.00047018618,0.015962427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998357,0.00023074457,0.00006190714,0.00041057888,0.0004010227,0.0005386535],"domain_scores_gemma":[0.99669254,0.0011792643,0.00023663507,0.0007752827,0.0005719111,0.0005443113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089622085,0.0004938659,0.00072152703,0.0017557123,0.0022188448,0.005452708,0.0013449494,0.0010351499,0.014695795],"category_scores_gemma":[0.0072643803,0.0004991714,0.0008051236,0.0012842678,0.0026628063,0.004924136,0.0026445026,0.0010415869,0.0019781063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010130312,0.000025912252,0.0011526379,0.000038623428,0.00000907887,0.00012367089,0.0004221974,0.0035935752,0.0023903504,0.98293555,0.0014742428,0.0077329087],"study_design_scores_gemma":[0.000016327123,0.000021836608,0.0004948404,0.000020789455,0.000016179654,0.00020976813,0.00040459147,0.024998732,0.0051563354,0.9621139,0.0065195803,0.000027102773],"about_ca_topic_score_codex":0.0019761408,"about_ca_topic_score_gemma":0.0027979307,"teacher_disagreement_score":0.014695795,"about_ca_system_score_codex":0.0019286162,"about_ca_system_score_gemma":0.0010522221,"threshold_uncertainty_score":0.04916233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7053757,0.0022805713,0.24139424,0.0018927564,0.00040494202,0.000099102144,0.00047760902,0.0006519537,0.047423143],"genre_scores_gemma":[0.9840831,0.00039588124,0.010882303,0.00019748,0.00024342793,0.000060547613,0.0001874427,0.00007204224,0.0038777243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963965,0.000794268,0.00037094706,0.00093012664,0.0007957601,0.00071243674],"domain_scores_gemma":[0.99169934,0.0033973942,0.0007920383,0.0012708902,0.001321005,0.0015193644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049559134,0.00062308146,0.0014207087,0.00470514,0.0048244144,0.0074514863,0.001918045,0.0017921441,0.0040352],"category_scores_gemma":[0.00889402,0.0012261342,0.0019828056,0.0029987681,0.011006702,0.014368884,0.006880877,0.003888403,0.00038932337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023720311,0.000016884153,0.00044703027,0.00002399262,0.0000102921385,0.00006742393,0.00074697414,0.00012924713,0.00045763628,0.9961914,0.0001663418,0.0017190806],"study_design_scores_gemma":[0.000010548018,0.0000145478125,0.00024395794,0.0000116030415,0.000014285356,0.0000940036,0.0001933298,0.0007527973,0.0004411719,0.9972888,0.00091971754,0.00001520297],"about_ca_topic_score_codex":0.001146717,"about_ca_topic_score_gemma":0.0009955805,"teacher_disagreement_score":0.0074514863,"about_ca_system_score_codex":0.0021592705,"about_ca_system_score_gemma":0.0013930764,"threshold_uncertainty_score":0.026209712},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50785893,0.0037020494,0.35136035,0.002013906,0.00040691407,0.0001254314,0.00040814554,0.0006131304,0.13351116],"genre_scores_gemma":[0.92059326,0.0008080875,0.06939105,0.00042231655,0.00023178253,0.00008153809,0.00018516042,0.00006326528,0.008223499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988323,0.00030193228,0.00009447053,0.00025846873,0.00032661736,0.00018626788],"domain_scores_gemma":[0.9974286,0.0010264423,0.00036713344,0.0003924893,0.0004280354,0.00035724888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016363163,0.00029706553,0.00038061987,0.0016984879,0.0016216448,0.0023109105,0.0006165213,0.0009190237,0.0029753721],"category_scores_gemma":[0.00364232,0.00033426392,0.000947081,0.0016181523,0.005192284,0.0067749307,0.0020058851,0.0015761526,0.0003532099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009814727,0.00000363714,0.00027078803,0.000010850132,0.0000021759176,0.000038810485,0.00039384197,0.00019808633,0.0007950248,0.9948513,0.00021245338,0.003213211],"study_design_scores_gemma":[0.000008766414,0.000031948475,0.0010369556,0.000023634084,0.000008130511,0.00019356351,0.0003245814,0.0018691716,0.002149497,0.97903425,0.0153009845,0.000018424422],"about_ca_topic_score_codex":0.002059008,"about_ca_topic_score_gemma":0.0016303608,"teacher_disagreement_score":0.0029753721,"about_ca_system_score_codex":0.0015128497,"about_ca_system_score_gemma":0.0006838565,"threshold_uncertainty_score":0.010976613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7451924,0.0011845485,0.17045143,0.002645775,0.0001272831,0.000071126,0.0006474256,0.0009093334,0.07877062],"genre_scores_gemma":[0.9832423,0.00019009018,0.007071742,0.00011821882,0.000075115364,0.000027527345,0.0002772871,0.000058894657,0.008938824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886096,0.00024119088,0.000044464738,0.00031395096,0.00026490848,0.00027459074],"domain_scores_gemma":[0.9974841,0.0010722806,0.00031549385,0.00036362503,0.00036480773,0.00039967298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087266846,0.0005812371,0.00068979297,0.001093906,0.0020466216,0.0030448863,0.0012665577,0.0005815385,0.009261527],"category_scores_gemma":[0.0028458012,0.00047399863,0.0011166487,0.0008041046,0.003936688,0.007957349,0.0028757723,0.0029798057,0.0013263703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008560162,0.00003128501,0.000833082,0.000059068017,0.000013218387,0.00015487536,0.0006877139,0.0017038527,0.0015933065,0.99017835,0.00086361123,0.0037959744],"study_design_scores_gemma":[0.000034778695,0.00006565309,0.0008609644,0.000021309315,0.000032635526,0.00020398587,0.00035865343,0.008685173,0.0028775276,0.982369,0.004461403,0.000028975528],"about_ca_topic_score_codex":0.00253256,"about_ca_topic_score_gemma":0.0017864242,"teacher_disagreement_score":0.009261527,"about_ca_system_score_codex":0.002540415,"about_ca_system_score_gemma":0.00083979557,"threshold_uncertainty_score":0.030982852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6352506,0.001282262,0.20658015,0.0016994462,0.00055585074,0.000100076264,0.0003897381,0.00058221887,0.15355961],"genre_scores_gemma":[0.97187567,0.00033339838,0.012318273,0.00024014221,0.00030704492,0.000047276073,0.00023055014,0.00008253803,0.014565098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923027,0.00015395576,0.00004021994,0.00012307325,0.00027385133,0.0001785836],"domain_scores_gemma":[0.99896085,0.00022771055,0.00010498152,0.00011439539,0.00021274283,0.0003792918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016891315,0.00054756907,0.00074373797,0.0023163203,0.0026500518,0.0037561988,0.0010864767,0.0006822392,0.0047150296],"category_scores_gemma":[0.0019461699,0.0005216967,0.0007767066,0.0011186039,0.0037372361,0.0044353083,0.00247186,0.002952735,0.0006058906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003715539,0.00003176857,0.00011303761,0.000013026298,0.000004638866,0.000031384654,0.0002573498,0.00019423617,0.0007351417,0.9961533,0.00034099573,0.0020879002],"study_design_scores_gemma":[0.000019835337,0.0000111476775,0.000094497525,0.0000060993425,0.0000058288315,0.000041933385,0.00012443577,0.001264375,0.0007580706,0.996079,0.0015856948,0.000009125947],"about_ca_topic_score_codex":0.0007469395,"about_ca_topic_score_gemma":0.0010074913,"teacher_disagreement_score":0.0047150296,"about_ca_system_score_codex":0.0013641767,"about_ca_system_score_gemma":0.00066678645,"threshold_uncertainty_score":0.015773356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6191101,0.0024142473,0.18810603,0.0015616127,0.0006338099,0.00009418718,0.0006455071,0.00048334795,0.18695115],"genre_scores_gemma":[0.96041363,0.00063492014,0.019397907,0.0002343101,0.00031385865,0.000057514426,0.00039416342,0.00008496012,0.018468723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994136,0.00012857492,0.000036676433,0.000098353245,0.00016870757,0.0001541027],"domain_scores_gemma":[0.9993647,0.00015450732,0.0000719402,0.00008315672,0.00011258951,0.00021312822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048305,0.00036078898,0.000575791,0.0017254049,0.0017505401,0.003156577,0.00064334157,0.00040214194,0.005241026],"category_scores_gemma":[0.0012127784,0.00041621228,0.0005402463,0.0010040168,0.0023621956,0.003745789,0.0022385346,0.0017903099,0.00064619404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003999634,0.000029144252,0.00015158483,0.000021361388,0.0000057770512,0.000027734737,0.00027679527,0.00019574075,0.0007758548,0.9925925,0.00072756165,0.005155956],"study_design_scores_gemma":[0.00002235697,0.00001428155,0.00018933382,0.000010907749,0.0000073630044,0.00006572477,0.0001894169,0.0008443365,0.0007625534,0.99294853,0.0049346047,0.000010669389],"about_ca_topic_score_codex":0.00042526127,"about_ca_topic_score_gemma":0.00069445075,"teacher_disagreement_score":0.005241026,"about_ca_system_score_codex":0.0007967614,"about_ca_system_score_gemma":0.00047023146,"threshold_uncertainty_score":0.017533004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3267509,0.009478765,0.45312548,0.016369672,0.0022906803,0.0000840005,0.0010562558,0.0006230014,0.1902213],"genre_scores_gemma":[0.93689054,0.0034160567,0.033292692,0.0018380722,0.002480177,0.00012002293,0.00045537215,0.00033141795,0.02117555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802434,0.00039457038,0.00018906471,0.0005858362,0.00050166744,0.00030453943],"domain_scores_gemma":[0.9939312,0.003557902,0.0004001451,0.0011914524,0.0004798237,0.0004395126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037414883,0.0011027772,0.0019212454,0.00377214,0.002343817,0.0038201534,0.0026741566,0.0020436593,0.0074997908],"category_scores_gemma":[0.009930969,0.0010472578,0.0028952055,0.0035067762,0.009254739,0.026826773,0.006537887,0.008958362,0.000816882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002769203,0.000010786935,0.00017333271,0.000031501604,0.000009587749,0.000060344773,0.00019877129,0.00040433108,0.00033602,0.99576217,0.0005646804,0.0024207265],"study_design_scores_gemma":[0.00000696453,0.0000046221935,0.00012797199,0.0000053424988,0.0000062751496,0.000036403104,0.000024625182,0.00085858617,0.00010628724,0.9975836,0.0012300428,0.000009215616],"about_ca_topic_score_codex":0.0024638155,"about_ca_topic_score_gemma":0.0011410622,"teacher_disagreement_score":0.0074997908,"about_ca_system_score_codex":0.002545398,"about_ca_system_score_gemma":0.00096470886,"threshold_uncertainty_score":0.025089264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33947337,0.0022025316,0.49893138,0.0039175027,0.00070475193,0.0001858121,0.0009223929,0.001564662,0.15209755],"genre_scores_gemma":[0.9446507,0.0009826104,0.026494998,0.00081145996,0.0005148086,0.00016550256,0.0011284717,0.0006629775,0.024588272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621373,0.0007984981,0.00032443536,0.0011279986,0.00089715165,0.00063818804],"domain_scores_gemma":[0.9879666,0.0063651334,0.00082128175,0.0025257939,0.0011157927,0.001205455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030973607,0.00090112607,0.0015673476,0.0019316889,0.002817772,0.0057657408,0.0020021552,0.0021354477,0.014072211],"category_scores_gemma":[0.010534602,0.0015301612,0.0022083204,0.001851417,0.007450259,0.027514284,0.007242583,0.0050972593,0.0018678601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013220907,0.000045433786,0.0006574486,0.00005807934,0.00002429503,0.00017626506,0.0006020265,0.00034055262,0.0009234405,0.9888925,0.0009679571,0.0071798214],"study_design_scores_gemma":[0.00003740781,0.00003259903,0.00039252004,0.00001972402,0.000028626448,0.00021414258,0.00029200842,0.002720886,0.0017132133,0.9912441,0.0032837698,0.000021088625],"about_ca_topic_score_codex":0.0011433123,"about_ca_topic_score_gemma":0.0012378396,"teacher_disagreement_score":0.014072211,"about_ca_system_score_codex":0.00093665806,"about_ca_system_score_gemma":0.0011510809,"threshold_uncertainty_score":0.047076225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79650795,0.0038705815,0.14190686,0.0073564188,0.0003902641,0.00013625804,0.0025317902,0.00037470265,0.04692521],"genre_scores_gemma":[0.96336716,0.0016345836,0.027822454,0.00038955983,0.00070462044,0.0001784857,0.001161951,0.00018909466,0.004552143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952923,0.001518917,0.0003772065,0.0011548272,0.000996802,0.000660037],"domain_scores_gemma":[0.8318157,0.14299622,0.009272355,0.0052355765,0.0035656386,0.007114482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007437114,0.0011203986,0.0021856,0.004976392,0.002868357,0.0065947743,0.004390708,0.003042149,0.01154246],"category_scores_gemma":[0.046453245,0.0018559836,0.0014961212,0.0040229345,0.009834842,0.021277083,0.0036507729,0.0040421165,0.0006213884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013317984,0.00021048874,0.015619485,0.0004548467,0.00018774894,0.00032784836,0.0010168243,0.021013774,0.0065519917,0.92731947,0.004459684,0.02150596],"study_design_scores_gemma":[0.00012441282,0.00008817058,0.0035168766,0.00009285496,0.000106451946,0.0004399491,0.00034873356,0.0370257,0.0021756245,0.95402455,0.0019919418,0.00006478143],"about_ca_topic_score_codex":0.0011474447,"about_ca_topic_score_gemma":0.0015587972,"teacher_disagreement_score":0.01154246,"about_ca_system_score_codex":0.0024581733,"about_ca_system_score_gemma":0.0014478003,"threshold_uncertainty_score":0.039331675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13023339,0.013318172,0.5607754,0.020678625,0.005679339,0.00018911841,0.0012546573,0.00090572756,0.26696557],"genre_scores_gemma":[0.68871105,0.010015755,0.22532597,0.0051426454,0.006686678,0.0002956838,0.00085773075,0.00047989137,0.06248458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987703,0.00036824064,0.00010097552,0.00023929607,0.00036311845,0.00015801445],"domain_scores_gemma":[0.99708766,0.0018747766,0.00011287883,0.00032288325,0.00032865015,0.00027315103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002828854,0.0008129424,0.0011413015,0.0018369587,0.003087133,0.0038732472,0.0015016233,0.0012811456,0.006794728],"category_scores_gemma":[0.0034297444,0.000804376,0.0017505452,0.0031550664,0.006256091,0.016275438,0.0035997252,0.0063596126,0.0008629859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002710824,0.000011717999,0.000075556614,0.000042937118,0.0000041012263,0.00008316738,0.00026749008,0.00024601954,0.00078793836,0.99278015,0.002067918,0.003605897],"study_design_scores_gemma":[0.000007921638,0.000018118257,0.00012317993,0.000013123563,0.000009430335,0.00009909479,0.00012137584,0.0012591648,0.000645929,0.9853833,0.01230719,0.000012242881],"about_ca_topic_score_codex":0.0023653384,"about_ca_topic_score_gemma":0.0039691166,"teacher_disagreement_score":0.006794728,"about_ca_system_score_codex":0.0025593403,"about_ca_system_score_gemma":0.0012890047,"threshold_uncertainty_score":0.022730589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37100336,0.0023093007,0.5849275,0.0013139365,0.00010983853,0.000079774385,0.00019924444,0.00018743397,0.039869577],"genre_scores_gemma":[0.8890064,0.0014383851,0.09627163,0.0003188521,0.0002495097,0.00015085831,0.00023273122,0.00008752234,0.01224419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985286,0.00052190624,0.00008606983,0.0003328152,0.00033880537,0.00019178263],"domain_scores_gemma":[0.99456394,0.00340862,0.00044334063,0.00031897565,0.0007165811,0.0005485475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004063631,0.000621897,0.00091230153,0.002617148,0.001521155,0.0023567933,0.0007941418,0.0011551247,0.003430714],"category_scores_gemma":[0.007451465,0.00037495018,0.0010880438,0.0018555615,0.004692244,0.0069939494,0.0026075742,0.0018634868,0.00024946217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052912234,0.000031404874,0.0011330857,0.00007122903,0.000021678634,0.00018796818,0.0005713662,0.0048940317,0.0013542676,0.9838771,0.0002385065,0.007566458],"study_design_scores_gemma":[0.0000197904,0.00014750767,0.0012812383,0.000057160607,0.000026145612,0.00037531144,0.00047924914,0.047091164,0.0024062658,0.9437378,0.004342951,0.000035397148],"about_ca_topic_score_codex":0.0016470036,"about_ca_topic_score_gemma":0.0015554908,"teacher_disagreement_score":0.004063631,"about_ca_system_score_codex":0.0015744144,"about_ca_system_score_gemma":0.00065232214,"threshold_uncertainty_score":0.021490812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3065019,0.0082761105,0.34139702,0.010324199,0.0021291259,0.00007297784,0.00035938976,0.00086776755,0.33007148],"genre_scores_gemma":[0.904632,0.0026879457,0.036302563,0.001423419,0.0029917692,0.000100483056,0.00025790697,0.00026331746,0.05134059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994294,0.00015293797,0.000028154567,0.000116117066,0.0001964135,0.00007691355],"domain_scores_gemma":[0.99870193,0.00059905933,0.00019109834,0.00019700939,0.00015348288,0.00015744452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010834474,0.00092222454,0.00095848815,0.002439018,0.0016533966,0.003076547,0.0011057114,0.0018773127,0.008712249],"category_scores_gemma":[0.0032773053,0.00056865776,0.00096566015,0.0016632179,0.00557805,0.007207692,0.0019134297,0.0037701388,0.0008289708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003888443,0.000004107935,0.000021413094,0.000005173614,0.0000013437716,0.000016854361,0.000032222943,0.00014656826,0.00013368209,0.99829143,0.0003515743,0.0009916978],"study_design_scores_gemma":[0.0000033840217,0.0000021654268,0.000048991387,0.0000015084682,0.0000013313696,0.000032534026,0.000015054912,0.0009871125,0.000049221755,0.998092,0.00076322677,0.0000035300384],"about_ca_topic_score_codex":0.0005397314,"about_ca_topic_score_gemma":0.0005992548,"teacher_disagreement_score":0.008712249,"about_ca_system_score_codex":0.0010390022,"about_ca_system_score_gemma":0.00043641383,"threshold_uncertainty_score":0.02914542},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026585493,0.004754636,0.38741636,0.09230396,0.0044862153,0.00015388559,0.0011533224,0.0020355154,0.48111048],"genre_scores_gemma":[0.7606628,0.0029488062,0.101496235,0.02296502,0.0069286376,0.00040853748,0.00071942824,0.0012069794,0.10266359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715257,0.0005695803,0.00018233707,0.0009171886,0.00082303997,0.00035524007],"domain_scores_gemma":[0.9937742,0.0023356965,0.00027958903,0.0019729892,0.0011672365,0.0004702543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037532253,0.00047866532,0.0013855373,0.0014461942,0.005844229,0.008718742,0.0019355826,0.004195774,0.02064795],"category_scores_gemma":[0.013141724,0.00061700685,0.0015860519,0.0012676404,0.018321797,0.03027698,0.004949925,0.008866907,0.004494664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067468764,0.0000042936413,0.000057174355,0.00001626944,0.0000033122858,0.000010566031,0.00011589135,0.000028069471,0.000074407595,0.9942017,0.0032786273,0.0022030342],"study_design_scores_gemma":[0.000011355048,0.0000046328287,0.000046217807,0.000015471152,0.000004348161,0.00003875784,0.000075645876,0.00015999682,0.0001620631,0.98191696,0.017556638,0.000007784327],"about_ca_topic_score_codex":0.002229782,"about_ca_topic_score_gemma":0.001969116,"teacher_disagreement_score":0.02064795,"about_ca_system_score_codex":0.002323104,"about_ca_system_score_gemma":0.002060299,"threshold_uncertainty_score":0.06907427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75575906,0.0010083207,0.15201199,0.0007092122,0.00023414384,0.00008385961,0.0002064248,0.00041515933,0.08957181],"genre_scores_gemma":[0.9779585,0.00014884463,0.0150970025,0.0000823167,0.00017545912,0.000026003403,0.0000989022,0.000023738337,0.006389322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989644,0.0002430957,0.00006287525,0.00018435883,0.0003733624,0.00017185835],"domain_scores_gemma":[0.998838,0.00019296206,0.00021033108,0.00014228783,0.00029004493,0.0003264486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258872,0.00019168755,0.00042970487,0.0006893487,0.00093863276,0.0020876375,0.0005258141,0.00025350827,0.0039252075],"category_scores_gemma":[0.001333847,0.00020885005,0.00043124286,0.00034205482,0.0025124121,0.003364631,0.0014575662,0.00073687924,0.00072539755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012016375,0.000049002734,0.0013506194,0.000042148833,0.000018259472,0.00020184553,0.0004878754,0.0006572357,0.0076838825,0.98182344,0.00064028107,0.0069252057],"study_design_scores_gemma":[0.00008640906,0.00029188822,0.0034190456,0.000049350274,0.00005258863,0.0016144268,0.0008943636,0.015289162,0.019664852,0.9154468,0.043134347,0.00005660741],"about_ca_topic_score_codex":0.00028758522,"about_ca_topic_score_gemma":0.00018403867,"teacher_disagreement_score":0.0039252075,"about_ca_system_score_codex":0.0004521415,"about_ca_system_score_gemma":0.000426544,"threshold_uncertainty_score":0.013131142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56055266,0.0061535127,0.12692294,0.0063203084,0.0009426585,0.0000700388,0.00057704205,0.00058477017,0.29787606],"genre_scores_gemma":[0.9719124,0.00082719827,0.005170562,0.00026716568,0.00028189534,0.00002618407,0.00018107319,0.000068916524,0.021264652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909294,0.00026719674,0.000055317763,0.00020797497,0.00017819808,0.00019844182],"domain_scores_gemma":[0.998713,0.000533566,0.00012708578,0.00023240109,0.00016935167,0.0002247256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224673,0.0005539704,0.0009222917,0.0020920357,0.0038529981,0.0044824784,0.0010054494,0.0012610309,0.010913867],"category_scores_gemma":[0.0037527045,0.0006731674,0.0005764493,0.0033020033,0.00660378,0.010705377,0.0029941981,0.003729698,0.0009977462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016655751,0.000006230207,0.00011807796,0.0000072734238,0.0000026272646,0.00003485428,0.00022003452,0.00012020376,0.0001116399,0.99673444,0.00045807858,0.002169903],"study_design_scores_gemma":[0.0000048261077,0.000002913252,0.00007638116,0.0000032821956,0.000002292776,0.000025387975,0.00006695242,0.00015643741,0.000092336464,0.99818027,0.0013849981,0.000004068411],"about_ca_topic_score_codex":0.0011852742,"about_ca_topic_score_gemma":0.0013557406,"teacher_disagreement_score":0.010913867,"about_ca_system_score_codex":0.001426656,"about_ca_system_score_gemma":0.000579535,"threshold_uncertainty_score":0.036510587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41833565,0.0016095637,0.2845475,0.0021398007,0.0009828267,0.0001862373,0.0012739486,0.0013306873,0.2895937],"genre_scores_gemma":[0.91934484,0.00054599624,0.024689602,0.00039454282,0.00035631075,0.00015053336,0.00082460186,0.0005485599,0.053145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778384,0.00047968578,0.00012242368,0.0005783296,0.0004105432,0.0006252274],"domain_scores_gemma":[0.99787426,0.0007008909,0.00015154952,0.00042497565,0.00037885088,0.00046947834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346953,0.0009787476,0.00135885,0.0033302421,0.005163276,0.008144491,0.0013390764,0.0014162246,0.018169457],"category_scores_gemma":[0.0033033737,0.0012536239,0.0015869432,0.0027288664,0.0063030384,0.0124670705,0.0055452455,0.0036001327,0.0026296733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014647012,0.0000051056027,0.0000640332,0.0000075600046,0.0000019828494,0.000014086122,0.0001763968,0.0000647252,0.00011309827,0.99793184,0.0003762037,0.0012303365],"study_design_scores_gemma":[0.000008086183,0.000005094102,0.00009878796,0.000009020866,0.0000073673014,0.000049054182,0.00018521279,0.00055663625,0.00031700547,0.9951846,0.0035700735,0.000009144155],"about_ca_topic_score_codex":0.0016901788,"about_ca_topic_score_gemma":0.002375574,"teacher_disagreement_score":0.018169457,"about_ca_system_score_codex":0.0024755134,"about_ca_system_score_gemma":0.0010841385,"threshold_uncertainty_score":0.06078291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96064705,0.00040094348,0.015989374,0.0005405036,0.00005497089,0.000040155937,0.00028609956,0.000100059275,0.02194096],"genre_scores_gemma":[0.99552625,0.00007862067,0.0021571647,0.000052047122,0.000044260625,0.000013970391,0.00016737543,0.0000060219963,0.0019542072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909043,0.00016412156,0.00005839185,0.00017500031,0.00020333214,0.0003087989],"domain_scores_gemma":[0.99749655,0.00092288794,0.0005861745,0.00023992629,0.0001998444,0.00055453996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005385163,0.00027202646,0.00048317938,0.0012639596,0.0013938149,0.0028500666,0.0004527345,0.000905227,0.0042863153],"category_scores_gemma":[0.0014435593,0.00023423428,0.0004918266,0.0011033219,0.0029241533,0.0025144971,0.000985195,0.0007072965,0.00018140842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004804733,0.00015019695,0.01298366,0.000070654234,0.000044198146,0.00031916672,0.0007809491,0.004248968,0.004136314,0.9582357,0.0030658522,0.015483866],"study_design_scores_gemma":[0.00017013552,0.00029643482,0.016643615,0.00006212006,0.000038840535,0.00082526734,0.0007081173,0.017548772,0.0021226346,0.94687116,0.014657568,0.00005546787],"about_ca_topic_score_codex":0.0033932598,"about_ca_topic_score_gemma":0.003810801,"teacher_disagreement_score":0.0042863153,"about_ca_system_score_codex":0.0014653242,"about_ca_system_score_gemma":0.000515247,"threshold_uncertainty_score":0.014339149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67685866,0.0006829102,0.26334947,0.0038780186,0.00038610215,0.00011461154,0.0005084579,0.00037643922,0.053845365],"genre_scores_gemma":[0.9571854,0.00029078257,0.033947878,0.00015651516,0.0003646991,0.00011107524,0.0003184601,0.00010822368,0.0075170286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957831,0.0011165516,0.0003372155,0.00085503067,0.0011469213,0.00076121144],"domain_scores_gemma":[0.9738264,0.01865768,0.0018557735,0.0017602254,0.0013511402,0.002548666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007453013,0.00088241376,0.0019591574,0.0030076555,0.0054810573,0.010699591,0.0031588809,0.0023950087,0.007142329],"category_scores_gemma":[0.018417774,0.0010397444,0.0013542823,0.0026449137,0.011681537,0.019914487,0.0047659692,0.005345157,0.000531612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019114566,0.00005090191,0.0008139841,0.000028432843,0.000008071553,0.00006358099,0.0003947967,0.0011399856,0.0007679391,0.9926709,0.0004124998,0.0034577698],"study_design_scores_gemma":[0.00003771946,0.000024282965,0.00026792867,0.000016243157,0.000014948178,0.00008942064,0.00017538444,0.009771655,0.00085964246,0.9878699,0.0008543248,0.000018623936],"about_ca_topic_score_codex":0.0013772065,"about_ca_topic_score_gemma":0.0014643924,"teacher_disagreement_score":0.010699591,"about_ca_system_score_codex":0.0031467285,"about_ca_system_score_gemma":0.0015749413,"threshold_uncertainty_score":0.039415777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6260079,0.0011751631,0.22324365,0.0023650187,0.0009780342,0.00018992614,0.0011067401,0.0016550801,0.14327848],"genre_scores_gemma":[0.96808183,0.00014385414,0.011894663,0.000391684,0.00021042976,0.000062133615,0.00047160828,0.00032023183,0.01842365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766314,0.00034689045,0.00017038458,0.00047554864,0.0005125232,0.0008315115],"domain_scores_gemma":[0.9970487,0.0007545251,0.00045984605,0.0006118786,0.0006452995,0.00047975627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019003927,0.0005736338,0.0012533183,0.002614563,0.004899916,0.005893214,0.001402587,0.0019037947,0.009549711],"category_scores_gemma":[0.0054600798,0.0010862678,0.001566715,0.0024409043,0.004369892,0.012458068,0.0047509167,0.0038592645,0.0012542964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015464089,0.0000437699,0.00090684125,0.00006125216,0.000030057803,0.00021460674,0.0007420898,0.00018659642,0.0025439165,0.989953,0.0008590547,0.0043041017],"study_design_scores_gemma":[0.00004558116,0.0000260662,0.00067756034,0.000025599067,0.00005487101,0.00042819357,0.0005554191,0.0018225425,0.004490044,0.9842144,0.007618699,0.000040901574],"about_ca_topic_score_codex":0.0015853484,"about_ca_topic_score_gemma":0.0016567941,"teacher_disagreement_score":0.009549711,"about_ca_system_score_codex":0.001577142,"about_ca_system_score_gemma":0.0010956972,"threshold_uncertainty_score":0.031946957},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05765561,0.024025517,0.2095072,0.03954105,0.004197856,0.00010760484,0.0011712525,0.0007698569,0.66302407],"genre_scores_gemma":[0.82668006,0.0067132246,0.04964854,0.0030345656,0.0029861175,0.00027643173,0.0006645351,0.00025648688,0.10974005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787045,0.00074795104,0.00016640825,0.00049740676,0.00054144126,0.00017632222],"domain_scores_gemma":[0.9973139,0.0012044939,0.00019737492,0.0006503079,0.00036319566,0.00027068512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017557472,0.0007623342,0.0010844221,0.0032167118,0.0037795387,0.011318817,0.0014672575,0.0017759461,0.020279212],"category_scores_gemma":[0.0050978903,0.0006314718,0.0008700888,0.0035442763,0.010143239,0.02392025,0.0043526134,0.004976276,0.002616384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025270829,0.0000019665217,0.000024568717,0.000008128076,0.0000015644305,0.000003246603,0.000110247944,0.00002537391,0.000018733383,0.9975483,0.0006149922,0.0016403389],"study_design_scores_gemma":[0.0000036951128,0.0000020161897,0.000035190667,0.0000070060555,0.00000423071,0.000030084677,0.000098383796,0.00012930862,0.000037725098,0.9848887,0.014761174,0.0000026107139],"about_ca_topic_score_codex":0.00094239146,"about_ca_topic_score_gemma":0.0010136314,"teacher_disagreement_score":0.020279212,"about_ca_system_score_codex":0.0021035362,"about_ca_system_score_gemma":0.0007696691,"threshold_uncertainty_score":0.067840695},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062232234,0.009638549,0.39008868,0.028518997,0.0081422115,0.00005646069,0.0004135989,0.00048195684,0.50042737],"genre_scores_gemma":[0.7967481,0.00898042,0.072174594,0.007471856,0.010361193,0.00011875066,0.0004054235,0.0004078091,0.10333186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999166,0.00020470897,0.000056973604,0.00015207558,0.00028655658,0.00013370597],"domain_scores_gemma":[0.99896145,0.00055110536,0.000068238325,0.00017798528,0.00014980347,0.00009140951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018171179,0.0006480069,0.0008428619,0.0013067101,0.0025106347,0.0030690623,0.001869301,0.0016669894,0.008979172],"category_scores_gemma":[0.002714615,0.0005141184,0.0016129651,0.0013724334,0.006942053,0.010843844,0.0037069903,0.0061698714,0.0014823067],"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.00000416601,0.0000039309007,0.000028961284,0.000011197591,0.000001606048,0.000020775136,0.00007989644,0.000095259435,0.00010699006,0.9970366,0.0014181079,0.0011925455],"study_design_scores_gemma":[0.000003071828,0.000003557556,0.000038436265,0.0000068753375,0.0000023718374,0.00002952212,0.000015974087,0.00044072734,0.000105128674,0.99274194,0.006608165,0.0000042909046],"about_ca_topic_score_codex":0.0011638658,"about_ca_topic_score_gemma":0.0014356804,"teacher_disagreement_score":0.008979172,"about_ca_system_score_codex":0.0013256788,"about_ca_system_score_gemma":0.00070890994,"threshold_uncertainty_score":0.030038297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5347766,0.0010133405,0.25980031,0.0010360361,0.000699998,0.000110067755,0.00026705748,0.0003827887,0.20191382],"genre_scores_gemma":[0.92608595,0.0006009028,0.024062641,0.0003412402,0.00035664975,0.00007863832,0.00020828248,0.00013599174,0.048129655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989637,0.00019266712,0.00005503469,0.00021575575,0.00031073895,0.00026212525],"domain_scores_gemma":[0.9985273,0.00062232796,0.00018061051,0.00018076817,0.00015640988,0.00033258853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012828057,0.0007936799,0.0008107136,0.0017977818,0.0026907658,0.003002327,0.0010549689,0.00071591267,0.007983927],"category_scores_gemma":[0.0024192987,0.00055785803,0.0009246062,0.0018743754,0.0050631845,0.005804926,0.0043247207,0.002132572,0.0011798897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005091163,0.000022657188,0.00019346914,0.00001868057,0.000005593401,0.00009371228,0.00020958162,0.00051223155,0.00088696415,0.9912634,0.0005743917,0.006168388],"study_design_scores_gemma":[0.000019364594,0.000025567215,0.0003004026,0.000015010579,0.000008815609,0.00012837694,0.000091348644,0.0026268538,0.0009462108,0.99197197,0.0038549257,0.000011081383],"about_ca_topic_score_codex":0.00086901546,"about_ca_topic_score_gemma":0.0011662896,"teacher_disagreement_score":0.007983927,"about_ca_system_score_codex":0.0014439621,"about_ca_system_score_gemma":0.0005355194,"threshold_uncertainty_score":0.0267089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51597005,0.002012663,0.21197045,0.006145132,0.000571974,0.00023351966,0.0013307407,0.0007107423,0.26105466],"genre_scores_gemma":[0.96528727,0.0005656462,0.017867029,0.0006894738,0.000347919,0.00013449724,0.00074504723,0.00012798322,0.014235101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998464,0.00034422977,0.00011497619,0.000286839,0.00038022868,0.00040982987],"domain_scores_gemma":[0.9952009,0.0023393608,0.00046781704,0.00042748445,0.0007801396,0.00078429165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651055,0.00066101766,0.0012323034,0.0038016522,0.0037468176,0.0046980623,0.001470632,0.0022155757,0.012823713],"category_scores_gemma":[0.0077298926,0.0006984017,0.0014098233,0.0026853303,0.0048884805,0.00896582,0.0042977817,0.0040990044,0.0012985014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036815505,0.000019390698,0.00024451516,0.00001692287,0.0000057233688,0.00005129311,0.00013881378,0.00018112104,0.00046623833,0.9965313,0.00068836036,0.0016195485],"study_design_scores_gemma":[0.000018923773,0.000016147105,0.000316611,0.000016267728,0.000009447338,0.00007703736,0.00019867164,0.0022621527,0.00081747194,0.9940042,0.0022465272,0.000016543034],"about_ca_topic_score_codex":0.0010443446,"about_ca_topic_score_gemma":0.0012178365,"teacher_disagreement_score":0.012823713,"about_ca_system_score_codex":0.00218738,"about_ca_system_score_gemma":0.0013419578,"threshold_uncertainty_score":0.04289955},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10977061,0.009970402,0.23412105,0.0481215,0.0034061493,0.00010522837,0.00097040494,0.0004999181,0.5930347],"genre_scores_gemma":[0.864912,0.005246113,0.036627524,0.0047730743,0.0025366573,0.00016703599,0.00045141284,0.00035962154,0.08492656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846137,0.0005303996,0.00009556019,0.00036600957,0.00038734596,0.0001593985],"domain_scores_gemma":[0.99551624,0.0026206265,0.00021514879,0.00077354984,0.00059863494,0.00027581348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029939718,0.0007318388,0.0016625925,0.0018986452,0.003338368,0.0035377585,0.0014709466,0.002263694,0.017831879],"category_scores_gemma":[0.007543759,0.000696232,0.0010580281,0.0024730172,0.010471709,0.021105304,0.0045664865,0.0064161634,0.0011589195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011720611,0.0000035859614,0.00002476809,0.000018318016,0.0000021370379,0.000014983243,0.00007940655,0.00008163354,0.000039827868,0.9966304,0.0012808603,0.0018124057],"study_design_scores_gemma":[0.000007968762,0.000005328354,0.000056391535,0.0000075414055,0.000002946702,0.000037193342,0.000053924297,0.00034700127,0.000077977806,0.99475265,0.0046465844,0.0000044192393],"about_ca_topic_score_codex":0.0013579606,"about_ca_topic_score_gemma":0.0011570901,"teacher_disagreement_score":0.017831879,"about_ca_system_score_codex":0.0018593292,"about_ca_system_score_gemma":0.0012725645,"threshold_uncertainty_score":0.05965364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34109014,0.0010141571,0.5048614,0.0029584938,0.00066148443,0.0000729538,0.00015650147,0.00095028325,0.14823458],"genre_scores_gemma":[0.95171505,0.00014825093,0.033001307,0.0003678639,0.00029738294,0.000042733824,0.00006520655,0.0001150214,0.014247162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840015,0.00049900817,0.000113727416,0.00031833682,0.0003766201,0.0002921922],"domain_scores_gemma":[0.99751747,0.00086589303,0.00030437953,0.00061549834,0.00041474684,0.00028202822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016487875,0.00034113874,0.00044727154,0.00093743834,0.0015181467,0.0024915067,0.0009852317,0.001067828,0.0061424333],"category_scores_gemma":[0.0027286133,0.00037397153,0.0008638041,0.0005809878,0.0061348407,0.004497082,0.003609808,0.0022191901,0.0009337798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013447639,0.000006339524,0.00009202545,0.000009919715,0.0000026795735,0.00004570006,0.00017831214,0.00023041155,0.00078194524,0.996514,0.00034871124,0.0017765821],"study_design_scores_gemma":[0.0000061386804,0.00001842341,0.00009065744,0.000007282012,0.0000041607,0.0001095434,0.00007411392,0.0028220634,0.0013767385,0.9914949,0.0039809146,0.000015054126],"about_ca_topic_score_codex":0.00077822653,"about_ca_topic_score_gemma":0.00046775563,"teacher_disagreement_score":0.0061424333,"about_ca_system_score_codex":0.0007986284,"about_ca_system_score_gemma":0.00048237405,"threshold_uncertainty_score":0.020548522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.576484,0.0004494114,0.3602519,0.00078463333,0.0001129183,0.00015787565,0.00050194527,0.00076099683,0.060496293],"genre_scores_gemma":[0.98088455,0.000079200094,0.016765533,0.00007483611,0.000077887045,0.00006240544,0.00037629696,0.00007915388,0.001600224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946682,0.00077776355,0.00038919956,0.0010654171,0.0023221036,0.0007772445],"domain_scores_gemma":[0.983763,0.008445957,0.0015375788,0.0020979745,0.002852599,0.0013029875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029163712,0.00033407312,0.0011491313,0.0013938693,0.0032711239,0.00480855,0.0012244176,0.00070712727,0.0066417735],"category_scores_gemma":[0.012315284,0.00063749525,0.0011983241,0.0018608015,0.0052039195,0.007989128,0.003670922,0.0026443023,0.00067526597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017847176,0.0000864929,0.0076440745,0.00006686369,0.000043517495,0.00055443053,0.0010594897,0.0014807468,0.0042202594,0.9728482,0.0011753077,0.010642183],"study_design_scores_gemma":[0.000057588728,0.00006790083,0.0024711152,0.00003867014,0.000053627427,0.0011950103,0.0006670599,0.017845929,0.01856125,0.9519176,0.007076131,0.00004814422],"about_ca_topic_score_codex":0.0012201879,"about_ca_topic_score_gemma":0.00073679566,"teacher_disagreement_score":0.0066417735,"about_ca_system_score_codex":0.0011836089,"about_ca_system_score_gemma":0.0011058546,"threshold_uncertainty_score":0.022218943},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039994903,0.70590097,0.18037345,0.041682642,0.0078405235,0.000072703995,0.0012231247,0.0007249014,0.058182172],"genre_scores_gemma":[0.117059514,0.62560344,0.10979686,0.009088414,0.015378779,0.00026457684,0.002021826,0.0008595072,0.11992698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992999,0.0001555719,0.000038775128,0.00014624499,0.00029890137,0.00006067646],"domain_scores_gemma":[0.9985348,0.0008521909,0.00016405845,0.00009426719,0.00025943623,0.00009524876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012788585,0.002189771,0.0018165566,0.0032144897,0.0009692439,0.0020677398,0.0015472508,0.0018747823,0.014624585],"category_scores_gemma":[0.0031652644,0.0013835409,0.0015518294,0.0031339389,0.0024506045,0.0045801513,0.001543744,0.004007384,0.007553833],"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.00021704216,0.00007409212,0.0005887317,0.0012867948,0.00011477649,0.00032535841,0.000882808,0.006091195,0.0012294718,0.46655232,0.404334,0.11830343],"study_design_scores_gemma":[0.000043806944,0.000044397704,0.0011764882,0.00036492615,0.00008908944,0.00038357987,0.00014577256,0.005541386,0.0009999435,0.61750025,0.37361866,0.00009172042],"about_ca_topic_score_codex":0.009005824,"about_ca_topic_score_gemma":0.0078174975,"teacher_disagreement_score":0.014624585,"about_ca_system_score_codex":0.002735758,"about_ca_system_score_gemma":0.0008810498,"threshold_uncertainty_score":0.048924148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6417446,0.00049285387,0.2560353,0.0006621703,0.00015523295,0.00012855929,0.00042238823,0.00061850395,0.09974044],"genre_scores_gemma":[0.96596277,0.00015413883,0.022863975,0.0000891616,0.00006190355,0.000067026,0.00022382327,0.000051496092,0.010525731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993175,0.00008786423,0.00003632386,0.00013500483,0.00026204734,0.00016114856],"domain_scores_gemma":[0.99918777,0.00018381412,0.00015585605,0.00010800538,0.0001841092,0.00018051447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006647897,0.00023506052,0.00039307596,0.0006811724,0.0013887892,0.0019098661,0.0007412816,0.00036193166,0.0042964295],"category_scores_gemma":[0.001471165,0.00022662876,0.0007971309,0.00057520845,0.0019003131,0.004281893,0.0014331616,0.0012354932,0.0007100154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039499384,0.00002143955,0.00056336244,0.00002749461,0.0000073998194,0.00014239151,0.00025944965,0.0007036644,0.0032355443,0.990359,0.0006362724,0.004004456],"study_design_scores_gemma":[0.000023730932,0.000032669886,0.00063997763,0.000012656436,0.000014237317,0.00032493044,0.00015447839,0.0049355663,0.007252049,0.9814153,0.005168275,0.000026294289],"about_ca_topic_score_codex":0.0006931168,"about_ca_topic_score_gemma":0.000779489,"teacher_disagreement_score":0.0042964295,"about_ca_system_score_codex":0.0012685898,"about_ca_system_score_gemma":0.000987673,"threshold_uncertainty_score":0.014372945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1337962,0.0016152788,0.6754307,0.00253662,0.00056967104,0.00010927673,0.0007232536,0.0010083162,0.1842107],"genre_scores_gemma":[0.8864322,0.0006998142,0.07772299,0.000734591,0.0005164389,0.00013129583,0.0006818362,0.00019384254,0.03288707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.00016987843,0.000059783553,0.00017054235,0.00024844147,0.00015000443],"domain_scores_gemma":[0.99909806,0.0004001288,0.00005704111,0.000106442705,0.00025392268,0.000084373845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011672343,0.00049906556,0.0007123676,0.0015141821,0.0018567814,0.003041063,0.00092059205,0.0008395931,0.00940898],"category_scores_gemma":[0.0018715522,0.0005294005,0.0011315844,0.0016650415,0.0025784983,0.0061642784,0.0018655652,0.0033247718,0.0014174269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027247559,0.000018289378,0.000081956125,0.000028585577,0.0000056282165,0.00004245333,0.0001762206,0.0002783439,0.0005223159,0.9895844,0.0009798071,0.008254714],"study_design_scores_gemma":[0.000007034588,0.00000762673,0.000055008742,0.000006452334,0.000006358761,0.00003396241,0.000034984398,0.0016783049,0.0003096493,0.9954389,0.0024169344,0.0000049648906],"about_ca_topic_score_codex":0.000880548,"about_ca_topic_score_gemma":0.0009841842,"teacher_disagreement_score":0.00940898,"about_ca_system_score_codex":0.0012590183,"about_ca_system_score_gemma":0.0006950307,"threshold_uncertainty_score":0.0314762},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.709102,0.00092873164,0.14700723,0.002621855,0.00036632892,0.00003917175,0.00040792255,0.00048024725,0.13904649],"genre_scores_gemma":[0.9816882,0.00020120178,0.009136152,0.00014871813,0.00016113668,0.000028303637,0.00010794862,0.000058779373,0.008469511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991906,0.00017436646,0.000032744683,0.00014445178,0.00030812298,0.0001496873],"domain_scores_gemma":[0.9988865,0.0004200338,0.00010057495,0.00012498912,0.00017959886,0.00028822312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008557905,0.00047316257,0.00066135795,0.0018550907,0.001994202,0.003932242,0.0010325478,0.0010742331,0.0065172734],"category_scores_gemma":[0.0018604154,0.0003879394,0.00051047513,0.001100213,0.0040978934,0.0044085537,0.0014780309,0.0016810106,0.00067851215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029760211,0.000008717785,0.000052267966,0.000009117508,0.000002477456,0.00005725669,0.00010474074,0.00032725168,0.0008271579,0.99703395,0.0002693979,0.0012779295],"study_design_scores_gemma":[0.000015635576,0.000009894159,0.00007271971,0.000007073855,0.0000024559738,0.0001021074,0.00006875994,0.0043273936,0.000481222,0.9938443,0.001058493,0.000009912935],"about_ca_topic_score_codex":0.0011666024,"about_ca_topic_score_gemma":0.0005822462,"teacher_disagreement_score":0.0065172734,"about_ca_system_score_codex":0.0013186396,"about_ca_system_score_gemma":0.000759516,"threshold_uncertainty_score":0.021802425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115381315,0.006472629,0.7209401,0.004189754,0.00095367094,0.00017021551,0.00058038783,0.0011147948,0.15019712],"genre_scores_gemma":[0.6764611,0.0060340543,0.22586551,0.0011106959,0.001230149,0.00050083426,0.0012042114,0.00081160886,0.08678189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998135,0.00050250837,0.00021608268,0.0003734888,0.00055519,0.00021775355],"domain_scores_gemma":[0.9975114,0.0012444875,0.0002063352,0.00031833502,0.00041385356,0.00030571033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034076676,0.0012645882,0.0016118323,0.0040802904,0.005326753,0.006625902,0.0015438513,0.0021337802,0.008978362],"category_scores_gemma":[0.0041359905,0.0013779465,0.0018198271,0.004456964,0.0067990674,0.021409852,0.0046601985,0.006506479,0.0026190209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012425062,0.000007429865,0.000037016,0.000020484818,0.0000032742967,0.000043988202,0.00028034122,0.000101668615,0.000341809,0.9965827,0.00035104985,0.0022178225],"study_design_scores_gemma":[0.0000070007254,0.0000081264,0.00003573976,0.000007284429,0.000007426062,0.00006165555,0.000109618544,0.0007417102,0.0006382589,0.99343336,0.0049408246,0.000008895091],"about_ca_topic_score_codex":0.00090975786,"about_ca_topic_score_gemma":0.001257301,"teacher_disagreement_score":0.008978362,"about_ca_system_score_codex":0.002370299,"about_ca_system_score_gemma":0.0011802961,"threshold_uncertainty_score":0.030035615},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06121097,0.011540065,0.10845041,0.05984735,0.0053126914,0.00003693012,0.0007028483,0.00042026586,0.7524785],"genre_scores_gemma":[0.8411402,0.009804492,0.026796428,0.010150877,0.0031212396,0.000087405024,0.00052580476,0.0002783743,0.1080951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957985,0.00015796811,0.000019609819,0.000060786664,0.000119478274,0.000062195606],"domain_scores_gemma":[0.9987846,0.00069393613,0.00007672302,0.00014438415,0.00020702025,0.000093356815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137231,0.00029829924,0.00046683138,0.000841663,0.0013652159,0.0025501372,0.0008134255,0.0010473606,0.018460363],"category_scores_gemma":[0.0028460962,0.00022683543,0.0006502158,0.0012214949,0.004586639,0.007660312,0.0019754262,0.0030574563,0.0020441874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058570413,0.0000018336817,0.000033880133,0.000013886131,0.0000015589541,0.000018832761,0.000040452567,0.00006700268,0.00006259396,0.9956255,0.0025833263,0.0015452964],"study_design_scores_gemma":[0.000003907396,0.0000041352905,0.00008612519,0.000019968078,0.0000022014954,0.000025091102,0.00008171162,0.00019653338,0.00008240828,0.99006784,0.009426943,0.0000030992578],"about_ca_topic_score_codex":0.0023376478,"about_ca_topic_score_gemma":0.0019448884,"teacher_disagreement_score":0.018460363,"about_ca_system_score_codex":0.0013190127,"about_ca_system_score_gemma":0.0006834923,"threshold_uncertainty_score":0.061756074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39703622,0.0016777746,0.4451906,0.0012146018,0.00083797897,0.00016558732,0.0023730749,0.0014255237,0.1500787],"genre_scores_gemma":[0.8558458,0.0010057515,0.09344649,0.0007447386,0.0004753499,0.00018234199,0.002501157,0.00040113347,0.045397215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984591,0.00022990159,0.000154978,0.00045637836,0.0004400614,0.00025965465],"domain_scores_gemma":[0.9953571,0.0018776458,0.0004371121,0.00060171046,0.00093749736,0.00078889914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012256987,0.00056766294,0.0009816797,0.0026988664,0.002779911,0.004978432,0.0012399051,0.00094401045,0.0070852763],"category_scores_gemma":[0.0037692147,0.0009183769,0.0011224343,0.0029346435,0.0020874725,0.0071755634,0.002384144,0.0028798017,0.001570917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059733415,0.000032749256,0.0008047509,0.00007876453,0.00003116242,0.00016544564,0.00039855426,0.00037737633,0.0020655026,0.9796949,0.0018056027,0.014485428],"study_design_scores_gemma":[0.000008563727,0.000016765825,0.0004780754,0.000019194382,0.000032893397,0.0003053494,0.0001067905,0.0013587518,0.0014147955,0.9874644,0.00877497,0.000019467367],"about_ca_topic_score_codex":0.0008866763,"about_ca_topic_score_gemma":0.0019999603,"teacher_disagreement_score":0.0070852763,"about_ca_system_score_codex":0.00093196536,"about_ca_system_score_gemma":0.0006892531,"threshold_uncertainty_score":0.023702562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2990657,0.0015500496,0.5979917,0.0040612095,0.00042492672,0.00014295988,0.0014935232,0.00052558084,0.09474429],"genre_scores_gemma":[0.9244136,0.0006107524,0.058571313,0.00075102126,0.0001416763,0.00017014601,0.0008912319,0.00008607282,0.014364062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980868,0.0004272331,0.00017691635,0.00049914635,0.00046224418,0.00034761828],"domain_scores_gemma":[0.9960765,0.0019779508,0.0002999734,0.0004628672,0.00089601317,0.00028672433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026048287,0.00056180125,0.0006133395,0.0011699075,0.0013505059,0.003082549,0.00097509346,0.0012268907,0.0059964913],"category_scores_gemma":[0.005011192,0.00054803374,0.0013812147,0.0011824646,0.0049768053,0.011807278,0.004647884,0.003619962,0.0010018279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001060657,0.000009867043,0.00017570236,0.000033177806,0.000005365939,0.000057408066,0.00027913813,0.0002828401,0.00056057324,0.9956852,0.0005017266,0.0023984306],"study_design_scores_gemma":[0.000011175122,0.0000152423645,0.00035664145,0.000009420273,0.000006740441,0.00009682683,0.00014134421,0.0020102488,0.000975871,0.9915206,0.0048438148,0.000012155147],"about_ca_topic_score_codex":0.0019171897,"about_ca_topic_score_gemma":0.0016421409,"teacher_disagreement_score":0.0059964913,"about_ca_system_score_codex":0.0014303855,"about_ca_system_score_gemma":0.00094773737,"threshold_uncertainty_score":0.0200603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.676183,0.0010360299,0.2672556,0.0028019587,0.0003416718,0.00002761516,0.0004919994,0.00040601433,0.051456098],"genre_scores_gemma":[0.9868749,0.00022548652,0.007071434,0.00010923957,0.00025425814,0.000023648765,0.00013489313,0.000030255682,0.005276056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989003,0.00024298855,0.000062712825,0.00024989905,0.0003581138,0.0001860361],"domain_scores_gemma":[0.99287206,0.0033077428,0.0006839248,0.00068665924,0.001150303,0.0012993895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016342035,0.00042428964,0.00084192964,0.0017873325,0.0015018772,0.0040408247,0.0011652418,0.0009951793,0.0048652515],"category_scores_gemma":[0.010419021,0.00045951176,0.0005143689,0.0012943194,0.0030248065,0.0058743623,0.0022585003,0.001422567,0.0004861852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010599367,0.000020002133,0.00037647522,0.000030326599,0.000014975206,0.00011371949,0.00025639182,0.0004197404,0.0021283766,0.99198806,0.0003944657,0.0041514197],"study_design_scores_gemma":[0.000042838703,0.00006546771,0.00060812983,0.000020706771,0.000017503928,0.00036187217,0.00016861472,0.011417507,0.0019476374,0.9827467,0.0025824553,0.000020420515],"about_ca_topic_score_codex":0.00041148037,"about_ca_topic_score_gemma":0.00021943514,"teacher_disagreement_score":0.0048652515,"about_ca_system_score_codex":0.00083427347,"about_ca_system_score_gemma":0.000562737,"threshold_uncertainty_score":0.016275942},"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":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077817193,0.98031336,0.0011711443,0.0024003708,0.0025866746,0.000044207292,0.00027476918,0.00010069207,0.012330606],"genre_scores_gemma":[0.008036076,0.9701026,0.003495864,0.002953599,0.0021827098,0.00006928673,0.00076298753,0.000043483997,0.012353505],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943,0.0000901569,0.00008795871,0.00010813877,0.00024519433,0.000038608585],"domain_scores_gemma":[0.9994344,0.00016017802,0.000111479094,0.00003586206,0.00022308146,0.000035014717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010177318,0.00087247853,0.0007914964,0.0012916003,0.00018329876,0.0012038763,0.00061908533,0.0007975328,0.022292048],"category_scores_gemma":[0.0019718008,0.00015830394,0.0005266854,0.0015649213,0.0002978744,0.0013860759,0.00054668094,0.0010730476,0.017469285],"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.00019613635,0.000069094036,0.00027228758,0.013656563,0.0000933806,0.00015254848,0.000041878124,0.00017911737,0.0030076278,0.0060683303,0.059850827,0.9164122],"study_design_scores_gemma":[0.00003483254,0.00014673691,0.0008436315,0.0024760338,0.00010721792,0.0010692542,0.00003097733,0.000057462017,0.0022148227,0.0016911253,0.99131835,0.000009543433],"about_ca_topic_score_codex":0.000643504,"about_ca_topic_score_gemma":0.0007864742,"teacher_disagreement_score":0.022292048,"about_ca_system_score_codex":0.0006669794,"about_ca_system_score_gemma":0.0009307997,"threshold_uncertainty_score":0.07457435},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21138093,0.0051916772,0.31453916,0.012579206,0.0029816907,0.00012021629,0.00045457482,0.00068459596,0.45206788],"genre_scores_gemma":[0.96162957,0.0011120898,0.019663833,0.00077018625,0.0006905462,0.000072131596,0.00009307738,0.00013179211,0.015836766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994356,0.00015270486,0.000024013043,0.000084902065,0.00022739702,0.000075211174],"domain_scores_gemma":[0.99863654,0.0005974614,0.00013336264,0.00024345594,0.00027227134,0.00011693237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009041029,0.00033286438,0.00040185935,0.0012130863,0.0011451729,0.0033476558,0.0007371633,0.0013463187,0.011229939],"category_scores_gemma":[0.0047902837,0.00032010107,0.00030732673,0.0006104914,0.0044742934,0.0037931795,0.0017000416,0.0023664841,0.0014650968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038262983,0.000003205069,0.000036072885,0.000007740251,0.0000010672491,0.000028795077,0.00005658724,0.00017256332,0.0002502298,0.99744844,0.00059757096,0.0013939698],"study_design_scores_gemma":[0.000004108399,0.0000025351696,0.00004413328,0.0000077896675,7.198876e-7,0.000045057197,0.000017391949,0.0020259891,0.00010559345,0.9961851,0.0015574299,0.0000042217966],"about_ca_topic_score_codex":0.00045585766,"about_ca_topic_score_gemma":0.00022398711,"teacher_disagreement_score":0.011229939,"about_ca_system_score_codex":0.000817181,"about_ca_system_score_gemma":0.00047977283,"threshold_uncertainty_score":0.037567854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7114202,0.0016693487,0.18729062,0.0007193267,0.00014993391,0.00009127263,0.00035165908,0.0003259901,0.097981595],"genre_scores_gemma":[0.9840247,0.00018094476,0.0077589573,0.00005309386,0.000055564044,0.000029851515,0.00017063691,0.00002006006,0.0077061234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991912,0.000120408025,0.000039462262,0.00016367075,0.0003863153,0.00009895563],"domain_scores_gemma":[0.99940014,0.00017435479,0.00008129048,0.000053716456,0.00019088104,0.00009970571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051416596,0.00023896148,0.000366825,0.000993477,0.001090727,0.0019151816,0.0005657471,0.00030233082,0.0038416223],"category_scores_gemma":[0.0011136545,0.00017665028,0.0004973514,0.00082416716,0.002168348,0.0026512975,0.0014179818,0.0009825798,0.00045925425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037681704,0.00002376646,0.00045156747,0.000033679913,0.000012139473,0.00013622009,0.0004229033,0.0019496863,0.0027453154,0.9891293,0.00044675157,0.0046109986],"study_design_scores_gemma":[0.000030405263,0.000033996206,0.00089519104,0.000018181387,0.000014860543,0.00027959226,0.00019669764,0.0149288615,0.004494117,0.9673525,0.011731427,0.000024147601],"about_ca_topic_score_codex":0.00090519857,"about_ca_topic_score_gemma":0.0004054325,"teacher_disagreement_score":0.0038416223,"about_ca_system_score_codex":0.0010621131,"about_ca_system_score_gemma":0.00038055854,"threshold_uncertainty_score":0.012851477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015052231,0.019015102,0.051567532,0.0064727855,0.002673738,0.00004284836,0.0002793262,0.0003576799,0.9180858],"genre_scores_gemma":[0.121115334,0.0332279,0.04948158,0.0034494991,0.008375734,0.0002620623,0.0011896499,0.00074893306,0.78214943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944705,0.00013529339,0.00001896786,0.00007592471,0.0002742032,0.000048677754],"domain_scores_gemma":[0.9997009,0.00009079508,0.000014272652,0.000063877924,0.000086969056,0.000043175125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052188593,0.0007598288,0.0007637478,0.0014677047,0.0018433733,0.004978746,0.0012049243,0.0009409263,0.030074136],"category_scores_gemma":[0.001132535,0.00055780535,0.0005056833,0.002198832,0.0042151236,0.0060322667,0.0017567992,0.0035982085,0.0144706555],"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.000005962821,0.000012398713,0.00001846149,0.000048830705,0.0000020791906,0.000009516638,0.0000977223,0.0002083202,0.0000996247,0.91786915,0.056032334,0.025595652],"study_design_scores_gemma":[0.0000057124903,0.0000038589146,0.000026554948,0.000039967927,0.0000018596357,0.00003120644,0.00006643896,0.00040179977,0.00006880135,0.75532895,0.24401996,0.0000048211045],"about_ca_topic_score_codex":0.0020007684,"about_ca_topic_score_gemma":0.0027373678,"teacher_disagreement_score":0.030074136,"about_ca_system_score_codex":0.0029536856,"about_ca_system_score_gemma":0.0027624748,"threshold_uncertainty_score":0.10060805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16682571,0.0035526636,0.7202256,0.042779826,0.0011162562,0.00035475186,0.0016596534,0.0018256631,0.06165987],"genre_scores_gemma":[0.74219334,0.0021138228,0.21613005,0.0032681536,0.0016913058,0.00046486454,0.001310175,0.0010837634,0.03174452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974177,0.00064883544,0.00024687592,0.0007365933,0.0006691598,0.00028087787],"domain_scores_gemma":[0.9761431,0.017488599,0.0007781261,0.0032661292,0.0012026893,0.001121412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036158983,0.0006549519,0.0018035595,0.0012359587,0.004444559,0.0056522302,0.0028862928,0.0028808124,0.008503697],"category_scores_gemma":[0.026572458,0.0013082774,0.0014386765,0.0029552884,0.0065648905,0.020852312,0.0059538935,0.007143966,0.0016978314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030314672,0.00014159072,0.0014462356,0.00023537893,0.000020176012,0.00020060636,0.0015128598,0.0021491137,0.0023106008,0.88488865,0.015087758,0.091703825],"study_design_scores_gemma":[0.000044402008,0.000022645107,0.00020747636,0.000034187124,0.000016344839,0.0002509904,0.0005491126,0.0048742862,0.0023004985,0.98040533,0.011271854,0.000022749287],"about_ca_topic_score_codex":0.0014562252,"about_ca_topic_score_gemma":0.0012783324,"teacher_disagreement_score":0.008503697,"about_ca_system_score_codex":0.0016031029,"about_ca_system_score_gemma":0.0020256909,"threshold_uncertainty_score":0.028447747},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069402205,0.0052311793,0.0036051278,0.080900535,0.8828796,0.0000566646,0.0018919562,0.00045024895,0.024290668],"genre_scores_gemma":[0.028404316,0.028477272,0.016396461,0.10082115,0.26501477,0.00040991502,0.008671122,0.0020629058,0.5497422],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977977,0.00031900877,0.00048176473,0.00030647425,0.0009447313,0.00015045257],"domain_scores_gemma":[0.98649085,0.0043239524,0.0005604411,0.0009481475,0.007224,0.0004525844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032599522,0.0028973415,0.0033979947,0.005286883,0.005166998,0.004791305,0.0039864085,0.004669489,0.065086074],"category_scores_gemma":[0.03272968,0.0015090673,0.0015547156,0.0046942243,0.003593968,0.00614642,0.0015373116,0.00736265,0.026458085],"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.000069069036,0.000016399546,0.000055684086,0.0001440036,0.000011363632,0.000117170486,0.00003649637,0.00009144787,0.00006029481,0.007506252,0.98461884,0.00727295],"study_design_scores_gemma":[0.00012567207,0.0000736955,0.0012587431,0.00047332875,0.00009139272,0.00056166225,0.0002988017,0.0009850187,0.00060966617,0.030153824,0.9652795,0.000088597],"about_ca_topic_score_codex":0.014107186,"about_ca_topic_score_gemma":0.018249907,"teacher_disagreement_score":0.065086074,"about_ca_system_score_codex":0.0050408207,"about_ca_system_score_gemma":0.003452275,"threshold_uncertainty_score":0.21773458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.377222,0.0018406505,0.32554513,0.0034204584,0.0007230056,0.00014880269,0.0030370802,0.0015883757,0.28647456],"genre_scores_gemma":[0.93503565,0.0006370152,0.035918985,0.00049918017,0.00053386705,0.000103277045,0.0020571745,0.0002076654,0.025007026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988845,0.0002063107,0.000103542145,0.00031519527,0.00028007964,0.00021028933],"domain_scores_gemma":[0.99652797,0.0017084404,0.00039028624,0.00053163175,0.00046228673,0.0003794509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095523894,0.0005934298,0.00080185506,0.0014596136,0.0023258517,0.0048651104,0.00068115944,0.0008917408,0.012641913],"category_scores_gemma":[0.0026926913,0.00058408594,0.0010351446,0.0016397054,0.0024980118,0.009194862,0.00215925,0.0022401954,0.0014013675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007319417,0.00004490749,0.00052090076,0.000041283896,0.000012435799,0.00014928504,0.0002346553,0.00049092865,0.001246589,0.98870826,0.0022144564,0.0062631047],"study_design_scores_gemma":[0.000021891809,0.000015185026,0.00019393301,0.000009644147,0.000012818036,0.00019492614,0.00009639288,0.0015434581,0.001197484,0.9911595,0.0055432306,0.000011566335],"about_ca_topic_score_codex":0.0008356841,"about_ca_topic_score_gemma":0.001961923,"teacher_disagreement_score":0.012641913,"about_ca_system_score_codex":0.00076388236,"about_ca_system_score_gemma":0.0012135977,"threshold_uncertainty_score":0.042291403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07949707,0.05027077,0.5647469,0.016426075,0.0013142477,0.00018472674,0.0007513333,0.000716236,0.2860926],"genre_scores_gemma":[0.7738019,0.014463857,0.17472774,0.0024156966,0.0029629902,0.00029682633,0.00064709166,0.00015007121,0.030533826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.0005732521,0.00008617449,0.00019922855,0.00039808202,0.00014394824],"domain_scores_gemma":[0.9988506,0.0005834747,0.00011763903,0.00013531004,0.00017305542,0.00013997825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022859222,0.00063666643,0.00081588747,0.002229884,0.0019542787,0.0044065057,0.0012201053,0.0015643002,0.005410635],"category_scores_gemma":[0.0023443075,0.00038022132,0.0009487121,0.0023102027,0.005918796,0.007490575,0.0020985373,0.0031895922,0.0008643484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002116775,0.0000031909997,0.000029717034,0.000012780771,0.0000022772576,0.000018256073,0.000105914136,0.0003091225,0.00008669748,0.9976966,0.00031738187,0.0014159334],"study_design_scores_gemma":[0.0000016885864,0.0000034386178,0.000031652922,0.000008466928,0.0000011827398,0.000012885038,0.00003092346,0.0010670873,0.00003993493,0.9947131,0.0040867305,0.0000028022976],"about_ca_topic_score_codex":0.0026270747,"about_ca_topic_score_gemma":0.0019331485,"teacher_disagreement_score":0.005410635,"about_ca_system_score_codex":0.0031551176,"about_ca_system_score_gemma":0.001067589,"threshold_uncertainty_score":0.022892058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5156533,0.00091417413,0.37958765,0.0017824426,0.0005378344,0.00015324236,0.0003305248,0.0013769825,0.099663846],"genre_scores_gemma":[0.9566129,0.00028514274,0.023442358,0.00030199823,0.0002819624,0.000116348,0.00019221657,0.00036209213,0.018405005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601763,0.00084621523,0.00031076383,0.0007495715,0.001048851,0.00102691],"domain_scores_gemma":[0.9925868,0.0036644107,0.00051263906,0.0014090498,0.001048599,0.00077859807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039055247,0.0007692973,0.001963395,0.0028837507,0.004602823,0.006752005,0.0017470331,0.0022645753,0.006981873],"category_scores_gemma":[0.009229476,0.0011024694,0.0019866035,0.0034995354,0.007963871,0.01657453,0.0058452897,0.0046098125,0.0011164614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003384014,0.000008870364,0.00011245773,0.000008567993,0.000003461003,0.000052182422,0.00028530837,0.00007654608,0.00042403056,0.99682426,0.00020232242,0.0019681172],"study_design_scores_gemma":[0.000026011603,0.000017195816,0.00012226422,0.0000073541637,0.000016478838,0.00012134978,0.00015816599,0.00082144147,0.0016047728,0.99533975,0.0017525505,0.000012538687],"about_ca_topic_score_codex":0.0009935049,"about_ca_topic_score_gemma":0.0007222415,"teacher_disagreement_score":0.006981873,"about_ca_system_score_codex":0.00259363,"about_ca_system_score_gemma":0.0016475846,"threshold_uncertainty_score":0.023356736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009867059,0.012785611,0.9589928,0.0008355019,0.00047154876,0.00009348614,0.000085762425,0.00017933674,0.016688952],"genre_scores_gemma":[0.24001214,0.022404391,0.7169098,0.0008845341,0.002129225,0.00024321325,0.00019429393,0.00013384953,0.017088583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.00029726356,0.00010713384,0.00019565088,0.0005130179,0.00008557566],"domain_scores_gemma":[0.9994286,0.0003121494,0.000045458575,0.00008453177,0.00010234726,0.000026919215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00163198,0.00061935856,0.00084275997,0.0013532792,0.00085265114,0.002146851,0.00082863687,0.00112142,0.002896146],"category_scores_gemma":[0.002737835,0.0003115073,0.0010154848,0.0027196775,0.00344311,0.0040378436,0.0010902258,0.0023876533,0.0008974044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004680568,0.000027142993,0.00011120351,0.00022625578,0.000015610085,0.00023589001,0.00037842288,0.014955715,0.005273049,0.92138845,0.0020789732,0.05526247],"study_design_scores_gemma":[0.000027890235,0.00011775984,0.00027296031,0.00010578235,0.00003364378,0.000526999,0.00012013696,0.088025935,0.0066464962,0.86177963,0.042278726,0.00006406559],"about_ca_topic_score_codex":0.0015158483,"about_ca_topic_score_gemma":0.0009421554,"teacher_disagreement_score":0.002896146,"about_ca_system_score_codex":0.0010951285,"about_ca_system_score_gemma":0.00069727516,"threshold_uncertainty_score":0.009688616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12939131,0.0027095156,0.77093023,0.0011134587,0.0022129454,0.00024224118,0.00076823216,0.0021697085,0.090462424],"genre_scores_gemma":[0.67958194,0.0022638906,0.2285277,0.001420746,0.001092377,0.0003563261,0.0012921798,0.0017589808,0.083705865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620986,0.0007410742,0.00042684024,0.0010581497,0.00088822364,0.000675919],"domain_scores_gemma":[0.99388134,0.0019122196,0.00049269403,0.0021663308,0.001011632,0.0005359253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030538973,0.0012655986,0.0016161428,0.0034911395,0.0063650087,0.0057985177,0.0019222924,0.0013616625,0.009966834],"category_scores_gemma":[0.0067120953,0.0015860534,0.0023687503,0.0045438097,0.005570498,0.01714446,0.00959306,0.00470976,0.003402032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003857396,0.000015467276,0.00016063474,0.000042237483,0.000013059779,0.00014649941,0.0004196136,0.00017532983,0.0012019706,0.9848423,0.0010024718,0.01194183],"study_design_scores_gemma":[0.0000098161545,0.000020732636,0.00008054656,0.00003391552,0.00003453751,0.00024387291,0.00020692885,0.0008570601,0.0031326031,0.9741871,0.021171924,0.000020909278],"about_ca_topic_score_codex":0.0013476613,"about_ca_topic_score_gemma":0.0012548884,"teacher_disagreement_score":0.009966834,"about_ca_system_score_codex":0.0018778068,"about_ca_system_score_gemma":0.0020933463,"threshold_uncertainty_score":0.03334236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0701938,0.0018809977,0.79980505,0.0026819303,0.00083601894,0.00006387726,0.00041111046,0.0001775098,0.12394972],"genre_scores_gemma":[0.81414497,0.0015845181,0.1446741,0.0012330381,0.0012659178,0.00015403338,0.00045895705,0.00017233145,0.036312092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877554,0.0003348343,0.00007322634,0.00025036282,0.00041625646,0.0001497876],"domain_scores_gemma":[0.99832445,0.00061173696,0.00010383524,0.00017482713,0.00063975516,0.00014540085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019309205,0.0006132948,0.0006157573,0.0034950087,0.0013216686,0.0036535803,0.0012402324,0.0014292526,0.0076583223],"category_scores_gemma":[0.004118751,0.0002412489,0.0007602764,0.0024825165,0.0032308595,0.0062427768,0.001657628,0.0022921863,0.0007431474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008562528,0.000004359894,0.000046113448,0.000013887728,0.0000037378172,0.000018500301,0.00005045072,0.0003505046,0.00043663103,0.99538594,0.0004193431,0.003261924],"study_design_scores_gemma":[0.000005041684,0.000020459538,0.00014923114,0.000017152623,0.000009981782,0.0001292205,0.00006514715,0.016542219,0.0006225643,0.97387403,0.008548842,0.000016199017],"about_ca_topic_score_codex":0.0017548985,"about_ca_topic_score_gemma":0.0011414319,"teacher_disagreement_score":0.0076583223,"about_ca_system_score_codex":0.0015218041,"about_ca_system_score_gemma":0.0010029671,"threshold_uncertainty_score":0.025619686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22629607,0.0019984695,0.60861105,0.00977455,0.0014273579,0.00013782312,0.0012078359,0.0020650849,0.14848179],"genre_scores_gemma":[0.9652465,0.00044693061,0.020522403,0.0020002704,0.0005713768,0.00007873484,0.00049795466,0.0002376242,0.010398234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743,0.00040655586,0.00023221967,0.0009098741,0.0004359541,0.0005853902],"domain_scores_gemma":[0.99098796,0.0039978805,0.00037972923,0.00169002,0.0020446551,0.0008997229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002336207,0.00058293337,0.0011543377,0.0014345708,0.0021849566,0.002952978,0.0010545207,0.0015019123,0.0105719855],"category_scores_gemma":[0.006777338,0.0008277143,0.0019093868,0.0012447075,0.006504023,0.012247942,0.005516704,0.004120666,0.0013484354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053011558,0.000026161335,0.0006758518,0.00006822501,0.00002828038,0.0001238604,0.00038266013,0.00024562769,0.001586238,0.98784804,0.0013155061,0.007646561],"study_design_scores_gemma":[0.000015781538,0.000016457127,0.000410795,0.000009919235,0.0000154254,0.00020879973,0.00010310148,0.0006401409,0.0009140054,0.99380845,0.003842941,0.000014187309],"about_ca_topic_score_codex":0.000977709,"about_ca_topic_score_gemma":0.00065584417,"teacher_disagreement_score":0.0105719855,"about_ca_system_score_codex":0.0010877107,"about_ca_system_score_gemma":0.00076106866,"threshold_uncertainty_score":0.035366833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47359124,0.0022283925,0.37517798,0.002469092,0.0003634354,0.0000759815,0.0005221157,0.00038235186,0.14518939],"genre_scores_gemma":[0.98295605,0.0003991707,0.01062044,0.00013020236,0.00021795832,0.000024026856,0.0001322834,0.000031835363,0.0054881163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991196,0.0002754456,0.000045473564,0.00015868973,0.00029269795,0.00010818913],"domain_scores_gemma":[0.9992385,0.00016972056,0.00012050494,0.000072625175,0.00025515034,0.00014345994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075199537,0.0004036027,0.0005147284,0.001376121,0.0011450006,0.0021750624,0.0006405718,0.00035604907,0.0044607143],"category_scores_gemma":[0.0015266285,0.00017374879,0.0005943202,0.0008641886,0.0030838386,0.0034484973,0.0019344157,0.0010333034,0.00054046937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005086891,0.0000019829138,0.00007451977,0.000008909621,0.0000027940102,0.000021139118,0.00006821872,0.00029326504,0.00028793662,0.99816304,0.00013055898,0.0009424132],"study_design_scores_gemma":[0.000006386806,0.000016580023,0.00019792383,0.000008589208,0.000005239313,0.00007438904,0.00011141162,0.0031006932,0.0004492306,0.9922225,0.0037997465,0.0000073011292],"about_ca_topic_score_codex":0.0010893698,"about_ca_topic_score_gemma":0.00046824507,"teacher_disagreement_score":0.0044607143,"about_ca_system_score_codex":0.0012524859,"about_ca_system_score_gemma":0.0004188356,"threshold_uncertainty_score":0.014922619},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03886178,0.0037924058,0.29187045,0.013775772,0.0020042616,0.00011822308,0.00093232776,0.0005829219,0.6480619],"genre_scores_gemma":[0.7792557,0.0026904247,0.060870837,0.004201832,0.0043624653,0.0003307682,0.0007240955,0.00036290902,0.14720106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987704,0.00023705672,0.00007963346,0.00039341857,0.0003723821,0.00014704428],"domain_scores_gemma":[0.99820185,0.00074102904,0.00006921426,0.00041944734,0.0004280683,0.0001403837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015687541,0.00052267546,0.0010115722,0.0015485281,0.0040761824,0.0046250154,0.0012557039,0.0018925202,0.017550612],"category_scores_gemma":[0.0029316312,0.00068212673,0.0010896589,0.0016809346,0.009381763,0.0132016605,0.002946761,0.0042521856,0.0031782205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003472302,0.000004701,0.000014552141,0.0000057274083,0.0000014559909,0.0000079912725,0.0000457905,0.000018288663,0.000066697066,0.99717855,0.0009537487,0.0016990382],"study_design_scores_gemma":[0.0000045685733,0.0000023589462,0.000027570237,0.0000030230226,0.00000201634,0.00002886216,0.0000100007455,0.000111775385,0.00007140463,0.9919653,0.0077707344,0.000002391054],"about_ca_topic_score_codex":0.00081429566,"about_ca_topic_score_gemma":0.00069989957,"teacher_disagreement_score":0.017550612,"about_ca_system_score_codex":0.0012893443,"about_ca_system_score_gemma":0.0011335814,"threshold_uncertainty_score":0.05871266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.205856,0.0026077777,0.64569724,0.0022896852,0.00031989437,0.00022102782,0.0006136231,0.00054739247,0.14184733],"genre_scores_gemma":[0.9173212,0.0008768131,0.06754236,0.00045029697,0.00026216815,0.00016759666,0.0005261443,0.00008301084,0.0127703855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979633,0.0004325918,0.00018012724,0.00046627884,0.0006751471,0.00028254554],"domain_scores_gemma":[0.9980385,0.00062471663,0.00024869744,0.00028635468,0.00053840515,0.0002635066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013932037,0.0005562978,0.00048808576,0.0016345605,0.0016186929,0.0040356005,0.0007721242,0.00077105954,0.00553705],"category_scores_gemma":[0.003389632,0.0004382747,0.0008349196,0.0018713449,0.002600207,0.008322828,0.0024074616,0.0020261884,0.00070307974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001822996,0.000013608591,0.000184049,0.000024893387,0.0000070029846,0.00006183116,0.0002768674,0.00051936874,0.0008973122,0.99297804,0.00038338735,0.00463548],"study_design_scores_gemma":[0.000014008525,0.00003366366,0.00024392617,0.00002962874,0.000016776261,0.00032828114,0.00027666567,0.0077548795,0.0024487635,0.96432984,0.02450358,0.00001989242],"about_ca_topic_score_codex":0.0010100732,"about_ca_topic_score_gemma":0.00048574372,"teacher_disagreement_score":0.00553705,"about_ca_system_score_codex":0.0013027088,"about_ca_system_score_gemma":0.00084084045,"threshold_uncertainty_score":0.018523335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12324572,0.013113142,0.75796276,0.008109163,0.001875182,0.00016495648,0.0002451353,0.00037960967,0.09490436],"genre_scores_gemma":[0.8492287,0.00326383,0.1310907,0.0014202173,0.0015267313,0.00023154537,0.00018886688,0.00015216749,0.012897285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975545,0.0010781819,0.00019577917,0.00047945572,0.00040868844,0.00028339867],"domain_scores_gemma":[0.9969549,0.0019604878,0.00019285413,0.0003550552,0.00032682405,0.00020979907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067630727,0.0012205179,0.0020523143,0.003856829,0.005213877,0.004890253,0.0017992604,0.0030934026,0.004303256],"category_scores_gemma":[0.010464962,0.0011997683,0.002855069,0.004203114,0.013998532,0.014568929,0.0061664083,0.010989928,0.0005176569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001637179,0.000007661523,0.000034323242,0.000019957148,0.000004776806,0.000014133071,0.00011202534,0.0002591488,0.000090615395,0.99720407,0.00025083093,0.001986205],"study_design_scores_gemma":[0.0000051581046,0.0000065435356,0.000024635181,0.0000051492093,0.0000040083305,0.000012767444,0.000016215961,0.00092051446,0.00006428534,0.9983095,0.0006247838,0.000006562384],"about_ca_topic_score_codex":0.0018596895,"about_ca_topic_score_gemma":0.0013491741,"teacher_disagreement_score":0.0067630727,"about_ca_system_score_codex":0.0025644859,"about_ca_system_score_gemma":0.001508323,"threshold_uncertainty_score":0.03576696},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04970876,0.0042576184,0.43083236,0.036211364,0.010342764,0.00008975241,0.0006494529,0.00052248995,0.46738547],"genre_scores_gemma":[0.67853034,0.004348557,0.09150349,0.009442617,0.010661237,0.00014055839,0.0005022877,0.0005297798,0.20434114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991124,0.00017215105,0.000051134983,0.00017516111,0.00031203995,0.00017713732],"domain_scores_gemma":[0.999108,0.0003870446,0.000058511672,0.00017198242,0.0001817264,0.00009274093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015312415,0.0005523689,0.0006368057,0.0013643625,0.0024072416,0.0027884236,0.0016092216,0.0015476192,0.013147064],"category_scores_gemma":[0.0021555228,0.00031471628,0.0016329701,0.0010641975,0.0052204477,0.008893049,0.003253739,0.004652316,0.0014348229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069876714,0.000005937309,0.00004245723,0.000012679069,0.0000023832606,0.000027022821,0.00010926743,0.000073951385,0.00021014459,0.9949655,0.002803946,0.001739696],"study_design_scores_gemma":[0.0000071864033,0.000008503016,0.000114307644,0.000012634947,0.0000069282014,0.00007030862,0.00003886823,0.00060181523,0.0005405673,0.9751608,0.023429083,0.000008978723],"about_ca_topic_score_codex":0.0010661462,"about_ca_topic_score_gemma":0.0011882597,"teacher_disagreement_score":0.013147064,"about_ca_system_score_codex":0.0013760948,"about_ca_system_score_gemma":0.0007213311,"threshold_uncertainty_score":0.043981314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51124513,0.001807985,0.3960351,0.0032364172,0.0002654854,0.00012683567,0.000598094,0.0003939521,0.086291],"genre_scores_gemma":[0.88617307,0.001050541,0.07349289,0.00042131625,0.0004466046,0.00014827914,0.0006322195,0.00030067944,0.03733433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998359,0.0004297376,0.00012011079,0.00054150546,0.00030953757,0.00024002086],"domain_scores_gemma":[0.9952832,0.002313384,0.00072493777,0.00060022675,0.00065827277,0.00041996274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028398456,0.0011133496,0.0012008734,0.004037138,0.00244652,0.0054521672,0.0015038277,0.0020709676,0.011470144],"category_scores_gemma":[0.008966845,0.0015365492,0.0016338892,0.0034983917,0.00470911,0.013718856,0.004773489,0.004070294,0.0011436075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002152176,0.000009209085,0.00029442372,0.000019488178,0.000007023382,0.000028288634,0.0002489598,0.00022257419,0.00040111525,0.9967007,0.0003101172,0.0017364225],"study_design_scores_gemma":[0.00001934357,0.000017001086,0.00025300894,0.000013695861,0.00001908549,0.00008782759,0.00016904238,0.0013470872,0.00050574174,0.9946346,0.0029210006,0.000012628702],"about_ca_topic_score_codex":0.0008717771,"about_ca_topic_score_gemma":0.0007876843,"teacher_disagreement_score":0.011470144,"about_ca_system_score_codex":0.0019182282,"about_ca_system_score_gemma":0.0007835362,"threshold_uncertainty_score":0.038371444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749542,0.00046192735,0.39002776,0.00082733645,0.0002723128,0.00016970676,0.00091910746,0.0009283378,0.031439252],"genre_scores_gemma":[0.94013274,0.00032851048,0.03303549,0.00025018683,0.0004529879,0.00023853334,0.000924197,0.00043819923,0.024199149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984395,0.0004684719,0.00009466836,0.0003719186,0.0003093264,0.0003161329],"domain_scores_gemma":[0.99571395,0.001886443,0.0005546315,0.00044203096,0.0004693138,0.0009335351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289634,0.0008818716,0.0011890358,0.0025595813,0.0016145048,0.003984323,0.001456832,0.00084714557,0.008048611],"category_scores_gemma":[0.0048369877,0.00077872875,0.0017269235,0.0015395435,0.0019506968,0.003999727,0.0020379694,0.0020690262,0.001006136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037191462,0.00012226863,0.000758402,0.00008364413,0.000052899286,0.00028000458,0.00082087936,0.0022566349,0.0070637297,0.97106946,0.0019808349,0.015139281],"study_design_scores_gemma":[0.00007071193,0.000071708106,0.0008795062,0.00001340836,0.00004527303,0.000410278,0.00018284694,0.013031859,0.003011516,0.97871965,0.003524022,0.00003922608],"about_ca_topic_score_codex":0.0010942353,"about_ca_topic_score_gemma":0.0010334093,"teacher_disagreement_score":0.008048611,"about_ca_system_score_codex":0.0012224743,"about_ca_system_score_gemma":0.00068063865,"threshold_uncertainty_score":0.026925325},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3235481,0.0054538245,0.32188556,0.020738507,0.00418926,0.00009962778,0.0003577713,0.0010321413,0.32269526],"genre_scores_gemma":[0.9256682,0.0011605528,0.025111793,0.0010943617,0.0020165904,0.000072891795,0.00014950035,0.00020733911,0.044518802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992052,0.0003034036,0.000040430285,0.00009337119,0.0002405583,0.000117127674],"domain_scores_gemma":[0.9982418,0.0007309099,0.00018253675,0.0003339253,0.0002462253,0.00026457364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022153903,0.00076794595,0.0010508648,0.0024869032,0.0026572794,0.0036374829,0.001241435,0.0021221803,0.008364436],"category_scores_gemma":[0.004271638,0.00058767095,0.0008495519,0.0020528885,0.0060476484,0.010984762,0.0032597743,0.004625663,0.0011747708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005856612,0.0000039763495,0.000017141003,0.0000061032392,9.448487e-7,0.000010249582,0.00006286156,0.00007349849,0.000058074707,0.9985097,0.00037039825,0.0008812748],"study_design_scores_gemma":[0.000004993128,0.0000027688352,0.000013145257,0.0000025400338,0.0000012086459,0.000016729262,0.000011555775,0.00042888935,0.000030743893,0.9988268,0.0006583334,0.0000022699292],"about_ca_topic_score_codex":0.0005438778,"about_ca_topic_score_gemma":0.00041355653,"teacher_disagreement_score":0.008364436,"about_ca_system_score_codex":0.0014112345,"about_ca_system_score_gemma":0.0008089816,"threshold_uncertainty_score":0.027981818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17951098,0.0025171407,0.5399253,0.0025515137,0.00047023437,0.00013438589,0.00083795807,0.00057457935,0.27347794],"genre_scores_gemma":[0.8852273,0.0010808007,0.041545395,0.0008247059,0.00047595744,0.00009156794,0.00060798513,0.00014532026,0.07000097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873966,0.00030498943,0.00007428247,0.00019853008,0.00048049437,0.00020199927],"domain_scores_gemma":[0.9985067,0.00041603766,0.00013760074,0.00017476385,0.000490373,0.00027439362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012975156,0.00052740827,0.00084120355,0.0016367104,0.001792527,0.003495442,0.00097995,0.00070243474,0.013533956],"category_scores_gemma":[0.0037516728,0.00033293516,0.0008311429,0.0016061632,0.0017886338,0.0050218413,0.0018978528,0.0018405837,0.0018185863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001944775,0.00000788719,0.000052307856,0.00001838139,0.0000055154637,0.000013890385,0.000053584314,0.00022875781,0.00042272158,0.994616,0.0006721162,0.0038893272],"study_design_scores_gemma":[0.0000067295337,0.0000085123975,0.000065844324,0.000009263094,0.000007639638,0.00005862938,0.000034761244,0.0029229561,0.00060694775,0.9927078,0.0035645775,0.0000064149267],"about_ca_topic_score_codex":0.0006170369,"about_ca_topic_score_gemma":0.00076631835,"teacher_disagreement_score":0.013533956,"about_ca_system_score_codex":0.0014699243,"about_ca_system_score_gemma":0.0008084972,"threshold_uncertainty_score":0.04527557},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55165815,0.003956417,0.30095148,0.0056000515,0.00030665606,0.00004058418,0.0005029274,0.00044735445,0.13653633],"genre_scores_gemma":[0.97686064,0.0004090401,0.01652684,0.00022972921,0.00016917197,0.00002441399,0.0001860301,0.00004314377,0.005550966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920076,0.0002072039,0.00005149589,0.00018237092,0.00024046046,0.00011769037],"domain_scores_gemma":[0.99726415,0.0016085072,0.00017909215,0.00038606106,0.00027147692,0.00029072273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014314873,0.00023638993,0.0005777615,0.00070840615,0.0016536061,0.0027717473,0.0006938438,0.00061607873,0.0041486328],"category_scores_gemma":[0.0029937967,0.00043961342,0.0005363347,0.000984596,0.0057862396,0.0091410605,0.002328777,0.002260744,0.00041514717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041292395,0.00001355559,0.0003000591,0.000020221785,0.000005073196,0.000061757746,0.00028646286,0.00033532098,0.0007431624,0.99215573,0.0004470313,0.00559037],"study_design_scores_gemma":[0.000007918142,0.000004098193,0.000088616805,0.0000035244336,0.000002994039,0.000053460637,0.00005321728,0.00092648854,0.00041349768,0.9969721,0.0014711979,0.0000028950778],"about_ca_topic_score_codex":0.0008271068,"about_ca_topic_score_gemma":0.0007647896,"teacher_disagreement_score":0.0041486328,"about_ca_system_score_codex":0.0010718784,"about_ca_system_score_gemma":0.0006799543,"threshold_uncertainty_score":0.013878584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24149129,0.00023847546,0.74576914,0.000125899,0.000042061234,0.00008575206,0.0002408148,0.0013401643,0.0106663965],"genre_scores_gemma":[0.9362891,0.00018978294,0.06037764,0.000078913385,0.000032968386,0.00014962867,0.00033076943,0.00016304613,0.0023882221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991208,0.00017030837,0.000057975514,0.00017141984,0.0003405781,0.0001389774],"domain_scores_gemma":[0.9981237,0.0010687454,0.0001830154,0.00033399664,0.00020752984,0.000083002786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048405112,0.00043002385,0.00046803843,0.0007623832,0.0005242025,0.00083988276,0.00058013154,0.000415472,0.0025719272],"category_scores_gemma":[0.0027557295,0.00031157144,0.0008652148,0.00052101514,0.0009956876,0.0014164897,0.0013309403,0.0006264347,0.00024530586],"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.00080097374,0.00016814303,0.004085724,0.0004300022,0.000071974704,0.00067808054,0.00062810327,0.33397073,0.11774846,0.45283714,0.0014299846,0.08715076],"study_design_scores_gemma":[0.00002984101,0.00013718776,0.001027215,0.0000415643,0.000053362543,0.00017687542,0.00004193142,0.8040809,0.052122265,0.13813607,0.0041260244,0.000026691845],"about_ca_topic_score_codex":0.0009782839,"about_ca_topic_score_gemma":0.00052655936,"teacher_disagreement_score":0.0025719272,"about_ca_system_score_codex":0.0010713235,"about_ca_system_score_gemma":0.00062043266,"threshold_uncertainty_score":0.00860399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059439924,0.0028294595,0.78256774,0.05067329,0.0022748662,0.00013183763,0.00056569517,0.0010025973,0.100514635],"genre_scores_gemma":[0.6101032,0.0022870807,0.3273635,0.004384489,0.001919371,0.0003693416,0.0008099397,0.00079679023,0.05196628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824464,0.000521428,0.000108086555,0.0004784701,0.0004144403,0.00023298118],"domain_scores_gemma":[0.99637645,0.00163394,0.00015057104,0.0010099318,0.0005480555,0.00028105278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113241,0.00057217287,0.0015534156,0.0012663358,0.0033768772,0.0032010772,0.0028066305,0.0033696827,0.012372126],"category_scores_gemma":[0.0133834025,0.0006783469,0.0013485092,0.0015949794,0.0043165833,0.011679351,0.0068993936,0.006080288,0.0023701726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035010227,0.000018492427,0.00012273037,0.000045398203,0.0000095893165,0.000067798646,0.00021874798,0.00062712975,0.00020309094,0.98618996,0.0055886135,0.006873391],"study_design_scores_gemma":[0.000024524274,0.000009259518,0.000051672094,0.000017636903,0.0000050890235,0.00009392628,0.00009070422,0.0028491938,0.00017602432,0.98644614,0.010225311,0.000010444009],"about_ca_topic_score_codex":0.0008043285,"about_ca_topic_score_gemma":0.00061086303,"teacher_disagreement_score":0.012372126,"about_ca_system_score_codex":0.001103343,"about_ca_system_score_gemma":0.0016001611,"threshold_uncertainty_score":0.04138893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73281515,0.0019927835,0.15789376,0.002382258,0.0006054509,0.00013037528,0.00056965055,0.0004010422,0.103209585],"genre_scores_gemma":[0.96588135,0.00043916857,0.017301854,0.0002272965,0.00033929813,0.00008220993,0.00032494,0.00006048199,0.015343512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998971,0.00023230354,0.00007395695,0.00025014923,0.00023314738,0.00023946792],"domain_scores_gemma":[0.9985875,0.000518865,0.00016766546,0.00010981119,0.0001971603,0.00041913986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118873,0.00049480813,0.00064041646,0.0024899489,0.002969934,0.00420839,0.0009448233,0.0007731248,0.005598381],"category_scores_gemma":[0.0017492907,0.00065958005,0.0011014595,0.0011391226,0.003965766,0.009286215,0.0028368926,0.0028085501,0.0005225186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061374965,0.000038254384,0.00025200073,0.000018382436,0.0000060069547,0.00006082283,0.00034876502,0.00009898123,0.00063795317,0.9962714,0.00032959908,0.0018764101],"study_design_scores_gemma":[0.000053649852,0.000037391535,0.0004335085,0.000015436119,0.000023650766,0.00026478295,0.00028991525,0.0016465735,0.0012452279,0.9912635,0.0047080065,0.000018372095],"about_ca_topic_score_codex":0.0006842128,"about_ca_topic_score_gemma":0.0009650476,"teacher_disagreement_score":0.005598381,"about_ca_system_score_codex":0.0016294608,"about_ca_system_score_gemma":0.0006290097,"threshold_uncertainty_score":0.018728495},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2861542,0.0013057642,0.3494312,0.04020814,0.0017198003,0.0003289085,0.0006590248,0.0019607742,0.3182321],"genre_scores_gemma":[0.9543909,0.000639355,0.026421895,0.002206811,0.0006064695,0.0001654518,0.0003094787,0.00031935435,0.014940285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958385,0.0009938085,0.00035666765,0.0011532162,0.0007588452,0.00089901016],"domain_scores_gemma":[0.9834636,0.011427072,0.0004717602,0.0024791143,0.0014173499,0.0007410644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043773567,0.00075709744,0.001587485,0.0015667806,0.00388216,0.006345388,0.0027236314,0.004621257,0.011955114],"category_scores_gemma":[0.016488245,0.0010742244,0.0029568104,0.0019840912,0.014135944,0.019945052,0.010886434,0.008851496,0.0015413285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000602638,0.000031541826,0.00019734599,0.000033791388,0.000006772543,0.00018447898,0.00035579712,0.00014222026,0.00042763626,0.99508154,0.0014140416,0.0020645086],"study_design_scores_gemma":[0.00006900655,0.000024234507,0.000107261636,0.00002098162,0.00002262656,0.00046054085,0.0002738048,0.0015254683,0.0011453856,0.9916393,0.004692895,0.000018445997],"about_ca_topic_score_codex":0.001261881,"about_ca_topic_score_gemma":0.0004786494,"teacher_disagreement_score":0.011955114,"about_ca_system_score_codex":0.0014868085,"about_ca_system_score_gemma":0.0013044128,"threshold_uncertainty_score":0.039993823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028106801,0.0008043392,0.69551873,0.00464276,0.0035024122,0.00017637087,0.00048098827,0.0020673093,0.26470026],"genre_scores_gemma":[0.45405313,0.00085630396,0.40236524,0.00218002,0.0020941119,0.00045861234,0.00082552107,0.0014271493,0.13573974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983144,0.00044494966,0.000076993216,0.0003873351,0.0005550055,0.00022127984],"domain_scores_gemma":[0.9989256,0.00018177641,0.000047113008,0.00032528347,0.00023139775,0.00028874257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013895399,0.0007906051,0.0011524151,0.0017658268,0.0038684846,0.0042221886,0.0018008428,0.0013117759,0.025731388],"category_scores_gemma":[0.0019320641,0.0007460386,0.0014815412,0.00136537,0.0042603035,0.008582515,0.005475791,0.0047926055,0.0070222053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016563044,0.000020872638,0.000028759498,0.000019551544,0.0000035031526,0.000021533708,0.00008855255,0.00011002963,0.0006865401,0.98970467,0.0024387906,0.0068606366],"study_design_scores_gemma":[0.000029403756,0.000020437667,0.00003469357,0.00001416794,0.000011974796,0.0001234111,0.00007972071,0.0025632267,0.001431798,0.9563887,0.03928369,0.0000189055],"about_ca_topic_score_codex":0.00047516645,"about_ca_topic_score_gemma":0.00063431554,"teacher_disagreement_score":0.025731388,"about_ca_system_score_codex":0.0012832842,"about_ca_system_score_gemma":0.0011260401,"threshold_uncertainty_score":0.086080074},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17362861,0.016360212,0.3685167,0.016274871,0.0019888151,0.00016825032,0.00078896567,0.0011240594,0.4211495],"genre_scores_gemma":[0.91256326,0.003309911,0.04390095,0.0012009484,0.0009666341,0.00027080183,0.00037402348,0.00036853744,0.037045017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870586,0.00030155337,0.00015549248,0.0002881292,0.0003564503,0.00019256394],"domain_scores_gemma":[0.9985128,0.00087484356,0.00012211093,0.00018243055,0.00021464188,0.00009315401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017201222,0.00060364266,0.0011309454,0.0023254836,0.0030324792,0.003661243,0.0010367379,0.0012189494,0.0052624145],"category_scores_gemma":[0.0036056377,0.0010172543,0.0013883085,0.0017734575,0.008065431,0.01634399,0.0034903218,0.0042071394,0.00096472545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001145164,0.000008090791,0.000034857232,0.000026167605,0.000002713619,0.00003241954,0.00044181428,0.00009625244,0.00026163078,0.99593323,0.00082092034,0.0023305072],"study_design_scores_gemma":[0.000014831602,0.000004549262,0.00007844623,0.000013304678,0.0000061035657,0.00005667853,0.00012514052,0.00031169478,0.00025481283,0.9893939,0.009731084,0.000009316088],"about_ca_topic_score_codex":0.0015490582,"about_ca_topic_score_gemma":0.0010803965,"teacher_disagreement_score":0.0052624145,"about_ca_system_score_codex":0.002600229,"about_ca_system_score_gemma":0.0009545198,"threshold_uncertainty_score":0.018866003},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53499573,0.0019688646,0.3506923,0.0011983396,0.00022097601,0.00010930294,0.0003247911,0.0002738228,0.11021592],"genre_scores_gemma":[0.95997906,0.00045275906,0.024466192,0.00016745155,0.00022374609,0.00010603969,0.00019236938,0.0000345898,0.01437777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991762,0.00023002963,0.00005098379,0.00015522662,0.0002739747,0.000113579226],"domain_scores_gemma":[0.9991485,0.00017971211,0.00013841261,0.000089208705,0.00018533245,0.00025888218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010309254,0.00032743817,0.00027611264,0.0011920569,0.0009264453,0.0015917359,0.00047786275,0.0003324876,0.0044508935],"category_scores_gemma":[0.0013414301,0.00019823031,0.0006823344,0.00063692534,0.0027363838,0.0036241983,0.0020811053,0.0012771756,0.00042217772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014976904,0.0000125921915,0.00027558478,0.000021426536,0.0000075944226,0.00006112853,0.00028471128,0.0003343846,0.0017523433,0.9945418,0.00012789691,0.0025656282],"study_design_scores_gemma":[0.000013806315,0.00006220285,0.0008841137,0.00002270555,0.000013486299,0.0002421967,0.00034159928,0.004207024,0.0028643059,0.9791047,0.012228033,0.00001579268],"about_ca_topic_score_codex":0.0006927034,"about_ca_topic_score_gemma":0.0005138301,"teacher_disagreement_score":0.0044508935,"about_ca_system_score_codex":0.00087221625,"about_ca_system_score_gemma":0.00046396552,"threshold_uncertainty_score":0.014889717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08217056,0.01318107,0.5823416,0.034693353,0.0022948652,0.000043522872,0.0005373878,0.00066203735,0.2840756],"genre_scores_gemma":[0.79640985,0.007555516,0.10919168,0.0073160105,0.0068640406,0.00007586722,0.00042384077,0.0005540477,0.07160925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.00031153217,0.000049187063,0.00018407554,0.00033256458,0.000120494136],"domain_scores_gemma":[0.9981431,0.0009201819,0.0001368908,0.0003099077,0.00031488502,0.00017521111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024425606,0.0005327422,0.0010490968,0.0016448927,0.0023312932,0.0052854912,0.0014542483,0.0015380481,0.01079074],"category_scores_gemma":[0.0049292743,0.00047308143,0.0010490053,0.0020430943,0.007041046,0.02546819,0.003291263,0.0050515556,0.0011424413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006154172,0.00000468618,0.00003359774,0.000011050214,0.000002018958,0.000012867206,0.00005843623,0.00011612934,0.0001168149,0.996689,0.0009916076,0.001957788],"study_design_scores_gemma":[0.0000028037032,0.000003837632,0.00002343908,0.0000045098154,0.0000014461781,0.00002212817,0.000028717695,0.0006593544,0.00009568678,0.9950488,0.0041047526,0.000004388673],"about_ca_topic_score_codex":0.0009634382,"about_ca_topic_score_gemma":0.0010696964,"teacher_disagreement_score":0.01079074,"about_ca_system_score_codex":0.0015789812,"about_ca_system_score_gemma":0.0007245382,"threshold_uncertainty_score":0.0360986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13125208,0.0014701223,0.23620945,0.0050121415,0.0015613518,0.000087811924,0.00048262792,0.00073480693,0.6231896],"genre_scores_gemma":[0.8513947,0.0007690832,0.028008778,0.0011653004,0.0010572233,0.00009226424,0.00042394482,0.00023004759,0.11685861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873143,0.00029761606,0.00006639585,0.00023442233,0.00046882167,0.00020124386],"domain_scores_gemma":[0.9988446,0.00021961053,0.00008115693,0.00026664237,0.00036465286,0.00022332052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013859497,0.0004128959,0.00068090245,0.0016062963,0.0030555136,0.0045303237,0.00090768375,0.0010176566,0.01142711],"category_scores_gemma":[0.0026546158,0.00046290373,0.0007281895,0.0010659492,0.0033560921,0.0076187616,0.0031442195,0.0034005158,0.002530258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058837263,0.000008351694,0.000027573804,0.000004238043,0.0000013605284,0.000010980074,0.00007476725,0.00002755246,0.00012323345,0.997681,0.00071904506,0.0013160247],"study_design_scores_gemma":[0.0000063737143,0.0000026078912,0.000031730047,0.0000034610187,0.0000031321388,0.0000576985,0.000047817088,0.0005166593,0.00033523436,0.9934615,0.0055298167,0.000003996107],"about_ca_topic_score_codex":0.0005255383,"about_ca_topic_score_gemma":0.0005512121,"teacher_disagreement_score":0.01142711,"about_ca_system_score_codex":0.0014462598,"about_ca_system_score_gemma":0.00088406156,"threshold_uncertainty_score":0.0382275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7311247,0.0019854372,0.17639604,0.0012995978,0.00056004786,0.000051010742,0.00026300675,0.0004017174,0.08791849],"genre_scores_gemma":[0.96853715,0.00051311887,0.010245191,0.00019460218,0.00025687757,0.000050505936,0.00017596305,0.00017135462,0.019855158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836236,0.0003180738,0.00012703075,0.0003391857,0.00048116143,0.00037217943],"domain_scores_gemma":[0.99622405,0.0016380037,0.00039486092,0.0005473878,0.00043971892,0.0007559133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024792312,0.0011985947,0.0013858725,0.004077497,0.004023781,0.006450941,0.0019730174,0.0016161874,0.008281539],"category_scores_gemma":[0.005698913,0.0011932942,0.0015126776,0.002563836,0.007894882,0.011723854,0.005321589,0.0044845706,0.0012050334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005073425,0.00001931071,0.00022444961,0.00002123216,0.000012360244,0.00014926535,0.00070421275,0.00027240947,0.0007203979,0.99549556,0.00024457148,0.002085462],"study_design_scores_gemma":[0.000010561073,0.000020092799,0.00020745871,0.000009482987,0.000013273818,0.00010469192,0.00019956323,0.0009869712,0.0008607371,0.9965473,0.0010271769,0.000012747653],"about_ca_topic_score_codex":0.0006029262,"about_ca_topic_score_gemma":0.0007331892,"teacher_disagreement_score":0.008281539,"about_ca_system_score_codex":0.0013936416,"about_ca_system_score_gemma":0.00067770464,"threshold_uncertainty_score":0.027704477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2375043,0.0038254377,0.49261907,0.008622525,0.0017252533,0.0001772217,0.0006762045,0.0009863133,0.25386372],"genre_scores_gemma":[0.92280823,0.0010503576,0.04806171,0.00063527335,0.0010952364,0.000182243,0.00041853954,0.00027293598,0.025475496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934168,0.0016305593,0.00068975525,0.0013022933,0.0020570639,0.0009036182],"domain_scores_gemma":[0.98878735,0.005153879,0.0011325645,0.0016232508,0.0016269673,0.0016760087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047488087,0.00067889993,0.0019091216,0.0039273724,0.0056823823,0.0086844135,0.0017868272,0.0017329034,0.009705566],"category_scores_gemma":[0.015314025,0.0012308898,0.0015529505,0.0039420915,0.013115358,0.015197317,0.0064283647,0.006300724,0.0012814153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018602983,0.00000927348,0.00006536844,0.000011434806,0.0000031699394,0.000015033106,0.00017871548,0.00014718199,0.00012713292,0.99725,0.0003256807,0.0018484734],"study_design_scores_gemma":[0.000013917913,0.0000056748695,0.000045465833,0.0000071198024,0.000004212787,0.000027109563,0.00012481942,0.0004728116,0.00020879069,0.9967211,0.0023630653,0.0000059099475],"about_ca_topic_score_codex":0.0017583349,"about_ca_topic_score_gemma":0.0012591297,"teacher_disagreement_score":0.009705566,"about_ca_system_score_codex":0.0026395859,"about_ca_system_score_gemma":0.0013096893,"threshold_uncertainty_score":0.03246838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81384903,0.0017670128,0.1037588,0.0010328029,0.0002713743,0.000065867775,0.00036514062,0.0006329406,0.07825712],"genre_scores_gemma":[0.9691309,0.00038668155,0.009729132,0.000081176855,0.00018007692,0.00002971214,0.00020016325,0.00012859004,0.020133492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907446,0.00015279079,0.000060294275,0.00021566077,0.00021434357,0.0002823793],"domain_scores_gemma":[0.9988788,0.00034721542,0.00013753232,0.00012103594,0.00015162324,0.00036387413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015461905,0.000851988,0.0012274261,0.0029758418,0.003224378,0.004324329,0.0009872627,0.00096867484,0.008685879],"category_scores_gemma":[0.0022551815,0.0008392903,0.0013034442,0.0020301417,0.0042234,0.0074500404,0.002529815,0.0019337161,0.0013290301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000996428,0.00002562729,0.0003902699,0.000023661574,0.000007813378,0.00014009724,0.0007865184,0.00025811727,0.00087423064,0.99435025,0.00038795138,0.0026559127],"study_design_scores_gemma":[0.000067609675,0.00004348443,0.0006336279,0.000015960668,0.000029732839,0.0002364389,0.0005055368,0.0012794102,0.0011228315,0.9917321,0.00430548,0.000027701448],"about_ca_topic_score_codex":0.0013491701,"about_ca_topic_score_gemma":0.0015681896,"teacher_disagreement_score":0.008685879,"about_ca_system_score_codex":0.0013334303,"about_ca_system_score_gemma":0.0006877505,"threshold_uncertainty_score":0.029057205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31737572,0.0012218083,0.48165601,0.002925294,0.0012504898,0.00040684763,0.0008167425,0.005169632,0.1891774],"genre_scores_gemma":[0.8722697,0.00063015753,0.048721794,0.0010919139,0.0009049893,0.00042565665,0.0007406637,0.0013825047,0.073832676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943348,0.000874642,0.00034847736,0.0016542678,0.0014087548,0.0013790239],"domain_scores_gemma":[0.98521024,0.004364116,0.0011894878,0.004120399,0.004151352,0.0009644324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002968713,0.0011154547,0.0026579278,0.0030916827,0.006074948,0.007478591,0.0017435587,0.0027098581,0.01065445],"category_scores_gemma":[0.011117341,0.0015208365,0.001956312,0.0032717194,0.007510179,0.017645644,0.007147684,0.0054749264,0.0038032457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008337257,0.000025498643,0.00067154004,0.0000335464,0.0000226525,0.00016444025,0.00068603276,0.000081722275,0.0022509997,0.9846175,0.0017568493,0.009605931],"study_design_scores_gemma":[0.00003774424,0.000035680398,0.00051598385,0.000017745235,0.000065985136,0.00059718016,0.00039292182,0.0007189518,0.0064830217,0.9751304,0.01597699,0.000027349804],"about_ca_topic_score_codex":0.00069022895,"about_ca_topic_score_gemma":0.00048618612,"teacher_disagreement_score":0.01065445,"about_ca_system_score_codex":0.0021169279,"about_ca_system_score_gemma":0.0018371991,"threshold_uncertainty_score":0.035642684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064928666,0.0058444785,0.5473609,0.017119877,0.0019156912,0.00019813726,0.0011885539,0.00050931034,0.36093444],"genre_scores_gemma":[0.78793454,0.006950759,0.09676694,0.0028854515,0.0025271121,0.00032992242,0.0018229301,0.0005664516,0.10021591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680364,0.0011751393,0.00017837774,0.000700958,0.0007706429,0.0003713218],"domain_scores_gemma":[0.9922937,0.00477941,0.00040328447,0.001302572,0.00082710886,0.00039389823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030383999,0.0014418537,0.0018933474,0.002677851,0.0039603775,0.005773769,0.0027913034,0.0023703622,0.0184717],"category_scores_gemma":[0.011837096,0.0012611942,0.0022099928,0.0059561403,0.010930274,0.026031038,0.007619566,0.008928055,0.0019308425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009523511,0.00000400687,0.000030315687,0.000017289674,0.0000031067013,0.00002381222,0.00009553015,0.00043240702,0.00003115693,0.9964336,0.0010286663,0.0018905585],"study_design_scores_gemma":[0.000004827728,0.000001973733,0.000019386696,0.000009588639,0.000003266193,0.000017839044,0.000030839423,0.00063597824,0.00003165252,0.9958299,0.0034114814,0.0000033265592],"about_ca_topic_score_codex":0.005264577,"about_ca_topic_score_gemma":0.0038024145,"teacher_disagreement_score":0.0184717,"about_ca_system_score_codex":0.003369726,"about_ca_system_score_gemma":0.0017490117,"threshold_uncertainty_score":0.061793923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30454358,0.003480567,0.39201504,0.0059379414,0.0032066293,0.00008372106,0.000601081,0.00043643668,0.2896951],"genre_scores_gemma":[0.88844293,0.0015706058,0.041159935,0.0015173033,0.0023483897,0.00008897774,0.00047290276,0.00020431718,0.064194694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991393,0.0001572478,0.00005414051,0.00024468443,0.00025668886,0.00014788049],"domain_scores_gemma":[0.99895716,0.00035773203,0.00010570496,0.00021685568,0.0002126757,0.00014977313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012786076,0.00056494656,0.0008280113,0.0018241588,0.0018965104,0.0033208542,0.0010702596,0.0010656503,0.006947719],"category_scores_gemma":[0.0021096296,0.00048322178,0.0014229639,0.0012101982,0.0032232718,0.007962469,0.0020126319,0.003167707,0.001189991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008594358,0.000006486954,0.00005413547,0.000013424,0.0000034858226,0.0000273186,0.000088015884,0.00011399849,0.00035624055,0.9970817,0.00068715215,0.0015593386],"study_design_scores_gemma":[0.00000766874,0.00000920005,0.00013215421,0.0000054829748,0.0000051335655,0.00009878428,0.000028766954,0.0007529474,0.00039445455,0.99497765,0.0035801975,0.0000074801574],"about_ca_topic_score_codex":0.0006461626,"about_ca_topic_score_gemma":0.0006007545,"teacher_disagreement_score":0.006947719,"about_ca_system_score_codex":0.0010176159,"about_ca_system_score_gemma":0.0007034433,"threshold_uncertainty_score":0.023242474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2335005,0.004165592,0.57071126,0.0031156593,0.0018149873,0.00014194754,0.00057248195,0.0024794722,0.18349805],"genre_scores_gemma":[0.85983187,0.001214466,0.10823365,0.0010900366,0.0007791039,0.00015432356,0.00046731677,0.00083673815,0.027392456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715245,0.00053087453,0.00023492833,0.0009969912,0.00051142037,0.00057342055],"domain_scores_gemma":[0.9970174,0.0010380913,0.00020338334,0.0010325763,0.00036156643,0.00034705727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033510684,0.0010589296,0.0015965566,0.002558284,0.002250731,0.004127054,0.001938647,0.0016120884,0.009528163],"category_scores_gemma":[0.007586541,0.0013152863,0.0027103892,0.002395321,0.008723161,0.019132555,0.0067110844,0.0067337384,0.0014879913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007299405,0.000024699115,0.0001385588,0.00007843354,0.000027120308,0.000056073546,0.00045647315,0.00031156142,0.0020395613,0.9845403,0.0006671478,0.011587073],"study_design_scores_gemma":[0.000022967437,0.00003246421,0.00022742905,0.00003654633,0.000101616,0.00012540424,0.00018446278,0.001259004,0.006308377,0.98269236,0.008975496,0.000033888522],"about_ca_topic_score_codex":0.00054092135,"about_ca_topic_score_gemma":0.000625184,"teacher_disagreement_score":0.009528163,"about_ca_system_score_codex":0.001305046,"about_ca_system_score_gemma":0.00094236,"threshold_uncertainty_score":0.031874895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05955892,0.0044006575,0.77099717,0.008650854,0.0013465245,0.00020163447,0.00047355666,0.0008603903,0.15351035],"genre_scores_gemma":[0.79736537,0.0015766083,0.17400512,0.0015383804,0.00071353617,0.00022629135,0.0005181106,0.0003128168,0.02374367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965953,0.001529647,0.0001822157,0.00033493366,0.00082998886,0.0005278335],"domain_scores_gemma":[0.99353987,0.0042184643,0.00028009445,0.00084281503,0.0006719104,0.0004468842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045725685,0.0010918565,0.0013363098,0.002593032,0.0029540872,0.006976961,0.0032752,0.0030907157,0.009175087],"category_scores_gemma":[0.009333911,0.0009801997,0.0024903836,0.0021213666,0.008924989,0.013786837,0.0047788857,0.0067654215,0.001063097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016738042,0.00001226862,0.000030920055,0.00001855443,0.000004373481,0.000022442833,0.00014822997,0.00027268656,0.00011979807,0.9977302,0.00035701608,0.0012666908],"study_design_scores_gemma":[0.000023421708,0.00000831663,0.000043045686,0.000014024166,0.000007264992,0.000025747522,0.000053185056,0.0017413548,0.00019030322,0.99557614,0.0023089133,0.000008404351],"about_ca_topic_score_codex":0.0016697048,"about_ca_topic_score_gemma":0.0016425726,"teacher_disagreement_score":0.009175087,"about_ca_system_score_codex":0.0029958312,"about_ca_system_score_gemma":0.001629806,"threshold_uncertainty_score":0.03069377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09500452,0.003284711,0.81880635,0.0011334466,0.00079646584,0.00023253878,0.0008887531,0.0018097562,0.07804346],"genre_scores_gemma":[0.68146276,0.0015379876,0.3043952,0.00032909334,0.00073424104,0.00029391033,0.001314286,0.00033271546,0.009599841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972193,0.00089048146,0.00033222066,0.00036902583,0.0008041861,0.00038467348],"domain_scores_gemma":[0.9972952,0.0011752357,0.00034755375,0.0004766907,0.00043102723,0.00027423716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024323808,0.00071901816,0.00087803655,0.0021860297,0.0014005263,0.00836948,0.0019593216,0.0014497082,0.006898894],"category_scores_gemma":[0.0067479867,0.00075787446,0.0014273871,0.0028039266,0.004208714,0.012767093,0.0035139,0.0025146154,0.0015636388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009571442,0.00004432187,0.00019532297,0.000070952425,0.000010600731,0.00010002194,0.0005693269,0.0026449424,0.0017180948,0.97738326,0.001151815,0.01601568],"study_design_scores_gemma":[0.000041055322,0.000039207815,0.000095975694,0.00003892634,0.00001653803,0.00011876749,0.00025292014,0.011066157,0.0018812305,0.97760457,0.0088241575,0.00002045509],"about_ca_topic_score_codex":0.0009562552,"about_ca_topic_score_gemma":0.000737889,"teacher_disagreement_score":0.00836948,"about_ca_system_score_codex":0.0012751664,"about_ca_system_score_gemma":0.00083613413,"threshold_uncertainty_score":0.023079038},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061157316,0.027741343,0.37194553,0.007872173,0.0013922218,0.00031444608,0.002190128,0.0006151502,0.5267717],"genre_scores_gemma":[0.75427866,0.01462344,0.16891398,0.002505758,0.0032232616,0.00053705653,0.0020517188,0.00018341688,0.05368267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987166,0.00035089985,0.00009031802,0.00026235898,0.0004562384,0.0001235634],"domain_scores_gemma":[0.998187,0.00075612206,0.0002266901,0.00025874408,0.00042101735,0.00015042404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010816766,0.0008433841,0.0006682796,0.0031949044,0.0017786912,0.0060948203,0.0008576404,0.0009110143,0.012674403],"category_scores_gemma":[0.0036432857,0.0003790744,0.0006999943,0.0029124054,0.004483438,0.009074668,0.0021252087,0.0024185933,0.0017126693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002185916,0.0000017104878,0.000021678557,0.000017400167,0.0000020470395,0.000009696758,0.000063092266,0.00015646894,0.00010862356,0.9971226,0.00066361664,0.0018308931],"study_design_scores_gemma":[0.0000031496722,0.0000036183635,0.00008365476,0.000014372398,0.0000027091555,0.00005557695,0.00005211281,0.0010988171,0.000116118106,0.97757214,0.020991696,0.0000059811223],"about_ca_topic_score_codex":0.0014196917,"about_ca_topic_score_gemma":0.0010175039,"teacher_disagreement_score":0.012674403,"about_ca_system_score_codex":0.0019832323,"about_ca_system_score_gemma":0.00094727194,"threshold_uncertainty_score":0.042400062},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030997893,0.008299999,0.3935668,0.13294856,0.007284049,0.0000738504,0.000963489,0.0014248553,0.42444053],"genre_scores_gemma":[0.7162187,0.0036911045,0.12659426,0.0277111,0.0067461547,0.00025542517,0.0005715834,0.0015836307,0.11662801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979183,0.00067591877,0.000083952385,0.0005131765,0.00061286095,0.00019570961],"domain_scores_gemma":[0.995846,0.0019405943,0.00016482164,0.0012681785,0.0004957935,0.00028477216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028910418,0.0007147585,0.0012460385,0.001089071,0.0035933875,0.005713165,0.0013210488,0.0034487396,0.03152124],"category_scores_gemma":[0.009867274,0.0005577222,0.001406937,0.00093900354,0.010898765,0.022683201,0.003722545,0.009121055,0.0051892796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010498762,0.0000046413606,0.00002762362,0.000012494918,0.000004877566,0.0000068605195,0.000029405332,0.000080334874,0.000052331463,0.9936737,0.003463571,0.002633667],"study_design_scores_gemma":[0.000006721099,0.000002989466,0.00002213769,0.000008383925,0.0000025333575,0.000014744308,0.000015931242,0.00022893857,0.00006478067,0.9914437,0.008183198,0.000005903848],"about_ca_topic_score_codex":0.0008085161,"about_ca_topic_score_gemma":0.0013139228,"teacher_disagreement_score":0.03152124,"about_ca_system_score_codex":0.0019356626,"about_ca_system_score_gemma":0.0010699348,"threshold_uncertainty_score":0.10544902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20381454,0.0032342405,0.6813784,0.006578737,0.00068822544,0.00026771848,0.00024940568,0.00035853125,0.10343023],"genre_scores_gemma":[0.93474287,0.00062464783,0.05820128,0.000790106,0.0003966624,0.00017889122,0.00017172458,0.00007205045,0.0048218016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99477947,0.0015288169,0.0006465172,0.00092479354,0.0013193969,0.00080101175],"domain_scores_gemma":[0.9904152,0.005176722,0.0008482508,0.0011471077,0.0018889951,0.00052373693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005539991,0.000487776,0.00081342354,0.0014888381,0.0029086417,0.0038613179,0.0010416573,0.0020070442,0.007396591],"category_scores_gemma":[0.0077310195,0.00066709734,0.0012544076,0.001389796,0.012719648,0.016108217,0.0048184907,0.0042643473,0.0006462938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015047388,0.000007131416,0.00017832624,0.000040156534,0.0000043033237,0.00007710279,0.0005667626,0.00009699387,0.0005491664,0.99637043,0.00020498621,0.0018897095],"study_design_scores_gemma":[0.00004513984,0.00005991223,0.0006052026,0.000053523567,0.000020378979,0.00029372537,0.0008053304,0.002084338,0.0021969925,0.9813503,0.01245378,0.000031269094],"about_ca_topic_score_codex":0.0011991377,"about_ca_topic_score_gemma":0.0012943402,"teacher_disagreement_score":0.007396591,"about_ca_system_score_codex":0.0017038747,"about_ca_system_score_gemma":0.0016868471,"threshold_uncertainty_score":0.029298663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44633573,0.00051709596,0.4172644,0.0010135875,0.0001749696,0.000112312075,0.00024114506,0.0012230704,0.1331177],"genre_scores_gemma":[0.9769753,0.00008656354,0.014666513,0.000094622075,0.00006010382,0.00007347652,0.000073080555,0.00007713547,0.00789313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853706,0.00039135854,0.00009257231,0.00023639051,0.00044548544,0.00029714755],"domain_scores_gemma":[0.9985544,0.0005128776,0.00015109315,0.00038865648,0.0002056986,0.00018733359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140441,0.00037242888,0.0004762872,0.001197437,0.0020599174,0.0030708455,0.00071490294,0.00083242566,0.006913489],"category_scores_gemma":[0.0019625616,0.0004512117,0.0012429442,0.0006979234,0.0045280512,0.00612699,0.0037206851,0.0014927776,0.0005863581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015175849,0.000010295813,0.00032272324,0.000015048893,0.0000067901606,0.00017978244,0.00039243515,0.00047262266,0.0012791918,0.9954585,0.00013077143,0.0017167473],"study_design_scores_gemma":[0.000016047863,0.000037094553,0.00054062356,0.000022051445,0.000018406407,0.0003226212,0.00024083057,0.006913247,0.002523966,0.9821383,0.007202209,0.000024479103],"about_ca_topic_score_codex":0.0016187617,"about_ca_topic_score_gemma":0.001524176,"teacher_disagreement_score":0.006913489,"about_ca_system_score_codex":0.0015063996,"about_ca_system_score_gemma":0.0008137441,"threshold_uncertainty_score":0.023127913},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018584926,0.039980218,0.10589154,0.1023847,0.0109806005,0.000052204054,0.0009116813,0.0003946144,0.7208195],"genre_scores_gemma":[0.5738372,0.032112624,0.04233981,0.046408303,0.010403531,0.00027688482,0.0013363245,0.0006021053,0.29268327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970847,0.000838216,0.00017688575,0.0010355596,0.00060815184,0.00025658644],"domain_scores_gemma":[0.9971841,0.0010479186,0.00026054645,0.0006350082,0.0007076101,0.00016478392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024619189,0.00067947013,0.0004996312,0.0010458102,0.0050500915,0.00780583,0.0012483061,0.0027938837,0.014235482],"category_scores_gemma":[0.0051413868,0.0006319257,0.00094588625,0.0015329935,0.013711205,0.018522307,0.0035333266,0.007891536,0.004790752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015483218,0.0000051222837,0.00016090796,0.000045749603,0.0000072175385,0.000024098003,0.0019330783,0.000050369606,0.00017147898,0.97773105,0.013550107,0.006305334],"study_design_scores_gemma":[0.000009563291,0.00001765747,0.00066965003,0.0001943896,0.000017797487,0.00016757095,0.0010316351,0.00017675222,0.00035131615,0.4054833,0.5918556,0.000024724355],"about_ca_topic_score_codex":0.009922032,"about_ca_topic_score_gemma":0.010575986,"teacher_disagreement_score":0.014235482,"about_ca_system_score_codex":0.004316778,"about_ca_system_score_gemma":0.003188484,"threshold_uncertainty_score":0.047622383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6639066,0.0028363098,0.28537798,0.0009192537,0.00011896281,0.00016539569,0.00068550685,0.00046949627,0.045520604],"genre_scores_gemma":[0.876736,0.0018112311,0.11224191,0.00027032007,0.00021152488,0.0002748311,0.001600688,0.00013148904,0.006721975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983918,0.0003812218,0.00014650698,0.00027537887,0.0005531673,0.0002518562],"domain_scores_gemma":[0.9975036,0.0014356079,0.00025153253,0.0002318292,0.0003620901,0.00021543504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243342,0.0006249335,0.0008406458,0.0022618845,0.001769405,0.002848112,0.0012863158,0.0010253756,0.004224212],"category_scores_gemma":[0.0053352793,0.00039891482,0.0011668035,0.0030263786,0.0019123253,0.006390355,0.0014016712,0.0019352076,0.0007149772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024346294,0.00014086698,0.0032967075,0.00026479823,0.000033700908,0.00019997153,0.00059130666,0.005801217,0.0064626564,0.87197465,0.0019542882,0.109036386],"study_design_scores_gemma":[0.000040366365,0.00015748538,0.0022379486,0.00013634672,0.000051991596,0.00092437735,0.00057009613,0.049105458,0.014970944,0.9173236,0.014414737,0.00006672009],"about_ca_topic_score_codex":0.00064680155,"about_ca_topic_score_gemma":0.00039067518,"teacher_disagreement_score":0.004224212,"about_ca_system_score_codex":0.0015925234,"about_ca_system_score_gemma":0.0008115229,"threshold_uncertainty_score":0.014131367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82776797,0.00083811133,0.14398369,0.0003279357,0.000031384112,0.000045272925,0.00026826814,0.0004110037,0.026326299],"genre_scores_gemma":[0.9713661,0.00022683883,0.025005873,0.000048333175,0.000053646887,0.000053202202,0.00017195677,0.000053801516,0.0030202866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987476,0.0002797375,0.00009912284,0.00023135937,0.00044855272,0.00019363828],"domain_scores_gemma":[0.9960258,0.0020231272,0.0007593752,0.00036768714,0.0005471359,0.00027683348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012122835,0.00030283074,0.00049379346,0.0019966909,0.0010263964,0.0023412348,0.0006053976,0.00036680297,0.0029600663],"category_scores_gemma":[0.0054806415,0.000252326,0.0005605988,0.0019035111,0.001722563,0.0037874652,0.00087317097,0.0006468922,0.00022921235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031337982,0.000016424337,0.002541121,0.000038400125,0.000010988619,0.0001778987,0.0003768237,0.002079364,0.0018684947,0.9810065,0.00039206716,0.011460713],"study_design_scores_gemma":[0.000016780066,0.000074296,0.002087064,0.000025172285,0.000032899676,0.00065691676,0.0002914318,0.040541194,0.0061841495,0.9449251,0.005141632,0.000023302548],"about_ca_topic_score_codex":0.0011383714,"about_ca_topic_score_gemma":0.00071896164,"teacher_disagreement_score":0.0029600663,"about_ca_system_score_codex":0.0020279796,"about_ca_system_score_gemma":0.0005442825,"threshold_uncertainty_score":0.014714062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7989486,0.0012307477,0.18634449,0.00052586396,0.000097915996,0.00009833158,0.00045739248,0.00073898473,0.011557743],"genre_scores_gemma":[0.946384,0.000229289,0.049287327,0.00014145674,0.00009169798,0.00007803211,0.0004575019,0.00007680043,0.003253753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983095,0.00020364927,0.00019361684,0.0008245593,0.00023041212,0.00023821411],"domain_scores_gemma":[0.99455404,0.0022605371,0.00072802434,0.0010277756,0.001048754,0.0003808023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017438212,0.00037233287,0.0013642729,0.0012905459,0.0018322566,0.002697818,0.0008429512,0.0010723654,0.0022511296],"category_scores_gemma":[0.0049859257,0.0007412911,0.0011539981,0.0009797203,0.003419412,0.005237435,0.0027793348,0.0012712858,0.00058333215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085751247,0.00010551212,0.015391798,0.00041907845,0.0001904992,0.0009498327,0.002999395,0.00221849,0.07812692,0.83880156,0.001844041,0.05809533],"study_design_scores_gemma":[0.000261294,0.0008073583,0.013822711,0.00023428835,0.0004973362,0.004474545,0.002452943,0.015004084,0.19591293,0.7223982,0.043840867,0.00029339688],"about_ca_topic_score_codex":0.0007339522,"about_ca_topic_score_gemma":0.00064312114,"teacher_disagreement_score":0.002697818,"about_ca_system_score_codex":0.0011555897,"about_ca_system_score_gemma":0.0013346373,"threshold_uncertainty_score":0.009222329},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5144769,0.00066200166,0.42860144,0.0005745992,0.00018395144,0.000146215,0.0005804076,0.0009437564,0.053830743],"genre_scores_gemma":[0.92293054,0.00015993533,0.068943724,0.00013604457,0.0000932424,0.00016452101,0.0004989007,0.0000721716,0.0070009045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964359,0.000703127,0.00035580038,0.0010490088,0.00089956145,0.0005566254],"domain_scores_gemma":[0.9976241,0.0006564424,0.00031218815,0.0006479098,0.00046016564,0.0002992616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019704867,0.00040697987,0.0005694482,0.001834562,0.0023595968,0.0022120157,0.0008717099,0.0007962639,0.0065671513],"category_scores_gemma":[0.0033491596,0.00045434322,0.0009427435,0.0009031167,0.0035585198,0.0039818822,0.004744799,0.0014280867,0.00089702266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041231455,0.000026542088,0.00064983394,0.00003775047,0.00001227862,0.00012910913,0.0006696628,0.0014175957,0.0038058439,0.9823156,0.00044694365,0.010447502],"study_design_scores_gemma":[0.000031345946,0.000060918486,0.0011060776,0.000024880064,0.000013401937,0.00020879498,0.00023066688,0.009311328,0.004513539,0.9753184,0.009147132,0.00003349023],"about_ca_topic_score_codex":0.0009981318,"about_ca_topic_score_gemma":0.0010183457,"teacher_disagreement_score":0.0065671513,"about_ca_system_score_codex":0.0014560678,"about_ca_system_score_gemma":0.0006862643,"threshold_uncertainty_score":0.021969318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05911394,0.002166735,0.876655,0.00501944,0.00040515698,0.00008406981,0.0002646438,0.00062954694,0.05566159],"genre_scores_gemma":[0.632011,0.0021404491,0.3525659,0.0008337143,0.00044995142,0.00016803581,0.00046130025,0.0001256132,0.011244019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608237,0.0013219985,0.00042346815,0.000791953,0.0010343782,0.00034592886],"domain_scores_gemma":[0.9938851,0.0025735025,0.00045006533,0.0019937463,0.0008136576,0.00028394838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044659562,0.00047609067,0.00066929625,0.00189616,0.001719969,0.00983925,0.0016651487,0.0015849944,0.0045019514],"category_scores_gemma":[0.016561283,0.0005201882,0.0011365396,0.0020428959,0.008878331,0.022938747,0.0047400296,0.0023388292,0.0011901793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020942389,0.000005602307,0.00011214032,0.00002133376,0.0000048285597,0.000021330303,0.00025941775,0.00080652954,0.00021670536,0.98674184,0.0005323511,0.011256935],"study_design_scores_gemma":[0.000004856035,0.0000067577016,0.00003560099,0.000017322713,0.0000070526517,0.000029223089,0.00009582714,0.004234708,0.00039605465,0.9900642,0.005100804,0.000007596599],"about_ca_topic_score_codex":0.0012538544,"about_ca_topic_score_gemma":0.0011872296,"teacher_disagreement_score":0.00983925,"about_ca_system_score_codex":0.0022691241,"about_ca_system_score_gemma":0.0018431952,"threshold_uncertainty_score":0.02361852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44092885,0.0005340249,0.4791237,0.002706398,0.00044009162,0.00013360061,0.0002373111,0.0009087167,0.07498726],"genre_scores_gemma":[0.90866715,0.00015179956,0.069175884,0.0003207164,0.00016918368,0.00007606503,0.000108042586,0.00013166216,0.021199476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902964,0.00020036029,0.00006396374,0.00014311746,0.0002834474,0.00027946872],"domain_scores_gemma":[0.99874794,0.00045722147,0.0001445982,0.00017046188,0.00014785457,0.00033198475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016243948,0.00070822524,0.0006771868,0.001640287,0.0023829977,0.0035067445,0.0014284933,0.0017705888,0.007920087],"category_scores_gemma":[0.0022328387,0.0005992248,0.0019785468,0.001065017,0.0047215167,0.007077675,0.0038193115,0.00254306,0.0011129874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045051107,0.000020003761,0.00010449374,0.00001423705,0.000006138984,0.00007825638,0.00019273469,0.00021541439,0.0012798691,0.9949274,0.00025019242,0.002866194],"study_design_scores_gemma":[0.00004229021,0.000043916185,0.00019778941,0.000009093525,0.000018696586,0.00011918966,0.00009510026,0.003727093,0.0018567382,0.9912545,0.0026133512,0.000022274347],"about_ca_topic_score_codex":0.0006662869,"about_ca_topic_score_gemma":0.0006538588,"teacher_disagreement_score":0.007920087,"about_ca_system_score_codex":0.0014028904,"about_ca_system_score_gemma":0.00059896754,"threshold_uncertainty_score":0.026495337},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24367948,0.01292431,0.3632081,0.0090742335,0.0016269655,0.00021896618,0.0014765023,0.00044730265,0.3673441],"genre_scores_gemma":[0.91835177,0.004171581,0.043947406,0.0017262402,0.0021732987,0.0002164674,0.0007351799,0.0001430593,0.028535085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921703,0.00018926429,0.00006716234,0.00013346015,0.00025444455,0.00013858233],"domain_scores_gemma":[0.99802506,0.0010636719,0.00022266831,0.00019130734,0.00032233357,0.00017493179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017814356,0.00046241313,0.00060319493,0.001640393,0.0015547836,0.0032849668,0.0010704793,0.0009173231,0.013959635],"category_scores_gemma":[0.004504237,0.000366142,0.0009937874,0.0015581271,0.0033902973,0.006853524,0.0017208182,0.0025842784,0.0013267644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011920933,0.0000118905145,0.00008571006,0.000025581698,0.0000043375294,0.000027926475,0.00009400329,0.00013186621,0.0003826285,0.9956872,0.00085437944,0.0026825299],"study_design_scores_gemma":[0.000004638338,0.000013138855,0.0001856924,0.000012814008,0.000004900337,0.00009217265,0.000049024475,0.0012053937,0.0003805964,0.9942585,0.003785927,0.000007076061],"about_ca_topic_score_codex":0.0008489596,"about_ca_topic_score_gemma":0.0006841691,"teacher_disagreement_score":0.013959635,"about_ca_system_score_codex":0.0014447819,"about_ca_system_score_gemma":0.00069547934,"threshold_uncertainty_score":0.046699643},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14036314,0.0036298698,0.3327992,0.0037758895,0.0011228513,0.00012456675,0.0010115252,0.00048889255,0.5166841],"genre_scores_gemma":[0.91567105,0.00079660054,0.04152047,0.001056851,0.00050731923,0.00017476692,0.00059049804,0.00011582297,0.039566625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856794,0.00046115523,0.000066118286,0.00025263365,0.00040155064,0.00025067627],"domain_scores_gemma":[0.99899584,0.00029279958,0.000071600916,0.00014148375,0.00032432098,0.00017397589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570855,0.000267325,0.00042695794,0.0017380806,0.0017982929,0.004174851,0.0004766031,0.00077336095,0.008913018],"category_scores_gemma":[0.0022022496,0.00027491272,0.00062371156,0.001060897,0.0027531795,0.004161072,0.0024520503,0.0016762943,0.001044691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066027324,0.000004422524,0.00008298043,0.000007753736,0.0000011697575,0.00002328588,0.00008655484,0.00011257562,0.00014461185,0.9973259,0.000543626,0.0016605047],"study_design_scores_gemma":[0.000009549164,0.000008694008,0.0001878693,0.000009809339,0.0000023423806,0.00012730969,0.00013027756,0.0017649125,0.00033128518,0.97731346,0.020107323,0.0000071396657],"about_ca_topic_score_codex":0.0015269963,"about_ca_topic_score_gemma":0.0010996101,"teacher_disagreement_score":0.008913018,"about_ca_system_score_codex":0.0023419445,"about_ca_system_score_gemma":0.0009176138,"threshold_uncertainty_score":0.029816985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48544976,0.0009334048,0.46164596,0.00086720247,0.000093186914,0.00012622155,0.00037366664,0.00037937044,0.05013123],"genre_scores_gemma":[0.8728573,0.0005765935,0.1162994,0.00021822457,0.000101138736,0.00021032897,0.0008025481,0.000105401996,0.008829081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982917,0.00055113883,0.00014200564,0.00021519524,0.00052876415,0.00027130346],"domain_scores_gemma":[0.99819523,0.00085743464,0.0001843875,0.00021640261,0.0003406628,0.00020580372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022250556,0.00053753634,0.0008104055,0.0017447583,0.0022224993,0.0033099,0.0009361053,0.0007001771,0.004520629],"category_scores_gemma":[0.004047428,0.00040915827,0.0013719787,0.001958205,0.002488108,0.0071753194,0.0021756173,0.0017307007,0.0008384191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000956974,0.00003705264,0.0005289256,0.00005911454,0.000010258469,0.0000774176,0.00029775998,0.0016179299,0.0022274686,0.9757102,0.00046818762,0.018869933],"study_design_scores_gemma":[0.000017425167,0.000056330726,0.00038254075,0.000031690146,0.000017232063,0.00019354375,0.00021902515,0.014490762,0.006595107,0.97255725,0.00541332,0.000025765674],"about_ca_topic_score_codex":0.00069274666,"about_ca_topic_score_gemma":0.0005529423,"teacher_disagreement_score":0.004520629,"about_ca_system_score_codex":0.0014989026,"about_ca_system_score_gemma":0.00089278613,"threshold_uncertainty_score":0.01512301},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006176757,0.7911074,0.02858998,0.030182716,0.0045944466,0.00004509253,0.00097089284,0.00051597646,0.14337587],"genre_scores_gemma":[0.038824756,0.67984754,0.04630302,0.01422662,0.009406496,0.00035266654,0.001885005,0.00095323,0.20820066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897814,0.00020991311,0.0000825411,0.00015343488,0.0005094498,0.00006661333],"domain_scores_gemma":[0.99787915,0.0013019717,0.00017399118,0.00013915857,0.00037199058,0.00013372416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014805933,0.0015960572,0.0014248583,0.0041243345,0.0017047299,0.0037615844,0.0017828351,0.002773296,0.040815435],"category_scores_gemma":[0.0033521752,0.0021538392,0.0011284244,0.005773608,0.0036759146,0.010765568,0.0015478624,0.0055964915,0.016054414],"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.000026639476,0.000030949464,0.00015412623,0.00065833755,0.000029515939,0.00007840135,0.00045621677,0.00048065477,0.00017306567,0.22030202,0.6884525,0.08915763],"study_design_scores_gemma":[0.000013489926,0.00001619288,0.000513865,0.000925242,0.000022869752,0.00019363631,0.00014757186,0.0005178274,0.00012305514,0.2604896,0.7370067,0.000029962519],"about_ca_topic_score_codex":0.008406902,"about_ca_topic_score_gemma":0.012441337,"teacher_disagreement_score":0.040815435,"about_ca_system_score_codex":0.003995374,"about_ca_system_score_gemma":0.0019979265,"threshold_uncertainty_score":0.13654125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6409456,0.000910312,0.20439035,0.002255514,0.00042573563,0.00009991906,0.0009715061,0.0008371029,0.14916389],"genre_scores_gemma":[0.9627008,0.00048835657,0.014332287,0.00042513668,0.00040293857,0.00006520447,0.00064947444,0.0003074663,0.020628419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.0001231761,0.00006442021,0.00024379032,0.00021110289,0.00019503968],"domain_scores_gemma":[0.9966286,0.0014149027,0.0003535424,0.00071439805,0.0003059593,0.000582575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011553114,0.00066032284,0.0014245794,0.0014401369,0.0023767937,0.004726005,0.0015732214,0.0014415907,0.011040189],"category_scores_gemma":[0.0039987927,0.00074692204,0.0011532288,0.0019150176,0.0027717156,0.010022678,0.0022735125,0.003814813,0.0010871006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014620188,0.000054970413,0.00045778832,0.000050765393,0.000016718726,0.00018558321,0.0003512806,0.0007488524,0.0023593695,0.9863144,0.0015992889,0.0077148303],"study_design_scores_gemma":[0.000029385024,0.000033211458,0.0003614494,0.000017534187,0.00002455721,0.00029249772,0.00015113808,0.0028242436,0.00192083,0.99031675,0.0040132864,0.000015027277],"about_ca_topic_score_codex":0.00065047987,"about_ca_topic_score_gemma":0.0004811484,"teacher_disagreement_score":0.011040189,"about_ca_system_score_codex":0.0009431981,"about_ca_system_score_gemma":0.00046682937,"threshold_uncertainty_score":0.036933064},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2407763,0.03150473,0.20459132,0.02356705,0.0007692431,0.000057783924,0.00008856826,0.00016187057,0.49848315],"genre_scores_gemma":[0.98038507,0.0047375844,0.006484483,0.001224776,0.00037243363,0.000028870138,0.00003663088,0.000039720147,0.006690412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831486,0.00092698605,0.00008592675,0.00016789758,0.00037329012,0.00013097019],"domain_scores_gemma":[0.99610007,0.0029372578,0.0002538483,0.0002488952,0.00033448273,0.00012534791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021070063,0.00026859422,0.00041284828,0.0020897456,0.001967003,0.0028376172,0.00060977525,0.001786721,0.002931758],"category_scores_gemma":[0.0058801016,0.00019159839,0.00045834895,0.0023854827,0.010924027,0.0089965435,0.0025017632,0.0019050336,0.00023169281],"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.000004352882,0.00000424669,0.00016232155,0.000024231354,0.0000016333618,0.00012517103,0.0038125075,0.0001569019,0.00018046507,0.9919974,0.0003528085,0.0031780608],"study_design_scores_gemma":[0.0000053147583,0.00003173338,0.0017121093,0.000115544506,0.00000822771,0.00035317798,0.0039211,0.0021347797,0.00034385142,0.96167815,0.029662687,0.000033208245],"about_ca_topic_score_codex":0.0022425703,"about_ca_topic_score_gemma":0.0014010533,"teacher_disagreement_score":0.002931758,"about_ca_system_score_codex":0.0014276067,"about_ca_system_score_gemma":0.0004742965,"threshold_uncertainty_score":0.011143088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8052175,0.00066230417,0.12245792,0.0012897006,0.00022762234,0.0001496056,0.00053465803,0.00061384164,0.068846904],"genre_scores_gemma":[0.98665917,0.00009034055,0.007997665,0.0000831769,0.00015302352,0.00003937269,0.00024648826,0.000049016184,0.0046817493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988318,0.00017115353,0.0000830159,0.00045267583,0.0002269837,0.00023438242],"domain_scores_gemma":[0.99765575,0.0011782558,0.00036986996,0.00034492146,0.00016969058,0.0002815057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010458371,0.0003051787,0.00059311854,0.000989823,0.0023815583,0.0039128102,0.0011526896,0.00080798037,0.0047503575],"category_scores_gemma":[0.0045190803,0.00030945922,0.001258076,0.00076457387,0.0042495294,0.0063120727,0.0020536508,0.0026967854,0.00034961887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012280044,0.000053432734,0.0011743511,0.000060614406,0.000018347162,0.00022352525,0.00104388,0.0009372457,0.0058500404,0.9838664,0.00054178224,0.0061075953],"study_design_scores_gemma":[0.000076769335,0.00012388731,0.0015374622,0.000030026738,0.000040241423,0.0005172384,0.00048951065,0.0049198554,0.005691343,0.9795567,0.0069833347,0.000033753855],"about_ca_topic_score_codex":0.00077957485,"about_ca_topic_score_gemma":0.0005454731,"teacher_disagreement_score":0.0047503575,"about_ca_system_score_codex":0.0010947087,"about_ca_system_score_gemma":0.0008064562,"threshold_uncertainty_score":0.015891552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64954925,0.0024109709,0.25463614,0.0020194107,0.00027198473,0.000107441374,0.001212928,0.000689141,0.08910267],"genre_scores_gemma":[0.890929,0.001629797,0.08308886,0.00043272783,0.000537408,0.00027435736,0.0010544212,0.00014352701,0.02191001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979651,0.0005532592,0.00010126795,0.0003567215,0.00070939254,0.0003142508],"domain_scores_gemma":[0.9956626,0.0019322278,0.00063358364,0.00031674904,0.00061205274,0.00084274187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010891815,0.00069740607,0.0010288934,0.0018607014,0.002084223,0.0044548293,0.0009833131,0.00096520444,0.0054485956],"category_scores_gemma":[0.0044485847,0.00048462546,0.0008815889,0.0025181966,0.0045436933,0.0057221265,0.0019839448,0.0015753479,0.0011869334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112880654,0.000025555479,0.00081967894,0.000061918705,0.000016602711,0.0003582142,0.00039490065,0.0026187024,0.0026815138,0.98127913,0.0009629717,0.010668004],"study_design_scores_gemma":[0.000047225105,0.00009270871,0.0007386725,0.00003197944,0.0000120279565,0.0005190505,0.00039767227,0.016086785,0.0019658436,0.97042716,0.009644384,0.000036548845],"about_ca_topic_score_codex":0.0024342013,"about_ca_topic_score_gemma":0.0015843704,"teacher_disagreement_score":0.0054485956,"about_ca_system_score_codex":0.0021339648,"about_ca_system_score_gemma":0.0008752187,"threshold_uncertainty_score":0.018227398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4762431,0.0032787004,0.34821695,0.021226166,0.00026491424,0.0001064473,0.00023675822,0.000652973,0.14977401],"genre_scores_gemma":[0.9764199,0.0005077185,0.018855575,0.00035011646,0.000106095744,0.00003359918,0.000044881457,0.00010374464,0.003578453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948079,0.0022211792,0.00034585054,0.00043900008,0.0017020924,0.00048403064],"domain_scores_gemma":[0.9670833,0.022447841,0.00304065,0.0029625257,0.0038053168,0.00066039374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040198523,0.00030034993,0.00041344692,0.0054935142,0.0025304083,0.004082783,0.0010660194,0.0010997998,0.0031527006],"category_scores_gemma":[0.020739365,0.00032858364,0.00060570065,0.0029338733,0.015237425,0.011952862,0.0045484016,0.0028598828,0.00032027843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004098487,0.000018789491,0.0029987919,0.000046099252,0.0000075171542,0.0002735911,0.0076023596,0.0005183313,0.000954463,0.97383696,0.0006441009,0.013057993],"study_design_scores_gemma":[0.0000041451367,0.000023105365,0.0017320244,0.00004335782,0.000015205228,0.0003248133,0.002878566,0.004896645,0.0016987557,0.9742923,0.014070809,0.000020186231],"about_ca_topic_score_codex":0.0012471658,"about_ca_topic_score_gemma":0.0007382899,"teacher_disagreement_score":0.0054935142,"about_ca_system_score_codex":0.0023878044,"about_ca_system_score_gemma":0.0013758452,"threshold_uncertainty_score":0.021259308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026384162,0.0009252226,0.90352064,0.00059874484,0.00029606908,0.00013644209,0.0005314084,0.0007766762,0.06683059],"genre_scores_gemma":[0.7482965,0.0014054121,0.20829557,0.0006153748,0.00054537307,0.00034634612,0.00096875214,0.00024042229,0.03928631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983273,0.0003395272,0.00016331526,0.00034987292,0.0006001087,0.00021979133],"domain_scores_gemma":[0.9986817,0.00032753783,0.00021665699,0.00026011065,0.00033790243,0.00017603794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013606437,0.00051111536,0.00046337285,0.0012380955,0.0014421359,0.0030794293,0.0015223374,0.0010040064,0.010261959],"category_scores_gemma":[0.0020122526,0.00034817398,0.0014870281,0.0013700997,0.0027682106,0.0069863833,0.001888929,0.0017344673,0.0011977638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047950834,0.0000038293447,0.00003875107,0.000012975552,0.0000034657594,0.00003262943,0.00007515294,0.0006959229,0.0003018384,0.9971656,0.00018199062,0.0014830943],"study_design_scores_gemma":[0.000012803292,0.00002302492,0.000073214156,0.000020177857,0.000015336238,0.00013857163,0.000116481664,0.013464657,0.001112111,0.9639511,0.02105929,0.000013327467],"about_ca_topic_score_codex":0.0023458928,"about_ca_topic_score_gemma":0.0017695465,"teacher_disagreement_score":0.010261959,"about_ca_system_score_codex":0.0020161604,"about_ca_system_score_gemma":0.0014023775,"threshold_uncertainty_score":0.034329653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45921674,0.0012491051,0.4926005,0.0027161774,0.0001553756,0.00015254687,0.0010177128,0.0014637511,0.041428093],"genre_scores_gemma":[0.96500164,0.00026191337,0.02795844,0.0003001446,0.00016557517,0.00012973568,0.0005709818,0.00016948195,0.0054421052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927625,0.0013709726,0.0011045029,0.0017087229,0.0015125588,0.0015406947],"domain_scores_gemma":[0.97070396,0.014372885,0.0027313298,0.007743304,0.0024818138,0.0019666709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048224344,0.00084583275,0.0014169815,0.0024986712,0.0024144815,0.005742444,0.0039637703,0.0018846841,0.0049634646],"category_scores_gemma":[0.020078832,0.0012301913,0.0025178841,0.0024763471,0.009418509,0.026592033,0.009504126,0.0042681554,0.00090560224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017457698,0.000046857745,0.002555418,0.00010417045,0.000026871803,0.00035475398,0.001141541,0.0034395566,0.0018600655,0.9811973,0.000659458,0.008439371],"study_design_scores_gemma":[0.000032160588,0.00006242459,0.00046936778,0.000030382374,0.000038771286,0.0003378718,0.0002388542,0.009128131,0.002400792,0.9845093,0.0027192177,0.00003279255],"about_ca_topic_score_codex":0.0020769383,"about_ca_topic_score_gemma":0.0011260788,"teacher_disagreement_score":0.005742444,"about_ca_system_score_codex":0.001516579,"about_ca_system_score_gemma":0.0012656455,"threshold_uncertainty_score":0.025503755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8246857,0.00070164615,0.16119471,0.00039333492,0.000043747703,0.000057648034,0.00024035345,0.00027608086,0.012406702],"genre_scores_gemma":[0.95406467,0.00015970138,0.043126628,0.00003940199,0.00007433564,0.00006261289,0.00013697422,0.000055689266,0.002279859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843615,0.00028339203,0.00012508497,0.00037603112,0.00053034094,0.0002489997],"domain_scores_gemma":[0.98699296,0.008188274,0.0015503316,0.0011047856,0.0008877236,0.0012759006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019900033,0.000372761,0.0006852931,0.0012393367,0.0015410145,0.0025500087,0.0007255984,0.0006097392,0.0024165725],"category_scores_gemma":[0.0075528114,0.00059872214,0.00057341025,0.00057495903,0.0027615814,0.004722478,0.0014357509,0.0009556231,0.00025954077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014290636,0.00017559109,0.016869692,0.00040361733,0.00006992575,0.0008912176,0.0018341459,0.025291955,0.052459903,0.8543244,0.0015732546,0.044677168],"study_design_scores_gemma":[0.00007949232,0.00032965967,0.008057891,0.000111240355,0.00005519563,0.0013781812,0.00056165096,0.0932816,0.032368958,0.85461783,0.009092032,0.000066201166],"about_ca_topic_score_codex":0.0008712279,"about_ca_topic_score_gemma":0.0010175243,"teacher_disagreement_score":0.0025500087,"about_ca_system_score_codex":0.0013609476,"about_ca_system_score_gemma":0.00044587313,"threshold_uncertainty_score":0.010524273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984417,0.0008988739,0.07835054,0.00014068089,0.000044619417,0.00006148414,0.0004548551,0.00022918452,0.021378053],"genre_scores_gemma":[0.96810955,0.00024322394,0.02574087,0.000047760088,0.00006667648,0.000122046455,0.0004117061,0.000030346291,0.0052278154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987563,0.00017363288,0.00013734482,0.00037303317,0.00035717915,0.00020251128],"domain_scores_gemma":[0.99713,0.0008685537,0.0006173776,0.00035517718,0.00056473794,0.0004641776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009780085,0.000347171,0.00044269633,0.0024513693,0.0015184495,0.0025681197,0.00055057695,0.0005423095,0.0025090682],"category_scores_gemma":[0.0035088714,0.00037983456,0.000679017,0.0013863299,0.0013030662,0.0023064876,0.0015584246,0.00070570747,0.00027903795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025230928,0.000043293527,0.0059461854,0.00008030336,0.000038445734,0.00051949907,0.0020957848,0.0018705383,0.014222965,0.9471485,0.00060492114,0.027177317],"study_design_scores_gemma":[0.00012231982,0.00044476477,0.024204135,0.00016698407,0.00016714977,0.0027794342,0.0022142713,0.026942478,0.032485504,0.8598844,0.050453413,0.00013517895],"about_ca_topic_score_codex":0.0010734469,"about_ca_topic_score_gemma":0.0006248329,"teacher_disagreement_score":0.0025681197,"about_ca_system_score_codex":0.0015646203,"about_ca_system_score_gemma":0.0005279729,"threshold_uncertainty_score":0.011352181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13507918,0.006753977,0.4244377,0.006100081,0.0020241335,0.00019317951,0.0020584897,0.0008908353,0.42246246],"genre_scores_gemma":[0.7785751,0.0038657277,0.06927321,0.0011332202,0.001519604,0.00024445888,0.0021849922,0.00029449386,0.1429091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989102,0.00024456182,0.00009358813,0.000245479,0.0003801027,0.00012609884],"domain_scores_gemma":[0.9986468,0.00044452725,0.00013001786,0.0002794754,0.00031166588,0.00018754041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085383415,0.00090016576,0.00083114917,0.004342403,0.002355233,0.0055758758,0.0009657513,0.001214062,0.016095856],"category_scores_gemma":[0.0021858113,0.00056819426,0.0007635076,0.0035782075,0.0041963374,0.010018412,0.0027721531,0.0024526883,0.002821876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048974107,0.000005338708,0.00002900941,0.000012458255,0.000001866292,0.000026258655,0.00010174179,0.000069214475,0.00016904467,0.9967828,0.00072967395,0.0020676155],"study_design_scores_gemma":[0.0000050120425,0.0000073540145,0.000056581128,0.0000109885395,0.000005532624,0.00010157424,0.00012236288,0.00060862675,0.00041274165,0.9838514,0.01481177,0.0000060510015],"about_ca_topic_score_codex":0.0005926814,"about_ca_topic_score_gemma":0.0005829486,"teacher_disagreement_score":0.016095856,"about_ca_system_score_codex":0.0014115241,"about_ca_system_score_gemma":0.00074411905,"threshold_uncertainty_score":0.053846},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06641017,0.008962506,0.32803595,0.14361581,0.007912991,0.00008212261,0.0011562947,0.00067822955,0.443146],"genre_scores_gemma":[0.8241228,0.0072805807,0.055347867,0.028442023,0.011773655,0.0002441804,0.0006413021,0.0004377258,0.071710035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984451,0.00046286962,0.000092989176,0.00031116136,0.0005352824,0.00015267795],"domain_scores_gemma":[0.9963529,0.0021260602,0.00023344737,0.00047038813,0.00056537706,0.00025191298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025491065,0.0005154145,0.0006310086,0.0010950958,0.0019751312,0.0024907412,0.001412902,0.0012950766,0.021102874],"category_scores_gemma":[0.0065390454,0.00018921502,0.0011496498,0.0008392404,0.0055210693,0.008175783,0.003956873,0.0035509465,0.001563336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008232962,0.0000060087555,0.00013703713,0.0000349106,0.000005203379,0.000035988673,0.000120354154,0.0003541125,0.00016530999,0.9933828,0.0032894511,0.0024605587],"study_design_scores_gemma":[0.0000060712596,0.000011850355,0.00025627558,0.000017118806,0.0000035261758,0.000045942288,0.000068206115,0.0007884983,0.0001736715,0.9845766,0.014044001,0.000008337901],"about_ca_topic_score_codex":0.000987043,"about_ca_topic_score_gemma":0.000717176,"teacher_disagreement_score":0.021102874,"about_ca_system_score_codex":0.0010115698,"about_ca_system_score_gemma":0.00054711703,"threshold_uncertainty_score":0.07059616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060227676,0.0042947754,0.9620746,0.0023549167,0.0003234222,0.00006749686,0.00007420337,0.00011532128,0.024672484],"genre_scores_gemma":[0.6246344,0.011182251,0.33519667,0.0021797812,0.0031577735,0.00068788877,0.00032443125,0.00023372273,0.022403076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410594,0.0019532065,0.00026397675,0.00076872366,0.0025493714,0.00035871708],"domain_scores_gemma":[0.9904045,0.007294059,0.00039432792,0.0008518368,0.00093587657,0.000119370125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00666607,0.0009530971,0.0015110032,0.0031013328,0.001828184,0.0042199357,0.0028783153,0.0027102747,0.006497026],"category_scores_gemma":[0.019655813,0.0011155865,0.0017815984,0.0031388975,0.0075810323,0.0077159447,0.0027715086,0.0029315434,0.0018668949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015322043,0.000015144114,0.00011929526,0.00012217449,0.000026937661,0.000039594554,0.00008630449,0.012799113,0.00043324838,0.96933955,0.0011639235,0.015839407],"study_design_scores_gemma":[0.000008234169,0.000031465377,0.000089236324,0.00005801863,0.0000129168875,0.00008264415,0.000021325124,0.0768085,0.00077030907,0.91619146,0.0059094387,0.0000164642],"about_ca_topic_score_codex":0.0010504093,"about_ca_topic_score_gemma":0.0005677587,"teacher_disagreement_score":0.00666607,"about_ca_system_score_codex":0.0025201687,"about_ca_system_score_gemma":0.0012926168,"threshold_uncertainty_score":0.035253942},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60479784,0.0013029298,0.28075722,0.0010717557,0.00019529757,0.00011673712,0.00038531024,0.00042219757,0.110950716],"genre_scores_gemma":[0.93594843,0.00034163648,0.048465036,0.00020988201,0.000091497,0.00011803342,0.0001913463,0.00004616638,0.014587976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989285,0.00022122177,0.000081522994,0.00028069978,0.00034822625,0.0001398136],"domain_scores_gemma":[0.9979195,0.0007864994,0.0002854544,0.00032588906,0.000354711,0.00032789705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010378447,0.00028659438,0.000569543,0.0008426785,0.0015067317,0.003343512,0.00084900163,0.000526146,0.003116968],"category_scores_gemma":[0.0035362276,0.00029983494,0.0008562804,0.0010471885,0.0025260036,0.004680894,0.0015252053,0.0017345152,0.0004150225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005106247,0.000019261319,0.00045868978,0.000022435552,0.0000061299015,0.00022807873,0.0005757241,0.0009224825,0.0017039493,0.98895955,0.00026095894,0.00679175],"study_design_scores_gemma":[0.00005667764,0.00008440837,0.00066264614,0.000017254937,0.000019311405,0.0006209682,0.0003987162,0.013318588,0.0027254815,0.9656137,0.016451757,0.000030446277],"about_ca_topic_score_codex":0.0019245158,"about_ca_topic_score_gemma":0.0013916694,"teacher_disagreement_score":0.003343512,"about_ca_system_score_codex":0.002302577,"about_ca_system_score_gemma":0.0007854466,"threshold_uncertainty_score":0.016706407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23904173,0.029683724,0.41964823,0.02549789,0.0022386946,0.00014455739,0.0011592876,0.0006915652,0.28189427],"genre_scores_gemma":[0.90017986,0.0077780015,0.052966423,0.0019650345,0.0017897253,0.00013869145,0.000763962,0.00022905311,0.0341893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672747,0.0011961383,0.00024993735,0.0005378184,0.00082411594,0.0004644547],"domain_scores_gemma":[0.9921164,0.0049916715,0.0004298974,0.001284791,0.0007544916,0.00042282118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006161629,0.0009483669,0.002084099,0.0028898476,0.0037868242,0.0075589614,0.0026311635,0.0022935367,0.008360996],"category_scores_gemma":[0.009790086,0.0011750276,0.0019653356,0.004172899,0.015302941,0.02850466,0.007562407,0.0074429177,0.00072618056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123378395,0.0000048705388,0.000050164734,0.000014390361,0.0000048523375,0.000011190851,0.00020391002,0.0002800257,0.00006770963,0.9972778,0.0004713246,0.0016014463],"study_design_scores_gemma":[0.000008023534,0.000003829616,0.000042978987,0.000008082053,0.0000034898092,0.000009281225,0.000046110337,0.00052587216,0.000049296756,0.99743783,0.0018606159,0.0000045756583],"about_ca_topic_score_codex":0.0040496294,"about_ca_topic_score_gemma":0.0031200738,"teacher_disagreement_score":0.008360996,"about_ca_system_score_codex":0.0032878423,"about_ca_system_score_gemma":0.0014109208,"threshold_uncertainty_score":0.032586217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79360104,0.0017916139,0.12315389,0.00097604573,0.0002781864,0.00005043496,0.00035300155,0.00039126608,0.07940452],"genre_scores_gemma":[0.9767428,0.0002738329,0.016080642,0.00008259363,0.00008966924,0.000036131652,0.00024039339,0.00003146405,0.006422398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992799,0.0001854744,0.00004583884,0.0001733927,0.00022353993,0.00009179915],"domain_scores_gemma":[0.9992731,0.00021054216,0.00010419879,0.00014558941,0.00008867483,0.00017791589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006369842,0.00031485702,0.00041950372,0.0011944489,0.0009794123,0.0028726675,0.0006750633,0.00044299563,0.0030376678],"category_scores_gemma":[0.0008301894,0.00020887693,0.00043271252,0.000799226,0.0028581766,0.0046507507,0.0024739818,0.0010141733,0.00033958704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005882213,0.000012835546,0.000846699,0.000045554854,0.000010401831,0.0002421474,0.0006060158,0.0004476153,0.0039181313,0.9879644,0.00043010467,0.005417347],"study_design_scores_gemma":[0.000050810482,0.00011402372,0.0029158923,0.0000428886,0.000029647414,0.0012439871,0.0011651079,0.0027336336,0.004894435,0.9526968,0.034068275,0.000044538778],"about_ca_topic_score_codex":0.00017288794,"about_ca_topic_score_gemma":0.00018214695,"teacher_disagreement_score":0.0030376678,"about_ca_system_score_codex":0.0007152849,"about_ca_system_score_gemma":0.00019365082,"threshold_uncertainty_score":0.010161996},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16226465,0.0024756943,0.3518352,0.0071500796,0.0012533604,0.00008764321,0.00041713822,0.0011579142,0.4733583],"genre_scores_gemma":[0.96652746,0.00052612735,0.017133461,0.0005420481,0.0003199156,0.00004734672,0.00015962445,0.000409465,0.014334362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857366,0.00037262065,0.00010115244,0.00037496624,0.00030644916,0.00027116537],"domain_scores_gemma":[0.9957787,0.002093444,0.00024124733,0.0012050673,0.0004936365,0.00018795332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018760427,0.0005942822,0.0006274027,0.0009860458,0.0030493306,0.0038917493,0.0014457096,0.0015853997,0.009761136],"category_scores_gemma":[0.007874046,0.0007064928,0.0012275203,0.0012153103,0.008192558,0.018383825,0.0063887415,0.004276491,0.001149456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020573849,0.000006182718,0.00016730005,0.00002781158,0.0000041801895,0.00009041045,0.0006960923,0.0001285699,0.00027249282,0.99533314,0.00059005676,0.0026632096],"study_design_scores_gemma":[0.0000067491246,0.000008631743,0.00014727357,0.000028365681,0.000015135723,0.00022419925,0.0003729418,0.00090955966,0.0006968912,0.9888104,0.00876864,0.000011195678],"about_ca_topic_score_codex":0.00083380775,"about_ca_topic_score_gemma":0.0011092267,"teacher_disagreement_score":0.009761136,"about_ca_system_score_codex":0.0012604623,"about_ca_system_score_gemma":0.00085817784,"threshold_uncertainty_score":0.032654226},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13679396,0.008013483,0.37198216,0.0073640347,0.0005590105,0.00017081664,0.001960007,0.0008158266,0.4723406],"genre_scores_gemma":[0.8748235,0.0021220027,0.063578814,0.0018449997,0.0007202784,0.00031377454,0.0015408386,0.00018401524,0.05487164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766624,0.00049285544,0.00012555947,0.00046470176,0.00088798377,0.00036273472],"domain_scores_gemma":[0.9983529,0.0004997265,0.00015447312,0.0002528376,0.0005148456,0.00022523986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017023862,0.00038955262,0.00041704674,0.0023752633,0.0017121319,0.0033489002,0.0010827499,0.0009629902,0.010626451],"category_scores_gemma":[0.0026187494,0.00028183195,0.00067500863,0.0017535599,0.00668381,0.008844152,0.003513154,0.0016822226,0.0010683226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000459208,0.0000036009224,0.0000768192,0.000016158065,0.0000022470947,0.000025399533,0.00014610583,0.000105232866,0.00019998352,0.9964818,0.00063117326,0.0023068541],"study_design_scores_gemma":[0.000005885442,0.000009707387,0.00038612934,0.000020508778,0.0000063230154,0.00014477248,0.00019865368,0.0012163797,0.00034607033,0.9577433,0.03990997,0.00001234685],"about_ca_topic_score_codex":0.0039980505,"about_ca_topic_score_gemma":0.002004631,"teacher_disagreement_score":0.010626451,"about_ca_system_score_codex":0.0023428358,"about_ca_system_score_gemma":0.0011624515,"threshold_uncertainty_score":0.035549045},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03325318,0.16908784,0.17843293,0.1213741,0.010168203,0.00013566791,0.0017581271,0.0003942753,0.48539567],"genre_scores_gemma":[0.7857266,0.039000936,0.040739123,0.00725729,0.006669255,0.0001576392,0.00065544335,0.000153943,0.11963977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810237,0.0006372876,0.00012372447,0.00039831726,0.00047656178,0.00026176037],"domain_scores_gemma":[0.99876785,0.0008848207,0.000052911775,0.00006273622,0.00016172901,0.00007008442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019525096,0.0006896694,0.00055698137,0.0013697676,0.0015303385,0.0027749608,0.00042694388,0.0012149162,0.0067959637],"category_scores_gemma":[0.0042403587,0.0004324552,0.0007881487,0.0015395355,0.0061759185,0.0041602324,0.0011632883,0.0030057344,0.0022329616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002347811,0.000008205547,0.00006909898,0.000045816647,0.000008620351,0.000032954136,0.00014069505,0.00077261124,0.00019516572,0.9758228,0.0133417435,0.009538808],"study_design_scores_gemma":[0.000014436628,0.000011232143,0.00021361903,0.00006850286,0.000008119659,0.00005064165,0.000044165085,0.0010436219,0.00062862004,0.8693028,0.12859645,0.000017718075],"about_ca_topic_score_codex":0.0072807283,"about_ca_topic_score_gemma":0.0032069965,"teacher_disagreement_score":0.0087379385,"about_ca_system_score_codex":0.0087379385,"about_ca_system_score_gemma":0.0022325423,"threshold_uncertainty_score":0.06339848},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5947321,0.0028551943,0.35428318,0.0001788686,0.000099097284,0.00009249744,0.00067176844,0.00085194997,0.046235472],"genre_scores_gemma":[0.9230123,0.0012569634,0.06662156,0.00009893497,0.00020596138,0.00027530623,0.001001022,0.00023022671,0.0072977566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852484,0.0002044132,0.00011285561,0.00028717457,0.0006446649,0.00022610085],"domain_scores_gemma":[0.99589574,0.002067782,0.00057452,0.00034274437,0.00072209066,0.00039720573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010250552,0.00065070455,0.00076175,0.0025547286,0.0008579444,0.0022525063,0.0009364608,0.0006007991,0.0029996592],"category_scores_gemma":[0.006620327,0.00033667154,0.000803557,0.002604435,0.0013838375,0.0031036998,0.0010947328,0.0012030877,0.000638753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047712715,0.0000575126,0.0037170465,0.00015228201,0.000038333983,0.0010157264,0.0017551213,0.008464805,0.021882368,0.9021845,0.001218861,0.05903636],"study_design_scores_gemma":[0.00015291863,0.0005213684,0.0074491384,0.0001663047,0.00011890327,0.0031436933,0.0009640351,0.06076394,0.02471761,0.86872053,0.033155225,0.00012634757],"about_ca_topic_score_codex":0.00082622416,"about_ca_topic_score_gemma":0.00029459206,"teacher_disagreement_score":0.0029996592,"about_ca_system_score_codex":0.0012126323,"about_ca_system_score_gemma":0.00031897574,"threshold_uncertainty_score":0.010034859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3801,0.00037197984,0.553287,0.0009387949,0.00038213076,0.00018966215,0.00070287084,0.0020870268,0.061940517],"genre_scores_gemma":[0.8943277,0.00019059727,0.09393909,0.00020221942,0.00007770526,0.00010066997,0.0005988257,0.0003513231,0.010211881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987992,0.0002044766,0.00008866811,0.00018492767,0.00038463256,0.00033813305],"domain_scores_gemma":[0.99737597,0.000991035,0.0001904728,0.000924558,0.00026776263,0.00025020208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095707184,0.0006334969,0.0008983929,0.0009396708,0.0013155306,0.0040096706,0.0011082514,0.0011915358,0.006579516],"category_scores_gemma":[0.003500543,0.0006598457,0.00080501544,0.0010915383,0.0018770678,0.005876008,0.003288447,0.0017601395,0.0011362458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057592685,0.000085458705,0.00041169848,0.000106570005,0.000028791896,0.00020995339,0.00069651316,0.010354274,0.009943782,0.94061,0.0024614371,0.034515787],"study_design_scores_gemma":[0.000062261046,0.000064436215,0.00015443316,0.000027431632,0.00003073381,0.00011449964,0.0002677719,0.031144485,0.008946911,0.95408934,0.005071643,0.000025942436],"about_ca_topic_score_codex":0.0006592259,"about_ca_topic_score_gemma":0.0013021103,"teacher_disagreement_score":0.006579516,"about_ca_system_score_codex":0.00074577314,"about_ca_system_score_gemma":0.00075699424,"threshold_uncertainty_score":0.022010684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7035012,0.00037205603,0.26648894,0.0006294988,0.00006631674,0.00009446117,0.0001783226,0.00049846346,0.02817067],"genre_scores_gemma":[0.9650169,0.00009073207,0.031950764,0.00005614037,0.000066978246,0.000051645588,0.00009488892,0.00004597429,0.002626087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903274,0.0002556194,0.00006763056,0.00015844851,0.0003243862,0.00016116873],"domain_scores_gemma":[0.99654526,0.0018552068,0.0003729551,0.00045455538,0.00025287273,0.00051921315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013532657,0.00023253313,0.00042790218,0.00095053704,0.00078191055,0.002673137,0.0006227618,0.0004032447,0.0043662586],"category_scores_gemma":[0.003754559,0.00038943547,0.000586369,0.0006340753,0.0022405738,0.0038528717,0.0027917244,0.0011137372,0.00035687757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042327002,0.00012472013,0.0019065742,0.0000825988,0.000015133917,0.0002454364,0.0016150237,0.0038325514,0.016615288,0.9523364,0.000775187,0.022027757],"study_design_scores_gemma":[0.00013958121,0.00014752602,0.0014114754,0.000029829951,0.000026523438,0.00040191898,0.0005606157,0.03797354,0.013903361,0.93891746,0.006444886,0.00004318844],"about_ca_topic_score_codex":0.0004815905,"about_ca_topic_score_gemma":0.00044624944,"teacher_disagreement_score":0.0043662586,"about_ca_system_score_codex":0.0007811331,"about_ca_system_score_gemma":0.00032861184,"threshold_uncertainty_score":0.014606535},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06380773,0.032414064,0.2076287,0.035745706,0.0012421566,0.000114928764,0.0011897101,0.00078048505,0.65707654],"genre_scores_gemma":[0.8743501,0.008448398,0.034541715,0.0040911078,0.0016015233,0.00011536258,0.00066522014,0.00032249803,0.075864136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800605,0.0009888643,0.000107221626,0.00030772068,0.00042157256,0.00016871885],"domain_scores_gemma":[0.99775875,0.0013948623,0.00015980519,0.00017359994,0.00041707975,0.00009574399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201753,0.00052170164,0.00056020357,0.0025916388,0.0032114112,0.006248254,0.0008553634,0.0011849891,0.0126852505],"category_scores_gemma":[0.0038437338,0.0005198863,0.0007031011,0.0026723463,0.008624129,0.011796061,0.0026812854,0.0026618226,0.0019500101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009979592,0.0000040762225,0.000096121774,0.00004007101,0.0000030471176,0.000056249108,0.0007076378,0.00011233682,0.0001402544,0.9926804,0.0021970507,0.0039528706],"study_design_scores_gemma":[0.0000045713814,0.000005164772,0.00014210686,0.00003458987,0.0000044767594,0.00009812767,0.00045079915,0.00065267045,0.000107557156,0.9545027,0.043991566,0.0000056697318],"about_ca_topic_score_codex":0.007850427,"about_ca_topic_score_gemma":0.0047963937,"teacher_disagreement_score":0.0126852505,"about_ca_system_score_codex":0.0037128788,"about_ca_system_score_gemma":0.0011478727,"threshold_uncertainty_score":0.04243636},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1644175,0.0032368342,0.3995848,0.004028361,0.0008879585,0.00022387113,0.001965046,0.00087398686,0.42478162],"genre_scores_gemma":[0.83443713,0.0015027781,0.07631523,0.0011094125,0.0010726938,0.00029683768,0.0019054124,0.00042159736,0.08293888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977489,0.0005231116,0.00012189097,0.00045683642,0.0007740719,0.00037519165],"domain_scores_gemma":[0.99729854,0.00096617924,0.00021589462,0.0003660033,0.00067562587,0.00047777873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002007156,0.0010215153,0.0010187213,0.0023850163,0.0024557775,0.004859338,0.0012304367,0.0008294023,0.0119609],"category_scores_gemma":[0.0039396114,0.0005825737,0.001395776,0.0013920128,0.006141971,0.008649246,0.0024447422,0.0029756255,0.0018691755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003044214,0.000013586549,0.00008924985,0.000029482746,0.0000042419642,0.00005073992,0.00030261735,0.000373831,0.00072577334,0.9935116,0.0011413794,0.0037270344],"study_design_scores_gemma":[0.000030400779,0.00004251291,0.00031787163,0.000021699392,0.000006259242,0.00017955124,0.00019062142,0.0027203565,0.0018201013,0.963327,0.031300094,0.000043559317],"about_ca_topic_score_codex":0.0065688277,"about_ca_topic_score_gemma":0.005234445,"teacher_disagreement_score":0.0119609,"about_ca_system_score_codex":0.0020643452,"about_ca_system_score_gemma":0.0016136188,"threshold_uncertainty_score":0.040013194},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8867504,0.00046876707,0.038583934,0.00078058726,0.000040827537,0.000056318422,0.0005054136,0.00020469603,0.072609164],"genre_scores_gemma":[0.98198295,0.00014418666,0.008964581,0.00004807191,0.0000067338665,0.0000150941605,0.0003336957,0.00010251185,0.008402119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950147,0.00021127542,0.000031810996,0.0001151163,0.00009918943,0.00004123568],"domain_scores_gemma":[0.9991234,0.0005139375,0.000072369025,0.00009622256,0.00015071512,0.000043360364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004342735,0.00043009478,0.0002874416,0.0006025608,0.0018452684,0.0019828924,0.00030024513,0.0005405459,0.0053934595],"category_scores_gemma":[0.0017409141,0.00024446766,0.00026005824,0.0010203025,0.0030053586,0.0014743942,0.00096902595,0.0010320083,0.00044119023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005839061,0.00010494175,0.04522221,0.00080155005,0.00015978511,0.016751459,0.2613691,0.009239768,0.08460362,0.49626938,0.005299785,0.07959444],"study_design_scores_gemma":[0.00014138619,0.0005381809,0.1304001,0.00048293776,0.0002729328,0.023655158,0.18255803,0.04885629,0.036405798,0.085937075,0.49039915,0.00035294742],"about_ca_topic_score_codex":0.08386278,"about_ca_topic_score_gemma":0.069889605,"teacher_disagreement_score":0.08386278,"about_ca_system_score_codex":0.0018361195,"about_ca_system_score_gemma":0.0010423964,"threshold_uncertainty_score":0.1667493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014956846,0.0009419186,0.95949715,0.00059248233,0.00012041193,0.00006605963,0.00012955401,0.00011888862,0.023576604],"genre_scores_gemma":[0.27205658,0.0012768086,0.7122208,0.00032988607,0.00029291693,0.00014029331,0.00038629468,0.00007993383,0.013216434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986817,0.00035912564,0.00009681252,0.00035565,0.00040928158,0.00009745084],"domain_scores_gemma":[0.99906546,0.00028989417,0.00009047537,0.00025810115,0.00021930033,0.000076790435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013659553,0.0005786965,0.0005613393,0.0013666976,0.00089178205,0.0022551708,0.0006414182,0.00081917725,0.0050606346],"category_scores_gemma":[0.002979919,0.00031443138,0.0009487655,0.0011831084,0.0024879824,0.0036876898,0.0014085243,0.0017957233,0.0010716772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024112995,0.000012341166,0.00012404608,0.00006606718,0.000011686878,0.00006311435,0.00037102608,0.0074876244,0.0040330365,0.94698006,0.0012096341,0.03961721],"study_design_scores_gemma":[0.000010149109,0.000053449596,0.00019683335,0.000054266715,0.00001614011,0.00021564667,0.00015662168,0.06071358,0.0021968163,0.9072466,0.029122166,0.000017687771],"about_ca_topic_score_codex":0.0009969177,"about_ca_topic_score_gemma":0.00072720513,"teacher_disagreement_score":0.0050606346,"about_ca_system_score_codex":0.00090633857,"about_ca_system_score_gemma":0.000705453,"threshold_uncertainty_score":0.016929567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099343,0.009369178,0.17268735,0.020410627,0.0014809362,0.000106158135,0.0010666295,0.00082883233,0.18411604],"genre_scores_gemma":[0.95888674,0.001404224,0.022313239,0.0012634612,0.00076724857,0.00009766824,0.00047758594,0.0000947117,0.014695085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862146,0.00032680482,0.00010301402,0.00026029174,0.000471014,0.00021745803],"domain_scores_gemma":[0.994282,0.0028649955,0.00068590266,0.00061189686,0.00079244183,0.00076269906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002653264,0.00027351506,0.00064980966,0.0015733615,0.0025218343,0.004292714,0.0007255158,0.0010124278,0.0040446627],"category_scores_gemma":[0.0048636566,0.00067547226,0.0007469804,0.0011779643,0.006497383,0.008040673,0.0018813342,0.0020364425,0.0006299828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012999655,0.000026360254,0.00096783036,0.00004552976,0.000005795629,0.00005425698,0.00050378975,0.0010950061,0.0008239253,0.98698425,0.0023196482,0.007043638],"study_design_scores_gemma":[0.00002567717,0.000020655416,0.0006474065,0.000023337094,0.000006542712,0.00005718676,0.00033835458,0.00290188,0.0010529311,0.9852402,0.009673792,0.000011999669],"about_ca_topic_score_codex":0.0044331863,"about_ca_topic_score_gemma":0.0053688264,"teacher_disagreement_score":0.0044331863,"about_ca_system_score_codex":0.0035037966,"about_ca_system_score_gemma":0.0013178405,"threshold_uncertainty_score":0.025421977},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016499916,0.2775552,0.1807833,0.0478864,0.0096639795,0.00007382407,0.00019589072,0.00016831061,0.46717322],"genre_scores_gemma":[0.6078298,0.22109814,0.08778817,0.0070058517,0.018056814,0.00019814156,0.00020540485,0.00014338366,0.057674255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983897,0.0008276565,0.00007175921,0.00019064675,0.00040428605,0.00011594694],"domain_scores_gemma":[0.99675,0.0024758072,0.00020431976,0.0002048649,0.0001814395,0.00018355531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012155384,0.0006350714,0.0008299964,0.0019785638,0.002045942,0.0065526734,0.0008792275,0.002152106,0.00624388],"category_scores_gemma":[0.003568825,0.0002645315,0.00043767956,0.002433626,0.011146578,0.0055285227,0.001723347,0.0051436163,0.001282513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004669931,0.0000044465364,0.00003776745,0.00008969004,0.0000030468027,0.00004747357,0.00016712642,0.00026155973,0.00020722851,0.99213296,0.0012703569,0.0057737133],"study_design_scores_gemma":[0.0000028168024,0.000017046435,0.00012876242,0.00011845522,0.000003423577,0.0001793603,0.00019445161,0.0008242929,0.00016862153,0.9316626,0.06669115,0.000009086716],"about_ca_topic_score_codex":0.0010016899,"about_ca_topic_score_gemma":0.0007499048,"teacher_disagreement_score":0.0065526734,"about_ca_system_score_codex":0.0024919796,"about_ca_system_score_gemma":0.0016768826,"threshold_uncertainty_score":0.020887852},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027865652,0.018994372,0.0004695992,0.40565684,0.5004561,0.00006580867,0.0008370329,0.0004565597,0.07278498],"genre_scores_gemma":[0.004310717,0.008066359,0.00021792589,0.15112878,0.098103754,0.0000778442,0.00041707116,0.0005297827,0.7371478],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982278,0.00027085695,0.00014637648,0.0004035622,0.0007351857,0.00021629616],"domain_scores_gemma":[0.99608237,0.0011302154,0.0003726962,0.00035544139,0.0016791753,0.0003801492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017606684,0.0015988621,0.0023946555,0.0015877918,0.0050600343,0.0049149464,0.0017320646,0.00870991,0.110291824],"category_scores_gemma":[0.014904782,0.0007678633,0.0008388662,0.0011293422,0.001894016,0.0045435424,0.003021449,0.009735653,0.10557101],"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.00001601697,0.0000025200236,0.000010267806,0.000022556032,0.0000018149389,0.000026083764,0.000009009444,0.0000122459605,0.000017137076,0.0007974054,0.996851,0.0022340135],"study_design_scores_gemma":[0.000011024818,0.0000063544785,0.00009607204,0.0000907103,0.0000041967783,0.00003171799,0.000024705081,0.000029514273,0.000086686734,0.001439057,0.9981724,0.000007614633],"about_ca_topic_score_codex":0.010722136,"about_ca_topic_score_gemma":0.013148213,"teacher_disagreement_score":0.110291824,"about_ca_system_score_codex":0.0043871077,"about_ca_system_score_gemma":0.0023958748,"threshold_uncertainty_score":0.36896288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55475986,0.0017124149,0.3043726,0.0023972571,0.0010110583,0.00013577189,0.0012309344,0.00057564134,0.13380449],"genre_scores_gemma":[0.9225441,0.0011731436,0.031804815,0.0003382721,0.0009235506,0.00016519327,0.00079637096,0.00015700082,0.04209739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.00027594113,0.000051277486,0.00016639498,0.00040745456,0.00022260206],"domain_scores_gemma":[0.9966343,0.0017180507,0.00045953374,0.0002046086,0.00043476422,0.0005487859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903198,0.0007683596,0.0007803582,0.0018329648,0.0019143313,0.003684086,0.00065345794,0.0008842448,0.0063081444],"category_scores_gemma":[0.0021011701,0.00033764806,0.0007109339,0.0010501691,0.002909127,0.0037573194,0.0013091861,0.0012185136,0.0011065719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122372,0.000025420339,0.00024931502,0.000037791582,0.0000074585914,0.00030922273,0.0004609831,0.0008269036,0.0029671157,0.9892463,0.00097546395,0.004771594],"study_design_scores_gemma":[0.00004702818,0.000084067855,0.0005329641,0.000021353451,0.000010051606,0.00051208714,0.00019752303,0.008603611,0.0016675658,0.9812309,0.007063881,0.000028830033],"about_ca_topic_score_codex":0.00091858563,"about_ca_topic_score_gemma":0.0008558562,"teacher_disagreement_score":0.0063081444,"about_ca_system_score_codex":0.0012914612,"about_ca_system_score_gemma":0.00109515,"threshold_uncertainty_score":0.021102846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48394072,0.0017637096,0.42577675,0.0009197336,0.00019186962,0.00011025887,0.0004918014,0.0006311261,0.08617411],"genre_scores_gemma":[0.9450607,0.0004551292,0.04584234,0.00022974268,0.000095506955,0.00006593044,0.00019710544,0.00005183134,0.0080017345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992933,0.00013332775,0.000044074462,0.00013912036,0.00027523353,0.0001149197],"domain_scores_gemma":[0.9991192,0.00018119975,0.00015458021,0.00015309316,0.0002515227,0.00014030661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008587906,0.00042020832,0.00029840166,0.0015729069,0.00076064706,0.0019734465,0.0006902362,0.00052118377,0.0030107943],"category_scores_gemma":[0.0013642112,0.00024143666,0.0007134995,0.0008538605,0.0024577137,0.0037179673,0.0016951462,0.0010579097,0.00034021717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006854695,0.0000075618914,0.00024986058,0.00002379481,0.000007464134,0.00006320044,0.0002737754,0.0007508184,0.0015856483,0.99248934,0.00015704724,0.0043846443],"study_design_scores_gemma":[0.000010032991,0.00004029884,0.0012716167,0.000020579353,0.000015826045,0.00035353584,0.00036593212,0.00837195,0.003589449,0.97432715,0.011607367,0.000026321772],"about_ca_topic_score_codex":0.0014820314,"about_ca_topic_score_gemma":0.0008809319,"teacher_disagreement_score":0.0030107943,"about_ca_system_score_codex":0.0010144424,"about_ca_system_score_gemma":0.00060820347,"threshold_uncertainty_score":0.0100720525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7845849,0.0007233571,0.17487991,0.00029102093,0.0001205525,0.000044704546,0.00040417459,0.00046927636,0.03848222],"genre_scores_gemma":[0.97956777,0.00023225612,0.013009647,0.000051477065,0.00005619264,0.00003069012,0.0002802094,0.000046622044,0.0067250547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908066,0.00016732374,0.000079067235,0.00016086258,0.00032744466,0.00018461797],"domain_scores_gemma":[0.99825627,0.0007075237,0.0002206146,0.00029288433,0.00028113413,0.00024158845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008943868,0.0003313693,0.00038448043,0.0019694243,0.0011264253,0.0028707013,0.0004937292,0.00035204773,0.002887926],"category_scores_gemma":[0.0019466949,0.00043150273,0.0007585331,0.0008315017,0.0033328086,0.0047172853,0.0029749828,0.00096622936,0.00031508316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077666664,0.000024071302,0.0017039119,0.00006634533,0.000019576139,0.00048019167,0.0011647423,0.0012174295,0.00480775,0.98015416,0.00041467356,0.00986954],"study_design_scores_gemma":[0.000028213439,0.00010824139,0.004678004,0.00005036751,0.000056512315,0.00080470205,0.0011439298,0.013306842,0.013592667,0.95389163,0.012276948,0.00006193561],"about_ca_topic_score_codex":0.00095265673,"about_ca_topic_score_gemma":0.0006317192,"teacher_disagreement_score":0.002887926,"about_ca_system_score_codex":0.0009397456,"about_ca_system_score_gemma":0.00039296693,"threshold_uncertainty_score":0.009661078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68509305,0.0007946584,0.21625237,0.0018636534,0.00033529894,0.00017727862,0.0022989686,0.0017355925,0.09144916],"genre_scores_gemma":[0.9654827,0.00035804405,0.016353812,0.00030780007,0.00030888105,0.0001022223,0.0012711517,0.000269305,0.015546088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817276,0.00033383028,0.00013602918,0.00043806108,0.00041820892,0.00050104206],"domain_scores_gemma":[0.9952937,0.0017190038,0.0011520233,0.00070277695,0.0005019461,0.00063044054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012895721,0.0006137693,0.00079975696,0.0032413232,0.0018271045,0.0037735845,0.0011416983,0.0008387711,0.01778174],"category_scores_gemma":[0.0044273795,0.00035122293,0.00115739,0.001531372,0.0019671866,0.004973786,0.0016404081,0.0014678367,0.0021373273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002552398,0.0000971277,0.0010887007,0.00015523197,0.000042841893,0.0002681884,0.00041797076,0.0036975055,0.0032575803,0.9691823,0.003908489,0.017628828],"study_design_scores_gemma":[0.000037288533,0.00008239266,0.0010513518,0.000023029459,0.00003921338,0.0005030396,0.00017844827,0.01345901,0.0027404712,0.97683084,0.0050071953,0.000047653528],"about_ca_topic_score_codex":0.0010132263,"about_ca_topic_score_gemma":0.0013920724,"teacher_disagreement_score":0.01778174,"about_ca_system_score_codex":0.0012862938,"about_ca_system_score_gemma":0.0006906636,"threshold_uncertainty_score":0.059485853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80042994,0.0010866578,0.13963774,0.0015862015,0.00018050043,0.000051922685,0.0009906888,0.00051732635,0.055518955],"genre_scores_gemma":[0.9740303,0.00025782085,0.018537896,0.00012068777,0.00018097126,0.000053260992,0.00051398977,0.00013095712,0.006174084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680895,0.00065674697,0.00029547766,0.00074968924,0.00096157216,0.00052750745],"domain_scores_gemma":[0.9903741,0.004031553,0.0015656675,0.0009859109,0.0016202927,0.0014225753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019317312,0.0004475897,0.00074825005,0.0026143442,0.002202477,0.005922554,0.0009994135,0.00076145754,0.0078964215],"category_scores_gemma":[0.0064159264,0.0007694891,0.0006798989,0.0014238456,0.0048712967,0.010703649,0.003431699,0.0021340135,0.0009078922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000298454,0.00006693135,0.0047563505,0.000094533636,0.00003762222,0.00022343539,0.001336762,0.0026494064,0.005417279,0.9672453,0.0013663432,0.01650766],"study_design_scores_gemma":[0.000021665091,0.00015626887,0.002238807,0.00007907941,0.00004475351,0.00037621328,0.0008279535,0.010340234,0.0087968465,0.96493065,0.012120047,0.000067447596],"about_ca_topic_score_codex":0.0009018505,"about_ca_topic_score_gemma":0.00084692275,"teacher_disagreement_score":0.0078964215,"about_ca_system_score_codex":0.0018454794,"about_ca_system_score_gemma":0.0008558309,"threshold_uncertainty_score":0.026416183},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12301208,0.0014321984,0.15790404,0.0059930584,0.0018786304,0.000118880715,0.0011939786,0.00065143406,0.70781565],"genre_scores_gemma":[0.67302275,0.0007426808,0.026986698,0.0009437068,0.0007446975,0.00016341657,0.0010839248,0.0007251846,0.29558697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862087,0.00027464962,0.00010594454,0.00034059703,0.000408878,0.00024896077],"domain_scores_gemma":[0.9983398,0.00047528022,0.000110019675,0.0003466454,0.000538005,0.00019031316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013086612,0.00040771766,0.00061922905,0.0023510666,0.004049664,0.007434461,0.00090768974,0.001245483,0.03909108],"category_scores_gemma":[0.0026602938,0.0006077845,0.0008671416,0.0024224722,0.0050345724,0.010555697,0.0036121104,0.0036234476,0.0035236094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047974045,0.0000021261653,0.000034330835,0.00000480435,8.534922e-7,0.000013030777,0.00010059877,0.000029771645,0.000069733585,0.9982326,0.0006165979,0.0008906631],"study_design_scores_gemma":[0.000011040009,0.000008205021,0.0001674866,0.000014800311,0.0000067084975,0.00009031709,0.00023537953,0.0006552168,0.0005482543,0.96182513,0.03642878,0.00000850126],"about_ca_topic_score_codex":0.003533154,"about_ca_topic_score_gemma":0.0027652527,"teacher_disagreement_score":0.03909108,"about_ca_system_score_codex":0.0031836152,"about_ca_system_score_gemma":0.0010588564,"threshold_uncertainty_score":0.13077271},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045570843,0.01614029,0.049721166,0.009996376,0.0051766066,0.00004096892,0.0002615521,0.0003059756,0.9138],"genre_scores_gemma":[0.10668349,0.017406052,0.048400607,0.0047340384,0.0069008064,0.00010198205,0.0007938353,0.00082798384,0.8141513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994067,0.00014922388,0.000024011524,0.000102566424,0.00024649993,0.000071000715],"domain_scores_gemma":[0.99951136,0.00022232997,0.000020324513,0.00006421515,0.0001134773,0.00006832213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000566786,0.00071051763,0.0006215587,0.0012643514,0.001303988,0.0046866755,0.000645044,0.00090299366,0.03642346],"category_scores_gemma":[0.0013506024,0.00033512642,0.0007107903,0.0018551439,0.003145233,0.007324224,0.001773797,0.00350141,0.008474975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011537735,0.000026638658,0.000034366138,0.000067750465,0.0000023748821,0.000024948022,0.00024523944,0.00012962091,0.00050650263,0.9445487,0.031880733,0.022521542],"study_design_scores_gemma":[0.000008818384,0.000009418237,0.00009439094,0.00006625227,0.0000028097409,0.000101813916,0.0001430596,0.0003032692,0.00039394916,0.69304985,0.30581474,0.000011694255],"about_ca_topic_score_codex":0.00100264,"about_ca_topic_score_gemma":0.0018908033,"teacher_disagreement_score":0.03642346,"about_ca_system_score_codex":0.0018578547,"about_ca_system_score_gemma":0.0011003058,"threshold_uncertainty_score":0.12184864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2748363,0.0026521555,0.58278,0.004187263,0.0011156885,0.00028151658,0.0013165753,0.0010152697,0.13181518],"genre_scores_gemma":[0.79935604,0.0014378427,0.16681263,0.00069622154,0.0014601073,0.00044013452,0.001621047,0.00041928692,0.027756672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932903,0.0022605087,0.0006333212,0.0009029587,0.0022023018,0.000710479],"domain_scores_gemma":[0.9895601,0.0053580883,0.0008810175,0.00076191925,0.0015675146,0.0018713794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055281557,0.0012746559,0.0016720393,0.0033889168,0.0044144094,0.0098694265,0.0017515928,0.0014943214,0.0072210836],"category_scores_gemma":[0.00813459,0.0016548188,0.0026203005,0.0028114268,0.007722183,0.011967107,0.0044374163,0.004718902,0.0015514628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008597266,0.000040164552,0.00016449446,0.000033179414,0.0000111105,0.00006407245,0.00039144314,0.00034911896,0.0011594666,0.9946154,0.0006502924,0.0024353135],"study_design_scores_gemma":[0.000052347772,0.000022055456,0.00013441705,0.000011612869,0.000007775157,0.00007918031,0.00017878735,0.0023737599,0.00076398754,0.9936147,0.0027452938,0.000016161603],"about_ca_topic_score_codex":0.0016737554,"about_ca_topic_score_gemma":0.0016146201,"teacher_disagreement_score":0.0098694265,"about_ca_system_score_codex":0.002505493,"about_ca_system_score_gemma":0.0021414703,"threshold_uncertainty_score":0.029236019},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029906554,0.73938733,0.10266182,0.014755875,0.011103783,0.00010100828,0.001162997,0.00081459084,0.12702192],"genre_scores_gemma":[0.08338295,0.61073047,0.0763646,0.005219275,0.029517956,0.00031414672,0.0017587424,0.0006608058,0.192051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924904,0.0001371187,0.00007128878,0.00013299496,0.00032664769,0.000083006154],"domain_scores_gemma":[0.999496,0.00021755321,0.000050092,0.000044126053,0.000107730455,0.00008459392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012525634,0.0010367878,0.0011928714,0.0026333241,0.0009393933,0.003606299,0.001148802,0.0011936818,0.023706205],"category_scores_gemma":[0.0013055109,0.0008491457,0.00085782097,0.0041044136,0.0030227364,0.007198806,0.0026165498,0.0038333153,0.014099985],"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.000053949727,0.000081407685,0.0002935534,0.0015314195,0.00003709138,0.00016242586,0.00072063226,0.0015466354,0.0017333284,0.4252159,0.32058012,0.24804361],"study_design_scores_gemma":[0.0000071306563,0.000033348046,0.00042040576,0.00029110105,0.00000712138,0.00048223618,0.00012572129,0.0008253253,0.00019765178,0.2570475,0.7405408,0.000021652853],"about_ca_topic_score_codex":0.0010017711,"about_ca_topic_score_gemma":0.001579118,"teacher_disagreement_score":0.023706205,"about_ca_system_score_codex":0.0013142552,"about_ca_system_score_gemma":0.0013168507,"threshold_uncertainty_score":0.07930511},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14389347,0.0029279473,0.28833202,0.0065868953,0.0020620455,0.00036941768,0.0040131016,0.004521239,0.5472939],"genre_scores_gemma":[0.9506819,0.0009240693,0.024821235,0.0010485327,0.0006041103,0.00017934926,0.0025013075,0.00091669627,0.018322721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979691,0.00043377667,0.0001728595,0.00076046726,0.00044182368,0.00022194965],"domain_scores_gemma":[0.9984273,0.00050618453,0.00022265356,0.0004461039,0.00027475067,0.00012310906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014813372,0.0009117125,0.00068615447,0.0010037659,0.0009687145,0.005023628,0.0011616118,0.0009317811,0.023669396],"category_scores_gemma":[0.005047612,0.00028413575,0.0006916156,0.00082794466,0.003213871,0.010023696,0.002553368,0.00123024,0.0037065449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000837578,0.000118332944,0.0032692738,0.0005118654,0.000085268606,0.0005092702,0.0031482228,0.0010302848,0.014033369,0.7945318,0.010663844,0.17126091],"study_design_scores_gemma":[0.000108255685,0.00021934674,0.0052274354,0.00016592091,0.00020523778,0.0012650092,0.00196202,0.0112489555,0.009444733,0.8780504,0.09198933,0.00011338697],"about_ca_topic_score_codex":0.001440139,"about_ca_topic_score_gemma":0.00086689857,"teacher_disagreement_score":0.023669396,"about_ca_system_score_codex":0.0009951944,"about_ca_system_score_gemma":0.00085462694,"threshold_uncertainty_score":0.07918203},"labels":[],"label_agreement":null},{"id":"W2268439824","doi":"10.1016/j.apal.2018.02.005","title":"New-from-old full dualities via axiomatisation","year":2018,"lang":"en","type":"preprint","venue":"Annals of Pure and Applied Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Dual (grammatical number); Algebra over a field; Mathematics; French horn; Pure mathematics; Natural (archaeology); Physics; Linguistics","score_opus":0.05508357663907007,"score_gpt":0.29424860470000047,"score_spread":0.2391650280609304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268439824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02551917,0.0018195546,0.8569147,0.0076632085,0.0019609067,0.00011143344,0.0007732779,0.0018704154,0.10336728],"genre_scores_gemma":[0.5718663,0.0023576661,0.3811129,0.004390546,0.0026620866,0.0002549154,0.0017135309,0.0015226635,0.03411942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555284,0.0014009416,0.0004053436,0.0010551376,0.0012499443,0.0003358353],"domain_scores_gemma":[0.99173284,0.0027084448,0.00021849404,0.0033077626,0.001612326,0.00042016056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005498878,0.0009935063,0.0013867704,0.0021154608,0.002438762,0.0061654905,0.0024993857,0.0018342398,0.01136368],"category_scores_gemma":[0.011586687,0.0011249636,0.0026974522,0.0014677382,0.008865772,0.022888856,0.009701872,0.010672113,0.0027286808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003182557,0.000024106212,0.00009670075,0.00004983946,0.000017620241,0.000033469947,0.00015565677,0.0003100914,0.000329275,0.98718387,0.0020534392,0.009714132],"study_design_scores_gemma":[0.000007791368,0.000003903511,0.000020945172,0.00001033476,0.00000938851,0.00003681458,0.00001857555,0.0010965704,0.00025731584,0.9941115,0.004419128,0.000007655783],"about_ca_topic_score_codex":0.00045426894,"about_ca_topic_score_gemma":0.0007461285,"teacher_disagreement_score":0.01136368,"about_ca_system_score_codex":0.0015280697,"about_ca_system_score_gemma":0.0014348639,"threshold_uncertainty_score":0.038015306},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33600473,0.0024954693,0.44613165,0.0030077416,0.00042494503,0.00007016821,0.0008777901,0.000334031,0.21065353],"genre_scores_gemma":[0.8783768,0.0017562223,0.04432335,0.0005525118,0.00045768902,0.00006127007,0.0010258246,0.00030832316,0.07313808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991242,0.00021908831,0.000050913113,0.00019269054,0.00029234387,0.000120794444],"domain_scores_gemma":[0.99858475,0.0005227286,0.00017763585,0.00018456294,0.00027040683,0.00025996167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915991,0.0011486838,0.0011358146,0.003436175,0.002077136,0.0032889848,0.00091746385,0.00077440817,0.012542274],"category_scores_gemma":[0.002354422,0.0006943561,0.000942272,0.0030946706,0.0038620112,0.007882387,0.004143313,0.0034415512,0.001441137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117066365,0.0000054567386,0.00010012582,0.000012031007,0.0000040839313,0.000036366306,0.00013654718,0.00044663672,0.00021277671,0.99637574,0.000489543,0.0021690705],"study_design_scores_gemma":[0.000004251552,0.000009809181,0.00012812334,0.0000075953462,0.0000047860462,0.00008847641,0.000110177694,0.0022150788,0.00020718732,0.99421906,0.003000239,0.000005183846],"about_ca_topic_score_codex":0.0014579293,"about_ca_topic_score_gemma":0.0017108113,"teacher_disagreement_score":0.012542274,"about_ca_system_score_codex":0.0014749434,"about_ca_system_score_gemma":0.0004682455,"threshold_uncertainty_score":0.041958094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914665,0.00093562563,0.0012420609,0.00021201445,0.000016187436,0.000023618077,0.0022853557,0.00002202564,0.0037965362],"genre_scores_gemma":[0.9885479,0.0005976917,0.00075388217,0.000032374104,0.000019071837,0.000024577792,0.0019690644,0.000008809023,0.008046626],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924433,0.00012543613,0.000059422502,0.00017015944,0.0002640689,0.00013660589],"domain_scores_gemma":[0.9907246,0.00498582,0.0025244434,0.00033780883,0.000855378,0.0005718519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012306102,0.00043492665,0.0004383773,0.0012516822,0.0005332919,0.0018430146,0.00062581594,0.00046752143,0.009995567],"category_scores_gemma":[0.007093029,0.0002411907,0.0004875326,0.002149075,0.0005419452,0.00081226986,0.00070604554,0.0007279686,0.0008275486],"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.00048100436,0.00005602887,0.9709216,0.00022272457,0.00033086576,0.00022590448,0.0027056637,0.003105916,0.0020666728,0.0017103624,0.0009131868,0.017260034],"study_design_scores_gemma":[0.0000068512973,0.00009115195,0.9917135,0.000025869698,0.00009644336,0.000063622734,0.0022723144,0.0016275502,0.0008211508,0.0002545834,0.003010068,0.000016909515],"about_ca_topic_score_codex":0.19753286,"about_ca_topic_score_gemma":0.26300836,"teacher_disagreement_score":0.19753286,"about_ca_system_score_codex":0.002653164,"about_ca_system_score_gemma":0.0014591952,"threshold_uncertainty_score":0.39276618},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05711157,0.0014203228,0.31241572,0.012004851,0.00089139503,0.0001048198,0.00040410034,0.00045911677,0.6151882],"genre_scores_gemma":[0.927483,0.00055069244,0.0437969,0.0012236373,0.0009063123,0.0001544055,0.0002343927,0.00034315462,0.025307564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765563,0.0012512633,0.00013510408,0.00036071351,0.0004196867,0.00017761502],"domain_scores_gemma":[0.9965521,0.0019604324,0.00020868842,0.00059100275,0.000526054,0.00016166906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027030369,0.00073940103,0.0006937145,0.0041603805,0.004436241,0.0065145413,0.0026452055,0.0033424082,0.013549116],"category_scores_gemma":[0.006137048,0.00093192095,0.0009537989,0.0028912702,0.013295884,0.022004372,0.0042230184,0.004642849,0.0011193762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074621726,0.000004222062,0.0000630955,0.00000835189,0.0000014531289,0.000044165827,0.00092719926,0.000066303284,0.00011838374,0.99693406,0.0005387054,0.0012864314],"study_design_scores_gemma":[0.000012019649,0.0000053389285,0.00012300177,0.000020536494,0.0000042237098,0.00013926007,0.0009868753,0.0014223607,0.00023208871,0.9865767,0.010468285,0.000009375877],"about_ca_topic_score_codex":0.0021809954,"about_ca_topic_score_gemma":0.0024530035,"teacher_disagreement_score":0.013549116,"about_ca_system_score_codex":0.0028614905,"about_ca_system_score_gemma":0.0010450548,"threshold_uncertainty_score":0.045326293},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81034595,0.0002706,0.15569538,0.0007087256,0.00027002874,0.000057646437,0.00011122424,0.0005067041,0.032033823],"genre_scores_gemma":[0.9795375,0.00009862102,0.014097443,0.00009944922,0.00015365936,0.00003968865,0.0000834538,0.00006585503,0.0058243754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982071,0.0005157596,0.0001244532,0.00035489668,0.00049414707,0.00030355298],"domain_scores_gemma":[0.9957475,0.0013200684,0.0004224988,0.0007146175,0.00095580664,0.00083960075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287296,0.00037726134,0.00045206843,0.0010110659,0.0010311981,0.0020568117,0.00056842825,0.00049742346,0.0033199484],"category_scores_gemma":[0.004361121,0.00031016365,0.0008557233,0.00044707075,0.0029463337,0.004345847,0.002050725,0.0015681598,0.00036012303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008446654,0.000054701857,0.0005272769,0.000017646957,0.000007700891,0.0003335303,0.00078192085,0.0010234824,0.0049083345,0.9860874,0.0004055635,0.005768061],"study_design_scores_gemma":[0.00002899832,0.00007242218,0.00025626528,0.000015095322,0.000008734494,0.00036571486,0.00025390822,0.010610722,0.002891356,0.98145837,0.004018866,0.000019587575],"about_ca_topic_score_codex":0.00048578635,"about_ca_topic_score_gemma":0.00036572613,"teacher_disagreement_score":0.0033199484,"about_ca_system_score_codex":0.0008527332,"about_ca_system_score_gemma":0.00052730524,"threshold_uncertainty_score":0.012844503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14995353,0.0003385785,0.79556185,0.0005006172,0.0001528062,0.00011165602,0.00048626587,0.0008999927,0.05199471],"genre_scores_gemma":[0.8579444,0.00024849127,0.11942973,0.00018432608,0.00012290856,0.00009668839,0.00045809132,0.00012373156,0.021391585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987795,0.00022243599,0.0001131545,0.00021721302,0.0005321478,0.00013565803],"domain_scores_gemma":[0.99844235,0.0003347641,0.000217884,0.00035274745,0.00045582873,0.00019637546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508572,0.00046779314,0.0007014076,0.001178159,0.001456063,0.004072212,0.0010116247,0.000593769,0.009222806],"category_scores_gemma":[0.0025109914,0.00039996332,0.001027636,0.0015174139,0.0018231076,0.005126683,0.0015223107,0.0020787963,0.0015177123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012546431,0.00004980712,0.0002946816,0.0000469841,0.000026844336,0.00018064759,0.00019883615,0.0044453735,0.004502553,0.964985,0.000994469,0.024149297],"study_design_scores_gemma":[0.000031437143,0.000026126161,0.0002463127,0.00001558366,0.000029571409,0.00021559285,0.00012186841,0.040893022,0.004406342,0.94771767,0.006265904,0.00003071054],"about_ca_topic_score_codex":0.0009262975,"about_ca_topic_score_gemma":0.0014204348,"teacher_disagreement_score":0.009222806,"about_ca_system_score_codex":0.0015841752,"about_ca_system_score_gemma":0.00096515566,"threshold_uncertainty_score":0.030853331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097667605,0.0015502936,0.7293459,0.0012354362,0.00048772385,0.00017567421,0.0007669001,0.0012536031,0.16751684],"genre_scores_gemma":[0.76706415,0.0012400866,0.18561853,0.00067961315,0.00067332835,0.00029687677,0.001295736,0.00046046823,0.042671178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797195,0.0004467641,0.00018569133,0.0003640347,0.00074722857,0.00028427696],"domain_scores_gemma":[0.9985505,0.0002841438,0.00016095287,0.0001721417,0.00065331487,0.0001789632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196371,0.00047652476,0.0004157206,0.0017705213,0.0019402263,0.0029696021,0.00073279906,0.00048972195,0.008099789],"category_scores_gemma":[0.0022977109,0.00037574742,0.00077119475,0.0013335053,0.0029758317,0.00653615,0.0019981433,0.0020992095,0.0024804508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023940976,0.000016788772,0.00021520881,0.000049452352,0.0000048630977,0.000055451972,0.0004411595,0.0002706972,0.0015184295,0.98928356,0.0011751236,0.0069453996],"study_design_scores_gemma":[0.000021693484,0.000042510615,0.00029894797,0.000025360367,0.000013590903,0.00025666904,0.0002554963,0.003996061,0.00411237,0.95761263,0.033340413,0.000024381337],"about_ca_topic_score_codex":0.0009873247,"about_ca_topic_score_gemma":0.0007154142,"teacher_disagreement_score":0.008099789,"about_ca_system_score_codex":0.001293009,"about_ca_system_score_gemma":0.00068295316,"threshold_uncertainty_score":0.02709651},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3412937,0.0019565811,0.6373732,0.00063549366,0.00018011217,0.000056926805,0.00017604862,0.00023882932,0.018089145],"genre_scores_gemma":[0.92564166,0.00076974643,0.06692315,0.00015691637,0.00030367842,0.00008014748,0.00012857487,0.00006237345,0.005933845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973309,0.0007453761,0.00021074424,0.00043552538,0.0009228051,0.00035458768],"domain_scores_gemma":[0.99488306,0.002163026,0.00072985876,0.00059864,0.000934225,0.00069128507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035130305,0.00091974775,0.0005947211,0.0023080308,0.0010879273,0.0028237943,0.00094213104,0.00058557873,0.001741471],"category_scores_gemma":[0.005275195,0.00036631915,0.0012566389,0.001381199,0.00397078,0.0069364375,0.0017676969,0.0016560567,0.0005563866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031478736,0.00002285556,0.00049427745,0.00003345657,0.000012714218,0.0001186435,0.00030498358,0.0018188533,0.0019386848,0.98768765,0.00015744849,0.0073789665],"study_design_scores_gemma":[0.000024818435,0.00014022997,0.0012469796,0.000034137815,0.000041441745,0.0006077103,0.0002856403,0.029973613,0.0066860723,0.95371175,0.0072038756,0.000043853808],"about_ca_topic_score_codex":0.00065992307,"about_ca_topic_score_gemma":0.0003868179,"teacher_disagreement_score":0.0035130305,"about_ca_system_score_codex":0.0013585796,"about_ca_system_score_gemma":0.00073653174,"threshold_uncertainty_score":0.018578887},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0143492175,0.0041136076,0.081542976,0.002762113,0.0010180544,0.000023817543,0.00011325673,0.00035602174,0.895721],"genre_scores_gemma":[0.32755667,0.0052631297,0.030559419,0.0014506557,0.0011081303,0.00009183311,0.00025241528,0.00071089016,0.6330069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995572,0.00010662932,0.000021149051,0.000077618584,0.00016942386,0.00006800038],"domain_scores_gemma":[0.99952006,0.00023523207,0.000029673103,0.00007752945,0.00010012571,0.000037455087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559084,0.000650252,0.0004735459,0.001343694,0.0016024199,0.0027498873,0.00097529276,0.0010391858,0.01648546],"category_scores_gemma":[0.0016875748,0.00048555763,0.0005922198,0.0015233721,0.0022630221,0.006126305,0.002015415,0.0031556378,0.005746431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046376977,0.0000036896188,0.000008881264,0.000015833652,0.0000010732283,0.000012063726,0.00009403383,0.00006943512,0.00016758962,0.9933176,0.0024749145,0.0038303141],"study_design_scores_gemma":[0.000003858059,0.0000041705457,0.000030016254,0.000030225601,0.000004712715,0.000097744065,0.00006305831,0.0005172022,0.00046287154,0.94246864,0.056309685,0.000007839172],"about_ca_topic_score_codex":0.0006754559,"about_ca_topic_score_gemma":0.0007313699,"teacher_disagreement_score":0.01648546,"about_ca_system_score_codex":0.0015182218,"about_ca_system_score_gemma":0.0007567252,"threshold_uncertainty_score":0.055149317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6790154,0.0013593328,0.24328877,0.0009604757,0.00030511792,0.00007208289,0.00039922105,0.00024822523,0.07435142],"genre_scores_gemma":[0.9569755,0.00034717162,0.02786908,0.00018798003,0.0001842751,0.0000779819,0.00031599333,0.00003594803,0.014006135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990717,0.00019931879,0.000077046774,0.00018698983,0.00033814146,0.0001267924],"domain_scores_gemma":[0.9990125,0.00024710468,0.00015716234,0.00016597926,0.00020782815,0.0002094316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009277835,0.00024877908,0.00029275424,0.00079340505,0.0010382442,0.0017205562,0.00056993804,0.00043867828,0.004277274],"category_scores_gemma":[0.0014674831,0.00025379294,0.00055845914,0.00046652756,0.002185721,0.0035363585,0.0019055189,0.0007105055,0.00053957064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019100053,0.000008862508,0.00018807763,0.000014617017,0.0000036343158,0.00006347835,0.00038540308,0.0003916138,0.0015231813,0.9943527,0.00022424797,0.0028249056],"study_design_scores_gemma":[0.000012275856,0.000039121605,0.00034693733,0.0000106623365,0.0000058215874,0.00016155254,0.00019784017,0.0046664025,0.0013620212,0.98800707,0.0051742955,0.00001592392],"about_ca_topic_score_codex":0.00048276296,"about_ca_topic_score_gemma":0.00029400954,"teacher_disagreement_score":0.004277274,"about_ca_system_score_codex":0.00065709575,"about_ca_system_score_gemma":0.00056581123,"threshold_uncertainty_score":0.01430887},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07660914,0.005953057,0.37414658,0.009703416,0.00080447673,0.00008126573,0.00083684665,0.0010388324,0.5308264],"genre_scores_gemma":[0.922511,0.0023917079,0.040941697,0.001718813,0.0008215242,0.00008151353,0.00057021354,0.00019655733,0.03076714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984394,0.00038201516,0.00014519668,0.00033781788,0.00051294157,0.00018256505],"domain_scores_gemma":[0.9980258,0.0008839753,0.00016354612,0.00041402492,0.00041324896,0.00009945519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019014549,0.0006041097,0.0005896074,0.0014705299,0.0013749229,0.0031101303,0.0008230531,0.0007158236,0.007686604],"category_scores_gemma":[0.0027013586,0.00036671644,0.0012085865,0.0009359715,0.0065844515,0.0072029345,0.003203281,0.0032192448,0.0012256743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003878653,0.0000044229923,0.000075870084,0.000028318098,0.000004914729,0.00005872461,0.00016463286,0.00022468655,0.0002817505,0.99648845,0.0007612318,0.0019032118],"study_design_scores_gemma":[0.000005896221,0.0000060469238,0.00010449976,0.000017264436,0.000008683388,0.000104488005,0.000060589857,0.0011460023,0.0006376241,0.98087513,0.017027853,0.000005742468],"about_ca_topic_score_codex":0.0011314211,"about_ca_topic_score_gemma":0.0008684989,"teacher_disagreement_score":0.007686604,"about_ca_system_score_codex":0.0029791542,"about_ca_system_score_gemma":0.00086458144,"threshold_uncertainty_score":0.025714278},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008332744,0.09429,0.07944541,0.07243269,0.0031019954,0.00013075933,0.0010837222,0.00085753534,0.7403251],"genre_scores_gemma":[0.6817739,0.04990527,0.06101196,0.032665353,0.008660737,0.0006125294,0.0016989153,0.0009544512,0.16271687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499077,0.0022778744,0.0003770295,0.0010400865,0.00086684246,0.00044737995],"domain_scores_gemma":[0.9959584,0.0024625661,0.0002702335,0.000624263,0.0005111208,0.0001733877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033727041,0.0010675448,0.0015056208,0.0026019227,0.0044202707,0.009244055,0.0017539557,0.0032563861,0.013240261],"category_scores_gemma":[0.0050706924,0.0005885291,0.0017161367,0.0024428673,0.027370242,0.009929563,0.003865627,0.0062104026,0.004274339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004679357,0.0000033316658,0.00006786809,0.000053969598,0.000006758844,0.000027688511,0.00042009723,0.00020651404,0.000044251687,0.9880242,0.0070875767,0.0040531103],"study_design_scores_gemma":[0.000005082476,0.0000043133923,0.0000613581,0.000046490586,0.0000027736069,0.000046667566,0.00012111481,0.00017361772,0.000027932487,0.92371756,0.07578876,0.000004329833],"about_ca_topic_score_codex":0.0057629566,"about_ca_topic_score_gemma":0.0025993267,"teacher_disagreement_score":0.013240261,"about_ca_system_score_codex":0.009851679,"about_ca_system_score_gemma":0.003664635,"threshold_uncertainty_score":0.07147926},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029367066,0.030584447,0.0020253279,0.1455982,0.7618873,0.00005732813,0.0005427884,0.00021536947,0.05879557],"genre_scores_gemma":[0.0042962804,0.012346483,0.00064673263,0.016226282,0.812843,0.000059488706,0.00037081345,0.0005271782,0.15268375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956091,0.00066992565,0.0002798567,0.00089295866,0.0021838194,0.00036432935],"domain_scores_gemma":[0.99082935,0.0026100676,0.00045215274,0.00070744846,0.0032163465,0.002184665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038260373,0.002497501,0.0029513722,0.0041775242,0.002870719,0.010371543,0.0018137058,0.0063621476,0.07231466],"category_scores_gemma":[0.013304363,0.000826703,0.0014273463,0.0022841133,0.0027706125,0.009520026,0.0035460687,0.008836147,0.02948509],"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.00001786703,0.000010834452,0.00002887631,0.00007119663,0.000007740251,0.000023912171,0.000018704995,0.00004397941,0.000073294585,0.008445066,0.9841791,0.007079493],"study_design_scores_gemma":[0.0000128220545,0.000010695588,0.00013057969,0.00006904646,0.000008866336,0.00004664664,0.000016463686,0.00013258631,0.00007010094,0.009052058,0.9904419,0.000008378682],"about_ca_topic_score_codex":0.0022832768,"about_ca_topic_score_gemma":0.003871621,"teacher_disagreement_score":0.07231466,"about_ca_system_score_codex":0.0058486685,"about_ca_system_score_gemma":0.0037437628,"threshold_uncertainty_score":0.2419166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53206205,0.00083086133,0.43631974,0.0007834723,0.00014468157,0.0001669912,0.0003246899,0.00051556795,0.028851913],"genre_scores_gemma":[0.9464729,0.0002020542,0.047107458,0.00011859613,0.00012995658,0.00009706758,0.00033908358,0.00006285943,0.0054700742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631184,0.00075120426,0.0004129821,0.0011663965,0.0009949354,0.0003627077],"domain_scores_gemma":[0.99457824,0.0024815367,0.0006202877,0.0009203744,0.00085095805,0.0005486266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022697505,0.0004357155,0.0008606321,0.0010121627,0.0022271876,0.0043295794,0.0010915223,0.0008239359,0.0032694358],"category_scores_gemma":[0.0059770285,0.0006001825,0.001530176,0.0013586624,0.0045189387,0.011592831,0.0035836536,0.002336206,0.0004394576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011044628,0.000058786944,0.0015452157,0.00008259873,0.000026984093,0.00026945944,0.0012523435,0.0017424043,0.005527454,0.9812455,0.00026919693,0.007869496],"study_design_scores_gemma":[0.000044511282,0.000072928735,0.0007841618,0.000027647833,0.00004704064,0.00040173708,0.0006078836,0.009198788,0.007585125,0.9736226,0.00757356,0.00003400544],"about_ca_topic_score_codex":0.0013418844,"about_ca_topic_score_gemma":0.001199365,"teacher_disagreement_score":0.0043295794,"about_ca_system_score_codex":0.0013926625,"about_ca_system_score_gemma":0.0009455335,"threshold_uncertainty_score":0.01200372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.471647,0.0021023587,0.2102992,0.007545167,0.00107947,0.000102353595,0.0010584851,0.00061928737,0.30554667],"genre_scores_gemma":[0.9339944,0.0006760079,0.021488506,0.00087611744,0.0006061684,0.00012594424,0.0007923728,0.00027927323,0.041161228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918634,0.00020061641,0.00008214113,0.00019524328,0.00014697944,0.00018865372],"domain_scores_gemma":[0.99702317,0.0015356317,0.0004322422,0.00021251918,0.00039807582,0.00039834165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018224465,0.00082714943,0.000697906,0.0017248917,0.0030148134,0.004295183,0.0011664624,0.0012159338,0.012426546],"category_scores_gemma":[0.0036416003,0.00063635194,0.0013606217,0.0019315097,0.0034927907,0.007596905,0.0016259437,0.003331822,0.0014578666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091064794,0.000022023667,0.00027048748,0.000028241215,0.0000083063,0.00013515263,0.00034848778,0.0002617063,0.0009510718,0.9930449,0.0014570504,0.00338154],"study_design_scores_gemma":[0.000021408818,0.000034910146,0.000495705,0.000015571622,0.000014459058,0.00023912973,0.0002705277,0.0024168089,0.00198273,0.9868695,0.007617511,0.00002168321],"about_ca_topic_score_codex":0.0012110976,"about_ca_topic_score_gemma":0.0010193052,"teacher_disagreement_score":0.012426546,"about_ca_system_score_codex":0.0016625355,"about_ca_system_score_gemma":0.00071065646,"threshold_uncertainty_score":0.04157096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6879984,0.0009396349,0.21117945,0.001445845,0.00024411135,0.00010794013,0.00024416397,0.00043557494,0.09740483],"genre_scores_gemma":[0.9669776,0.00035615117,0.020632079,0.00014402316,0.00021054644,0.00008331575,0.00015194087,0.000083206956,0.011361044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987531,0.00028993897,0.00006419073,0.00019101721,0.00041933294,0.0002824479],"domain_scores_gemma":[0.99915075,0.0002455573,0.0001408355,0.00014520276,0.00012065408,0.00019703986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010811734,0.0005289037,0.00062651234,0.0018838429,0.0018769973,0.004197701,0.00096254214,0.00067188166,0.0049046706],"category_scores_gemma":[0.0014278623,0.00044197234,0.0010375828,0.001091292,0.0041848244,0.0066615944,0.0021413728,0.0019379467,0.00070270465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012735181,0.000015754942,0.00010213999,0.000011806221,0.000002631582,0.000047698057,0.00024822893,0.00045726946,0.0008252851,0.99641955,0.00013826475,0.0017184973],"study_design_scores_gemma":[0.000019657471,0.00003323115,0.00015831424,0.000012126866,0.0000053888857,0.00008208505,0.00020491781,0.00481365,0.0011353964,0.9908093,0.0027101233,0.00001581723],"about_ca_topic_score_codex":0.0010768792,"about_ca_topic_score_gemma":0.0008622499,"teacher_disagreement_score":0.0049046706,"about_ca_system_score_codex":0.0014755875,"about_ca_system_score_gemma":0.0007027411,"threshold_uncertainty_score":0.016407728},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027613172,0.029786304,0.13608542,0.053895913,0.01601169,0.000076737655,0.0011893417,0.00039164073,0.73494977],"genre_scores_gemma":[0.75251806,0.010778263,0.08451187,0.008965934,0.013279686,0.00042256192,0.0007477377,0.00026766426,0.12850815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984705,0.0004847131,0.00009993847,0.00041167188,0.00042175947,0.00011141184],"domain_scores_gemma":[0.99668676,0.0019533662,0.00019159929,0.00047566582,0.0005031229,0.00018934958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018725725,0.00060490245,0.0004912522,0.0017940243,0.0046183364,0.003656034,0.0009714174,0.0016519758,0.015757078],"category_scores_gemma":[0.008116578,0.00023332554,0.0008396519,0.001497247,0.0077681807,0.009055119,0.002810761,0.007714751,0.002013587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011706902,0.0000025577995,0.000050515428,0.000020243075,0.0000017518028,0.000023929957,0.0001316611,0.00005690662,0.00009231643,0.99311596,0.0042847404,0.0022077628],"study_design_scores_gemma":[0.000009619076,0.000016356858,0.00022311987,0.000057146768,0.0000061362434,0.00011076859,0.00015771191,0.00047786723,0.00022805012,0.89686733,0.101835266,0.000010728081],"about_ca_topic_score_codex":0.0020504156,"about_ca_topic_score_gemma":0.0018207878,"teacher_disagreement_score":0.015757078,"about_ca_system_score_codex":0.0032919922,"about_ca_system_score_gemma":0.0007176997,"threshold_uncertainty_score":0.05271268},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10878609,0.003473059,0.3713752,0.0032783959,0.0016643058,0.00013977785,0.0022074927,0.001075232,0.50800043],"genre_scores_gemma":[0.7843869,0.0014917167,0.093979985,0.0011961969,0.0005524956,0.00007984604,0.0013320084,0.00036610517,0.11661477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986695,0.00038982125,0.000103627724,0.00022051846,0.00043378398,0.00018279774],"domain_scores_gemma":[0.998752,0.0002926349,0.00010315578,0.00023201662,0.00041914417,0.00020115975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198113,0.0004892437,0.00048071652,0.0015908342,0.001937565,0.0028159434,0.00083943945,0.0008039307,0.0149801895],"category_scores_gemma":[0.0029030738,0.00042069028,0.00063678174,0.0011652219,0.0019836815,0.0054975194,0.002520888,0.0021186813,0.0053430633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002137622,0.0000137923935,0.00015191475,0.000029768364,0.000006920795,0.00009271036,0.00014137315,0.00012028247,0.00074612256,0.98653746,0.0028087783,0.009329629],"study_design_scores_gemma":[0.000011609428,0.000009600847,0.00013490432,0.000015896956,0.0000060912444,0.0002753786,0.00010013723,0.0010418536,0.0013015632,0.9797686,0.017321944,0.000012457937],"about_ca_topic_score_codex":0.0011983269,"about_ca_topic_score_gemma":0.001876691,"teacher_disagreement_score":0.0149801895,"about_ca_system_score_codex":0.0012913056,"about_ca_system_score_gemma":0.0008472306,"threshold_uncertainty_score":0.050113738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17417245,0.004318919,0.602751,0.0017632594,0.00078743685,0.00015895841,0.0011963351,0.001072219,0.21377948],"genre_scores_gemma":[0.8699106,0.0008516212,0.09176028,0.0005675705,0.00039117702,0.00008198952,0.0005743221,0.00012356316,0.035738815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00022212662,0.00013425385,0.00024097732,0.00052382454,0.00013008568],"domain_scores_gemma":[0.9985934,0.00040125215,0.00013275379,0.00024978467,0.00041987252,0.0002029335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012462699,0.00036117408,0.00049276254,0.0015414585,0.0015820994,0.003167046,0.0006096349,0.0006014222,0.0070376066],"category_scores_gemma":[0.0026534256,0.00039196425,0.00085640524,0.001020686,0.0029995036,0.0051201303,0.001690829,0.0017626305,0.0013975198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028996854,0.000015167866,0.00028071462,0.00004085349,0.000012269485,0.000065965854,0.00026463205,0.00031628512,0.0009744122,0.98924375,0.0008932427,0.007863693],"study_design_scores_gemma":[0.00000931097,0.000015640047,0.00045607862,0.000020437568,0.000015122944,0.00020407428,0.00013722973,0.0024028076,0.0012222105,0.9824163,0.013084742,0.000015933378],"about_ca_topic_score_codex":0.0015103307,"about_ca_topic_score_gemma":0.0019116829,"teacher_disagreement_score":0.0070376066,"about_ca_system_score_codex":0.0010699455,"about_ca_system_score_gemma":0.00073568994,"threshold_uncertainty_score":0.023543179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2952626,0.00190218,0.47770965,0.003183027,0.0007393222,0.0001994521,0.0030502465,0.002068383,0.21588518],"genre_scores_gemma":[0.7968956,0.0017920457,0.11716337,0.00048560803,0.00030574764,0.00014820903,0.0019007337,0.0005095388,0.08079914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992229,0.00018713302,0.000053127664,0.00017452797,0.00019902868,0.00016328243],"domain_scores_gemma":[0.9971951,0.0012962918,0.00031250392,0.00058540475,0.00025527485,0.00035535556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007055794,0.0005151093,0.00066269713,0.0009790615,0.0013366713,0.0027480363,0.0010823333,0.001147284,0.016711503],"category_scores_gemma":[0.005007675,0.0006835587,0.00075437763,0.0010209549,0.0012135474,0.0062671877,0.00264323,0.002805779,0.0032728454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014829986,0.00005381648,0.00071117474,0.00014518121,0.00003185111,0.00012583958,0.00014586945,0.012453035,0.0026804472,0.9371407,0.012205988,0.034157757],"study_design_scores_gemma":[0.00002478186,0.000059509173,0.0004604017,0.00006493978,0.000026018119,0.00030678845,0.00013374072,0.031704932,0.0027434262,0.9370416,0.027415106,0.000018721124],"about_ca_topic_score_codex":0.0007454299,"about_ca_topic_score_gemma":0.0013371222,"teacher_disagreement_score":0.016711503,"about_ca_system_score_codex":0.000942528,"about_ca_system_score_gemma":0.0005667976,"threshold_uncertainty_score":0.05590552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1753536,0.00097477785,0.5483639,0.0014835462,0.0005308063,0.00022585446,0.0017196574,0.0015636247,0.2697842],"genre_scores_gemma":[0.81155473,0.00074014405,0.1106949,0.00080450514,0.00020696515,0.00018613749,0.0014306427,0.00049292535,0.073889084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988807,0.0003343851,0.000062634375,0.0003208273,0.00017660225,0.0002248714],"domain_scores_gemma":[0.9973802,0.0009101007,0.00023739302,0.00076046295,0.0003285651,0.00038331214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390872,0.0004441847,0.0005846926,0.0014784695,0.0023059829,0.0029691644,0.001118249,0.0007716439,0.019663284],"category_scores_gemma":[0.003525232,0.0006459487,0.0008456861,0.0014461522,0.0017020669,0.003901099,0.0025751966,0.0015833472,0.0031775075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000348137,0.000028012893,0.00031519856,0.000049311977,0.000018341472,0.00008865632,0.0002437283,0.0016548522,0.0009165849,0.9788826,0.004159663,0.013608127],"study_design_scores_gemma":[0.000020778443,0.000015932192,0.00025439463,0.000022196236,0.000020829653,0.00015062238,0.00017707297,0.0057640346,0.0009943135,0.9750405,0.017524835,0.000014437156],"about_ca_topic_score_codex":0.0017161302,"about_ca_topic_score_gemma":0.0031757862,"teacher_disagreement_score":0.019663284,"about_ca_system_score_codex":0.0014466454,"about_ca_system_score_gemma":0.0007508794,"threshold_uncertainty_score":0.06578022},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34823316,0.0025353883,0.3098978,0.0011643943,0.0010873353,0.00022839424,0.001401054,0.0014105735,0.3340419],"genre_scores_gemma":[0.84903055,0.0010591894,0.07790232,0.0006646861,0.00036253736,0.0001797915,0.0013686657,0.0005496546,0.068882585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990553,0.00019700639,0.00007526807,0.0002142332,0.00027967934,0.00017849533],"domain_scores_gemma":[0.99823344,0.00065814663,0.00024960985,0.00027705755,0.0002966181,0.00028498837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606007,0.00039907364,0.00047792785,0.0024780333,0.0026638666,0.0040222127,0.0009357977,0.0009276629,0.013981134],"category_scores_gemma":[0.0030192537,0.00059242814,0.00064182887,0.0022950352,0.0019498959,0.00516188,0.0020860974,0.0020885346,0.0028340884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003641316,0.000028076014,0.00019967202,0.000040668365,0.0000054752754,0.00014901841,0.00041079943,0.00028366808,0.00095330545,0.98778695,0.0017109568,0.008394983],"study_design_scores_gemma":[0.000016442875,0.000018183273,0.0004349833,0.00004546015,0.000013863426,0.00054665323,0.0004319678,0.0020169984,0.0012194075,0.9729767,0.022257008,0.000022309821],"about_ca_topic_score_codex":0.0010659401,"about_ca_topic_score_gemma":0.0018648532,"teacher_disagreement_score":0.013981134,"about_ca_system_score_codex":0.0010262438,"about_ca_system_score_gemma":0.00044339508,"threshold_uncertainty_score":0.046771526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09762136,0.010566461,0.5189301,0.006331657,0.0019088183,0.000121795536,0.0011169742,0.0009351315,0.3624677],"genre_scores_gemma":[0.7799868,0.007749227,0.11789409,0.0025394238,0.0015716071,0.00015983313,0.0011995251,0.00062543555,0.08827406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852043,0.00059734983,0.00010133165,0.00020297791,0.00039881162,0.00017917127],"domain_scores_gemma":[0.9983917,0.00062592694,0.00011379914,0.0003067088,0.00036221178,0.0001996407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015480571,0.0007022172,0.0008081775,0.0021495884,0.0021011773,0.0029207505,0.000918006,0.0011850388,0.009620336],"category_scores_gemma":[0.0038451839,0.0005446598,0.0009263085,0.0024938092,0.0039894558,0.010822593,0.0040320433,0.0033449188,0.003174431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010236861,0.0000084999565,0.00010215149,0.000029310046,0.0000054211723,0.00008094709,0.00020359547,0.0003429096,0.00022459155,0.9910433,0.0019627793,0.005986222],"study_design_scores_gemma":[0.0000035590253,0.0000037818377,0.000042764976,0.000013386046,0.0000027117035,0.00006602121,0.000060684215,0.0006884671,0.00010531441,0.9941906,0.004817991,0.00000478459],"about_ca_topic_score_codex":0.0014254175,"about_ca_topic_score_gemma":0.0024966495,"teacher_disagreement_score":0.009620336,"about_ca_system_score_codex":0.0013854193,"about_ca_system_score_gemma":0.0007451703,"threshold_uncertainty_score":0.03218323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070917204,0.0018082107,0.4825141,0.002095858,0.0012225471,0.000099382334,0.0013688882,0.0016092707,0.4383646],"genre_scores_gemma":[0.7214406,0.0013906228,0.0980342,0.0013949344,0.00085655245,0.00015598488,0.0022170714,0.0012650999,0.17324483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989272,0.00028450348,0.00007289901,0.00024936727,0.0003328623,0.00013316466],"domain_scores_gemma":[0.99867564,0.00040936962,0.00012633027,0.0003007054,0.0003375757,0.00015028297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009782107,0.0005243191,0.00046950945,0.0018252964,0.0014806293,0.0028374349,0.0008828196,0.0007375899,0.02338054],"category_scores_gemma":[0.0028607068,0.00037941727,0.00072244555,0.0012731896,0.002288746,0.0075759003,0.0033752054,0.0024022597,0.0053636907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027652943,0.000012179595,0.00015035499,0.000035747227,0.000004885603,0.000065345215,0.00018821206,0.00012604476,0.00051352865,0.98233634,0.0036314062,0.012908354],"study_design_scores_gemma":[0.00001522865,0.000014871666,0.00014375572,0.00002852718,0.000009669714,0.00033598542,0.00013628272,0.00086203596,0.0017308949,0.93515015,0.061561108,0.000011512467],"about_ca_topic_score_codex":0.00036946405,"about_ca_topic_score_gemma":0.0005014753,"teacher_disagreement_score":0.02338054,"about_ca_system_score_codex":0.0010304084,"about_ca_system_score_gemma":0.00037413236,"threshold_uncertainty_score":0.07821572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66073614,0.0010593241,0.17699595,0.0033346997,0.00034257866,0.00016266627,0.0029038927,0.0007517682,0.15371294],"genre_scores_gemma":[0.97170657,0.00023433192,0.012341032,0.00032781082,0.00038613472,0.00007657373,0.0021521405,0.00011753556,0.012657804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944717,0.00008928313,0.00003672236,0.00015364343,0.00018086484,0.000092303715],"domain_scores_gemma":[0.9975805,0.0010112607,0.00035002572,0.00027371614,0.00033899667,0.0004454678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005981509,0.00052578875,0.0006424179,0.0015511992,0.0014910145,0.003036644,0.0010767443,0.0008970299,0.011414114],"category_scores_gemma":[0.0029343728,0.0003234146,0.0007612348,0.0011421563,0.0019450458,0.00363388,0.0015797616,0.002285087,0.0012664855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015475762,0.000085663574,0.0017138704,0.000102797465,0.00002591044,0.0002163106,0.00041575762,0.00124993,0.0036909105,0.97814286,0.00523064,0.008970573],"study_design_scores_gemma":[0.000038063885,0.000050537663,0.0018084215,0.00002782132,0.000021995824,0.0005729325,0.00020885003,0.009851914,0.0015360512,0.9764421,0.009421405,0.000019908217],"about_ca_topic_score_codex":0.0009887782,"about_ca_topic_score_gemma":0.0009453303,"teacher_disagreement_score":0.011414114,"about_ca_system_score_codex":0.001162335,"about_ca_system_score_gemma":0.00065541425,"threshold_uncertainty_score":0.038183987},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10271485,0.0039367448,0.26388362,0.010638419,0.0010752694,0.00016362699,0.0023738134,0.0009273284,0.6142864],"genre_scores_gemma":[0.80522966,0.0012061723,0.06478129,0.0014315512,0.0003625866,0.00027194398,0.002181261,0.00024299853,0.12429256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974809,0.0008116812,0.000110421366,0.00057208573,0.0006497026,0.0003751633],"domain_scores_gemma":[0.9959197,0.0017509605,0.00029386824,0.000638591,0.00072402053,0.0006728572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014099684,0.0006045172,0.0006135792,0.002262231,0.0035289829,0.005032619,0.0011534985,0.0017103308,0.030066594],"category_scores_gemma":[0.007105984,0.00083322194,0.0011303755,0.0016528575,0.0038996595,0.0075925863,0.003880873,0.0025515119,0.0038025302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005414184,0.000013997256,0.00024225221,0.000029604002,0.000007471342,0.00016680012,0.00040956296,0.00014007959,0.00025238024,0.98810077,0.0040203505,0.006562557],"study_design_scores_gemma":[0.000040670606,0.000015080363,0.00034181206,0.00004524939,0.000013083877,0.00066811766,0.0005588751,0.0014248529,0.0006137834,0.9473495,0.048908573,0.000020409547],"about_ca_topic_score_codex":0.0011554682,"about_ca_topic_score_gemma":0.0011078971,"teacher_disagreement_score":0.030066594,"about_ca_system_score_codex":0.0022124967,"about_ca_system_score_gemma":0.00080047635,"threshold_uncertainty_score":0.10058272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03598896,0.010052481,0.4916319,0.0027156235,0.0056511676,0.00015274604,0.002503807,0.0014815029,0.44982183],"genre_scores_gemma":[0.46071848,0.010875018,0.27479315,0.0027763855,0.005557018,0.00054716883,0.004261469,0.002895917,0.23757541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973361,0.00059416844,0.0002774825,0.00060063414,0.0008965064,0.000295043],"domain_scores_gemma":[0.9980002,0.00044683088,0.00019381914,0.00053345656,0.0006113532,0.00021432985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020068295,0.0013170564,0.0013434406,0.0036259552,0.0030330212,0.0052394876,0.0015382782,0.00070087746,0.017991643],"category_scores_gemma":[0.005196502,0.00062840024,0.0012073513,0.0034047572,0.0027910967,0.01265051,0.003489622,0.0025840017,0.00861284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003456625,0.000015447149,0.00018162114,0.00015250442,0.00003285513,0.0000984836,0.0001934496,0.00020178464,0.00096566323,0.96526474,0.011155106,0.021703804],"study_design_scores_gemma":[0.0000058724722,0.000017470144,0.0002199694,0.00006111383,0.000025214002,0.00036135066,0.00007004751,0.0015683749,0.0012798927,0.95377713,0.042593524,0.00002002637],"about_ca_topic_score_codex":0.00076132943,"about_ca_topic_score_gemma":0.0018036256,"teacher_disagreement_score":0.017991643,"about_ca_system_score_codex":0.0010611684,"about_ca_system_score_gemma":0.0013678453,"threshold_uncertainty_score":0.060187995},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083441455,0.004018027,0.23481202,0.028819406,0.013535957,0.00007634356,0.0005491544,0.0005570081,0.70928794],"genre_scores_gemma":[0.559431,0.007621873,0.13882124,0.030701054,0.010603671,0.00041703682,0.0006608283,0.0008010372,0.25094226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988451,0.00029975307,0.00006602754,0.00025544202,0.0003885002,0.000145063],"domain_scores_gemma":[0.99727494,0.0012068205,0.0001002462,0.00048574165,0.00068711716,0.00024516362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002472883,0.00065570755,0.0005758349,0.0011156827,0.0030841304,0.0022774716,0.0013667867,0.0019746865,0.03173131],"category_scores_gemma":[0.0056558736,0.0003258276,0.0013314981,0.0009449868,0.0059543056,0.008496483,0.0043602036,0.0055802907,0.0069755875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013121442,0.000008251853,0.00005384431,0.000026686585,0.000004000318,0.00006204195,0.00014484933,0.000035246758,0.00021510404,0.98644155,0.00933326,0.0036620207],"study_design_scores_gemma":[0.000008575362,0.000016211605,0.0001663331,0.000026287795,0.0000085561305,0.00018110404,0.000066876666,0.00024226173,0.0003604883,0.94414186,0.05477203,0.000009481845],"about_ca_topic_score_codex":0.0024482347,"about_ca_topic_score_gemma":0.0016940638,"teacher_disagreement_score":0.03173131,"about_ca_system_score_codex":0.00084385363,"about_ca_system_score_gemma":0.0011761452,"threshold_uncertainty_score":0.10615182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18721582,0.009567963,0.48222756,0.0057777907,0.001468927,0.00013093858,0.0011590304,0.00097612425,0.31147575],"genre_scores_gemma":[0.8640332,0.003951447,0.08023271,0.00199542,0.0008517312,0.00009748171,0.00054711214,0.00033142642,0.047959518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980413,0.0008569182,0.00014382142,0.0002830123,0.00042965327,0.0002453403],"domain_scores_gemma":[0.99802893,0.0007998889,0.00019521288,0.00032037558,0.00038950957,0.00026600703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018526404,0.000690476,0.00072493183,0.00201514,0.002151161,0.0030736788,0.00083925517,0.0011788971,0.006521499],"category_scores_gemma":[0.0041115517,0.0006021977,0.0009046269,0.002282548,0.0046405,0.009180962,0.0043000574,0.00306074,0.0021805533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015061682,0.000007145915,0.00013867317,0.0000292761,0.000007849345,0.000102646976,0.00025453095,0.00034381775,0.00036445397,0.9932734,0.0010618573,0.0044013793],"study_design_scores_gemma":[0.0000055251658,0.0000045399042,0.000054201937,0.000012492045,0.0000034070217,0.000088182045,0.00006739817,0.00054315984,0.00012484439,0.99578047,0.0033097814,0.000006077126],"about_ca_topic_score_codex":0.0012214384,"about_ca_topic_score_gemma":0.0021184585,"teacher_disagreement_score":0.006521499,"about_ca_system_score_codex":0.0014484167,"about_ca_system_score_gemma":0.00068446156,"threshold_uncertainty_score":0.021816552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5403075,0.0027875977,0.13041036,0.0037377456,0.00093515945,0.0001362405,0.001162253,0.00040823536,0.32011494],"genre_scores_gemma":[0.9058977,0.0014894396,0.029431252,0.000718101,0.0007485731,0.00011747481,0.0014024146,0.0002206993,0.059974384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.0002729101,0.000049410824,0.000093995004,0.00019266596,0.00023414633],"domain_scores_gemma":[0.9985122,0.0007004807,0.0002504852,0.00018370086,0.00014587268,0.00020738087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010524617,0.00063607027,0.0006806805,0.001961302,0.0024688141,0.0017802456,0.0005827056,0.0008676258,0.016136762],"category_scores_gemma":[0.0022563557,0.00041171524,0.00090723933,0.0012819854,0.002746918,0.005156413,0.0034714427,0.0015600118,0.0021306167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008411624,0.000020001376,0.000304983,0.0000391655,0.000009374332,0.00013998325,0.00031920394,0.0008273841,0.0008966419,0.98927236,0.0026493743,0.0054373974],"study_design_scores_gemma":[0.000020530531,0.000027910208,0.00035287277,0.000026328811,0.0000099331055,0.00017182842,0.00024971267,0.0018052788,0.00043921755,0.9898031,0.0070800995,0.0000130501],"about_ca_topic_score_codex":0.0007531278,"about_ca_topic_score_gemma":0.0013756406,"teacher_disagreement_score":0.016136762,"about_ca_system_score_codex":0.0012654136,"about_ca_system_score_gemma":0.00054743805,"threshold_uncertainty_score":0.053982854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14457314,0.002025815,0.5885665,0.003454883,0.002033653,0.00016990874,0.0015736793,0.0010230424,0.25657943],"genre_scores_gemma":[0.7582455,0.0010699527,0.12548518,0.0010235015,0.0016797392,0.00014339366,0.0009928636,0.00035865087,0.11100128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988096,0.00024272631,0.0000672049,0.00031378632,0.00033100936,0.00023580604],"domain_scores_gemma":[0.9988128,0.00026282348,0.00014663991,0.0002674894,0.00030935855,0.00020089783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024464,0.00094013516,0.0010081433,0.0023393198,0.0027113135,0.0033199198,0.001334854,0.0009801507,0.024674281],"category_scores_gemma":[0.002693043,0.00043489385,0.0016149938,0.001866496,0.0029745756,0.005963923,0.0017897264,0.0024470345,0.0042703343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021867007,0.000010783718,0.00005891094,0.000022846838,0.0000055393057,0.00006189477,0.00013462863,0.00022360487,0.00041051797,0.99180377,0.0020160947,0.0052294293],"study_design_scores_gemma":[0.0000065294207,0.000009706732,0.000105194755,0.000008813083,0.0000055970236,0.00016773818,0.00005773175,0.0016080008,0.00034830836,0.98937714,0.008287251,0.000018129998],"about_ca_topic_score_codex":0.0013004929,"about_ca_topic_score_gemma":0.0016337282,"teacher_disagreement_score":0.024674281,"about_ca_system_score_codex":0.0011643847,"about_ca_system_score_gemma":0.0007523012,"threshold_uncertainty_score":0.08254367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16436659,0.0010548861,0.5579726,0.0017026267,0.0008512151,0.0002888521,0.001953288,0.0023859204,0.26942402],"genre_scores_gemma":[0.7573026,0.0005112184,0.18613005,0.0005876052,0.00033079754,0.000267462,0.0021594586,0.00069744984,0.052013405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802655,0.000418306,0.00020952965,0.00051554345,0.00046995407,0.00036005833],"domain_scores_gemma":[0.9966652,0.0012837943,0.00026331923,0.0011011626,0.00036592857,0.00032061985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469508,0.00050349586,0.001030784,0.0019641602,0.00311845,0.0046502342,0.0016657003,0.0015153432,0.014083231],"category_scores_gemma":[0.004871544,0.0007833843,0.0017738863,0.0022304317,0.0033483813,0.0082606375,0.0034268592,0.0030046145,0.0031246657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027376755,0.000035653888,0.00032256026,0.000041065094,0.00000832452,0.00014327059,0.0002519143,0.00020789205,0.0010464122,0.98656726,0.002628418,0.008719876],"study_design_scores_gemma":[0.000024221725,0.000020572108,0.0003419571,0.0000357379,0.000027360411,0.00073339517,0.00020123448,0.0030859045,0.0025835177,0.96307385,0.0298486,0.000023776625],"about_ca_topic_score_codex":0.0014555424,"about_ca_topic_score_gemma":0.0018890584,"teacher_disagreement_score":0.014083231,"about_ca_system_score_codex":0.0013659507,"about_ca_system_score_gemma":0.0010926682,"threshold_uncertainty_score":0.04711312},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21804011,0.0059725945,0.43504733,0.00432998,0.0023858524,0.00035226953,0.011208312,0.0008048747,0.32185882],"genre_scores_gemma":[0.7577139,0.0020782384,0.15531413,0.0007854402,0.0009859805,0.00052419695,0.005276351,0.00025986234,0.077061936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989042,0.00033001436,0.00008144253,0.00019514776,0.00031318225,0.00017602612],"domain_scores_gemma":[0.99895954,0.0002580785,0.00017167094,0.00013422432,0.00022333917,0.00025318746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083096226,0.00062508334,0.0007060489,0.0024664502,0.0019013253,0.004060323,0.0010393343,0.00065520254,0.01009293],"category_scores_gemma":[0.0019040657,0.00034381798,0.00091660494,0.0015855989,0.0028001852,0.004915245,0.001938695,0.0018539901,0.0023176232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086489905,0.000025254343,0.0004074189,0.00006187288,0.000018153023,0.00012592213,0.0002810634,0.00075543846,0.0012925126,0.98512876,0.0031897672,0.008627382],"study_design_scores_gemma":[0.00002220027,0.00004493808,0.000894412,0.0000438688,0.00001533781,0.00046670914,0.0003691813,0.003427301,0.00096760754,0.96394426,0.029777342,0.000026930762],"about_ca_topic_score_codex":0.001583403,"about_ca_topic_score_gemma":0.00178471,"teacher_disagreement_score":0.01009293,"about_ca_system_score_codex":0.0012851335,"about_ca_system_score_gemma":0.0012667901,"threshold_uncertainty_score":0.033764243},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12800346,0.037009027,0.40068182,0.004009369,0.002108583,0.00012464105,0.0020616408,0.0010656565,0.42493588],"genre_scores_gemma":[0.73349303,0.011299964,0.1446723,0.0012760859,0.0020549053,0.00019023415,0.0017448055,0.00040625222,0.10486237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984238,0.0004284515,0.00016515188,0.0003200515,0.0005037014,0.00015877928],"domain_scores_gemma":[0.99820745,0.0008020671,0.00022972685,0.0002686942,0.0002653967,0.0002267047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012152791,0.0007545491,0.0009669266,0.0026034305,0.0018689192,0.0053096632,0.00094277086,0.0008508202,0.009239859],"category_scores_gemma":[0.0049779057,0.0006661078,0.00083780935,0.0032402494,0.0049609644,0.010019765,0.0033323572,0.002345875,0.002967879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037601258,0.00001895234,0.00022883997,0.00007614709,0.00001064992,0.000083726416,0.00021840143,0.0003393131,0.00031543974,0.98003346,0.0032764855,0.01536104],"study_design_scores_gemma":[0.000005965452,0.000013794952,0.0001259088,0.00001822327,0.000009268014,0.00031104058,0.00010419746,0.0010538937,0.00039447664,0.9864985,0.011452872,0.00001194758],"about_ca_topic_score_codex":0.0009736773,"about_ca_topic_score_gemma":0.0016092652,"teacher_disagreement_score":0.009239859,"about_ca_system_score_codex":0.0010973681,"about_ca_system_score_gemma":0.00085508224,"threshold_uncertainty_score":0.030910373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4444089,0.0022052063,0.3573786,0.003989027,0.00041946492,0.00029466132,0.004171945,0.0011706826,0.18596151],"genre_scores_gemma":[0.88035715,0.0013672268,0.067595236,0.00094507675,0.0006367768,0.0002660548,0.0033818623,0.00043950987,0.04501113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985274,0.00042674682,0.00006692616,0.00038099932,0.00030621557,0.0002916804],"domain_scores_gemma":[0.9940195,0.0034090583,0.0007080544,0.00090642227,0.0004464491,0.00051055447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010984521,0.0005322202,0.00071375456,0.0025681842,0.002304749,0.0023888894,0.0013705975,0.0011278931,0.012967212],"category_scores_gemma":[0.0052818926,0.00046721354,0.0009407569,0.0021711562,0.002142094,0.0076040085,0.0021258197,0.0013726216,0.0013456995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000160503,0.00008453276,0.0014474773,0.0002023927,0.00006320346,0.00027193336,0.00040194628,0.004745937,0.0029245352,0.962665,0.010445828,0.016586557],"study_design_scores_gemma":[0.000025525425,0.0000142178,0.000987418,0.000029207273,0.000027078391,0.00028590162,0.00016372683,0.013072064,0.0009021144,0.97712266,0.007356712,0.000013410247],"about_ca_topic_score_codex":0.0016712428,"about_ca_topic_score_gemma":0.0033275129,"teacher_disagreement_score":0.012967212,"about_ca_system_score_codex":0.0013478448,"about_ca_system_score_gemma":0.00051177153,"threshold_uncertainty_score":0.043379605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6703297,0.0015118973,0.19060495,0.0016538645,0.0005366402,0.00011570443,0.001506439,0.00070439285,0.13303645],"genre_scores_gemma":[0.9667855,0.00033603655,0.015836215,0.00014498254,0.00023641073,0.000050023264,0.00063858967,0.00010210489,0.015870072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00022942487,0.00007428742,0.00014261258,0.00028719357,0.0002299032],"domain_scores_gemma":[0.9985374,0.00035781422,0.00025979543,0.00014974715,0.00022743242,0.00046773168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076755974,0.0004150892,0.00053919485,0.0018690706,0.0017817434,0.003440614,0.0005492103,0.00056706724,0.0087157665],"category_scores_gemma":[0.001700925,0.0003131617,0.0011179694,0.001035691,0.0030239453,0.003817828,0.0028782685,0.0015428469,0.0015830133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013424446,0.00002874412,0.00052890595,0.00004869571,0.000019856712,0.00022295829,0.0004660795,0.00083574886,0.0018345114,0.98962456,0.0013862986,0.004869328],"study_design_scores_gemma":[0.00004449527,0.00003990398,0.00034675185,0.00002460015,0.00001548458,0.00029800768,0.0004159758,0.005014228,0.002050479,0.9871662,0.004564934,0.000018903997],"about_ca_topic_score_codex":0.001023898,"about_ca_topic_score_gemma":0.0010454147,"teacher_disagreement_score":0.0087157665,"about_ca_system_score_codex":0.0010189484,"about_ca_system_score_gemma":0.000706482,"threshold_uncertainty_score":0.029157162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118478306,0.009496229,0.6035785,0.004386401,0.0011847107,0.00015779925,0.0015413612,0.00090840895,0.26026824],"genre_scores_gemma":[0.8140213,0.0045426646,0.13003035,0.001953147,0.0010303591,0.00011743634,0.0011551064,0.0002914149,0.046858203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983,0.0005965724,0.00012753991,0.00025647815,0.0005232623,0.00019611616],"domain_scores_gemma":[0.9970969,0.0015547429,0.00020344884,0.0003062114,0.00055038475,0.00028832696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020347985,0.00055995904,0.0006638599,0.0025323948,0.0022214518,0.00287769,0.0010331775,0.00118943,0.0076733218],"category_scores_gemma":[0.0067029675,0.000558572,0.0011168747,0.0020114465,0.003547882,0.009068217,0.002841672,0.003064697,0.0024525311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028698358,0.000019788944,0.00033160875,0.00005229942,0.00001348848,0.00022190134,0.00027779574,0.00066456135,0.00047445117,0.9833883,0.002310514,0.012216588],"study_design_scores_gemma":[0.000007085329,0.0000052727255,0.00008226987,0.00001533644,0.000004257411,0.00013506992,0.000049702623,0.0013793296,0.00021795782,0.9940958,0.004001061,0.000006840791],"about_ca_topic_score_codex":0.0015968014,"about_ca_topic_score_gemma":0.0025238167,"teacher_disagreement_score":0.0076733218,"about_ca_system_score_codex":0.0016296345,"about_ca_system_score_gemma":0.0009974279,"threshold_uncertainty_score":0.025669813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12165965,0.0032415409,0.5609413,0.007820299,0.0033758292,0.0005495091,0.015092158,0.0053639077,0.28195578],"genre_scores_gemma":[0.64761305,0.0015097318,0.26777765,0.0028235402,0.00075347594,0.00032674908,0.011131574,0.0014855361,0.06657873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975374,0.0006037466,0.00037150196,0.0005392149,0.00063698576,0.00031115583],"domain_scores_gemma":[0.9933448,0.0027175106,0.000481434,0.0012630875,0.0017032236,0.0004899786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017185541,0.00081446214,0.0008353095,0.0014618183,0.0028287421,0.0035237833,0.0011713181,0.0013085047,0.029531335],"category_scores_gemma":[0.008612168,0.00083930197,0.0022192546,0.0015587355,0.0023641516,0.008523512,0.003618863,0.0043482576,0.008593887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024829965,0.00009084785,0.0011923796,0.00071657385,0.00009773191,0.00035040654,0.00061482016,0.00087168865,0.0034087235,0.90743876,0.028960807,0.056008946],"study_design_scores_gemma":[0.000036366502,0.000049450562,0.00052767474,0.0000983425,0.00006056366,0.0004133174,0.00032232367,0.00119993,0.0036411653,0.93589205,0.057717565,0.000041315918],"about_ca_topic_score_codex":0.0013267284,"about_ca_topic_score_gemma":0.0038402446,"teacher_disagreement_score":0.029531335,"about_ca_system_score_codex":0.0011697855,"about_ca_system_score_gemma":0.0021454336,"threshold_uncertainty_score":0.098792136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3582984,0.0054626833,0.35362896,0.00689313,0.0022317693,0.00022516308,0.002310713,0.001292519,0.2696566],"genre_scores_gemma":[0.89345473,0.0015686307,0.051468898,0.0005567262,0.0011873846,0.00013940179,0.0011042354,0.00022706563,0.05029288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795854,0.0006363644,0.0001429654,0.00026780125,0.00057831674,0.00041594528],"domain_scores_gemma":[0.99754864,0.00076586,0.00045934864,0.0002503005,0.00033220265,0.0006436003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423677,0.0005652851,0.0006721645,0.002769273,0.002218238,0.005421744,0.00097463094,0.0009073352,0.011520854],"category_scores_gemma":[0.003207509,0.0004969027,0.000852377,0.0020461103,0.004032472,0.007487636,0.003499208,0.0028767213,0.0020219542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032073265,0.000016590984,0.00017348386,0.000025451021,0.0000055588093,0.00006329617,0.00013887472,0.00027262876,0.00033682433,0.9950663,0.0010120941,0.0028567433],"study_design_scores_gemma":[0.000018784236,0.000015958278,0.00013056985,0.00002219246,0.000006348891,0.00018909179,0.00016624531,0.0016791368,0.00043105008,0.9899283,0.0073991804,0.000013268175],"about_ca_topic_score_codex":0.0010020173,"about_ca_topic_score_gemma":0.0009706707,"teacher_disagreement_score":0.011520854,"about_ca_system_score_codex":0.0015917093,"about_ca_system_score_gemma":0.0010519685,"threshold_uncertainty_score":0.03854114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39538866,0.003205505,0.37581983,0.0035925687,0.0012627331,0.00015709925,0.0015552354,0.0011889796,0.21782929],"genre_scores_gemma":[0.9241716,0.00079583813,0.032513313,0.00039876756,0.00068837573,0.00010687981,0.00076281093,0.00019039382,0.040372003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980724,0.000564088,0.00012535162,0.00026367718,0.00059428054,0.00038014376],"domain_scores_gemma":[0.99750715,0.000833064,0.0004209754,0.00024850672,0.0003846614,0.0006057047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675269,0.00057526876,0.0005874338,0.0025450953,0.0018789504,0.0051392894,0.0008606705,0.00078589655,0.010750832],"category_scores_gemma":[0.0035929983,0.00055694155,0.0008631751,0.0017044856,0.0036272116,0.006135975,0.0038225562,0.0025267187,0.0018176265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003349224,0.00001596635,0.00019473826,0.000025122186,0.000007791603,0.00006909791,0.00015642736,0.00034013097,0.00048052554,0.9944988,0.0008103979,0.0033674818],"study_design_scores_gemma":[0.000017166123,0.000019633064,0.00018410354,0.000018461365,0.000008212324,0.00022169143,0.00017243132,0.0028356146,0.00089224445,0.9902249,0.005389972,0.000015521171],"about_ca_topic_score_codex":0.0010304762,"about_ca_topic_score_gemma":0.0010169777,"teacher_disagreement_score":0.010750832,"about_ca_system_score_codex":0.0015440711,"about_ca_system_score_gemma":0.0008720227,"threshold_uncertainty_score":0.035965085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0848908,0.0052580885,0.51186574,0.0040513845,0.0013183178,0.00015141827,0.0013056414,0.00093401864,0.3902246],"genre_scores_gemma":[0.7926286,0.0029575273,0.08053623,0.0017036885,0.0008309238,0.00012634414,0.0011597092,0.0005238896,0.11953305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808383,0.00061718246,0.00012699228,0.00024623258,0.0006729927,0.00025286278],"domain_scores_gemma":[0.9975629,0.00081855577,0.00014525639,0.0003669655,0.0008394126,0.00026693818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016902656,0.00047077143,0.00050399185,0.0014902445,0.0022241147,0.0025823568,0.0007953081,0.00093468424,0.013293801],"category_scores_gemma":[0.004546265,0.0005022965,0.0007125196,0.0014580451,0.0023772425,0.0072399364,0.0027149701,0.0025303157,0.004269473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014129239,0.000010573938,0.00012664832,0.000031152777,0.000004948901,0.000074875876,0.0001765218,0.00030014856,0.0004850479,0.99159825,0.0017039924,0.0054737567],"study_design_scores_gemma":[0.0000058049854,0.0000036592737,0.00007143678,0.000016451137,0.000004688945,0.000081143866,0.000065925844,0.0013837449,0.0005665311,0.9900816,0.0077125933,0.000006381978],"about_ca_topic_score_codex":0.0025998892,"about_ca_topic_score_gemma":0.0045063365,"teacher_disagreement_score":0.013293801,"about_ca_system_score_codex":0.0016203668,"about_ca_system_score_gemma":0.0011031701,"threshold_uncertainty_score":0.044472218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31509277,0.0036423118,0.38136357,0.0020755087,0.0009084408,0.00015122518,0.0023111836,0.0015945594,0.29286045],"genre_scores_gemma":[0.9107218,0.00083139463,0.043349355,0.00033358176,0.00051225844,0.000117252544,0.0012159247,0.00026964085,0.04264889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998326,0.00048587788,0.0001101891,0.0002857995,0.0005246876,0.0002673672],"domain_scores_gemma":[0.9969597,0.0013797196,0.0003347851,0.00039087934,0.0004223609,0.0005125199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011713983,0.0005843413,0.0005965462,0.0018541093,0.0016309773,0.0044261315,0.00088769075,0.0005442356,0.009691034],"category_scores_gemma":[0.0036106962,0.0005547675,0.0012046392,0.0010774811,0.002932769,0.005849362,0.002985678,0.0020299677,0.0022548984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007392829,0.000024418287,0.00028192214,0.00005227354,0.000014599678,0.00013033504,0.00026699004,0.0005770087,0.0010898544,0.9893644,0.001392528,0.0067317514],"study_design_scores_gemma":[0.000032716653,0.000025184107,0.0002756289,0.000029060713,0.000017307411,0.00036231044,0.00020398494,0.003679353,0.0029351667,0.98007005,0.012346676,0.000022489277],"about_ca_topic_score_codex":0.0006905539,"about_ca_topic_score_gemma":0.0008055311,"teacher_disagreement_score":0.009691034,"about_ca_system_score_codex":0.0012814624,"about_ca_system_score_gemma":0.0008400373,"threshold_uncertainty_score":0.03241974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14802231,0.0034862752,0.66536266,0.0018796071,0.00086591684,0.00014373256,0.0016691821,0.0009992977,0.17757104],"genre_scores_gemma":[0.79048145,0.0013704723,0.15119755,0.00053311227,0.0009634269,0.00016665274,0.0026953523,0.000538441,0.052053567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643,0.0009892532,0.0002515702,0.0008357653,0.0010509216,0.00044261213],"domain_scores_gemma":[0.99557614,0.0016145566,0.0004659565,0.0006249456,0.0008923907,0.0008260032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022576798,0.0005564436,0.0007572121,0.0025880013,0.0029487074,0.006571773,0.0011011589,0.0008753756,0.011419572],"category_scores_gemma":[0.005637769,0.00074953964,0.0012772091,0.0018832288,0.0038231616,0.0120616695,0.0051015145,0.0030845455,0.0031909554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051442337,0.000016173579,0.00022759916,0.000026322958,0.000009774342,0.000053478765,0.00023089247,0.00029252167,0.0005356061,0.99153847,0.0011427521,0.0058749784],"study_design_scores_gemma":[0.000019890442,0.000023548824,0.00019124156,0.000017105473,0.000011939928,0.00014725373,0.00021025541,0.0025416848,0.0014045603,0.9819389,0.013477235,0.000016376513],"about_ca_topic_score_codex":0.001067012,"about_ca_topic_score_gemma":0.0011365013,"teacher_disagreement_score":0.011419572,"about_ca_system_score_codex":0.0013430351,"about_ca_system_score_gemma":0.0010604176,"threshold_uncertainty_score":0.038202226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86007977,0.0010379326,0.110850036,0.00082275976,0.0001772859,0.000072442126,0.0005498798,0.00016541072,0.026244491],"genre_scores_gemma":[0.9850417,0.00038703438,0.009620299,0.00005154684,0.00008075698,0.000022426302,0.0002583765,0.000028116548,0.004509703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995443,0.00007788363,0.000040909006,0.000089283465,0.00015427668,0.0000932595],"domain_scores_gemma":[0.9980369,0.0007748594,0.00056404324,0.00017734163,0.00020234668,0.00024449348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007131005,0.00044032958,0.00034498062,0.00136966,0.00045761134,0.0012688326,0.0002912312,0.00025325897,0.0058361],"category_scores_gemma":[0.004726507,0.00018082367,0.00040926927,0.00048177023,0.0015511033,0.0017312065,0.00094987836,0.0009694966,0.0007843299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006692352,0.00015620705,0.015305395,0.0004337153,0.000072763534,0.001748011,0.0013218143,0.00432295,0.04033799,0.85399467,0.0036199049,0.07801736],"study_design_scores_gemma":[0.00004987337,0.00026871805,0.012580639,0.000051087114,0.000040543404,0.0025355306,0.00039710055,0.03537732,0.015194205,0.9246273,0.008814801,0.00006284523],"about_ca_topic_score_codex":0.0005824249,"about_ca_topic_score_gemma":0.00082622975,"teacher_disagreement_score":0.0058361,"about_ca_system_score_codex":0.0005188215,"about_ca_system_score_gemma":0.00036956198,"threshold_uncertainty_score":0.01952368},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016139513,0.036292247,0.060038768,0.008274524,0.0012987042,0.000040116636,0.00030743188,0.00023253751,0.8773762],"genre_scores_gemma":[0.67238283,0.023795258,0.03306251,0.0023418504,0.003366863,0.00023020491,0.0006899502,0.00021351186,0.26391697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995315,0.000142249,0.000023025927,0.000074646705,0.00017890852,0.000049823782],"domain_scores_gemma":[0.99948066,0.00024384631,0.000027309268,0.00010034076,0.000100272555,0.000047555546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008037752,0.0006136982,0.0007733834,0.0015561063,0.002348205,0.00509036,0.00090176455,0.0010583119,0.008773343],"category_scores_gemma":[0.0020368109,0.0005792765,0.0005701097,0.002006689,0.0069945757,0.00950568,0.0014220983,0.0038376134,0.0017257984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012994878,0.0000018760801,0.000007854416,0.0000067791807,7.335039e-7,0.0000028877014,0.000097715536,0.00005436257,0.000030751402,0.9967524,0.0015065537,0.0015369002],"study_design_scores_gemma":[0.0000017701824,0.0000014289607,0.000018177701,0.000008379642,9.792523e-7,0.000009750852,0.00002306041,0.0001489458,0.000029003342,0.98285264,0.01690431,0.000001544711],"about_ca_topic_score_codex":0.002779455,"about_ca_topic_score_gemma":0.0019979342,"teacher_disagreement_score":0.008773343,"about_ca_system_score_codex":0.0036322244,"about_ca_system_score_gemma":0.0015230611,"threshold_uncertainty_score":0.029349804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012052034,0.006385529,0.045489103,0.004676529,0.0013483271,0.000060061393,0.0003151375,0.00021322713,0.92946],"genre_scores_gemma":[0.49323782,0.0069131055,0.039146308,0.005149789,0.0021612286,0.00035196586,0.0003647127,0.0002777574,0.45239735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992848,0.00008226902,0.000027154085,0.000249462,0.0002357853,0.00012056386],"domain_scores_gemma":[0.9994018,0.00023655147,0.000028878942,0.00011293276,0.00016149988,0.000058351645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007697406,0.00051082147,0.0005230919,0.0016558731,0.00266548,0.0021105162,0.00072507444,0.0011606186,0.015435823],"category_scores_gemma":[0.002247534,0.0002968484,0.0006142617,0.0011028921,0.0034093861,0.004124797,0.002354843,0.0025474569,0.0037754136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008695017,0.0000040422015,0.00004745967,0.000022450477,0.0000023455723,0.000028797553,0.00013065165,0.000050760726,0.00018635427,0.9851193,0.0063923686,0.008006786],"study_design_scores_gemma":[0.000009979179,0.000013037589,0.0002762698,0.000026363114,0.000007179704,0.00023254043,0.000054606007,0.00046857903,0.0005479341,0.8377216,0.16063175,0.000010058962],"about_ca_topic_score_codex":0.0026748742,"about_ca_topic_score_gemma":0.0022031812,"teacher_disagreement_score":0.015435823,"about_ca_system_score_codex":0.0018235093,"about_ca_system_score_gemma":0.001055201,"threshold_uncertainty_score":0.051637948},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04643385,0.00083846034,0.06175275,0.006063447,0.00079507736,0.0000394795,0.00051455485,0.00018081316,0.88338155],"genre_scores_gemma":[0.88326085,0.0010746463,0.02199413,0.001756989,0.0006402039,0.0001260411,0.0005770678,0.00015725849,0.09041282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879694,0.0004962843,0.00006342015,0.00021671671,0.00026045198,0.00016618417],"domain_scores_gemma":[0.99834335,0.00097174116,0.00008845935,0.0002403263,0.0002431149,0.00011305441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012481082,0.00043955437,0.00062686176,0.0011492984,0.0034045598,0.003842827,0.0012091681,0.0013479706,0.013556639],"category_scores_gemma":[0.0034564198,0.00040536077,0.00069460494,0.0014018913,0.0038708877,0.004174395,0.0021613375,0.003247593,0.0013670895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005097372,0.0000023167122,0.000019864356,0.0000049885316,0.0000014793935,0.000012858839,0.000028556564,0.000061156315,0.000037079382,0.9976447,0.0010624363,0.0011195055],"study_design_scores_gemma":[0.00000475781,0.0000016425155,0.000051629017,0.0000039244615,0.00000224526,0.000026494678,0.000025705127,0.00018789215,0.00006680565,0.995542,0.004084644,0.0000023178072],"about_ca_topic_score_codex":0.0027203306,"about_ca_topic_score_gemma":0.002602699,"teacher_disagreement_score":0.013556639,"about_ca_system_score_codex":0.0018007212,"about_ca_system_score_gemma":0.0009645977,"threshold_uncertainty_score":0.045351446},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01110403,0.015154758,0.34154457,0.008826336,0.0017210109,0.000073301235,0.0007003007,0.0015175932,0.6193582],"genre_scores_gemma":[0.40323558,0.026962282,0.12399228,0.0023443159,0.003602691,0.00022407161,0.0027147585,0.0013123684,0.43561155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998811,0.00034882207,0.00006838883,0.00023825243,0.00038398508,0.00014963072],"domain_scores_gemma":[0.9986916,0.00046485986,0.00007242701,0.00044519932,0.00023192474,0.000093985655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012440118,0.0010563502,0.0007263356,0.002012197,0.0020422165,0.006046135,0.0016859424,0.0018548708,0.0531666],"category_scores_gemma":[0.0033786735,0.0005581617,0.0007960306,0.0050070076,0.0048330044,0.009809525,0.0036139968,0.0025785903,0.013884702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020313983,0.000016258797,0.00010779332,0.00006181778,0.00000386593,0.000029092,0.00010693926,0.0007989165,0.00019720267,0.92782074,0.01347211,0.05736501],"study_design_scores_gemma":[0.000005037996,0.00000624987,0.00010036306,0.000054877226,0.0000049330097,0.00006900156,0.00005162845,0.0020924564,0.00031431238,0.938075,0.059218325,0.000007824924],"about_ca_topic_score_codex":0.0041315914,"about_ca_topic_score_gemma":0.0048502106,"teacher_disagreement_score":0.0531666,"about_ca_system_score_codex":0.002091998,"about_ca_system_score_gemma":0.0019776556,"threshold_uncertainty_score":0.17785996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049348053,0.0021517342,0.22347826,0.0008650324,0.0012022373,0.00009824707,0.0010577464,0.0012147807,0.7205838],"genre_scores_gemma":[0.49663076,0.005080122,0.09166251,0.0009201413,0.000771891,0.00018151259,0.0026981956,0.0011330394,0.40092182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997831,0.00003248954,0.000013787381,0.0000630168,0.00006217771,0.000045382894],"domain_scores_gemma":[0.9996859,0.000103347105,0.000026274172,0.00006420016,0.000070653594,0.000049723953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019267964,0.0005043703,0.000488294,0.0015457615,0.0010612822,0.0015735975,0.0006333454,0.00051848753,0.044736538],"category_scores_gemma":[0.00073844084,0.0003014021,0.0006657147,0.0013829983,0.0010174821,0.0037975193,0.0012007247,0.0013008236,0.009534988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022719609,0.000008745316,0.00006596721,0.00006202207,0.0000061611254,0.00009914266,0.00014105049,0.001000681,0.0010139996,0.96129775,0.0075652627,0.028716581],"study_design_scores_gemma":[0.0000043941427,0.00001708045,0.00013478486,0.000035356763,0.000008538983,0.00017217509,0.00010561925,0.001951244,0.0009530031,0.9439368,0.052671786,0.000009170186],"about_ca_topic_score_codex":0.0008185382,"about_ca_topic_score_gemma":0.0011317191,"teacher_disagreement_score":0.044736538,"about_ca_system_score_codex":0.0004694658,"about_ca_system_score_gemma":0.00030139982,"threshold_uncertainty_score":0.14965862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34673524,0.014393338,0.48668924,0.0046986328,0.00019003474,0.00012624309,0.0003386376,0.000424694,0.14640398],"genre_scores_gemma":[0.93875176,0.001693674,0.053162135,0.000497327,0.00014648492,0.000055828143,0.00012453576,0.000040481307,0.0055278433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970323,0.0008426981,0.00019144118,0.00040236916,0.0012542359,0.00027691107],"domain_scores_gemma":[0.99527454,0.0027653,0.00031924224,0.00078595505,0.00054609997,0.00030880643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035905985,0.00023722011,0.00038481483,0.0018009963,0.0012710728,0.003947992,0.0011977501,0.00087258744,0.002542228],"category_scores_gemma":[0.004676002,0.00028424762,0.0006108805,0.0012131117,0.0034630897,0.0061283577,0.0025039383,0.0011993375,0.0002474817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004327596,0.000017827888,0.00032431167,0.00004905923,0.000009364091,0.00003851816,0.00040081303,0.0005781635,0.0010249702,0.9822994,0.00022530535,0.014989005],"study_design_scores_gemma":[0.00002262381,0.000057897734,0.0013228956,0.00005823886,0.000023073193,0.00017056457,0.00032648162,0.009620119,0.0018826971,0.9756218,0.0108751785,0.000018323486],"about_ca_topic_score_codex":0.0010033605,"about_ca_topic_score_gemma":0.00092544704,"teacher_disagreement_score":0.003947992,"about_ca_system_score_codex":0.0019573513,"about_ca_system_score_gemma":0.0011325291,"threshold_uncertainty_score":0.018989146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018939922,0.042108897,0.055289503,0.004960607,0.0014208717,0.000028658525,0.00024662504,0.0004102078,0.8765948],"genre_scores_gemma":[0.5523407,0.027568838,0.024732474,0.0011715682,0.0033883785,0.00014491135,0.0006744317,0.00024274936,0.38973594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997209,0.00007435247,0.00001685816,0.000038382736,0.00011620754,0.00003337085],"domain_scores_gemma":[0.9997342,0.00010923843,0.000023180104,0.000053198564,0.000057947746,0.000022141889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004667099,0.0006569167,0.00055574236,0.0012751465,0.0011279968,0.0034592755,0.0007345463,0.0011167061,0.011323915],"category_scores_gemma":[0.0010215542,0.00037905795,0.0003427086,0.0018939981,0.0034476537,0.0058438405,0.00090174354,0.0022405311,0.0032154417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002955248,0.00000298733,0.00001412082,0.000017195325,0.0000011759088,0.000011894609,0.00019798636,0.00008142316,0.0001305048,0.9926589,0.0028333827,0.0040474217],"study_design_scores_gemma":[0.0000024949613,0.0000021287035,0.000034733897,0.0000105653035,0.0000016144577,0.000042384887,0.00004729616,0.00016333438,0.000094810566,0.96001947,0.039577845,0.0000032569894],"about_ca_topic_score_codex":0.0012307592,"about_ca_topic_score_gemma":0.0012501148,"teacher_disagreement_score":0.011323915,"about_ca_system_score_codex":0.0018215082,"about_ca_system_score_gemma":0.0008153741,"threshold_uncertainty_score":0.037882328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60933805,0.00056966435,0.35272196,0.0011586399,0.00008559753,0.000051439474,0.0002465445,0.000701715,0.035126437],"genre_scores_gemma":[0.9668695,0.00029261902,0.023206938,0.00018207877,0.00009292157,0.0000985469,0.0002503765,0.00021867653,0.008788346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996743,0.00079958775,0.00022251211,0.0006672372,0.0008531649,0.00071451615],"domain_scores_gemma":[0.98968714,0.006323983,0.0007212885,0.0016711914,0.0009948267,0.00060150813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033836209,0.00086562586,0.0013766238,0.0025047697,0.002425663,0.0066967546,0.0019714048,0.0023207865,0.0039882604],"category_scores_gemma":[0.012154943,0.0010873678,0.0017721023,0.002943715,0.005823379,0.010954751,0.0043199393,0.0033358638,0.0005535239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036376554,0.000013894414,0.00036639755,0.000016555445,0.000007641393,0.0000776293,0.00057628355,0.0007963968,0.0010620091,0.9937656,0.00015864841,0.0031225858],"study_design_scores_gemma":[0.00002278552,0.00001586253,0.00021933894,0.000010848672,0.000023538243,0.00016448782,0.00013553516,0.0043558488,0.0015050849,0.9923099,0.0012220398,0.000014600878],"about_ca_topic_score_codex":0.0014410135,"about_ca_topic_score_gemma":0.0009903946,"teacher_disagreement_score":0.0066967546,"about_ca_system_score_codex":0.002392763,"about_ca_system_score_gemma":0.0010529913,"threshold_uncertainty_score":0.017894506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42408708,0.0015376672,0.4574195,0.0014023174,0.00030627268,0.000112319365,0.00046189904,0.00047446735,0.114198506],"genre_scores_gemma":[0.9505157,0.00048495407,0.03439256,0.00027483757,0.00016507838,0.00008870634,0.0002675457,0.000071871524,0.013738695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862945,0.00028669235,0.000091424634,0.0003494082,0.00041237738,0.00023073051],"domain_scores_gemma":[0.9988495,0.00032207355,0.00017495795,0.00015829607,0.00023371339,0.00026150554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419665,0.0006058932,0.00071703794,0.0015902383,0.0014336326,0.0031920413,0.00069081696,0.00062892336,0.0085402075],"category_scores_gemma":[0.0022143142,0.00035599578,0.00087785086,0.000947461,0.0033372098,0.0069329436,0.00460439,0.0022395349,0.0006705623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012750376,0.000011515073,0.00015028237,0.000024225053,0.000005967923,0.00006739091,0.00023887801,0.00022923018,0.0010417105,0.9959335,0.00015917016,0.002125454],"study_design_scores_gemma":[0.000012812831,0.000060343053,0.00040606965,0.00002316107,0.000016312253,0.00026704068,0.0004256395,0.0037138255,0.0031494203,0.9853652,0.006545231,0.000014899135],"about_ca_topic_score_codex":0.00064117776,"about_ca_topic_score_gemma":0.00061848876,"teacher_disagreement_score":0.0085402075,"about_ca_system_score_codex":0.0010242196,"about_ca_system_score_gemma":0.00049942126,"threshold_uncertainty_score":0.028569877},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040611595,0.0004824508,0.04746159,0.0020371599,0.0013568967,0.00018375006,0.002346167,0.003404712,0.9021156],"genre_scores_gemma":[0.68361866,0.00044880173,0.019409152,0.0006355072,0.00060073665,0.00018114805,0.0041647325,0.0048535718,0.28608772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781895,0.00065169536,0.00011022412,0.000525525,0.00050006027,0.00039345332],"domain_scores_gemma":[0.997701,0.00045556802,0.00015540107,0.0007744213,0.00073938374,0.0001742163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000882281,0.0011323182,0.0008748765,0.003484464,0.0059682275,0.006710255,0.0015964007,0.001220411,0.11185934],"category_scores_gemma":[0.005453357,0.0006723951,0.00071998296,0.0040743477,0.002844792,0.0072600967,0.003750192,0.0033488823,0.02911698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017902213,0.000022935863,0.00045386187,0.00010734225,0.000016875336,0.00024253914,0.002164098,0.0001841203,0.0010652195,0.93678385,0.033271957,0.02550819],"study_design_scores_gemma":[0.00005346504,0.000041986772,0.0007885462,0.000120080294,0.00003922625,0.00060515205,0.003309049,0.0019472626,0.0043625287,0.22780658,0.7608728,0.0000532787],"about_ca_topic_score_codex":0.00349509,"about_ca_topic_score_gemma":0.003888536,"teacher_disagreement_score":0.11185934,"about_ca_system_score_codex":0.0023527045,"about_ca_system_score_gemma":0.0011742327,"threshold_uncertainty_score":0.37420678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526056,0.0047373557,0.23762341,0.0035726156,0.0008168028,0.00013259276,0.0004044192,0.0005762138,0.1995309],"genre_scores_gemma":[0.95978516,0.0011163156,0.019781535,0.0002458735,0.00053465465,0.00009441572,0.00018124146,0.00007794629,0.018182836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984491,0.00041612753,0.00011051464,0.00032139226,0.0004089336,0.00029386513],"domain_scores_gemma":[0.9970893,0.0012528079,0.00031572708,0.00028780336,0.0005094457,0.0005449724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017860349,0.0005483117,0.00060869957,0.0022725977,0.0021949073,0.0044099754,0.0007047437,0.000862475,0.0042706956],"category_scores_gemma":[0.0042560054,0.00058255094,0.0010357719,0.001464352,0.007179781,0.008725911,0.0038913703,0.0034084842,0.00078425225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034984358,0.000019858559,0.00013327376,0.000023868935,0.0000032731314,0.000045019147,0.00036718423,0.00013231409,0.00096669793,0.9955907,0.00028181303,0.002401147],"study_design_scores_gemma":[0.000015815303,0.000024271823,0.00023930108,0.000008656548,0.0000054697,0.00008312176,0.00017179479,0.0008226905,0.0008721526,0.99531,0.0024354358,0.0000112161415],"about_ca_topic_score_codex":0.0011324481,"about_ca_topic_score_gemma":0.0006116425,"teacher_disagreement_score":0.0044099754,"about_ca_system_score_codex":0.001475756,"about_ca_system_score_gemma":0.0008277699,"threshold_uncertainty_score":0.014286935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92905,0.00045261846,0.046650898,0.00029067896,0.000044523145,0.000029152665,0.00022799929,0.00010088184,0.0231533],"genre_scores_gemma":[0.9888877,0.00012140416,0.007175241,0.000037705428,0.000040711202,0.000022692997,0.00019364136,0.0000087603685,0.0035120817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999413,0.00009476085,0.000061385945,0.000106291205,0.00017713368,0.0001474887],"domain_scores_gemma":[0.99879646,0.00023616663,0.0003083553,0.00013945198,0.00026678495,0.00025269916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059367897,0.00029638634,0.00036725332,0.0015737646,0.0009571148,0.0019281097,0.00065423694,0.0004241374,0.0044208057],"category_scores_gemma":[0.0014149137,0.000222571,0.0005196889,0.001086997,0.0019417059,0.0032637895,0.0017642615,0.00079485646,0.0005313577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011765036,0.000044023353,0.005215162,0.00006927695,0.000025452144,0.00025831404,0.00066140195,0.0012126633,0.008470781,0.9685255,0.00073602895,0.014663715],"study_design_scores_gemma":[0.00003153002,0.0001603323,0.005630934,0.000060870425,0.000052417818,0.001224251,0.00095053104,0.013496674,0.012996923,0.9572384,0.0081050545,0.00005212858],"about_ca_topic_score_codex":0.00035508315,"about_ca_topic_score_gemma":0.00035612038,"teacher_disagreement_score":0.0044208057,"about_ca_system_score_codex":0.0008995167,"about_ca_system_score_gemma":0.00055986375,"threshold_uncertainty_score":0.014789104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70811266,0.0013413966,0.24344431,0.0013385328,0.00023463502,0.00012017609,0.0007860879,0.0019003109,0.0427218],"genre_scores_gemma":[0.9300854,0.0003273672,0.057665914,0.00037127064,0.00012673029,0.00012741293,0.000793784,0.00027246983,0.010229553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992836,0.00009314505,0.00006157451,0.00015977431,0.0002656603,0.0001362333],"domain_scores_gemma":[0.9975454,0.0009593294,0.00030842432,0.00033843983,0.0006701853,0.00017814874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065364764,0.0006117183,0.0005648973,0.0014316351,0.0014802587,0.0012614887,0.00094864663,0.00074956607,0.0041608387],"category_scores_gemma":[0.004325739,0.00036511093,0.00097324746,0.00072583253,0.0017413947,0.0020170722,0.00087361614,0.0016187177,0.0004976711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008652282,0.00023415146,0.013214055,0.00051922875,0.0001340197,0.011199473,0.0017078809,0.006508942,0.07499212,0.7901872,0.0074503007,0.092987396],"study_design_scores_gemma":[0.00033878238,0.00030733543,0.00798887,0.00013185773,0.00024723844,0.009740528,0.00071108335,0.05558259,0.048230022,0.8281752,0.048323426,0.00022306797],"about_ca_topic_score_codex":0.0013346112,"about_ca_topic_score_gemma":0.001162251,"teacher_disagreement_score":0.0041608387,"about_ca_system_score_codex":0.001156359,"about_ca_system_score_gemma":0.00061961624,"threshold_uncertainty_score":0.013919413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49412942,0.0040823347,0.41770723,0.006866171,0.00025330271,0.00021040249,0.00086691225,0.0013026453,0.07458155],"genre_scores_gemma":[0.9336241,0.00091445557,0.055912375,0.0005367375,0.00021112259,0.00024273101,0.00034158785,0.00012527748,0.008091462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973116,0.0006343951,0.0002793201,0.00063978456,0.0007250203,0.00040997827],"domain_scores_gemma":[0.99550325,0.0027149073,0.0005178211,0.00050448795,0.00049687986,0.00026273573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003220036,0.00043998507,0.0008846873,0.0016349504,0.002562706,0.003051468,0.0010778105,0.0008239104,0.0034873777],"category_scores_gemma":[0.006295922,0.0006463049,0.0016981168,0.0012255779,0.009768791,0.012344399,0.0035751807,0.002688006,0.0006025827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071466784,0.000021404609,0.00040188877,0.00007817372,0.000008883872,0.00013043555,0.00091960846,0.0011532686,0.0014147153,0.988696,0.0006077313,0.0064964076],"study_design_scores_gemma":[0.000051913205,0.00003774919,0.00038174485,0.00003255301,0.000014825644,0.00021988807,0.0002670267,0.0030302303,0.0018380686,0.9830619,0.011033682,0.00003045209],"about_ca_topic_score_codex":0.0022016556,"about_ca_topic_score_gemma":0.0012360765,"teacher_disagreement_score":0.0034873777,"about_ca_system_score_codex":0.0030274608,"about_ca_system_score_gemma":0.0016011106,"threshold_uncertainty_score":0.021965802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12407642,0.0008773437,0.7431279,0.0016186836,0.0005631229,0.00017130506,0.0006362176,0.0019645102,0.12696454],"genre_scores_gemma":[0.7354096,0.00040016574,0.21253026,0.0004496722,0.00023226747,0.00014301071,0.000745869,0.0004944008,0.049594697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983694,0.00049038546,0.00013137967,0.0002529923,0.0005498876,0.00020601816],"domain_scores_gemma":[0.9983872,0.0004954079,0.00012160587,0.00032546834,0.0002965238,0.00037385157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211614,0.0004913578,0.00050294684,0.0012904106,0.0017278501,0.0030261786,0.00092875207,0.00057167193,0.008720754],"category_scores_gemma":[0.002272802,0.0007333058,0.001156235,0.000721972,0.0037970718,0.0052177,0.004430426,0.0022704008,0.0020108626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000607818,0.000033436347,0.00020332061,0.000063445,0.000009356039,0.00010449224,0.00040133286,0.0003159415,0.0032283557,0.9874653,0.0015795736,0.0065346374],"study_design_scores_gemma":[0.00004311542,0.000058085185,0.0002707811,0.000027361617,0.000022097758,0.0004886855,0.0005203258,0.0049987994,0.0069264416,0.9691328,0.017484546,0.000026991313],"about_ca_topic_score_codex":0.00055784045,"about_ca_topic_score_gemma":0.001087949,"teacher_disagreement_score":0.008720754,"about_ca_system_score_codex":0.0011157909,"about_ca_system_score_gemma":0.000745761,"threshold_uncertainty_score":0.029173851},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31630906,0.0036341,0.3099725,0.0052386075,0.00216324,0.00017686808,0.002787632,0.0010415547,0.3586765],"genre_scores_gemma":[0.8814087,0.0012517184,0.04237725,0.0007895118,0.0009275684,0.000103365994,0.0010807434,0.00026270768,0.071798414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988856,0.0003235858,0.000067676454,0.00017398622,0.00031408598,0.00023516346],"domain_scores_gemma":[0.99820673,0.00054834806,0.00030018523,0.0002564691,0.0003017858,0.00038645286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115517,0.0004872309,0.00055095414,0.0023953072,0.0020153315,0.0031786195,0.0008493978,0.00077376975,0.01670284],"category_scores_gemma":[0.0028508746,0.00040647,0.0007160437,0.0014436838,0.002446514,0.0046554855,0.0030588722,0.0020583635,0.002642736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025704081,0.00000940422,0.00012919445,0.000019442392,0.000004032799,0.000044731212,0.000082560495,0.00026536096,0.00032263348,0.99435717,0.0015523633,0.0031875337],"study_design_scores_gemma":[0.000008926162,0.0000074187024,0.00012602734,0.000011907538,0.0000049549694,0.00011179169,0.000080553415,0.0018444065,0.0004068775,0.99131936,0.0060683717,0.000009351459],"about_ca_topic_score_codex":0.0013910249,"about_ca_topic_score_gemma":0.0017203817,"teacher_disagreement_score":0.01670284,"about_ca_system_score_codex":0.0015021346,"about_ca_system_score_gemma":0.0006539318,"threshold_uncertainty_score":0.055876553},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113488145,0.009920066,0.19686882,0.01180679,0.0038379133,0.000105026666,0.0010696622,0.0005109479,0.66239256],"genre_scores_gemma":[0.79544824,0.011796076,0.10948233,0.0046816394,0.0028787155,0.00015397753,0.0012904116,0.00031978454,0.07394881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999549,0.000110676585,0.00003332717,0.00010424903,0.00014879179,0.00005392053],"domain_scores_gemma":[0.9988714,0.0005305478,0.00008249435,0.00020087608,0.00012524912,0.0001893331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665283,0.0006405636,0.00057152647,0.0013282025,0.0014397195,0.001845395,0.0013649293,0.001046787,0.013119111],"category_scores_gemma":[0.0024326132,0.0003864716,0.0007219032,0.0018142625,0.0023023142,0.0054463116,0.0032111013,0.0034911362,0.0020856606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051963365,0.00003979043,0.00035528568,0.00013075129,0.000013244068,0.000299305,0.00017868243,0.0017084699,0.0013572806,0.96081567,0.011868268,0.023181304],"study_design_scores_gemma":[0.0000059487934,0.000016411086,0.00023597204,0.000031344098,0.000006565151,0.0002564894,0.00005908805,0.002615209,0.0002613881,0.98040384,0.016100261,0.000007531356],"about_ca_topic_score_codex":0.0012339031,"about_ca_topic_score_gemma":0.0021636167,"teacher_disagreement_score":0.013119111,"about_ca_system_score_codex":0.00090345327,"about_ca_system_score_gemma":0.00047027227,"threshold_uncertainty_score":0.043887794},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12750147,0.0018834763,0.28074303,0.0044179102,0.0010121993,0.00013504925,0.0019238343,0.0009540557,0.5814289],"genre_scores_gemma":[0.8978465,0.0008107832,0.03330846,0.0013854722,0.0008279003,0.00015085132,0.0012174356,0.00041943605,0.06403303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997979,0.00058198516,0.00014488275,0.0003617269,0.00060360396,0.00032879435],"domain_scores_gemma":[0.99726844,0.0009577021,0.00030785534,0.0005840447,0.00047577097,0.00040622067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014821205,0.0005922904,0.00067482045,0.0020757536,0.002879836,0.005863548,0.0012188728,0.0011998266,0.020346634],"category_scores_gemma":[0.004650912,0.0005092133,0.001167743,0.0016473683,0.0038465813,0.0086887665,0.0036333927,0.0031728516,0.0051301136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007288069,0.000010385121,0.00008107791,0.000014434589,0.0000022923434,0.00003179572,0.00009308492,0.00012305634,0.00015122409,0.99591655,0.0017024087,0.0018664504],"study_design_scores_gemma":[0.000004924375,0.0000030945355,0.00008067561,0.000009526515,0.000003611439,0.000082413404,0.00004688534,0.0011623548,0.0002121216,0.9936273,0.004759856,0.000007236188],"about_ca_topic_score_codex":0.0010029142,"about_ca_topic_score_gemma":0.0012470708,"teacher_disagreement_score":0.020346634,"about_ca_system_score_codex":0.002002548,"about_ca_system_score_gemma":0.00078345515,"threshold_uncertainty_score":0.0680663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04604111,0.0039664186,0.044412144,0.002335005,0.0006214808,0.000021136162,0.00017134118,0.00025128902,0.90218],"genre_scores_gemma":[0.7667728,0.00293927,0.014455613,0.0007514878,0.000999641,0.000062443374,0.0002721558,0.0003804645,0.21336615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960834,0.00010299601,0.000022876227,0.00007056804,0.00012093644,0.00007424278],"domain_scores_gemma":[0.9994282,0.00019753887,0.000064816566,0.000113634196,0.00011480769,0.000080943246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051629764,0.0005133447,0.00043725502,0.0012223556,0.0018342581,0.0025841554,0.0005284436,0.00047755375,0.014399007],"category_scores_gemma":[0.0010569466,0.00025314672,0.00031850472,0.0012820648,0.004555307,0.004997374,0.0013650033,0.00292187,0.0024550639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043173036,0.0000032947842,0.000010731732,0.000008018402,6.547079e-7,0.000008249149,0.00008482543,0.00003953969,0.000095004325,0.9964425,0.0009304637,0.0023724088],"study_design_scores_gemma":[0.000003209674,0.0000035318742,0.000037539947,0.000007635151,0.000001504631,0.000035692818,0.000046415986,0.00012371589,0.00014903898,0.9844669,0.015121056,0.0000037176776],"about_ca_topic_score_codex":0.0008035429,"about_ca_topic_score_gemma":0.0012886095,"teacher_disagreement_score":0.014399007,"about_ca_system_score_codex":0.0012081031,"about_ca_system_score_gemma":0.0006802061,"threshold_uncertainty_score":0.048169553},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026761957,0.0018961673,0.003300305,0.93691236,0.0038976758,0.000011957517,0.00006131928,0.00003893671,0.051205132],"genre_scores_gemma":[0.21289435,0.003015719,0.0028243628,0.721397,0.027962351,0.00013943239,0.0000763604,0.00010475572,0.03158575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99560887,0.0017099138,0.00023106909,0.0005652451,0.0013535642,0.000531339],"domain_scores_gemma":[0.97949123,0.015661355,0.0007150944,0.0014872766,0.0018368077,0.0008081811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007937626,0.0003820675,0.0010045609,0.0011713633,0.0041584508,0.0057951673,0.0021417688,0.026700001,0.007189107],"category_scores_gemma":[0.025431078,0.00039583017,0.0005209883,0.000701279,0.026017876,0.010111036,0.0038747557,0.038325407,0.0030779247],"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.000045133256,0.000012663965,0.00033197663,0.0000226406,0.000011284594,0.00043854234,0.00039114206,0.000088852525,0.00009262527,0.8444638,0.1446453,0.0094560115],"study_design_scores_gemma":[0.0000319321,0.000009236331,0.00026624414,0.00007765397,0.000007273987,0.00031438193,0.00022876507,0.0003694647,0.00020041695,0.8692605,0.12921247,0.000021716902],"about_ca_topic_score_codex":0.002730759,"about_ca_topic_score_gemma":0.0036835684,"teacher_disagreement_score":0.026700001,"about_ca_system_score_codex":0.0043035196,"about_ca_system_score_gemma":0.0023007297,"threshold_uncertainty_score":0.041978657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22411618,0.0006462094,0.7172332,0.00092760974,0.00014114384,0.00015713315,0.00047618698,0.00082574866,0.05547664],"genre_scores_gemma":[0.89445806,0.00016136534,0.09748193,0.00017688845,0.00013138392,0.00014193286,0.000531802,0.00009737828,0.006819222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984334,0.00028168884,0.000116960226,0.00034220854,0.00060631393,0.00021934185],"domain_scores_gemma":[0.9967945,0.0016307478,0.00016555913,0.00045364804,0.0007117001,0.00024393381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019583819,0.00025423127,0.0008601681,0.0010755633,0.0012544906,0.003569064,0.00097545166,0.0006263541,0.0059112287],"category_scores_gemma":[0.0048103645,0.000341291,0.0010607728,0.0008339226,0.0036598342,0.0044372776,0.0024257887,0.0019266878,0.0010543083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006890164,0.00003289652,0.00051323057,0.00004243854,0.00000935211,0.00006984399,0.00033123101,0.0011226921,0.0021879144,0.9861107,0.00053254433,0.008978181],"study_design_scores_gemma":[0.000046043806,0.000057789664,0.000371419,0.000026043173,0.000011832584,0.0001250133,0.00021450732,0.015354115,0.0061178734,0.97007924,0.0075772186,0.000018859811],"about_ca_topic_score_codex":0.000952405,"about_ca_topic_score_gemma":0.00079242466,"teacher_disagreement_score":0.0059112287,"about_ca_system_score_codex":0.0010838334,"about_ca_system_score_gemma":0.0007725054,"threshold_uncertainty_score":0.019775033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6247944,0.0020167578,0.3073226,0.0005068516,0.00030734556,0.00005738402,0.00027822697,0.00030163905,0.06441483],"genre_scores_gemma":[0.9707499,0.0004337143,0.020982148,0.000088648114,0.00020093504,0.00003507082,0.00022098575,0.000039503073,0.0072492175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991302,0.00017674088,0.00006599502,0.00018308609,0.00026022075,0.00018375025],"domain_scores_gemma":[0.9981699,0.00051495555,0.00038077848,0.00016775029,0.00043109478,0.0003354793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011650643,0.0005866295,0.00067137927,0.0015852939,0.0016403119,0.0020579475,0.0009997755,0.00064790715,0.004204218],"category_scores_gemma":[0.0027213038,0.00030888148,0.0010238411,0.0013020105,0.0027128623,0.004384507,0.0014548461,0.0014410965,0.00079858385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058585192,0.000031359497,0.000809804,0.00011147603,0.000027038115,0.00037017095,0.00029526706,0.0009233421,0.0037211252,0.98764104,0.00034113388,0.0056697223],"study_design_scores_gemma":[0.000024209765,0.000114084716,0.00064865546,0.000054556454,0.000046282392,0.0009327832,0.00033064582,0.005596793,0.005559597,0.9820155,0.0046367883,0.00004012652],"about_ca_topic_score_codex":0.00052866427,"about_ca_topic_score_gemma":0.0004671283,"teacher_disagreement_score":0.004204218,"about_ca_system_score_codex":0.0009756553,"about_ca_system_score_gemma":0.00072260114,"threshold_uncertainty_score":0.014064491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30624175,0.0023690504,0.1362411,0.005242455,0.0011184072,0.00023945907,0.00056200457,0.00067669124,0.5473091],"genre_scores_gemma":[0.9013366,0.0010121504,0.01665213,0.000563904,0.0013669448,0.00019489857,0.0007957233,0.00029763582,0.077779986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989157,0.00024305648,0.00005426277,0.00023359159,0.0003068045,0.0002466927],"domain_scores_gemma":[0.9987469,0.00063700374,0.000081141174,0.00018945959,0.00013938389,0.00020603082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008598845,0.000889865,0.0013534899,0.0012961025,0.0036150082,0.0045021675,0.0009871724,0.0012502522,0.010545403],"category_scores_gemma":[0.002907552,0.00056707894,0.0011153712,0.0016886644,0.0054552425,0.005755655,0.0036855289,0.0034777415,0.0016790295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002806429,0.000010624853,0.00010869478,0.0000112596335,0.0000026679857,0.000055992434,0.00027818567,0.00007872537,0.00042707764,0.995708,0.00084984844,0.0024407725],"study_design_scores_gemma":[0.000028620017,0.000009799504,0.000129037,0.0000074905465,0.0000039325414,0.00009754158,0.00013231616,0.0004810455,0.0003243721,0.9927799,0.006001694,0.0000043052514],"about_ca_topic_score_codex":0.0013942682,"about_ca_topic_score_gemma":0.0007234655,"teacher_disagreement_score":0.010545403,"about_ca_system_score_codex":0.0014875598,"about_ca_system_score_gemma":0.0009808134,"threshold_uncertainty_score":0.035277903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034934573,0.04329206,0.1120863,0.0065310923,0.0025282917,0.000045220833,0.00029959963,0.0003825705,0.79990035],"genre_scores_gemma":[0.6153778,0.02592689,0.035525892,0.0017107449,0.003980248,0.00015272254,0.0006602709,0.00018242969,0.31648302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977785,0.00003977125,0.000014165777,0.000049678143,0.000085396285,0.0000330565],"domain_scores_gemma":[0.9998185,0.0000704842,0.000023876502,0.000033077085,0.00003180385,0.00002224928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032385363,0.00048228464,0.0005079004,0.00087284605,0.0014626203,0.0026120115,0.0005894618,0.00078941527,0.009577258],"category_scores_gemma":[0.0008122389,0.00029058277,0.0004967168,0.0016980012,0.0037746064,0.004976916,0.0007891418,0.001890574,0.0016216949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046029113,0.000004042512,0.00002496687,0.00001947298,0.0000014737317,0.000009693552,0.00008921525,0.0002216162,0.000102344144,0.98844457,0.0044155894,0.0066624237],"study_design_scores_gemma":[0.0000016776562,0.0000032180033,0.0000261944,0.000008995013,0.0000013078165,0.00002183539,0.000047884158,0.00022599976,0.00007669217,0.97924155,0.020342486,0.0000020516804],"about_ca_topic_score_codex":0.0012049886,"about_ca_topic_score_gemma":0.0014070664,"teacher_disagreement_score":0.009577258,"about_ca_system_score_codex":0.0012338813,"about_ca_system_score_gemma":0.0006039655,"threshold_uncertainty_score":0.032039046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79695886,0.00020100917,0.1919712,0.0017039225,0.00008094309,0.0002760512,0.00071895716,0.0007328912,0.007356099],"genre_scores_gemma":[0.9493758,0.00012181009,0.047644123,0.00015104312,0.00007297548,0.000078519246,0.0009726585,0.00007962571,0.0015033644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949986,0.0014092523,0.00043464344,0.0012091554,0.000951931,0.0009964689],"domain_scores_gemma":[0.96914816,0.02524499,0.0015520747,0.0017108208,0.0012130894,0.0011309215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005007753,0.0005271992,0.0014113561,0.0010946029,0.002083061,0.0060883565,0.0019493131,0.0023106798,0.0067405477],"category_scores_gemma":[0.02111426,0.0007729288,0.0024557854,0.0009816001,0.0046255253,0.012344375,0.0028641596,0.003269456,0.00060901465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025660072,0.00060756976,0.011334115,0.0005668984,0.00021672813,0.0012556602,0.001223075,0.10273509,0.019859036,0.8173898,0.0034186488,0.03882748],"study_design_scores_gemma":[0.0002248327,0.00021837717,0.00087010977,0.000045187324,0.00006732206,0.00024341553,0.0006278646,0.1692129,0.018877862,0.8076683,0.0018668665,0.00007696687],"about_ca_topic_score_codex":0.002209399,"about_ca_topic_score_gemma":0.002406003,"teacher_disagreement_score":0.0067405477,"about_ca_system_score_codex":0.0023437666,"about_ca_system_score_gemma":0.0023234356,"threshold_uncertainty_score":0.026483893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048585358,0.010855633,0.011340901,0.0016521716,0.002143048,0.000033298857,0.00018725563,0.00038770124,0.97291416],"genre_scores_gemma":[0.008954277,0.00747579,0.006583777,0.0010712502,0.0022606764,0.00006007507,0.0002394861,0.0002221554,0.97313243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996382,0.000065510736,0.000015098409,0.00006573904,0.00018252924,0.00003288757],"domain_scores_gemma":[0.99970895,0.00009163962,0.000012072728,0.00006878391,0.00007184026,0.000046717174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037557085,0.0010785908,0.0011387933,0.0024019936,0.0018065958,0.003326297,0.0010278005,0.0011318572,0.14092854],"category_scores_gemma":[0.0010866481,0.00041701258,0.0007277511,0.0033823987,0.001482882,0.0040662084,0.0015361359,0.0022550614,0.06387583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011113318,0.000044262866,0.00007240141,0.00024908799,0.000008776263,0.000056242505,0.00024241456,0.00031381252,0.0004311985,0.4628025,0.38753283,0.14823538],"study_design_scores_gemma":[0.0000031591633,0.000006466832,0.000103384686,0.0000585811,0.000003598023,0.00008640165,0.000044008564,0.0002780432,0.00012972813,0.14512783,0.8541534,0.0000055253167],"about_ca_topic_score_codex":0.0013111583,"about_ca_topic_score_gemma":0.0040592332,"teacher_disagreement_score":0.14092854,"about_ca_system_score_codex":0.001407593,"about_ca_system_score_gemma":0.00089359586,"threshold_uncertainty_score":0.47145295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131374,0.0009465348,0.32781887,0.0039571323,0.00019178614,0.00017706119,0.00088295346,0.0011231186,0.051765114],"genre_scores_gemma":[0.97260845,0.00014207797,0.023842193,0.0002688553,0.00005081003,0.000059258942,0.00031545042,0.000064793996,0.0026481168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679935,0.00110079,0.00014329836,0.0005876019,0.0010079305,0.00036108197],"domain_scores_gemma":[0.98675376,0.009653803,0.0007130572,0.00093430403,0.0013733079,0.0005717606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040304502,0.00040244433,0.00077195396,0.0019910727,0.0025962538,0.004295423,0.0017158819,0.0013313326,0.0044784797],"category_scores_gemma":[0.013296215,0.0006664009,0.0015145773,0.0016602405,0.005828729,0.0078062876,0.0028078745,0.002897588,0.0002970174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000752337,0.00003398576,0.0009523519,0.000050503786,0.000021734317,0.000206086,0.00035975952,0.00510404,0.00091381196,0.9882988,0.0004723541,0.0035114698],"study_design_scores_gemma":[0.000026110609,0.000015299885,0.00023445241,0.000017939346,0.000017119362,0.000067175206,0.00012744902,0.038519904,0.0017804726,0.9577061,0.0014708278,0.000017215714],"about_ca_topic_score_codex":0.005957521,"about_ca_topic_score_gemma":0.0063498844,"teacher_disagreement_score":0.005957521,"about_ca_system_score_codex":0.003971,"about_ca_system_score_gemma":0.001863337,"threshold_uncertainty_score":0.028811753},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13005306,0.0029772613,0.2231387,0.012728993,0.0024887137,0.00017734291,0.0020378132,0.0016003081,0.62479776],"genre_scores_gemma":[0.81908923,0.0014888211,0.07883355,0.001966009,0.0012320997,0.0002895878,0.0017308304,0.00075588346,0.09461403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962748,0.0011023281,0.00025225093,0.0007901188,0.0009691472,0.0006113501],"domain_scores_gemma":[0.99545527,0.0018648175,0.00035292955,0.00074716186,0.0009070968,0.0006727328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020898995,0.0012016578,0.0022109172,0.0038786947,0.00711117,0.008693691,0.001406805,0.0020974572,0.019532124],"category_scores_gemma":[0.006517048,0.0011071005,0.0020378064,0.0035602907,0.008454951,0.013884296,0.0076947697,0.0065514105,0.0037444779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019474117,0.0000069572657,0.000031997315,0.000014795953,0.0000034003374,0.00002563731,0.00007993371,0.00007971286,0.00009592529,0.9967541,0.0011042556,0.0017836997],"study_design_scores_gemma":[0.000008803287,0.0000032798685,0.000020991069,0.000006533879,0.0000043414457,0.000096414165,0.000068225694,0.00027936543,0.00018086625,0.9954151,0.0039086877,0.000007355162],"about_ca_topic_score_codex":0.0015181046,"about_ca_topic_score_gemma":0.0012120492,"teacher_disagreement_score":0.019532124,"about_ca_system_score_codex":0.0029529766,"about_ca_system_score_gemma":0.002555222,"threshold_uncertainty_score":0.06534141},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776759,0.0034764349,0.57443464,0.0016541489,0.00039456124,0.0002374508,0.0025631178,0.0014373716,0.13812634],"genre_scores_gemma":[0.89155394,0.0007251942,0.07933464,0.0003726549,0.0002323559,0.00021528504,0.0011449682,0.00018377411,0.026237193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827933,0.00028388196,0.00011038862,0.00043717417,0.00058262906,0.00030660172],"domain_scores_gemma":[0.99805415,0.0006789977,0.00019888578,0.0004116531,0.0003554304,0.00030091434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323626,0.00045954325,0.00060241896,0.0014214023,0.0022417542,0.003596968,0.0010378486,0.00057345507,0.008613776],"category_scores_gemma":[0.0025578775,0.0005128583,0.00095863285,0.0010238439,0.0035215907,0.0060347375,0.0028049776,0.001609298,0.00087261654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040768216,0.000010943501,0.0002581193,0.000038715694,0.000008293884,0.000048368318,0.00017887076,0.0006433482,0.0010542189,0.99094427,0.00057392614,0.0062002055],"study_design_scores_gemma":[0.000023442508,0.00004185257,0.00040000933,0.000030241798,0.000015302137,0.00023244898,0.00024094647,0.004539877,0.0025745882,0.957352,0.034525387,0.00002382712],"about_ca_topic_score_codex":0.0019170573,"about_ca_topic_score_gemma":0.0016176698,"teacher_disagreement_score":0.008613776,"about_ca_system_score_codex":0.0019822689,"about_ca_system_score_gemma":0.0010904678,"threshold_uncertainty_score":0.028815925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40511334,0.0075172805,0.36024562,0.010390878,0.0014725483,0.00022028807,0.0052477475,0.0009869379,0.20880546],"genre_scores_gemma":[0.8684137,0.0042914543,0.08423251,0.0012544943,0.0036895873,0.0003231037,0.0050312146,0.00037462244,0.03238934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996262,0.0007849954,0.00033974144,0.0009604843,0.001077798,0.00057490397],"domain_scores_gemma":[0.98525316,0.009407283,0.0009956018,0.001019943,0.0013818964,0.0019420906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004770056,0.0016909658,0.0030651297,0.0052919886,0.0064910054,0.009777752,0.0031617682,0.0019245506,0.012193886],"category_scores_gemma":[0.011564089,0.0019009355,0.003975361,0.005888313,0.008349396,0.016800283,0.0052656303,0.0085795615,0.0012697653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012254484,0.00008670881,0.00047146564,0.000085131025,0.000029942967,0.00010218324,0.0003210921,0.0007577287,0.0007858049,0.9923768,0.0012788703,0.0035816815],"study_design_scores_gemma":[0.000027349253,0.00002691292,0.00024816208,0.000018779147,0.000017141088,0.00007799872,0.00008789199,0.0020600315,0.0004141063,0.99496436,0.002038319,0.000018945992],"about_ca_topic_score_codex":0.0019049012,"about_ca_topic_score_gemma":0.001947074,"teacher_disagreement_score":0.012193886,"about_ca_system_score_codex":0.0036971325,"about_ca_system_score_gemma":0.001996117,"threshold_uncertainty_score":0.040792644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45457238,0.0015012278,0.36015862,0.0019207655,0.000621359,0.00024956022,0.00042396702,0.00036597808,0.18018611],"genre_scores_gemma":[0.9664708,0.0004004496,0.025109908,0.0001935569,0.0003044363,0.00006851552,0.00017948008,0.00004006801,0.007232782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854916,0.00037875876,0.0001197185,0.00024239541,0.0004677733,0.00024209787],"domain_scores_gemma":[0.9982331,0.0005161258,0.00016663565,0.000253942,0.00044696158,0.00038329253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017185688,0.0002553536,0.00047111575,0.0009658681,0.0014123814,0.0018930789,0.00054821844,0.00043329535,0.0047764736],"category_scores_gemma":[0.0029060484,0.00024429243,0.0007028215,0.00077717786,0.0032419516,0.0038877581,0.0022655388,0.0015152696,0.00043043852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019280587,0.000023340972,0.00020170813,0.000021231515,0.0000042676616,0.00011453778,0.00020129787,0.00031963552,0.0014505344,0.9948978,0.00022654899,0.0025197426],"study_design_scores_gemma":[0.00002659281,0.000025779895,0.00027029274,0.000012990121,0.0000070801534,0.00012879405,0.0001547369,0.002766596,0.0014168819,0.9908133,0.0043665436,0.000010535806],"about_ca_topic_score_codex":0.0010217514,"about_ca_topic_score_gemma":0.00089644507,"teacher_disagreement_score":0.0047764736,"about_ca_system_score_codex":0.0009027799,"about_ca_system_score_gemma":0.0010139492,"threshold_uncertainty_score":0.015978932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22694916,0.009594726,0.49684644,0.0060676956,0.0010031449,0.00012847332,0.0008431036,0.0008448511,0.25772247],"genre_scores_gemma":[0.94547224,0.0015959559,0.035918053,0.00070579007,0.00054015656,0.00016905893,0.00046799774,0.00013195789,0.014998783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970291,0.00047607635,0.00020630704,0.00085475657,0.0009594613,0.00047418254],"domain_scores_gemma":[0.997166,0.001343676,0.00019654441,0.000619561,0.00045272082,0.00022162557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031671652,0.0005597117,0.0010176396,0.0019796933,0.0030541369,0.004197298,0.0012615769,0.0012129927,0.005382221],"category_scores_gemma":[0.005967712,0.00041541594,0.0014510135,0.0017872723,0.007835204,0.013290061,0.003941225,0.0026778332,0.00083316164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010735157,0.0000039568818,0.00013662365,0.000011290601,0.0000030946576,0.00003770302,0.00011084303,0.000114481045,0.00016059741,0.99689937,0.00045478847,0.002056642],"study_design_scores_gemma":[0.000009705524,0.0000100965,0.00018360406,0.000008459231,0.000006089616,0.00011057213,0.000054227727,0.0007961186,0.00042283052,0.992463,0.005925981,0.000009245985],"about_ca_topic_score_codex":0.0016516912,"about_ca_topic_score_gemma":0.0007481873,"teacher_disagreement_score":0.005382221,"about_ca_system_score_codex":0.0018541251,"about_ca_system_score_gemma":0.00093305105,"threshold_uncertainty_score":0.018005311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54658073,0.001112007,0.18689945,0.0017546105,0.00031058365,0.00016846742,0.000488998,0.0007729933,0.2619122],"genre_scores_gemma":[0.9447388,0.00050930795,0.025709864,0.00031079436,0.0002156163,0.00013240516,0.00025983225,0.0001719261,0.027951462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905103,0.00022045676,0.00006246906,0.00013454254,0.0003380719,0.00019333242],"domain_scores_gemma":[0.9990471,0.00030322745,0.000103989805,0.00014387893,0.00015295224,0.00024888894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093855715,0.0004908321,0.0005428197,0.0024309612,0.0026305965,0.0034581462,0.0010920579,0.0005831345,0.012647175],"category_scores_gemma":[0.0019302424,0.00048651808,0.00068845286,0.0019655807,0.004332553,0.0056258515,0.0030269558,0.0013821167,0.001447202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014420335,0.000014187619,0.00019400158,0.000018668366,0.0000031240459,0.00009100956,0.00021001273,0.00027868425,0.0005853568,0.99478227,0.00054410956,0.0032642342],"study_design_scores_gemma":[0.0000164549,0.000016011194,0.00034530842,0.000015703665,0.000007145225,0.00016733797,0.0002749216,0.0019749166,0.00088305835,0.98634934,0.009931093,0.000018746854],"about_ca_topic_score_codex":0.0018206935,"about_ca_topic_score_gemma":0.0029704606,"teacher_disagreement_score":0.012647175,"about_ca_system_score_codex":0.0014719148,"about_ca_system_score_gemma":0.00065938896,"threshold_uncertainty_score":0.042309046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788077,0.00006477826,0.010031566,0.0001492859,0.0000115201265,0.000015416075,0.00016969259,0.000034224962,0.0107157575],"genre_scores_gemma":[0.9929837,0.000069433896,0.0040191524,0.000017370812,0.000014412092,0.000022618979,0.00022761854,0.000014544174,0.0026312384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928075,0.00014586722,0.00005042065,0.00013165067,0.00023459313,0.00015678098],"domain_scores_gemma":[0.99867165,0.00053595484,0.00021559683,0.00020342726,0.00017048707,0.00020291148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064794766,0.00023903986,0.00041361075,0.001335708,0.0010671157,0.0025823382,0.0005580205,0.00050595833,0.0050618206],"category_scores_gemma":[0.0027501541,0.0002584688,0.00040168126,0.0006305198,0.001728421,0.0018425875,0.001203744,0.0010710332,0.00048379146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005444332,0.00009727026,0.007057765,0.000093948714,0.000021961674,0.0002873685,0.0005473799,0.018469967,0.011041497,0.9451625,0.0009941226,0.015681842],"study_design_scores_gemma":[0.00007603744,0.00013979118,0.005629176,0.000033666,0.000027978906,0.0006320879,0.0007611692,0.042794954,0.012744919,0.93344104,0.0036636782,0.000055600154],"about_ca_topic_score_codex":0.00038494144,"about_ca_topic_score_gemma":0.00035586752,"teacher_disagreement_score":0.0050618206,"about_ca_system_score_codex":0.000791561,"about_ca_system_score_gemma":0.00039705163,"threshold_uncertainty_score":0.0169335},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009519144,0.00015607143,0.9827002,0.00034110926,0.000058599166,0.0000642764,0.0000752757,0.0021362628,0.0049488954],"genre_scores_gemma":[0.17996301,0.00032733768,0.8139829,0.00020037564,0.000054903245,0.00019943368,0.00035776326,0.00065074133,0.0042635375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958418,0.0010625421,0.00027749434,0.0007394036,0.0015980259,0.00048071487],"domain_scores_gemma":[0.9941174,0.0032780194,0.00028640992,0.0015573278,0.0006414113,0.000119440454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003716043,0.00095861737,0.00088768866,0.0016944984,0.0014719989,0.0037443032,0.0029093164,0.0014879701,0.006806339],"category_scores_gemma":[0.013268081,0.0006595181,0.0013210375,0.0021027916,0.0030608445,0.0069998833,0.004043766,0.0034740765,0.0015131213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016711003,0.00013962327,0.00092693866,0.00017970041,0.0000429509,0.000069681366,0.00040125728,0.051724408,0.0028126284,0.84658515,0.0029323315,0.09401835],"study_design_scores_gemma":[0.00012487588,0.00008452917,0.00032349696,0.00007881292,0.000048276077,0.00018162646,0.00018841091,0.40925047,0.014633851,0.5395436,0.035482693,0.00005930792],"about_ca_topic_score_codex":0.004837727,"about_ca_topic_score_gemma":0.004304774,"teacher_disagreement_score":0.006806339,"about_ca_system_score_codex":0.0036699837,"about_ca_system_score_gemma":0.0025820348,"threshold_uncertainty_score":0.02662766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087362856,0.0028170967,0.65439343,0.010125569,0.0007716114,0.000063201536,0.0004645411,0.00070253806,0.24329913],"genre_scores_gemma":[0.8213842,0.0014591231,0.15709266,0.0017857145,0.00095612905,0.00010714236,0.000356054,0.00022749824,0.01663157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831486,0.00054924795,0.000101945516,0.00040639163,0.00045256453,0.00017493936],"domain_scores_gemma":[0.99815637,0.0007092924,0.00018096367,0.00047837305,0.0003495009,0.00012548921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017797296,0.00044691694,0.0005475719,0.0019678504,0.0019950524,0.00408281,0.0012825552,0.0014168816,0.004792478],"category_scores_gemma":[0.0023638806,0.00047514425,0.0009843746,0.00160345,0.011746444,0.012205586,0.002827977,0.0039606616,0.0006893793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002512698,0.0000013629342,0.00003262923,0.0000062220547,9.761319e-7,0.000012178416,0.00015857488,0.000094668074,0.00013521758,0.9987174,0.00013041962,0.00070802745],"study_design_scores_gemma":[0.0000070303454,0.000012622043,0.00013354176,0.000015636404,0.000006940207,0.00010551247,0.0001709942,0.0013822615,0.00041694197,0.96774966,0.029988382,0.000010454504],"about_ca_topic_score_codex":0.0022781976,"about_ca_topic_score_gemma":0.00232718,"teacher_disagreement_score":0.004792478,"about_ca_system_score_codex":0.0022445559,"about_ca_system_score_gemma":0.0013353957,"threshold_uncertainty_score":0.016285539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081514135,0.00044980913,0.8876227,0.0003773083,0.00018946044,0.000141013,0.00023334612,0.0006309475,0.028841289],"genre_scores_gemma":[0.60502666,0.00064242946,0.3775363,0.00033981082,0.00024314848,0.00027656578,0.00038742472,0.00037053463,0.015177119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991429,0.00016423367,0.00009259366,0.0001870911,0.00028604837,0.00012711453],"domain_scores_gemma":[0.99882656,0.00052331167,0.00009359538,0.00015256829,0.00033924537,0.000064673535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016813572,0.00044900307,0.00051059533,0.0009186806,0.0010444446,0.002111186,0.0009885366,0.000853331,0.004451075],"category_scores_gemma":[0.003191879,0.0004923095,0.0012662713,0.0005573202,0.0022174108,0.0038092248,0.0020692744,0.0022811932,0.0013690144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026744263,0.000023623348,0.0003397894,0.00010649965,0.000008920797,0.0001799587,0.0005228945,0.00046198312,0.00534455,0.9781472,0.00056327326,0.014274583],"study_design_scores_gemma":[0.00006894207,0.00019548653,0.0010005559,0.00013458174,0.00008114425,0.000698469,0.0003589425,0.019238694,0.0376946,0.8948115,0.045613058,0.00010403996],"about_ca_topic_score_codex":0.00095264864,"about_ca_topic_score_gemma":0.0012713325,"teacher_disagreement_score":0.004451075,"about_ca_system_score_codex":0.001047935,"about_ca_system_score_gemma":0.0008446468,"threshold_uncertainty_score":0.014890313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75741416,0.0006310258,0.090592556,0.002144885,0.00047861025,0.00016080518,0.00043897238,0.00030640754,0.14783247],"genre_scores_gemma":[0.9467491,0.0002011379,0.026890358,0.00023595443,0.0000684793,0.00006838023,0.00041910764,0.000048685913,0.02531869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986884,0.00012428567,0.000038739465,0.00026448586,0.00045858586,0.00042558447],"domain_scores_gemma":[0.9988997,0.00022093835,0.00010209117,0.00015395369,0.00032900606,0.00029433693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007932369,0.0004817884,0.0004141712,0.001223827,0.0014338598,0.0021404314,0.0008717182,0.0009456659,0.006082741],"category_scores_gemma":[0.0024277568,0.00036552746,0.0004959019,0.0004945019,0.0025260334,0.0030230684,0.0022054068,0.0015094113,0.00080504274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053059874,0.00019666484,0.0080091925,0.00013447058,0.000037574362,0.0013706904,0.0020636623,0.0007132038,0.03057546,0.91677463,0.0038322723,0.035761558],"study_design_scores_gemma":[0.00012802986,0.00015575801,0.009693203,0.00009340371,0.000064836604,0.002416881,0.0039548,0.005673091,0.048872095,0.8686977,0.06017754,0.00007261604],"about_ca_topic_score_codex":0.0016517964,"about_ca_topic_score_gemma":0.0013597173,"teacher_disagreement_score":0.006082741,"about_ca_system_score_codex":0.0019540165,"about_ca_system_score_gemma":0.0008566317,"threshold_uncertainty_score":0.020348787},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043658487,0.00490915,0.09019747,0.012267988,0.0045002727,0.000043862452,0.0014866113,0.00040526758,0.84253085],"genre_scores_gemma":[0.7251991,0.007259477,0.041442886,0.0043283626,0.003902249,0.0001602048,0.0019081236,0.00024835023,0.2155512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963486,0.0001042383,0.000025435205,0.000062187995,0.00012775052,0.000045571705],"domain_scores_gemma":[0.9991436,0.00033054646,0.00008939811,0.000092830865,0.00024265307,0.000100889454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076160626,0.00040446184,0.00030930023,0.0013770465,0.0012138428,0.002293709,0.00053510536,0.00051565067,0.026813127],"category_scores_gemma":[0.0020244073,0.00024506485,0.00051161693,0.0014727062,0.0019874838,0.003675438,0.0016116044,0.0024329696,0.0030565902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011859303,0.0000058342225,0.00009049351,0.00003059717,0.0000038943517,0.000037326685,0.00008218268,0.00015106486,0.00021675973,0.98899347,0.006956762,0.0034197408],"study_design_scores_gemma":[0.000007842898,0.000014567221,0.00031374302,0.00002531733,0.0000052923965,0.00012413469,0.00013046426,0.00052577554,0.00028181088,0.96347815,0.03508601,0.0000068350373],"about_ca_topic_score_codex":0.0013011291,"about_ca_topic_score_gemma":0.0013062223,"teacher_disagreement_score":0.026813127,"about_ca_system_score_codex":0.0010347206,"about_ca_system_score_gemma":0.00067477225,"threshold_uncertainty_score":0.08969879},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08290145,0.002247148,0.40053007,0.0021352833,0.00354413,0.00015982203,0.00052248826,0.0011008427,0.5068588],"genre_scores_gemma":[0.64327735,0.0016602707,0.14532636,0.0023448754,0.0011879017,0.00026056293,0.0006642974,0.0014244126,0.20385394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984187,0.00038765793,0.00011347256,0.00039247223,0.0004224614,0.00026532813],"domain_scores_gemma":[0.9987936,0.00026345762,0.00012752961,0.00039156587,0.0002774937,0.0001462455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014005483,0.00086562254,0.00061133766,0.0015461544,0.0026146711,0.0037327346,0.0009008195,0.0012436446,0.019034073],"category_scores_gemma":[0.004384108,0.0006492015,0.0011772946,0.0009140261,0.004551006,0.007790172,0.00372688,0.0032782946,0.007709033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051051244,0.000019744048,0.00015133228,0.000036507583,0.0000074327413,0.00013195648,0.00021901917,0.000107906795,0.0015167536,0.98469585,0.0024452272,0.01061737],"study_design_scores_gemma":[0.000011953499,0.000016027217,0.00011558377,0.00002954206,0.000013258096,0.00041261053,0.00012214134,0.0009591781,0.0046102325,0.96220213,0.031489074,0.000018278644],"about_ca_topic_score_codex":0.00052494224,"about_ca_topic_score_gemma":0.00081975554,"teacher_disagreement_score":0.019034073,"about_ca_system_score_codex":0.0008670007,"about_ca_system_score_gemma":0.0008872337,"threshold_uncertainty_score":0.063675284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.406416,0.001851761,0.35054538,0.007478811,0.0015499629,0.00026355073,0.0012162859,0.00081690477,0.22986135],"genre_scores_gemma":[0.9325412,0.000430154,0.038178876,0.0011217563,0.0007057802,0.00015404884,0.0006412742,0.00029834738,0.025928468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984047,0.00033636147,0.00016850783,0.00032576657,0.00044286865,0.0003217564],"domain_scores_gemma":[0.9968887,0.001409243,0.00016515181,0.00051222794,0.0006238967,0.00040079054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002893623,0.0006463594,0.0013555263,0.0026023758,0.002549001,0.0039387285,0.0018416143,0.0023370662,0.016984785],"category_scores_gemma":[0.0070182797,0.0007182183,0.0019547336,0.0014065914,0.0053368583,0.014947001,0.0052656233,0.0058065546,0.0018104394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027813287,0.000014011271,0.00012349943,0.000020810221,0.0000036869274,0.000034724297,0.00018873143,0.00012395465,0.0005517832,0.9971367,0.0004283168,0.0013459316],"study_design_scores_gemma":[0.000023918803,0.000016407876,0.00019317654,0.00001331033,0.000008370481,0.00004237767,0.00013435961,0.0009553158,0.0005699557,0.9956291,0.002400442,0.000013332487],"about_ca_topic_score_codex":0.0010842775,"about_ca_topic_score_gemma":0.0015732065,"teacher_disagreement_score":0.016984785,"about_ca_system_score_codex":0.0022120103,"about_ca_system_score_gemma":0.0010775441,"threshold_uncertainty_score":0.056819797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7098611,0.0021537696,0.21449724,0.0019574587,0.00018082405,0.00008428931,0.0005441107,0.00045407686,0.07026721],"genre_scores_gemma":[0.980956,0.00039704962,0.011576361,0.00016287349,0.00016324873,0.00006907622,0.0002384556,0.00007384333,0.0063630897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967937,0.00069695094,0.00024442867,0.00073521055,0.0007781525,0.0007514744],"domain_scores_gemma":[0.99521846,0.0028980558,0.00039501084,0.00050712127,0.00048793099,0.0004933112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029871855,0.00056287483,0.0015296027,0.0030880237,0.0043687345,0.0049445643,0.0016416962,0.001366341,0.0038745832],"category_scores_gemma":[0.0070829815,0.0011687058,0.0022202379,0.0021612595,0.007330544,0.009829986,0.0051988517,0.0051256474,0.00037399275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034934157,0.00001551695,0.00033859862,0.000021258282,0.000010258738,0.000084406725,0.0003935073,0.00043580102,0.00039011094,0.99622333,0.00012566135,0.0019265263],"study_design_scores_gemma":[0.00001433132,0.000008923299,0.00029551488,0.000008475945,0.0000139874055,0.0000843316,0.00009031676,0.0013077089,0.00041246068,0.99686134,0.0008865066,0.00001604086],"about_ca_topic_score_codex":0.0013074869,"about_ca_topic_score_gemma":0.001450798,"teacher_disagreement_score":0.0049445643,"about_ca_system_score_codex":0.002367162,"about_ca_system_score_gemma":0.0012025251,"threshold_uncertainty_score":0.017175078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72804177,0.00042994152,0.21958506,0.00048675493,0.00007526163,0.00005869823,0.00015804345,0.0003309395,0.05083359],"genre_scores_gemma":[0.98398906,0.00012890881,0.0071147485,0.000056116492,0.00007201083,0.00003172554,0.0000796594,0.000024340408,0.008503476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942136,0.00012480737,0.000036722184,0.00013187478,0.00018128927,0.00010393387],"domain_scores_gemma":[0.999159,0.00023779893,0.00013723153,0.00011577806,0.00015377412,0.0001965048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929139,0.00033877156,0.0003840705,0.0007190247,0.0010142559,0.0012190726,0.00057543354,0.00033756948,0.0047216755],"category_scores_gemma":[0.0014180163,0.00020197532,0.0007278902,0.0002895482,0.0015593761,0.002676821,0.0019581087,0.0009978799,0.0004847063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080142905,0.000023233451,0.0005469863,0.000049850543,0.000016852138,0.0002831777,0.00041408924,0.001519394,0.015570171,0.9777444,0.00018692216,0.0035646528],"study_design_scores_gemma":[0.000026890968,0.00016948045,0.0010898771,0.000015180581,0.000025843065,0.0005381108,0.000401855,0.017078439,0.008849305,0.96677375,0.0050033443,0.00002786813],"about_ca_topic_score_codex":0.0006818934,"about_ca_topic_score_gemma":0.0006414277,"teacher_disagreement_score":0.0047216755,"about_ca_system_score_codex":0.00049524626,"about_ca_system_score_gemma":0.00042829989,"threshold_uncertainty_score":0.015795588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2547892,0.003988323,0.5801897,0.0029431924,0.00041737693,0.00021114349,0.0006716003,0.00041016573,0.15637931],"genre_scores_gemma":[0.8868483,0.0010730223,0.08875851,0.00054143963,0.00027524817,0.00025904315,0.00032301267,0.00009942747,0.021822039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990061,0.0002835354,0.00007100794,0.00017272966,0.0003263158,0.00014042581],"domain_scores_gemma":[0.9987826,0.00034795795,0.00024995967,0.00014548075,0.00024335412,0.0002306616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014425267,0.0006073618,0.0004225683,0.0022599653,0.0018612638,0.0046759243,0.0009891283,0.00095283205,0.0072270897],"category_scores_gemma":[0.0031197607,0.00043619968,0.0007529789,0.0015539393,0.002848682,0.0067926273,0.0023477494,0.001769,0.00067579065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008844281,0.000003957947,0.00006516401,0.000010659494,0.000003963749,0.000028703473,0.000063101084,0.00017137479,0.00037779208,0.9980002,0.00015896639,0.0011073962],"study_design_scores_gemma":[0.000011686458,0.000016498883,0.000115639785,0.0000206191,0.0000110623,0.000098371886,0.00016276873,0.005904746,0.0011156296,0.9873875,0.0051443544,0.000011100408],"about_ca_topic_score_codex":0.001040312,"about_ca_topic_score_gemma":0.0009780793,"teacher_disagreement_score":0.0072270897,"about_ca_system_score_codex":0.0013839186,"about_ca_system_score_gemma":0.0007106514,"threshold_uncertainty_score":0.024177015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14680041,0.00042928042,0.7799865,0.00073990197,0.0002282518,0.000067500005,0.00042583796,0.00068226666,0.070640035],"genre_scores_gemma":[0.83880156,0.00035029146,0.11794732,0.0002744274,0.00020916658,0.00014324748,0.0007863591,0.00029418553,0.041193414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928385,0.00016348281,0.00005139429,0.00016692006,0.00016630326,0.00016811522],"domain_scores_gemma":[0.99933344,0.00016523851,0.000077335535,0.000120201425,0.00014070417,0.00016312243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090608426,0.00068698416,0.0007535855,0.0011616406,0.0017422371,0.0021420687,0.0010339894,0.00067403243,0.010520725],"category_scores_gemma":[0.0015840317,0.00051804265,0.001685351,0.0011836287,0.0019077692,0.00531345,0.002372017,0.0021964784,0.0015305023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021641434,0.000010407407,0.00007433928,0.000014098434,0.0000072603184,0.00004573808,0.00013158022,0.00042913368,0.0011595282,0.9954131,0.0004838288,0.002209329],"study_design_scores_gemma":[0.000019206787,0.000022067381,0.00011627957,0.0000092615965,0.000019067573,0.000113912145,0.000120597004,0.004837959,0.0017599778,0.9883062,0.004662479,0.000012965213],"about_ca_topic_score_codex":0.0010691925,"about_ca_topic_score_gemma":0.0010385218,"teacher_disagreement_score":0.010520725,"about_ca_system_score_codex":0.0010091239,"about_ca_system_score_gemma":0.00059033756,"threshold_uncertainty_score":0.03519535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048368745,0.00041580532,0.94196826,0.0005489745,0.00011579976,0.00015501927,0.00029542542,0.0014364236,0.006695527],"genre_scores_gemma":[0.4334149,0.00028089964,0.5579534,0.00055730104,0.000085993284,0.00017947222,0.000599376,0.00016035185,0.006768274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981602,0.00041281423,0.00013375925,0.00054622407,0.0005835365,0.00016350046],"domain_scores_gemma":[0.998273,0.000892738,0.0001289788,0.0002343715,0.0003791035,0.000091696165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019765557,0.0005454903,0.0008244841,0.0013356527,0.001310373,0.0021062745,0.0013544126,0.0011276787,0.0030771422],"category_scores_gemma":[0.0038922005,0.000572078,0.0019915341,0.0008726918,0.0020176962,0.0024529265,0.002652874,0.002845313,0.0008163463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010197198,0.00007126521,0.00066262926,0.00017393575,0.00010680488,0.00034330477,0.00074920536,0.026723176,0.008017685,0.90671295,0.0017937553,0.054543294],"study_design_scores_gemma":[0.000043679254,0.000042668686,0.0003235974,0.000037058086,0.000060990576,0.00013579051,0.00006805924,0.11628033,0.006411065,0.8713251,0.0052275783,0.00004415946],"about_ca_topic_score_codex":0.0021547794,"about_ca_topic_score_gemma":0.003932145,"teacher_disagreement_score":0.0030771422,"about_ca_system_score_codex":0.002392737,"about_ca_system_score_gemma":0.0016259747,"threshold_uncertainty_score":0.017360628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27522025,0.00082213676,0.45758048,0.0018143753,0.00038926315,0.00036012288,0.002945918,0.001259787,0.2596077],"genre_scores_gemma":[0.87950474,0.0005435936,0.06459853,0.00046803307,0.00041195846,0.00038891865,0.003385101,0.0001986263,0.050500486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986802,0.00024184576,0.00008979762,0.00035828474,0.00037335546,0.00025660516],"domain_scores_gemma":[0.9983203,0.0005874043,0.00021224783,0.00024401193,0.00029410337,0.0003419915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085767184,0.00070568663,0.00043587395,0.00159362,0.002117053,0.002293338,0.00080075214,0.00055903196,0.01817836],"category_scores_gemma":[0.0016546493,0.00051354145,0.0008731917,0.0010168396,0.0028378426,0.0052635632,0.0028014036,0.0020220128,0.001975698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029204435,0.00003187099,0.0004638425,0.000028994027,0.000007638256,0.00013447563,0.00029850632,0.0006170548,0.0013149331,0.98881245,0.001350543,0.0069104554],"study_design_scores_gemma":[0.000019308787,0.000032863092,0.000499077,0.000015488393,0.000013177337,0.000342405,0.00028829213,0.003931011,0.0021408042,0.97319454,0.019501336,0.00002177965],"about_ca_topic_score_codex":0.0009250569,"about_ca_topic_score_gemma":0.0011793509,"teacher_disagreement_score":0.01817836,"about_ca_system_score_codex":0.0009989252,"about_ca_system_score_gemma":0.0007073925,"threshold_uncertainty_score":0.06081271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41533354,0.0034284052,0.38539025,0.0036969387,0.00035240257,0.00015494914,0.001180747,0.00047544567,0.1899873],"genre_scores_gemma":[0.91688657,0.0018305734,0.06387404,0.0002767474,0.00028749692,0.00014211581,0.00057300704,0.00008009177,0.016049359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987344,0.00028775932,0.00009641552,0.0003035758,0.00038766366,0.00019019278],"domain_scores_gemma":[0.99866533,0.0005323157,0.00026679062,0.00012644468,0.00022625714,0.00018286167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000138,0.0003711959,0.0004150209,0.0012163,0.0017099328,0.0030764944,0.00053274597,0.0005333353,0.005208244],"category_scores_gemma":[0.0032988144,0.0003391904,0.000753811,0.0014258628,0.005060774,0.006095678,0.00211002,0.0019620948,0.0007453919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001102011,0.000003788358,0.00008419076,0.000009758511,0.0000013524564,0.00002724867,0.00014795283,0.00048233097,0.00033738586,0.9965688,0.00019252258,0.0021335962],"study_design_scores_gemma":[0.000013307182,0.000014597724,0.0001233195,0.0000089788955,0.0000019883341,0.00005743609,0.00018466622,0.0023247437,0.000636578,0.9910137,0.005611479,0.000009230318],"about_ca_topic_score_codex":0.0024903775,"about_ca_topic_score_gemma":0.0014792975,"teacher_disagreement_score":0.005208244,"about_ca_system_score_codex":0.0019643276,"about_ca_system_score_gemma":0.00089377305,"threshold_uncertainty_score":0.017423332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8027659,0.00030113076,0.13079786,0.001724707,0.00008013399,0.00005884552,0.0004910966,0.00046327853,0.063317195],"genre_scores_gemma":[0.9892308,0.000056199555,0.00850737,0.00012098271,0.000037667825,0.00002118581,0.0001504239,0.000046367226,0.0018290919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998838,0.00023320974,0.00010149156,0.00026732197,0.00028102577,0.0002790564],"domain_scores_gemma":[0.9950053,0.0027087403,0.00046861183,0.00065405644,0.0007381902,0.00042508912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013689857,0.00025151606,0.00049404864,0.0013153671,0.0017025232,0.0042477283,0.0009464573,0.0008023068,0.005077541],"category_scores_gemma":[0.0039031545,0.00043104106,0.0008129749,0.0008171884,0.004804018,0.009226755,0.0014651826,0.0017301645,0.00028080228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100897865,0.0000585528,0.005099654,0.000056281006,0.000018048564,0.0002717045,0.0012488929,0.0005630777,0.004375249,0.9789082,0.0007140951,0.008585309],"study_design_scores_gemma":[0.000026456783,0.000041930733,0.0061592325,0.000035533958,0.000033017852,0.0004550794,0.0011928175,0.0073144017,0.0068572685,0.97033215,0.0075151827,0.000036994814],"about_ca_topic_score_codex":0.0013646699,"about_ca_topic_score_gemma":0.0018494318,"teacher_disagreement_score":0.005077541,"about_ca_system_score_codex":0.0015705155,"about_ca_system_score_gemma":0.00058736576,"threshold_uncertainty_score":0.016986072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5123604,0.00084463984,0.39152968,0.0023742225,0.00046951268,0.00010425599,0.0003954157,0.00054548215,0.091376334],"genre_scores_gemma":[0.9634935,0.00018121114,0.030103004,0.00034384913,0.00015730388,0.000060993774,0.0001709613,0.000066473454,0.005422654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964856,0.0010808317,0.00020720979,0.0006115908,0.0010494328,0.00056537875],"domain_scores_gemma":[0.9955728,0.0017734753,0.00039856034,0.00061328814,0.0009208477,0.0007210412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002191443,0.0003218465,0.0006629877,0.0010672087,0.001942255,0.0058073727,0.00080248533,0.0007147173,0.0054247766],"category_scores_gemma":[0.0053171916,0.0004134968,0.0010804274,0.0008858433,0.0055143056,0.0061558764,0.003772034,0.0025286397,0.0006090161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004063242,0.000020659567,0.00020379471,0.000018176033,0.0000053700846,0.000068612906,0.00018074593,0.00093116245,0.0012373695,0.994826,0.00035538126,0.0021119656],"study_design_scores_gemma":[0.000023204262,0.000025614157,0.00014086967,0.000015198885,0.000007741221,0.0001074066,0.0002501607,0.007156884,0.0023900957,0.98603225,0.0038350385,0.000015537831],"about_ca_topic_score_codex":0.0011295376,"about_ca_topic_score_gemma":0.0013040527,"teacher_disagreement_score":0.0058073727,"about_ca_system_score_codex":0.0016513868,"about_ca_system_score_gemma":0.0011479219,"threshold_uncertainty_score":0.018147647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4710364,0.0030054809,0.39194956,0.0030846773,0.0003461995,0.00006592875,0.000888343,0.0006693624,0.12895401],"genre_scores_gemma":[0.9519256,0.0006954496,0.029204896,0.00026616058,0.00019145758,0.00015930504,0.0006926326,0.00012103729,0.016743522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986541,0.00035297134,0.000077885394,0.00025989144,0.00038418866,0.0002710008],"domain_scores_gemma":[0.9967002,0.001998103,0.00036314977,0.0003066728,0.00026231562,0.00036951783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452537,0.0005429221,0.0006249665,0.0027136018,0.0027950066,0.004815873,0.000957148,0.0008213099,0.007969351],"category_scores_gemma":[0.0043620965,0.0006018626,0.0012558384,0.002179684,0.0045137354,0.0073313,0.0025245622,0.0026287609,0.00078356045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012733365,0.0000029450446,0.00009977586,0.000010023332,0.0000025962925,0.000015358317,0.00017307792,0.00037154474,0.0002734624,0.9977608,0.00022675283,0.0010509696],"study_design_scores_gemma":[0.000018679404,0.000012783677,0.0003947149,0.000015968173,0.000011932289,0.000064123655,0.00023595795,0.0041712513,0.00066215626,0.98967326,0.0047240676,0.000015099601],"about_ca_topic_score_codex":0.0020294383,"about_ca_topic_score_gemma":0.0021908279,"teacher_disagreement_score":0.007969351,"about_ca_system_score_codex":0.00306792,"about_ca_system_score_gemma":0.00068093714,"threshold_uncertainty_score":0.026660144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072122496,0.0024046402,0.020532228,0.0012704246,0.00067635614,0.000027078106,0.00026240657,0.00012070731,0.96749395],"genre_scores_gemma":[0.41266224,0.005988742,0.01643724,0.0012205475,0.0020519132,0.0001460671,0.0012438482,0.0003646974,0.5598847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924004,0.00015726607,0.0000428452,0.00018234365,0.00027336864,0.000104164246],"domain_scores_gemma":[0.99965525,0.00012296307,0.000018800363,0.00006724519,0.00010323164,0.00003250274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053542573,0.0007057166,0.00056360284,0.0018962864,0.0020461339,0.0037267401,0.0005666702,0.0008126899,0.03519098],"category_scores_gemma":[0.0010145376,0.00035728744,0.0005838455,0.0017651587,0.002708874,0.007090893,0.001981683,0.0033248619,0.0062248223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007022494,0.0000077129225,0.000016372462,0.000022574914,0.000002486187,0.000011839508,0.00010696314,0.000046712514,0.00020594124,0.98693883,0.003762389,0.008871118],"study_design_scores_gemma":[0.000008073723,0.000007489381,0.00014955553,0.000024710327,0.0000067533274,0.0000874704,0.00009694424,0.00020921172,0.0005160195,0.8483075,0.1505796,0.0000066217526],"about_ca_topic_score_codex":0.00081871956,"about_ca_topic_score_gemma":0.0007945282,"teacher_disagreement_score":0.03519098,"about_ca_system_score_codex":0.0016244001,"about_ca_system_score_gemma":0.00042587888,"threshold_uncertainty_score":0.11772555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002946424,0.0060786665,0.06185944,0.0015695794,0.0009094301,0.000037850154,0.00042642464,0.0007588875,0.9254133],"genre_scores_gemma":[0.091007404,0.009016764,0.026697755,0.0010559489,0.0015007938,0.00009841141,0.0009615855,0.00082564255,0.86883575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00010709288,0.00003275562,0.00013007157,0.0003645805,0.00006796029],"domain_scores_gemma":[0.9995284,0.00015481733,0.000023894514,0.00013660146,0.00012439342,0.00003188967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233482,0.00088836433,0.00066121237,0.0014150672,0.0015864756,0.005811934,0.0010142521,0.0006993725,0.052193917],"category_scores_gemma":[0.0015331833,0.00083766325,0.0005609719,0.0021265561,0.0024961804,0.009856593,0.0019166386,0.0025787128,0.02593115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005787069,0.0000073700903,0.000016307453,0.00006399793,0.0000037799405,0.000013951231,0.00016853477,0.00010190449,0.0004748388,0.9530666,0.022797514,0.023279453],"study_design_scores_gemma":[0.000004014769,0.000007909489,0.000063705964,0.000060529437,0.000008696257,0.00010649224,0.00006251675,0.00039593506,0.00091606285,0.60909605,0.38926736,0.000010676858],"about_ca_topic_score_codex":0.00059090497,"about_ca_topic_score_gemma":0.00094294926,"teacher_disagreement_score":0.052193917,"about_ca_system_score_codex":0.0014925246,"about_ca_system_score_gemma":0.0009616476,"threshold_uncertainty_score":0.17460603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47517595,0.0041361945,0.45071182,0.0021362766,0.00022607668,0.00011215359,0.0008834023,0.00037169454,0.06624641],"genre_scores_gemma":[0.9669279,0.0006755051,0.02583143,0.0002031548,0.0002319028,0.00006447076,0.0003751455,0.000035872978,0.005654643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987796,0.00020417152,0.00008075352,0.0003176955,0.0004223421,0.00019546313],"domain_scores_gemma":[0.99806136,0.000658885,0.00026913083,0.00024767214,0.00040129488,0.00036162793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456127,0.00041165005,0.0003352146,0.0021959248,0.0009147012,0.0037178597,0.0007869596,0.00079565484,0.0041946983],"category_scores_gemma":[0.001919051,0.00024728192,0.00040651378,0.0009545507,0.0042820293,0.0067654275,0.0035593943,0.0014121763,0.0003646149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018646091,0.000013270569,0.0008376399,0.000069210815,0.0000117417885,0.00012045339,0.00062236475,0.00031795405,0.0034883625,0.9889263,0.00036508043,0.0052089198],"study_design_scores_gemma":[0.00002477332,0.00014398256,0.005568156,0.00007765646,0.000035413825,0.0014404361,0.0012730996,0.0052317465,0.0057182834,0.9423016,0.038136914,0.00004796186],"about_ca_topic_score_codex":0.00038234532,"about_ca_topic_score_gemma":0.00022459339,"teacher_disagreement_score":0.0041946983,"about_ca_system_score_codex":0.0008102881,"about_ca_system_score_gemma":0.0004543469,"threshold_uncertainty_score":0.0140327215},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09122712,0.003327987,0.082038954,0.0017805404,0.0014926963,0.0000651216,0.0005700577,0.0003131376,0.8191843],"genre_scores_gemma":[0.88872766,0.0024748815,0.019247577,0.0004347698,0.0013158988,0.00009115999,0.0010831488,0.0002645198,0.08636031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992083,0.00014006844,0.00005502218,0.00016471767,0.00028495045,0.00014701617],"domain_scores_gemma":[0.9993812,0.0002422848,0.000033155702,0.00009942448,0.00018055543,0.00006333929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097392,0.00042751734,0.0005243144,0.0021744093,0.0020348325,0.0029669278,0.00059434224,0.0007449672,0.014488606],"category_scores_gemma":[0.0014728092,0.0002541164,0.00077616755,0.0015608498,0.002728219,0.0059670904,0.0016446977,0.002526161,0.0018023608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013071577,0.0000069818734,0.000042679807,0.000017718188,0.00000273676,0.00001579662,0.00016393374,0.00008396089,0.00026045326,0.99097264,0.0012700105,0.0071499976],"study_design_scores_gemma":[0.0000058718288,0.00000778876,0.00013266632,0.00001038078,0.0000039770584,0.000045106328,0.000068390684,0.00034132606,0.0002636531,0.9861324,0.012983867,0.0000046578007],"about_ca_topic_score_codex":0.0019429614,"about_ca_topic_score_gemma":0.0009140317,"teacher_disagreement_score":0.014488606,"about_ca_system_score_codex":0.0017771873,"about_ca_system_score_gemma":0.00063354673,"threshold_uncertainty_score":0.048469245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020130638,0.00063714595,0.11435263,0.0041047437,0.0007086637,0.000061028968,0.0026630734,0.0016281197,0.8557139],"genre_scores_gemma":[0.23006435,0.0012195753,0.056498423,0.0014790782,0.00032173123,0.000101038095,0.0044680657,0.003801918,0.70204586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995402,0.00005549998,0.000008665568,0.000103953855,0.00021864423,0.000073025185],"domain_scores_gemma":[0.99955696,0.0001369637,0.000028539385,0.000093737275,0.00015573011,0.00002801518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040207623,0.00078052847,0.0003844203,0.0012217468,0.0012410867,0.0035207942,0.0010122856,0.00068978406,0.16697969],"category_scores_gemma":[0.0022990971,0.0003705185,0.0007588649,0.0011624581,0.00097391394,0.003851922,0.0013798119,0.0014971509,0.041072894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006398233,0.00005447984,0.0010186866,0.00009050256,0.000022563387,0.00007340893,0.00020280188,0.00208063,0.0017416258,0.77256817,0.12771168,0.0943714],"study_design_scores_gemma":[0.000014661025,0.000021050877,0.0026327216,0.00011789484,0.00003974561,0.00024416545,0.0006190413,0.023584787,0.00919633,0.62911326,0.3343639,0.000052399904],"about_ca_topic_score_codex":0.006612761,"about_ca_topic_score_gemma":0.011652824,"teacher_disagreement_score":0.16697969,"about_ca_system_score_codex":0.0019683365,"about_ca_system_score_gemma":0.0010985939,"threshold_uncertainty_score":0.5586027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07893221,0.013946072,0.20354807,0.004672931,0.0017514752,0.00010029681,0.0011977605,0.00071965106,0.69513154],"genre_scores_gemma":[0.7312903,0.008649847,0.07879327,0.0008996013,0.0019165485,0.00025762853,0.0016275181,0.00042080518,0.17614453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999363,0.00015347409,0.000033781886,0.00009491366,0.0002725328,0.000082194834],"domain_scores_gemma":[0.99936,0.00027551033,0.00004701475,0.000081063175,0.00012977934,0.00010666636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066348515,0.00052930764,0.0006846948,0.0016620948,0.001673338,0.005920915,0.0010883056,0.0005063704,0.0107449815],"category_scores_gemma":[0.0014809665,0.0005826012,0.00062807306,0.0018471464,0.0039112046,0.006423758,0.0017233128,0.0033959458,0.0027168891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064625415,0.0000040035015,0.000024918514,0.000019380683,0.000001371856,0.000008763469,0.000110209345,0.00009347772,0.00015387007,0.9953852,0.0012333154,0.0029589422],"study_design_scores_gemma":[0.0000053678436,0.0000033780227,0.000043662054,0.000009392403,0.0000015827552,0.000044483317,0.000050458337,0.0003663719,0.00013400924,0.987205,0.01213278,0.0000034260331],"about_ca_topic_score_codex":0.00102133,"about_ca_topic_score_gemma":0.00079062354,"teacher_disagreement_score":0.0107449815,"about_ca_system_score_codex":0.0019985351,"about_ca_system_score_gemma":0.0009773346,"threshold_uncertainty_score":0.035945594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64033884,0.0013855364,0.22603555,0.0045682453,0.00038074193,0.00008150443,0.00097555894,0.0007392212,0.12549472],"genre_scores_gemma":[0.9267893,0.00070145534,0.03463831,0.0006643267,0.0007192187,0.00017470216,0.0011508366,0.00041194496,0.034749873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99585503,0.0011952566,0.00021012654,0.00060892716,0.0012955692,0.0008350405],"domain_scores_gemma":[0.9899519,0.006023632,0.00076482986,0.0007786024,0.0009697587,0.001511319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002830506,0.0010916891,0.0028724927,0.0040488713,0.004554008,0.010446437,0.0019644005,0.0023902636,0.012972671],"category_scores_gemma":[0.008289826,0.0012723095,0.0020129287,0.003906582,0.0062569384,0.009025429,0.0036847198,0.0055085267,0.0015805968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011169356,0.000031379812,0.00033531082,0.000041428782,0.000013419182,0.00011536136,0.00021696078,0.001890917,0.00077401113,0.9926959,0.00068374415,0.0030898578],"study_design_scores_gemma":[0.000026675121,0.00001827278,0.00019980772,0.0000139871045,0.0000074542063,0.000079994876,0.00006843656,0.006934712,0.0003682178,0.9910067,0.0012621621,0.000013611773],"about_ca_topic_score_codex":0.0035713336,"about_ca_topic_score_gemma":0.0027124677,"teacher_disagreement_score":0.012972671,"about_ca_system_score_codex":0.0038730998,"about_ca_system_score_gemma":0.0015727894,"threshold_uncertainty_score":0.043397963},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14672649,0.0026698015,0.358085,0.0028128542,0.0022935416,0.00046829515,0.0031722705,0.0030184484,0.4807532],"genre_scores_gemma":[0.74521816,0.002519985,0.14354785,0.0018352496,0.0014604345,0.000620276,0.004228647,0.001540156,0.099029265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800175,0.0004025692,0.00016306298,0.00039120897,0.0006408076,0.0004005342],"domain_scores_gemma":[0.99807274,0.00061549636,0.0001784208,0.00024502818,0.00055538525,0.00033282413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018075041,0.0011307924,0.000677828,0.0025663772,0.0028702726,0.0052401316,0.0011408781,0.0010650886,0.018853256],"category_scores_gemma":[0.00311021,0.0006924892,0.0019052685,0.0015186078,0.002711569,0.0083281,0.0035297729,0.0024806666,0.0050386325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003882246,0.000019446687,0.000108030814,0.00007616605,0.000007707118,0.000113904636,0.0003123448,0.0003744472,0.00088521454,0.98907834,0.002906562,0.0060790344],"study_design_scores_gemma":[0.000049223112,0.00004211746,0.00035796393,0.000059724753,0.000020821517,0.00024231934,0.00026173398,0.0022191633,0.0036563,0.94901776,0.044029925,0.0000430682],"about_ca_topic_score_codex":0.0025036274,"about_ca_topic_score_gemma":0.002961777,"teacher_disagreement_score":0.018853256,"about_ca_system_score_codex":0.0024650616,"about_ca_system_score_gemma":0.0018860966,"threshold_uncertainty_score":0.06307042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11224601,0.0014867845,0.8246751,0.002188274,0.00038764122,0.000041837793,0.00019414241,0.0002464968,0.058533758],"genre_scores_gemma":[0.8698637,0.0008634651,0.111045636,0.00067989464,0.00040859674,0.00020067254,0.00026494966,0.00014902068,0.016524069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972064,0.0005446376,0.00022459596,0.00050910504,0.0012184375,0.00029676966],"domain_scores_gemma":[0.9929986,0.0025631818,0.0010075929,0.0011581312,0.0012707821,0.001001764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028954067,0.000838674,0.0005511356,0.0020602783,0.0014196342,0.0049451906,0.0016034098,0.0014147601,0.0038636497],"category_scores_gemma":[0.010427943,0.00051675504,0.0015691223,0.0010495816,0.007047653,0.007995627,0.0050284616,0.0035990104,0.0005404261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000557688,0.000009157005,0.0002996421,0.000026890817,0.00000777119,0.00006267699,0.00012118047,0.0005581755,0.00046812964,0.9959864,0.00021259116,0.0022417803],"study_design_scores_gemma":[0.000006233857,0.000034778815,0.00065676187,0.000029014482,0.00001863137,0.00024940935,0.00013592793,0.008587248,0.0026264738,0.98123115,0.006404889,0.000019577363],"about_ca_topic_score_codex":0.0005622183,"about_ca_topic_score_gemma":0.0005421762,"teacher_disagreement_score":0.0049451906,"about_ca_system_score_codex":0.0013946752,"about_ca_system_score_gemma":0.0006876601,"threshold_uncertainty_score":0.015312493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013523816,0.00086762704,0.78171986,0.0016395444,0.00048146557,0.00021316325,0.0005951651,0.0009119357,0.20004737],"genre_scores_gemma":[0.6235626,0.0016936233,0.09952934,0.0010986648,0.00081920216,0.00039498918,0.0010323215,0.00041318068,0.27145612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.0002070511,0.00005081492,0.00018700336,0.0003894423,0.00012356714],"domain_scores_gemma":[0.9985586,0.00050018926,0.00013747277,0.0003700839,0.00030911967,0.00012455546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012893289,0.00065472466,0.0005858207,0.0011607357,0.0013664829,0.0021194092,0.00094582944,0.0008241683,0.034408133],"category_scores_gemma":[0.0035581563,0.0004002652,0.0008605476,0.0007761939,0.001876183,0.0035616562,0.0017360565,0.0022749722,0.0056320326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011918627,0.000009446447,0.000043958116,0.000019050145,0.0000046702426,0.000013775652,0.000046632038,0.0007424688,0.000255606,0.98957205,0.0015939719,0.0076864837],"study_design_scores_gemma":[0.000012248311,0.000013301478,0.000049792543,0.000009761294,0.000008037772,0.0000423641,0.00003523776,0.0048451284,0.0007595248,0.9739096,0.020306356,0.0000084572075],"about_ca_topic_score_codex":0.00078361755,"about_ca_topic_score_gemma":0.0005405322,"teacher_disagreement_score":0.034408133,"about_ca_system_score_codex":0.0010873569,"about_ca_system_score_gemma":0.001105572,"threshold_uncertainty_score":0.11510664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033313334,0.01940925,0.55342835,0.0095673585,0.0012472549,0.00013748363,0.00087810296,0.0006860363,0.41131487],"genre_scores_gemma":[0.2695803,0.021910673,0.50269777,0.006206082,0.00446393,0.00102742,0.0018845968,0.0005719904,0.1916572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987437,0.0005271671,0.000092820796,0.00022641434,0.00032172631,0.00008812796],"domain_scores_gemma":[0.9989416,0.0005270768,0.000057246605,0.00021186408,0.00019311962,0.000069068716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019679882,0.0013843873,0.0011531931,0.0022830572,0.0022831573,0.008548318,0.0025517957,0.0024373413,0.016499653],"category_scores_gemma":[0.0028186536,0.001101493,0.0014856735,0.0028303703,0.01318498,0.0140084475,0.0020256552,0.005196635,0.005384369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012546701,0.000002071525,0.000009181031,0.000019378995,0.000001794685,0.0000065910385,0.000068668865,0.00014606738,0.0000326862,0.9954846,0.0018885985,0.0023390674],"study_design_scores_gemma":[0.0000026406651,0.000001704483,0.000011040726,0.000012851477,0.0000015042094,0.000015718411,0.00001722861,0.000365356,0.00002290794,0.97743964,0.022107003,0.000002378071],"about_ca_topic_score_codex":0.003065886,"about_ca_topic_score_gemma":0.0025712433,"teacher_disagreement_score":0.016499653,"about_ca_system_score_codex":0.0036617212,"about_ca_system_score_gemma":0.0024843283,"threshold_uncertainty_score":0.05519688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24834937,0.00067150366,0.67632294,0.0008697264,0.0005657017,0.00015861538,0.0004095294,0.00034815693,0.07230452],"genre_scores_gemma":[0.89303887,0.00077038613,0.08082889,0.00043634925,0.0005574943,0.00018589817,0.00034594754,0.00026139675,0.023574734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622655,0.00082980434,0.00045334696,0.000721644,0.0011276312,0.00064114545],"domain_scores_gemma":[0.9943071,0.0022011865,0.000700377,0.0010110429,0.0011559594,0.00062433863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037670867,0.00087110663,0.0010436202,0.0019589944,0.0018355437,0.004248428,0.0011111547,0.0010775811,0.008326041],"category_scores_gemma":[0.0066273175,0.0009915838,0.0019691647,0.0014959481,0.005873193,0.010228636,0.0034508316,0.0022954063,0.0008778049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003471325,0.000019355783,0.0001089535,0.000014856084,0.0000066315874,0.000035186473,0.000098298275,0.00031890156,0.0006597634,0.99659425,0.0001376923,0.001971429],"study_design_scores_gemma":[0.000015324384,0.000024123015,0.00010808619,0.000006054854,0.00001377116,0.00008487335,0.00003505312,0.002642408,0.0010496457,0.99451447,0.0014888735,0.000017380991],"about_ca_topic_score_codex":0.0016513845,"about_ca_topic_score_gemma":0.0014711895,"teacher_disagreement_score":0.008326041,"about_ca_system_score_codex":0.0010850979,"about_ca_system_score_gemma":0.002167436,"threshold_uncertainty_score":0.02785343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08329993,0.0065335035,0.7384913,0.12029747,0.0020835206,0.0001437414,0.0022733477,0.0007419421,0.04613537],"genre_scores_gemma":[0.49873257,0.005095925,0.42990404,0.012684097,0.0075113596,0.0007023623,0.0039806017,0.00059143937,0.040797625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977266,0.000653408,0.0001285832,0.0009298064,0.00033864015,0.00022293316],"domain_scores_gemma":[0.98962855,0.0073810397,0.00046903387,0.0009338742,0.0009202819,0.0006672399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00335672,0.00095190917,0.0021827747,0.0022372005,0.0034792887,0.004902853,0.0021872304,0.0053861667,0.010948853],"category_scores_gemma":[0.01694612,0.0007758504,0.001730863,0.0032660023,0.0047873002,0.014558896,0.0050359317,0.007573073,0.001820256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019496754,0.00009943277,0.0009050294,0.00024942175,0.00003359941,0.00018115576,0.0006888322,0.002684991,0.0009398449,0.9164836,0.03494184,0.042597346],"study_design_scores_gemma":[0.000064793385,0.000042638883,0.00030341692,0.0000712592,0.000012534289,0.00023180291,0.00032696733,0.010572148,0.0005849736,0.9731364,0.014611459,0.000041557993],"about_ca_topic_score_codex":0.0011769583,"about_ca_topic_score_gemma":0.0008088455,"teacher_disagreement_score":0.010948853,"about_ca_system_score_codex":0.0020318492,"about_ca_system_score_gemma":0.0018807361,"threshold_uncertainty_score":0.03662759},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47776246,0.0017006728,0.42936683,0.002508868,0.00033600724,0.00006539492,0.00020762316,0.0004422093,0.08760991],"genre_scores_gemma":[0.97708136,0.0002690513,0.014902532,0.00022897,0.00014758017,0.00003705421,0.000057142086,0.00002554614,0.0072508478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.00018779756,0.00004907082,0.00016863164,0.00024282378,0.00019533408],"domain_scores_gemma":[0.9986895,0.00047011062,0.0001429273,0.00016396608,0.0002777981,0.0002557188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014782548,0.0002727583,0.00032002295,0.00083424797,0.0014114536,0.0015018337,0.0005838892,0.00052820717,0.002070144],"category_scores_gemma":[0.0015904654,0.00026791188,0.0007724767,0.00057455094,0.0053935107,0.004651585,0.003725641,0.0012838776,0.0002456005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021015312,0.000016073292,0.0005159128,0.000020901443,0.000005510524,0.00010634975,0.0003329573,0.0004696351,0.0009846321,0.99461645,0.00022430958,0.0026862246],"study_design_scores_gemma":[0.000016498561,0.000037016485,0.0006824928,0.000011054257,0.00001973209,0.00023825461,0.00018448711,0.0054643624,0.0021400584,0.9853513,0.0058354964,0.000019223009],"about_ca_topic_score_codex":0.003103421,"about_ca_topic_score_gemma":0.0022631965,"teacher_disagreement_score":0.003103421,"about_ca_system_score_codex":0.001361164,"about_ca_system_score_gemma":0.0009185519,"threshold_uncertainty_score":0.009875953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653184,0.0006964003,0.34508246,0.0014078061,0.00040313552,0.0001253893,0.00044092606,0.00071782287,0.08580767],"genre_scores_gemma":[0.9325046,0.0002268032,0.0502166,0.0001471727,0.0003107115,0.00013592103,0.00032989302,0.000216636,0.015911698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791795,0.0005379875,0.00013671225,0.00034949437,0.00064451183,0.0004133269],"domain_scores_gemma":[0.9978557,0.0008284715,0.0002444999,0.00026298617,0.0002804299,0.0005279461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016839587,0.0007966198,0.0012977385,0.001870789,0.0028807933,0.00706339,0.0017741878,0.0013220998,0.006134704],"category_scores_gemma":[0.0029002372,0.000975061,0.0014498505,0.0016475674,0.004717615,0.005966123,0.0030108015,0.0029376321,0.0008654547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007619996,0.000039835613,0.00012343364,0.000018876217,0.000007970619,0.00008421136,0.00037347386,0.000469282,0.0015371897,0.9948801,0.0002840172,0.0021054076],"study_design_scores_gemma":[0.000052250467,0.000029524643,0.00011676866,0.000007739543,0.000009690378,0.00011314789,0.00013478727,0.0043294984,0.0010665506,0.9924481,0.0016766185,0.000015405343],"about_ca_topic_score_codex":0.0009955391,"about_ca_topic_score_gemma":0.0010851083,"teacher_disagreement_score":0.00706339,"about_ca_system_score_codex":0.0016816733,"about_ca_system_score_gemma":0.0009901342,"threshold_uncertainty_score":0.020522654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28013614,0.002975541,0.47261578,0.0022387786,0.00076350034,0.00017590325,0.001944938,0.0014355093,0.23771386],"genre_scores_gemma":[0.9019352,0.000542952,0.06858754,0.00025109772,0.00048818864,0.00013296395,0.0011133743,0.0002512278,0.026697477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975575,0.00047076223,0.0001917868,0.0005599665,0.00073951576,0.000480406],"domain_scores_gemma":[0.99761826,0.0006253681,0.00035090646,0.0003933183,0.00054508477,0.0004671069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018357289,0.0004957133,0.0006153762,0.0021319198,0.0014798963,0.004586112,0.0010651635,0.00060092483,0.0071561993],"category_scores_gemma":[0.0025543896,0.0005625541,0.0011517061,0.001125073,0.00421913,0.0066165086,0.0034372513,0.0021373508,0.001415382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025897181,0.000011715241,0.00014767716,0.000017678272,0.0000040196633,0.000044833883,0.00061926077,0.0002803588,0.0007830141,0.9951616,0.00046908992,0.00243491],"study_design_scores_gemma":[0.000015458396,0.000034310837,0.0002810612,0.000019823188,0.000008456273,0.00014051821,0.0003771238,0.0045236414,0.0017179584,0.9792947,0.013570549,0.00001629585],"about_ca_topic_score_codex":0.0010259823,"about_ca_topic_score_gemma":0.00069472875,"teacher_disagreement_score":0.0071561993,"about_ca_system_score_codex":0.0020591787,"about_ca_system_score_gemma":0.00070706866,"threshold_uncertainty_score":0.023939848},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084112845,0.022594437,0.35467774,0.010461854,0.0012227694,0.00027561787,0.002401782,0.0006362265,0.52361685],"genre_scores_gemma":[0.81201684,0.010009126,0.12688193,0.0023064609,0.002733762,0.00040813728,0.0020407003,0.0001706615,0.043432385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985549,0.00039916442,0.000089869616,0.00028582686,0.0005289908,0.0001412322],"domain_scores_gemma":[0.9976439,0.0010012385,0.00029835338,0.000316922,0.00053785567,0.000201583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273694,0.0008569995,0.00066102366,0.0033326265,0.0017962225,0.006104811,0.0009926893,0.0010572573,0.013557863],"category_scores_gemma":[0.004126627,0.00039752602,0.0007337438,0.0030121014,0.0045602093,0.010285661,0.002121818,0.002642603,0.0015976029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021138778,0.0000021508472,0.000026501542,0.000017180615,0.00000190814,0.000009196954,0.000069871225,0.00016243765,0.00011637537,0.99729866,0.000737102,0.0015566532],"study_design_scores_gemma":[0.0000029872729,0.0000033072622,0.000094872834,0.000012592683,0.0000024046967,0.00005131862,0.000060556347,0.0013179763,0.00012812116,0.98058885,0.017731113,0.0000058464366],"about_ca_topic_score_codex":0.0017639634,"about_ca_topic_score_gemma":0.0011500705,"teacher_disagreement_score":0.013557863,"about_ca_system_score_codex":0.0023671833,"about_ca_system_score_gemma":0.0010095985,"threshold_uncertainty_score":0.04535556},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060092025,0.00013244734,0.9261001,0.00017266105,0.00011327352,0.00010510432,0.00012068924,0.0013072626,0.011856498],"genre_scores_gemma":[0.55668193,0.00035774085,0.43261728,0.00022646335,0.00018466522,0.00031475403,0.0005466583,0.0010490746,0.008021434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567837,0.00082217046,0.00032397447,0.00081579405,0.0018744627,0.0004853536],"domain_scores_gemma":[0.99503326,0.0024405015,0.0003103611,0.0010233378,0.0010010585,0.00019159105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028797113,0.0009785799,0.0009473148,0.003911008,0.0018348396,0.004010949,0.0021363746,0.0013759198,0.007314253],"category_scores_gemma":[0.018648246,0.00085493276,0.002077826,0.001664184,0.004070294,0.011319186,0.0056472425,0.0021088608,0.0016711545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006638259,0.00006938469,0.0012376694,0.00014308766,0.00003990329,0.00025961595,0.00076881546,0.012958232,0.0050070374,0.9465549,0.0006142338,0.032280695],"study_design_scores_gemma":[0.000009065901,0.000023061082,0.00013818333,0.000037164835,0.000028031829,0.00008445366,0.00015813648,0.03968504,0.009447634,0.9469853,0.0033767454,0.000027181459],"about_ca_topic_score_codex":0.0021505174,"about_ca_topic_score_gemma":0.0027201043,"teacher_disagreement_score":0.007314253,"about_ca_system_score_codex":0.0013328862,"about_ca_system_score_gemma":0.0015981795,"threshold_uncertainty_score":0.02446866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101792224,0.011919705,0.47890675,0.00806214,0.0017510027,0.000104791136,0.0010914084,0.0011757095,0.39519638],"genre_scores_gemma":[0.738803,0.009931464,0.13120158,0.0024722477,0.0012268886,0.0001814631,0.0011266716,0.00031469497,0.114742026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955684,0.00007660856,0.000020897825,0.000072156756,0.0002061051,0.000067362766],"domain_scores_gemma":[0.9996082,0.00016426333,0.000057440826,0.000061085695,0.000057230147,0.000051836134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043703584,0.00047900606,0.0002572077,0.0006485874,0.00081925216,0.0012496302,0.00055546593,0.00045292615,0.010896689],"category_scores_gemma":[0.0010518403,0.0003218407,0.00056359207,0.00084269646,0.0030720367,0.002552041,0.0018934628,0.0022091307,0.0021340388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004410197,0.000008169256,0.00008615811,0.000120084114,0.0000048661204,0.00011532231,0.00022918139,0.0013310747,0.0032350994,0.97021073,0.0035038977,0.021111352],"study_design_scores_gemma":[0.000013170176,0.000041095245,0.0002509046,0.000025636624,0.00000766462,0.00026410783,0.00027979407,0.0015131787,0.0052716993,0.9010026,0.09131209,0.000018055587],"about_ca_topic_score_codex":0.0009881185,"about_ca_topic_score_gemma":0.0008698252,"teacher_disagreement_score":0.010896689,"about_ca_system_score_codex":0.0011387668,"about_ca_system_score_gemma":0.00039520333,"threshold_uncertainty_score":0.03645301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3010378,0.004939766,0.49756762,0.005624436,0.0009571362,0.00019651215,0.0014053851,0.0015424194,0.18672894],"genre_scores_gemma":[0.8894292,0.0011903902,0.09164749,0.0005631127,0.0006796787,0.00016337556,0.0010170088,0.00022446882,0.015085316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605054,0.0011208431,0.0002891809,0.00081032823,0.0012703347,0.00045879747],"domain_scores_gemma":[0.996552,0.001444663,0.00046322067,0.00061873824,0.000472891,0.00044844896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018916918,0.00051872706,0.00067648303,0.0017328961,0.0027876562,0.008055931,0.0015697147,0.0010723553,0.0058827084],"category_scores_gemma":[0.0071751494,0.00067088,0.0011642245,0.0015423408,0.0076119946,0.016584644,0.0035277288,0.003335667,0.0009321691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025016445,0.000013016476,0.00010457921,0.000020160353,0.000004363372,0.000041152853,0.00024700802,0.0003394484,0.00044779383,0.99453497,0.000492522,0.0037299094],"study_design_scores_gemma":[0.000013025162,0.0000075932576,0.00009555261,0.000010670766,0.0000045613347,0.0000774106,0.00012432128,0.0016931212,0.000806088,0.99072886,0.006430688,0.000008246962],"about_ca_topic_score_codex":0.0015680045,"about_ca_topic_score_gemma":0.0011340578,"teacher_disagreement_score":0.008055931,"about_ca_system_score_codex":0.0020197385,"about_ca_system_score_gemma":0.0011933526,"threshold_uncertainty_score":0.019679606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64558315,0.0044042114,0.21190247,0.0052044312,0.00022688338,0.00014839016,0.0007558518,0.00071927364,0.13105537],"genre_scores_gemma":[0.96718276,0.0007475904,0.024098447,0.00029949562,0.0001683452,0.000114132716,0.00019328594,0.00006190246,0.007134098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.0003401099,0.00016887781,0.00041225163,0.00052703737,0.00030340836],"domain_scores_gemma":[0.9977101,0.0010154042,0.00038794105,0.00028767207,0.0003838015,0.0002149866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002359031,0.00034869235,0.0006533141,0.0018705524,0.0021230956,0.0027965182,0.00082719827,0.0005882964,0.002928763],"category_scores_gemma":[0.004469984,0.0004313983,0.0011705518,0.0011770827,0.008703765,0.010200014,0.002888827,0.0020124365,0.00055166805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040098425,0.000013868617,0.0005790546,0.000035662848,0.000006460082,0.00007558838,0.0007865823,0.00047328463,0.0009850721,0.99199533,0.00045040748,0.0045586647],"study_design_scores_gemma":[0.00002875552,0.00002549805,0.00083834224,0.000027562128,0.00001222113,0.00025215806,0.00029817506,0.0018990213,0.0016207523,0.9811106,0.013860584,0.000026409678],"about_ca_topic_score_codex":0.0015500232,"about_ca_topic_score_gemma":0.00086176035,"teacher_disagreement_score":0.002928763,"about_ca_system_score_codex":0.0025288034,"about_ca_system_score_gemma":0.0011788551,"threshold_uncertainty_score":0.0183478},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15092522,0.00027518443,0.81723136,0.0002377826,0.00019606059,0.00036617692,0.00040160117,0.0020572501,0.028309433],"genre_scores_gemma":[0.46300423,0.0004132464,0.50806314,0.00018757369,0.00015548403,0.00029458816,0.0018193439,0.0016631236,0.024399215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913436,0.00014031371,0.000047808127,0.00017991757,0.00034244097,0.0001551991],"domain_scores_gemma":[0.9987532,0.00030111359,0.00006016009,0.0004725554,0.00029542812,0.000117630814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013013887,0.0013056664,0.0011646282,0.0025188338,0.0009594887,0.002576581,0.0011041053,0.00065180444,0.018340869],"category_scores_gemma":[0.00292965,0.0003899262,0.0013043098,0.0011387119,0.0018666977,0.0031690309,0.002536871,0.0022419165,0.0046705436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027830788,0.00017124922,0.001404066,0.00017381666,0.00004503693,0.00051872525,0.0012627078,0.0106842965,0.028160987,0.76827055,0.004683877,0.18434636],"study_design_scores_gemma":[0.00004463376,0.000113866685,0.00038798223,0.000048058064,0.000030108175,0.00023373021,0.0006792492,0.042158414,0.017357217,0.912819,0.026092798,0.000034922963],"about_ca_topic_score_codex":0.00071163574,"about_ca_topic_score_gemma":0.0008717543,"teacher_disagreement_score":0.018340869,"about_ca_system_score_codex":0.00061783066,"about_ca_system_score_gemma":0.0005530498,"threshold_uncertainty_score":0.061356246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8518925,0.0010003895,0.098299325,0.00065152824,0.000064538464,0.00005174059,0.00074743904,0.00035355648,0.04693907],"genre_scores_gemma":[0.9694317,0.0004997876,0.018576866,0.00024375784,0.00010295068,0.00012442347,0.0011754439,0.000085064705,0.009759998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986778,0.00022759783,0.00010208533,0.0003309161,0.00044429122,0.00021732083],"domain_scores_gemma":[0.99735665,0.0011447917,0.00036019707,0.00031479058,0.00053689687,0.00028660998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080000656,0.0005681181,0.00095639593,0.0020993254,0.0021650263,0.003726958,0.0008810078,0.0010180663,0.0033137656],"category_scores_gemma":[0.00516882,0.0005041084,0.0011499587,0.0015122505,0.002391318,0.0038358655,0.0023872422,0.0015522824,0.0004257413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087482265,0.000023158176,0.0023974874,0.000060507744,0.000025767637,0.0003014015,0.00056146894,0.0017655,0.0034935654,0.9804449,0.0008233154,0.010015488],"study_design_scores_gemma":[0.000033869255,0.00008178297,0.002819589,0.00006574041,0.00006153476,0.0014659307,0.00058849767,0.024321891,0.008635808,0.9449988,0.016872607,0.000053951157],"about_ca_topic_score_codex":0.0014087302,"about_ca_topic_score_gemma":0.00078030274,"teacher_disagreement_score":0.003726958,"about_ca_system_score_codex":0.0022396615,"about_ca_system_score_gemma":0.0007852112,"threshold_uncertainty_score":0.016249955},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006960186,0.10956549,0.16110466,0.08735096,0.102017574,0.00032950414,0.0035928136,0.0019494893,0.5271293],"genre_scores_gemma":[0.09500604,0.057827163,0.09490674,0.011223304,0.0418637,0.00045950225,0.007278734,0.002970981,0.6884638],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971596,0.0009792887,0.0001915787,0.00052024913,0.00085893524,0.00029032904],"domain_scores_gemma":[0.9977106,0.0008413134,0.00006849601,0.00038733127,0.0006392064,0.000353046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033786285,0.00094098103,0.0013397902,0.001578712,0.0019183662,0.007848968,0.0016514458,0.0016208042,0.09016574],"category_scores_gemma":[0.0047019366,0.0006006311,0.0015415525,0.0015450823,0.0024236308,0.0069689383,0.0036582905,0.006315992,0.01969166],"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.00013658123,0.00010341095,0.00026691577,0.00038536216,0.000059872447,0.00011350088,0.00065032474,0.0007605452,0.0015356806,0.23379073,0.6389463,0.12325085],"study_design_scores_gemma":[0.000013636914,0.000024238087,0.0002540235,0.0001961291,0.00001570965,0.00013859784,0.00013323792,0.00088660634,0.00050931197,0.088581584,0.90922797,0.000018917099],"about_ca_topic_score_codex":0.0016384209,"about_ca_topic_score_gemma":0.0033466602,"teacher_disagreement_score":0.09016574,"about_ca_system_score_codex":0.0031761713,"about_ca_system_score_gemma":0.0027900415,"threshold_uncertainty_score":0.30163443},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005344835,0.031809803,0.0028503328,0.11226802,0.8260626,0.000054894383,0.00025928553,0.00029856904,0.025861915],"genre_scores_gemma":[0.0050098957,0.016535409,0.0011442984,0.017304232,0.8829556,0.00007167507,0.00036451555,0.0006152297,0.07599909],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99421847,0.0010529322,0.00039874134,0.0012785302,0.0024804191,0.0005709982],"domain_scores_gemma":[0.9862124,0.006547205,0.00067339704,0.00091292604,0.002739605,0.0029144178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047996906,0.0018437287,0.0022792707,0.0027951926,0.004276007,0.011512545,0.0021077974,0.0050488766,0.04662111],"category_scores_gemma":[0.015088421,0.0010898291,0.0022614703,0.0018680753,0.0031693743,0.01008722,0.0040004756,0.011151162,0.014442672],"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.000031183437,0.000024718998,0.00006934017,0.00015848917,0.000014186589,0.00007231205,0.00005795311,0.00009565046,0.00015280527,0.0075503555,0.98149693,0.010275982],"study_design_scores_gemma":[0.000009752538,0.00001644237,0.00015115221,0.00017618075,0.000009046846,0.00011904524,0.000035247744,0.00017831803,0.00007679178,0.006730561,0.9924867,0.000010683971],"about_ca_topic_score_codex":0.00089954975,"about_ca_topic_score_gemma":0.0023108898,"teacher_disagreement_score":0.04662111,"about_ca_system_score_codex":0.0054628174,"about_ca_system_score_gemma":0.003382063,"threshold_uncertainty_score":0.15596318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35391712,0.01305335,0.3282784,0.026311846,0.003386973,0.000068504065,0.0014897601,0.00052605255,0.27296793],"genre_scores_gemma":[0.94344616,0.0017944527,0.02072766,0.0012008717,0.0012091822,0.00003422009,0.0005916901,0.00012555064,0.030870268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992212,0.00023004659,0.000040769846,0.0002487482,0.0001720864,0.00008715893],"domain_scores_gemma":[0.9991671,0.00028584586,0.00009183257,0.000120814366,0.00019892004,0.000135545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091426296,0.0005185486,0.0005275855,0.0015747704,0.0013432563,0.004469377,0.00049952196,0.0011479952,0.00606757],"category_scores_gemma":[0.0016018761,0.00030008832,0.000685346,0.001389851,0.0036620782,0.007172687,0.0023291195,0.002776529,0.0005525303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015958669,0.0000056655035,0.000089462534,0.000024775349,0.000004188003,0.000031829262,0.00018040864,0.000051257342,0.00025862563,0.9971745,0.00090310804,0.0012600716],"study_design_scores_gemma":[0.000014349203,0.000021451182,0.0002819865,0.00001965884,0.0000090171925,0.00022090669,0.00029653986,0.0012486015,0.000581573,0.9773171,0.019980013,0.000008748735],"about_ca_topic_score_codex":0.00041873957,"about_ca_topic_score_gemma":0.0004121401,"teacher_disagreement_score":0.00606757,"about_ca_system_score_codex":0.0010176004,"about_ca_system_score_gemma":0.00035400916,"threshold_uncertainty_score":0.020298064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63423365,0.0014382917,0.20040463,0.0016562542,0.0008689136,0.00017949165,0.00073868816,0.0004762807,0.16000384],"genre_scores_gemma":[0.9742198,0.0003331543,0.012833482,0.0002998788,0.00040883885,0.00005056171,0.00032220903,0.000052018862,0.011480191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998703,0.00020999264,0.00009742318,0.00031594836,0.0004165113,0.00025725082],"domain_scores_gemma":[0.9989819,0.00012673772,0.0001590337,0.00009788863,0.00036504326,0.00026944533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063040596,0.00026527987,0.0007070394,0.0014689378,0.0016477972,0.0025299594,0.00066269864,0.00055796484,0.0074690585],"category_scores_gemma":[0.001233597,0.0002559503,0.0009978717,0.000777682,0.0027281826,0.0048657088,0.0017261246,0.0015858262,0.00069084263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006149508,0.00003019955,0.00040263878,0.000047729136,0.000015985046,0.000103266546,0.00020080598,0.0003603891,0.0026236998,0.9921639,0.00049174885,0.003498176],"study_design_scores_gemma":[0.00004677436,0.00010804736,0.001007095,0.000019784102,0.000028865035,0.0006650076,0.0004320411,0.005500167,0.0030217948,0.97884136,0.01029168,0.000037325004],"about_ca_topic_score_codex":0.0009405477,"about_ca_topic_score_gemma":0.00046768034,"teacher_disagreement_score":0.0074690585,"about_ca_system_score_codex":0.0011659564,"about_ca_system_score_gemma":0.00096498284,"threshold_uncertainty_score":0.024986506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27156058,0.0010529388,0.40662622,0.0023923202,0.0010411203,0.00014318195,0.0005867969,0.0012957989,0.31530112],"genre_scores_gemma":[0.79833704,0.0006779848,0.04595581,0.0005937247,0.00028325696,0.00016550225,0.0005838332,0.00032326046,0.15307969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996382,0.00007109272,0.000020534793,0.000072983465,0.00013154751,0.000065645574],"domain_scores_gemma":[0.99873906,0.00041787155,0.0000902355,0.0002328975,0.00027952337,0.00024040941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006802489,0.000824391,0.0006403594,0.0013559349,0.0014635705,0.0020221157,0.0008003127,0.0007570725,0.01679574],"category_scores_gemma":[0.0018745138,0.00042360826,0.0005705824,0.0007001978,0.0014266723,0.0036133719,0.0023344806,0.0019515556,0.0015390224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012925682,0.000018866709,0.000254215,0.000050212675,0.000011014735,0.00008107884,0.000073262876,0.0009165969,0.0025375881,0.9796575,0.0023842435,0.0138861695],"study_design_scores_gemma":[0.000020470037,0.000037354246,0.00021059519,0.000017367658,0.000021652155,0.00013440751,0.00004824731,0.006633178,0.0032822774,0.9771971,0.012386618,0.0000106552625],"about_ca_topic_score_codex":0.00037634646,"about_ca_topic_score_gemma":0.0006897555,"teacher_disagreement_score":0.01679574,"about_ca_system_score_codex":0.0008767099,"about_ca_system_score_gemma":0.00053901394,"threshold_uncertainty_score":0.056187272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7932166,0.00045705913,0.18642905,0.00030454964,0.00006141163,0.000052593758,0.00008970884,0.000096405034,0.019292664],"genre_scores_gemma":[0.9888508,0.00012565058,0.006901799,0.000023060382,0.00006804553,0.000038755345,0.000044468663,0.000014098317,0.003933432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.000120377255,0.000023643022,0.00012259914,0.00017838072,0.0000751229],"domain_scores_gemma":[0.99846077,0.000567899,0.0002835869,0.00012829195,0.00025799367,0.00030140174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012041276,0.0002666451,0.00041349325,0.0012093724,0.00068014656,0.0013457355,0.0005188573,0.0003473703,0.0041137],"category_scores_gemma":[0.002062721,0.00018212298,0.00068914314,0.00039714194,0.0022412466,0.0019866743,0.0010947854,0.000991923,0.0002208383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057322926,0.000028670662,0.0008118762,0.00003897555,0.00002207407,0.0003211469,0.0005853555,0.0029730308,0.0105126975,0.9804316,0.00015160287,0.004065663],"study_design_scores_gemma":[0.00003498919,0.00018849611,0.0020867593,0.000021026626,0.00002572985,0.0005027066,0.00043441638,0.033707686,0.006111128,0.9536727,0.003183532,0.0000308988],"about_ca_topic_score_codex":0.00054832036,"about_ca_topic_score_gemma":0.0003689521,"teacher_disagreement_score":0.0041137,"about_ca_system_score_codex":0.0007397993,"about_ca_system_score_gemma":0.0003169529,"threshold_uncertainty_score":0.013761699},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022664852,0.02896971,0.15270267,0.0031242408,0.0018229964,0.00006924493,0.0010438092,0.0004758951,0.7891266],"genre_scores_gemma":[0.5270326,0.03152889,0.10159812,0.0016105284,0.0050320043,0.0003051503,0.002999712,0.000501171,0.32939184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.000055534096,0.000019830546,0.00006811386,0.00022082744,0.000038021506],"domain_scores_gemma":[0.9996935,0.00011538926,0.000021425323,0.000043143154,0.00008381972,0.000042715452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034590025,0.0007740758,0.0008380369,0.0026582098,0.0014829095,0.004929558,0.001358337,0.00071511586,0.01337235],"category_scores_gemma":[0.0006448154,0.00043088186,0.0008290736,0.0042006397,0.0021274448,0.0042432914,0.0010036654,0.0026459303,0.0023291705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042563984,0.000006659343,0.000023589346,0.00004439128,0.0000043150685,0.000010081069,0.00003254622,0.0004385449,0.0001925456,0.9828484,0.0062116883,0.010183031],"study_design_scores_gemma":[0.0000039229403,0.000004729235,0.00008142925,0.000022773533,0.000004603261,0.00005362082,0.000023050265,0.0013866426,0.0001294674,0.967062,0.03122087,0.0000069853245],"about_ca_topic_score_codex":0.0017376753,"about_ca_topic_score_gemma":0.0015312836,"teacher_disagreement_score":0.01337235,"about_ca_system_score_codex":0.0028232543,"about_ca_system_score_gemma":0.0012345344,"threshold_uncertainty_score":0.044735014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36937952,0.004590942,0.52282166,0.0035318574,0.0004851825,0.00006846645,0.0005677976,0.00027544153,0.09827919],"genre_scores_gemma":[0.9520805,0.0029870581,0.03435471,0.0006406804,0.0012642973,0.00005539402,0.00037759214,0.000115294264,0.008124515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967564,0.0006915729,0.0003179358,0.0007255505,0.0011438993,0.00036459893],"domain_scores_gemma":[0.98937863,0.0059256316,0.0015259576,0.001425604,0.0011034887,0.0006406927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034643535,0.00068701257,0.0008884332,0.0018640413,0.0015818969,0.0033003353,0.0010652478,0.0007694374,0.0046222797],"category_scores_gemma":[0.011629645,0.00046283804,0.0018937493,0.0020210922,0.0045416793,0.0066477126,0.0023321295,0.003754454,0.0005430601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040127565,0.00003227478,0.00071568653,0.00011145727,0.000028105578,0.00017923657,0.00023239793,0.0021179093,0.001963516,0.98706144,0.00039434788,0.00712354],"study_design_scores_gemma":[0.00001207471,0.00009268943,0.0010472907,0.00003654741,0.00005349325,0.0005713595,0.00009737828,0.011060034,0.0040414715,0.9777258,0.00523232,0.000029601964],"about_ca_topic_score_codex":0.00043593094,"about_ca_topic_score_gemma":0.00032481467,"teacher_disagreement_score":0.0046222797,"about_ca_system_score_codex":0.00097514235,"about_ca_system_score_gemma":0.0008641309,"threshold_uncertainty_score":0.018321514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74120164,0.00078630936,0.0262194,0.0057556294,0.00055529526,0.00006325405,0.00029394368,0.00036803004,0.22475643],"genre_scores_gemma":[0.9910875,0.00008387058,0.0028249382,0.00028348307,0.00006607961,0.000028789878,0.00010970619,0.000023809698,0.0054917713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995882,0.00006981098,0.000023308316,0.000056670786,0.00010610817,0.00015593231],"domain_scores_gemma":[0.9996012,0.00009658925,0.000044279343,0.000089602196,0.00006500899,0.00010328563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048983307,0.0005038408,0.00070571224,0.0011490679,0.002397365,0.0023306056,0.0010022933,0.0021397197,0.00957568],"category_scores_gemma":[0.0013228045,0.0002705132,0.0011209982,0.00046098192,0.0017827257,0.002511645,0.0017705526,0.0015149292,0.0005861614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003288363,0.000037714537,0.00030779841,0.000034234577,0.0000069679368,0.00036541405,0.00026023205,0.000610089,0.0014005008,0.9935928,0.0012533258,0.0020980483],"study_design_scores_gemma":[0.00006507282,0.000048976828,0.00063134416,0.00005194162,0.000020727437,0.0006173355,0.0005289006,0.0135319745,0.0017497719,0.9776474,0.005072606,0.000033929497],"about_ca_topic_score_codex":0.0013913123,"about_ca_topic_score_gemma":0.002563574,"teacher_disagreement_score":0.00957568,"about_ca_system_score_codex":0.0008884117,"about_ca_system_score_gemma":0.0008263088,"threshold_uncertainty_score":0.03203386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12164192,0.008439918,0.58533466,0.011888307,0.003429044,0.00008376266,0.0003969999,0.00024868155,0.2685367],"genre_scores_gemma":[0.8282873,0.0048483973,0.118620425,0.0021733951,0.0036462091,0.00023459172,0.00032262242,0.00020679401,0.041660275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872607,0.00058080844,0.00009585052,0.00023968883,0.00022532082,0.0001321775],"domain_scores_gemma":[0.9987281,0.0004500776,0.00014107523,0.00020077909,0.0002823269,0.00019766517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026300012,0.0010703222,0.0013980496,0.0040121144,0.0029744753,0.004622233,0.0014671114,0.0023525131,0.004776013],"category_scores_gemma":[0.004018188,0.00063120946,0.0019437891,0.0019627502,0.0065711965,0.013028317,0.006123989,0.0055235256,0.00069390924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006056267,0.000005517429,0.00001867359,0.0000066298867,0.000001614996,0.000014333987,0.000046127312,0.00008525549,0.00006567164,0.9988532,0.00017071005,0.0007262588],"study_design_scores_gemma":[0.000005911964,0.000006388737,0.000022799295,0.000007208874,0.0000026184991,0.0000457807,0.000031539992,0.00092790974,0.000059252085,0.9966923,0.0021926016,0.0000056222334],"about_ca_topic_score_codex":0.0006112121,"about_ca_topic_score_gemma":0.000564633,"teacher_disagreement_score":0.004776013,"about_ca_system_score_codex":0.0016923025,"about_ca_system_score_gemma":0.0009398565,"threshold_uncertainty_score":0.015977323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2271155,0.003381085,0.47046056,0.0025985856,0.0014001229,0.00019211204,0.0016604244,0.0011481133,0.29204354],"genre_scores_gemma":[0.90156394,0.0007609219,0.063145354,0.0006690764,0.0005480135,0.00015693693,0.0012298449,0.00016496048,0.03176088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973423,0.0005397296,0.00027897544,0.00072640437,0.000769662,0.00034297584],"domain_scores_gemma":[0.9974661,0.00097584614,0.000226497,0.00062803854,0.0004822395,0.00022117341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017213837,0.0004301323,0.0006572755,0.0018766507,0.002495493,0.0023617325,0.0007883211,0.0009703171,0.011063324],"category_scores_gemma":[0.0038541516,0.00040659672,0.0010236665,0.0010482376,0.0038732637,0.00903329,0.0033655935,0.0024531155,0.0020256205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004052566,0.000024655043,0.00016395889,0.000030504087,0.000008016803,0.000077457036,0.00028808083,0.00018252565,0.0009253598,0.9875544,0.0010539197,0.009650561],"study_design_scores_gemma":[0.000009428487,0.00001892021,0.0002352287,0.000016749129,0.000007787666,0.00013853185,0.00009849401,0.00094243523,0.0009819347,0.9893668,0.008173914,0.000009715615],"about_ca_topic_score_codex":0.00074035925,"about_ca_topic_score_gemma":0.0010004458,"teacher_disagreement_score":0.011063324,"about_ca_system_score_codex":0.0010572935,"about_ca_system_score_gemma":0.00071211916,"threshold_uncertainty_score":0.03701055},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006452012,0.015595803,0.05342993,0.004702205,0.0010763983,0.000029689034,0.00021477559,0.0001783783,0.9183208],"genre_scores_gemma":[0.3978927,0.02029933,0.043924876,0.0030016976,0.0035107108,0.00012291504,0.00060371915,0.00035378995,0.5302902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999567,0.00010717958,0.000017105594,0.00009385817,0.0001703872,0.000044428616],"domain_scores_gemma":[0.99960345,0.0002503931,0.000017000895,0.000050102502,0.000055585704,0.000023544279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005666013,0.0005503451,0.0006396978,0.0011120108,0.0013832597,0.0029591925,0.0007091745,0.00083716935,0.011622181],"category_scores_gemma":[0.001362509,0.0004958776,0.00048725182,0.0013315971,0.0043928456,0.0058091544,0.0011780239,0.0037567,0.0026000908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004247764,0.0000039353567,0.00001084053,0.00002102893,0.0000013004636,0.0000073191663,0.00005933919,0.00014121854,0.00009181311,0.9894135,0.004545712,0.0056996755],"study_design_scores_gemma":[0.000003218872,0.0000029934938,0.00005665658,0.000021428215,0.0000024534568,0.00003123173,0.000021727956,0.00042476717,0.00013480772,0.95135456,0.04794215,0.000003997456],"about_ca_topic_score_codex":0.0019340328,"about_ca_topic_score_gemma":0.0021732769,"teacher_disagreement_score":0.011622181,"about_ca_system_score_codex":0.0024506839,"about_ca_system_score_gemma":0.000729143,"threshold_uncertainty_score":0.03888011},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44851092,0.0013076056,0.36875084,0.0015181046,0.00045530262,0.000068471956,0.00036318484,0.00028276772,0.17874277],"genre_scores_gemma":[0.95246416,0.00030908166,0.036883447,0.00027826728,0.00014589001,0.000049806906,0.00011881233,0.00004427113,0.009706136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923575,0.00018261521,0.000032144322,0.00016482435,0.0002735881,0.00011098674],"domain_scores_gemma":[0.99806195,0.00064334617,0.0002472796,0.00021963652,0.00047544757,0.00035233403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023696,0.00026448158,0.00032169375,0.00089005544,0.0010942667,0.0020971578,0.00046711785,0.00059370167,0.006559916],"category_scores_gemma":[0.002725798,0.00017706462,0.0002727263,0.0008182022,0.0027425808,0.0032448885,0.0019436337,0.0013852478,0.0005418171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003544093,0.0000080386335,0.00018281284,0.00002667986,0.0000025265608,0.00007964124,0.00014665921,0.0010615735,0.0021110089,0.9907376,0.00039448089,0.00521358],"study_design_scores_gemma":[0.00001769253,0.00005280825,0.00023759146,0.000021707792,0.000003104,0.0003756937,0.00024802063,0.011418337,0.0028625445,0.9730059,0.011736611,0.000019980675],"about_ca_topic_score_codex":0.0005323683,"about_ca_topic_score_gemma":0.00048238187,"teacher_disagreement_score":0.006559916,"about_ca_system_score_codex":0.00075331156,"about_ca_system_score_gemma":0.0005324252,"threshold_uncertainty_score":0.02194506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00370133,0.09671371,0.15766244,0.0053677317,0.002435592,0.00007291378,0.00035694416,0.0005070737,0.73318225],"genre_scores_gemma":[0.1543103,0.082770824,0.11215021,0.00218995,0.0050466917,0.00025468014,0.001041995,0.0004003366,0.641835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995838,0.00008736393,0.000021183829,0.00006218951,0.00021848617,0.000026975853],"domain_scores_gemma":[0.9996935,0.000169526,0.00001351429,0.000054528125,0.000053946846,0.000014998066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047861013,0.0006678849,0.000717381,0.0014435112,0.0011106313,0.003878759,0.00086920016,0.00074935827,0.023134567],"category_scores_gemma":[0.0015798069,0.00036488302,0.00042771216,0.0031078293,0.0024465465,0.0054636025,0.0008769238,0.0017262733,0.0058496697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035809007,0.0000062715044,0.000023257351,0.000085442705,0.000004006993,0.000021460502,0.00025154304,0.00028697902,0.00017372078,0.93694353,0.022524212,0.03967602],"study_design_scores_gemma":[0.000002450781,0.000005427266,0.00008822745,0.00007213465,0.00000614386,0.00007865288,0.000119813565,0.0012065056,0.00015375772,0.7710205,0.22724062,0.0000057077655],"about_ca_topic_score_codex":0.0026609444,"about_ca_topic_score_gemma":0.0029096608,"teacher_disagreement_score":0.023134567,"about_ca_system_score_codex":0.0013573595,"about_ca_system_score_gemma":0.00077676214,"threshold_uncertainty_score":0.07739282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1081292,0.0016974042,0.51673406,0.0010706971,0.0012801541,0.0011296689,0.1287609,0.105103664,0.1360943],"genre_scores_gemma":[0.4332446,0.0015756983,0.21344243,0.0005692149,0.0003783353,0.0033240034,0.2326883,0.013472444,0.10130499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991885,0.00011735448,0.000070652924,0.00027186977,0.00019762639,0.00015401671],"domain_scores_gemma":[0.9987382,0.0003392189,0.00017380484,0.00041469443,0.00020754119,0.00012653244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109145,0.0013964468,0.0010118285,0.0011691961,0.0012597152,0.002080623,0.0021808115,0.0005539348,0.04739011],"category_scores_gemma":[0.0022601495,0.00066120573,0.00066952466,0.0015915238,0.0006863467,0.0017932422,0.002219772,0.001125365,0.024847666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044564907,0.00056900264,0.006949054,0.0013666995,0.00016075888,0.0013200815,0.0017044394,0.0055089756,0.1166513,0.36054265,0.26879933,0.23197122],"study_design_scores_gemma":[0.0006196818,0.0005005223,0.004641444,0.00026043798,0.00011533667,0.0008957557,0.0004487468,0.02951093,0.03807506,0.122239724,0.80255723,0.00013524867],"about_ca_topic_score_codex":0.0010376178,"about_ca_topic_score_gemma":0.0013383005,"teacher_disagreement_score":0.04739011,"about_ca_system_score_codex":0.00080905476,"about_ca_system_score_gemma":0.0005564987,"threshold_uncertainty_score":0.15853572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90289795,0.00026819517,0.062357634,0.00039974347,0.00003191666,0.000020919904,0.00020187232,0.0001652739,0.033656407],"genre_scores_gemma":[0.99367285,0.00007718196,0.0033921967,0.000034827808,0.000027578928,0.000014411769,0.000113752394,0.00002645187,0.0026406818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993069,0.00010383647,0.000026295691,0.00018687427,0.0002599247,0.00011612321],"domain_scores_gemma":[0.99886703,0.00045917387,0.00014732142,0.00015807844,0.00017886532,0.00018953627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039884736,0.0002991197,0.000373356,0.0015693391,0.0007926694,0.0017957063,0.00047467803,0.00048191103,0.0051659467],"category_scores_gemma":[0.0018714793,0.00024075463,0.00033068258,0.0005971933,0.001868351,0.0032533586,0.0014067447,0.0011330778,0.0003295571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050251318,0.000028685796,0.00071163435,0.000036096768,0.000007956981,0.00011833439,0.00050571986,0.002045303,0.0070449784,0.98375124,0.000288766,0.0054109693],"study_design_scores_gemma":[0.000018254552,0.000027225235,0.0016254628,0.00001420796,0.000009836762,0.00017449468,0.00035191508,0.011304602,0.0056339013,0.97824335,0.0025824476,0.000014423171],"about_ca_topic_score_codex":0.00058556005,"about_ca_topic_score_gemma":0.0005078633,"teacher_disagreement_score":0.0051659467,"about_ca_system_score_codex":0.00084910565,"about_ca_system_score_gemma":0.00015139664,"threshold_uncertainty_score":0.01728177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5364883,0.004028417,0.31462356,0.0014460799,0.00038928122,0.00006313646,0.0003480424,0.0005176071,0.14209555],"genre_scores_gemma":[0.9724343,0.0006097412,0.019879919,0.0001583138,0.00008595773,0.000040453742,0.00015500703,0.000056741377,0.006579602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900705,0.00027292414,0.00010163311,0.0001943888,0.00021052985,0.00021347967],"domain_scores_gemma":[0.9991948,0.00028877024,0.00009917232,0.00015287712,0.00014119124,0.00012316986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012681307,0.00057139545,0.00040848332,0.0022123642,0.0014555231,0.0023966385,0.00052360224,0.0006926964,0.0038241642],"category_scores_gemma":[0.0017925986,0.00039017198,0.0006861175,0.0011804502,0.0049576634,0.004972587,0.005610023,0.0013497479,0.00040847942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017241777,0.000005566772,0.0007458836,0.000046195277,0.000005194516,0.00034784086,0.0011797446,0.00037512055,0.001298649,0.9894896,0.00035309693,0.0061358726],"study_design_scores_gemma":[0.000011550884,0.000047546382,0.0011276925,0.00006222734,0.000022105576,0.000890941,0.0010877919,0.0022854216,0.0024513805,0.96744466,0.024537906,0.000030874206],"about_ca_topic_score_codex":0.0007464478,"about_ca_topic_score_gemma":0.0005164342,"teacher_disagreement_score":0.0038241642,"about_ca_system_score_codex":0.0010101214,"about_ca_system_score_gemma":0.00033742664,"threshold_uncertainty_score":0.012793124},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02592402,0.0038312569,0.46965432,0.0036183228,0.0010846064,0.00009502294,0.00042747584,0.0005365708,0.49482846],"genre_scores_gemma":[0.6176274,0.0044209007,0.25197124,0.0022708199,0.0014348027,0.00027852558,0.0010164339,0.00036365163,0.12061619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994716,0.00015949027,0.00003522687,0.00014630934,0.00014456437,0.000042803014],"domain_scores_gemma":[0.999445,0.0002330441,0.00005010311,0.000112062284,0.00010751373,0.0000522843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005857018,0.00043885768,0.00028992083,0.0013865412,0.0015967793,0.0021682675,0.00062653446,0.0009220585,0.006356766],"category_scores_gemma":[0.0010112326,0.00037482957,0.0007308327,0.0010606535,0.006033379,0.0077444776,0.0016245077,0.0027329675,0.001401218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.9958e-7,0.0000012984049,0.000010682287,0.0000069199446,8.165729e-7,0.00001177459,0.00006824655,0.00006438823,0.0001261186,0.9979182,0.0005754479,0.0012151804],"study_design_scores_gemma":[0.0000019800898,0.0000063993834,0.00007017421,0.000013347181,0.0000027802148,0.00009710036,0.00005994344,0.00061410974,0.00019231557,0.9540627,0.044874813,0.0000043125247],"about_ca_topic_score_codex":0.0006486093,"about_ca_topic_score_gemma":0.0009773821,"teacher_disagreement_score":0.006356766,"about_ca_system_score_codex":0.0013195341,"about_ca_system_score_gemma":0.00062164484,"threshold_uncertainty_score":0.021265507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4040663,0.002089269,0.5375598,0.0049831113,0.00026179073,0.00015468606,0.0017388414,0.0024208236,0.046725396],"genre_scores_gemma":[0.9244896,0.00059849495,0.06302261,0.0006248549,0.00022046837,0.00009468292,0.0013224344,0.00023302005,0.009393885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694973,0.0005688788,0.00025169682,0.00079941197,0.000735405,0.00069492013],"domain_scores_gemma":[0.9913946,0.0063842745,0.00062013493,0.0006902924,0.0005109195,0.00039977778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029554695,0.00095611945,0.0011135966,0.0018811794,0.0018289307,0.005568401,0.0026180095,0.0020210557,0.005218527],"category_scores_gemma":[0.0067749154,0.0014640507,0.0058108866,0.002008512,0.005426128,0.012596893,0.004165637,0.0039715813,0.0005361512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002408565,0.00010133588,0.0011754343,0.00020770021,0.00009042358,0.00041638405,0.0007883873,0.0151645765,0.0024681198,0.96003675,0.0022147517,0.01709541],"study_design_scores_gemma":[0.000052553194,0.000029068833,0.00038766616,0.000036677542,0.000057263653,0.00014469691,0.00009967348,0.040247183,0.0025870006,0.9542456,0.0020813607,0.00003122544],"about_ca_topic_score_codex":0.008544004,"about_ca_topic_score_gemma":0.007947609,"teacher_disagreement_score":0.008544004,"about_ca_system_score_codex":0.0051843366,"about_ca_system_score_gemma":0.003665127,"threshold_uncertainty_score":0.03761518},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031077124,0.012871479,0.46496245,0.044831276,0.0010677299,0.00009750635,0.00093686435,0.0006460521,0.4435096],"genre_scores_gemma":[0.8868606,0.0050023464,0.06853316,0.004599408,0.0021282905,0.00018489595,0.0007581268,0.00022633604,0.031706765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964922,0.0013243661,0.00017964536,0.0007915799,0.0010041521,0.00020814262],"domain_scores_gemma":[0.9952252,0.0021984072,0.00039142027,0.00091301685,0.0009695795,0.00030243874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034681368,0.0005255145,0.00056530937,0.001754014,0.0019717491,0.004592593,0.0012122333,0.0014230196,0.010200192],"category_scores_gemma":[0.005100859,0.00038233676,0.0009102863,0.001355412,0.014472451,0.009361597,0.0040897904,0.0041573965,0.0014504995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002061905,0.0000018961493,0.000030848023,0.000014019134,0.0000019959753,0.000006044426,0.00006814651,0.00010611986,0.000062806816,0.99823403,0.000513143,0.000958826],"study_design_scores_gemma":[0.0000034288196,0.000003238135,0.000043254342,0.000012976785,0.0000024038131,0.000016557373,0.000034621036,0.0004038153,0.000081268976,0.9877649,0.011631357,0.0000022167912],"about_ca_topic_score_codex":0.0012196505,"about_ca_topic_score_gemma":0.0009352491,"teacher_disagreement_score":0.010200192,"about_ca_system_score_codex":0.004910641,"about_ca_system_score_gemma":0.0023562887,"threshold_uncertainty_score":0.03562939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5001477,0.0025772245,0.41551247,0.0017527413,0.0003169387,0.00012526361,0.00088919705,0.0011136275,0.07756486],"genre_scores_gemma":[0.9424519,0.0005477358,0.047018312,0.0003232208,0.00010158235,0.00013179639,0.0004981178,0.000100303376,0.008827072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516857,0.00091996393,0.00037079724,0.001391492,0.0014249128,0.0007242936],"domain_scores_gemma":[0.9888158,0.004926445,0.0010504603,0.001904265,0.002054449,0.0012484808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030467224,0.00046175724,0.0007371201,0.0014853956,0.0018303955,0.00578319,0.0012264188,0.001041511,0.0046626767],"category_scores_gemma":[0.009631923,0.0009561422,0.00084463315,0.0017374197,0.0070092496,0.010831913,0.0058237324,0.002177681,0.00062899286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112257345,0.000029475614,0.0011969624,0.00017866828,0.000046841637,0.00042704577,0.0006741379,0.0010426525,0.0035106912,0.977225,0.00083551,0.014720685],"study_design_scores_gemma":[0.000043769494,0.00009067876,0.0025622956,0.00007138605,0.000042319727,0.0013049156,0.0007677121,0.0051626316,0.0059487754,0.9618411,0.022108346,0.000055973178],"about_ca_topic_score_codex":0.00064057304,"about_ca_topic_score_gemma":0.0011254069,"teacher_disagreement_score":0.00578319,"about_ca_system_score_codex":0.0011930844,"about_ca_system_score_gemma":0.0012324431,"threshold_uncertainty_score":0.016112804},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030610065,0.07085042,0.07338809,0.0067616254,0.004257285,0.00002220994,0.0002849214,0.00053214113,0.84084225],"genre_scores_gemma":[0.10873385,0.106979564,0.05458039,0.002331308,0.010065509,0.00009208402,0.00094023324,0.00058526936,0.71569175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995128,0.00013143358,0.000018455985,0.0000492192,0.00025217934,0.000035991412],"domain_scores_gemma":[0.9994838,0.00023313942,0.000020284257,0.00009260556,0.0001279813,0.00004222775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059939356,0.000755542,0.0007050944,0.0018057551,0.0008229127,0.0035768677,0.00086399337,0.0007487968,0.022133209],"category_scores_gemma":[0.0014515007,0.00038588716,0.0006186494,0.0033415887,0.0018641558,0.006487003,0.0012400693,0.0032635506,0.008005065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003588471,0.000008398817,0.000016672295,0.00006094687,0.0000029328467,0.000009370853,0.00009118391,0.00033945328,0.00018639749,0.94026214,0.03361075,0.02540808],"study_design_scores_gemma":[0.0000026573584,0.000004727415,0.00004838491,0.000044300676,0.0000027449198,0.000041618852,0.00003252312,0.0011838947,0.00008972808,0.77821636,0.22032844,0.000004591504],"about_ca_topic_score_codex":0.0010055879,"about_ca_topic_score_gemma":0.0012014718,"teacher_disagreement_score":0.022133209,"about_ca_system_score_codex":0.0018255466,"about_ca_system_score_gemma":0.0012335024,"threshold_uncertainty_score":0.07404292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013417019,0.0005417505,0.9774514,0.00028104283,0.00018695027,0.000089590976,0.0005721854,0.001294052,0.00616601],"genre_scores_gemma":[0.2555548,0.00092826894,0.71357006,0.0003093138,0.00051494665,0.00024208183,0.0036604533,0.0010132303,0.024206916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981008,0.0006929295,0.000083152125,0.00029828202,0.00060019887,0.00022470547],"domain_scores_gemma":[0.997004,0.0014776075,0.00018496871,0.0005009221,0.0005899859,0.00024254437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019156501,0.001102191,0.0020293253,0.0046331077,0.0013399337,0.0027508317,0.002108269,0.0012720217,0.009346309],"category_scores_gemma":[0.006720029,0.00048448064,0.0011598367,0.0034608655,0.0007529699,0.0038847295,0.0016123556,0.0018745083,0.0024825411],"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.00046018363,0.0003845682,0.0026183764,0.000667087,0.0001877284,0.00015439348,0.00013581417,0.06456458,0.004157018,0.13869125,0.03998463,0.74799436],"study_design_scores_gemma":[0.00010627819,0.00016694189,0.0012263539,0.00009788284,0.00013573508,0.00021329356,0.00010731981,0.7301051,0.004282682,0.24854317,0.01495211,0.00006314146],"about_ca_topic_score_codex":0.0027561907,"about_ca_topic_score_gemma":0.005337195,"teacher_disagreement_score":0.009346309,"about_ca_system_score_codex":0.0008388195,"about_ca_system_score_gemma":0.0017280648,"threshold_uncertainty_score":0.03126651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24252428,0.001240023,0.5656587,0.0018523606,0.00037809566,0.00017925746,0.0006814444,0.00033671764,0.18714912],"genre_scores_gemma":[0.840185,0.0012487298,0.1386696,0.0004521347,0.0003722118,0.00020555113,0.00059075694,0.00015566785,0.018120332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910307,0.00017026167,0.00007575994,0.00020124043,0.00028317404,0.00016648833],"domain_scores_gemma":[0.99865496,0.00045842186,0.00017747683,0.00014503012,0.00035658578,0.00020748036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092812703,0.00050574937,0.0004752614,0.0017582163,0.0010710756,0.0024632895,0.00055792846,0.00045864744,0.007169316],"category_scores_gemma":[0.003858586,0.00031635817,0.00069047336,0.0014168358,0.00294739,0.003913747,0.0025676214,0.0022052126,0.00096580974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029795036,0.000010433228,0.00024666314,0.000029067582,0.0000034131895,0.000055472352,0.0002640123,0.0010166733,0.0016702508,0.98368526,0.0005837256,0.012405303],"study_design_scores_gemma":[0.000015952088,0.000028205119,0.00028962392,0.000014476913,0.0000034086838,0.00010212505,0.00014515228,0.0054921713,0.0017268169,0.98699284,0.005172629,0.000016650642],"about_ca_topic_score_codex":0.0017924751,"about_ca_topic_score_gemma":0.0020299493,"teacher_disagreement_score":0.007169316,"about_ca_system_score_codex":0.0009858599,"about_ca_system_score_gemma":0.0008058509,"threshold_uncertainty_score":0.023983717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5747944,0.00140076,0.15857665,0.0019727414,0.00063413364,0.00015994321,0.00067420286,0.0003857531,0.26140139],"genre_scores_gemma":[0.9577178,0.000432325,0.019348232,0.00032306017,0.00032359333,0.00007137789,0.0003097931,0.00008032277,0.021393498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00015039869,0.000041264764,0.00010874349,0.00020817302,0.00016124548],"domain_scores_gemma":[0.999308,0.00013994248,0.00012691664,0.00009196349,0.00015581459,0.00017745337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007673319,0.0003791322,0.00041022996,0.0012055305,0.0012059198,0.0028638656,0.0009143401,0.0008067425,0.009487491],"category_scores_gemma":[0.0016454956,0.0003079374,0.00062750437,0.0006840315,0.0021301128,0.0046012285,0.001930926,0.0016051526,0.0014512249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012964706,0.000007825846,0.00005290758,0.000007761807,0.0000017673456,0.00003113437,0.00008695402,0.00012357056,0.00054540555,0.99787843,0.0002305304,0.0010207929],"study_design_scores_gemma":[0.000015114902,0.000020606278,0.000113309245,0.0000061949554,0.0000028791803,0.00009830208,0.00006102277,0.0013806571,0.000555222,0.99562496,0.0021139276,0.00000779676],"about_ca_topic_score_codex":0.00039937964,"about_ca_topic_score_gemma":0.00037183642,"teacher_disagreement_score":0.009487491,"about_ca_system_score_codex":0.001103804,"about_ca_system_score_gemma":0.00053898135,"threshold_uncertainty_score":0.031738758},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144484695,0.021228323,0.3102607,0.10865406,0.020138469,0.00011770792,0.00071738294,0.0005366375,0.5238983],"genre_scores_gemma":[0.57800764,0.022668747,0.24050146,0.031748258,0.02001526,0.00044920432,0.00079249777,0.0007222831,0.105094686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974952,0.0008109047,0.00017204606,0.00049433694,0.0008229809,0.00020453763],"domain_scores_gemma":[0.99129325,0.005905239,0.0003214989,0.0011957922,0.000778626,0.00050551095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040010265,0.00077584514,0.0010160964,0.0018100507,0.0041975095,0.005598838,0.0022683125,0.002467288,0.009231682],"category_scores_gemma":[0.010957159,0.0005470114,0.0013837974,0.0020756135,0.021140195,0.026347272,0.0065674344,0.012012255,0.0013749675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086261025,0.0000057745974,0.00007251749,0.00002037135,0.0000032855314,0.000038443257,0.0002743191,0.00004232022,0.00014028337,0.99183977,0.0050440747,0.0025101893],"study_design_scores_gemma":[0.0000062458175,0.000009998403,0.00023692843,0.000019473828,0.0000051211155,0.0000790817,0.0001318748,0.0001528003,0.00009241338,0.9600341,0.039220627,0.000011415062],"about_ca_topic_score_codex":0.0063180756,"about_ca_topic_score_gemma":0.011506745,"teacher_disagreement_score":0.009231682,"about_ca_system_score_codex":0.0020286774,"about_ca_system_score_gemma":0.0016884345,"threshold_uncertainty_score":0.030883074},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09341645,0.006468449,0.21101877,0.015296152,0.0030074,0.00007661091,0.000761275,0.00033773028,0.6696171],"genre_scores_gemma":[0.8405291,0.0069631846,0.07078716,0.0028420724,0.003451327,0.00015030305,0.00081454235,0.0001846729,0.07427765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994276,0.00013140545,0.000027668055,0.000085421496,0.00025263376,0.00007532715],"domain_scores_gemma":[0.99936694,0.0003111203,0.0000680401,0.000060147595,0.00011719413,0.00007651385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050745346,0.00037889375,0.0002669717,0.0006239099,0.0011230215,0.0017634152,0.00044697596,0.00040182163,0.01014969],"category_scores_gemma":[0.0016593892,0.00022996012,0.00047840714,0.0010797653,0.003025937,0.0034261474,0.0015616147,0.0023656918,0.00123707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019467532,0.000005138728,0.00007569598,0.00003277253,0.000002217258,0.00005235632,0.00010703581,0.000319784,0.00047663655,0.99068743,0.0029656617,0.0052558584],"study_design_scores_gemma":[0.000009819712,0.000015753121,0.00017736094,0.000016268532,0.0000033208144,0.000098217126,0.00017595301,0.001061221,0.0009911053,0.95866126,0.0387837,0.000005973477],"about_ca_topic_score_codex":0.0018722275,"about_ca_topic_score_gemma":0.0013757573,"teacher_disagreement_score":0.01014969,"about_ca_system_score_codex":0.0013980464,"about_ca_system_score_gemma":0.00062358764,"threshold_uncertainty_score":0.033954084},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011127798,0.025972249,0.035055272,0.008659505,0.0039214734,0.000029347184,0.00093465374,0.00037142372,0.9139282],"genre_scores_gemma":[0.4959558,0.018455245,0.020979494,0.0039953603,0.0066140075,0.00013965166,0.0014814405,0.0005226527,0.45185643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996208,0.00009724052,0.000014044729,0.00009238052,0.00013004652,0.000045509612],"domain_scores_gemma":[0.9997223,0.00006592049,0.000030985248,0.000053339973,0.00008634959,0.00004104667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004420101,0.00061252393,0.0005828661,0.0013936423,0.0015315447,0.003397274,0.0005355314,0.00072325807,0.029415395],"category_scores_gemma":[0.0009451137,0.0002382878,0.00048361113,0.0012213476,0.0020746575,0.0034649675,0.0013264586,0.0026619898,0.008112939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010020361,0.000007791163,0.00007164511,0.000039654733,0.0000045671904,0.00001230334,0.00008153923,0.00009850414,0.00014736387,0.97317106,0.017933156,0.008422381],"study_design_scores_gemma":[0.000005246251,0.000006058783,0.00017810447,0.000024322771,0.000004977103,0.00007860612,0.00006297702,0.00034541238,0.00014031725,0.92898613,0.07016391,0.000003888137],"about_ca_topic_score_codex":0.0013000891,"about_ca_topic_score_gemma":0.0009257539,"teacher_disagreement_score":0.029415395,"about_ca_system_score_codex":0.0013941759,"about_ca_system_score_gemma":0.00064158026,"threshold_uncertainty_score":0.09840429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04219497,0.03191027,0.35905272,0.031609852,0.0014017476,0.000088561486,0.0011927104,0.00042271003,0.5321264],"genre_scores_gemma":[0.7830435,0.020374116,0.08985331,0.003261018,0.003537645,0.00021744773,0.0018979908,0.000421435,0.09739358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.00046548698,0.000070867456,0.00013566406,0.00044105266,0.00008990016],"domain_scores_gemma":[0.9956222,0.00324278,0.00014575737,0.00045934343,0.00042611637,0.00010380513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025931394,0.0008775653,0.0010080741,0.0016454324,0.0011405515,0.0034327882,0.0014314442,0.0010835954,0.006477035],"category_scores_gemma":[0.005889053,0.00065476116,0.00088591845,0.0015728178,0.0070122997,0.011948594,0.0019665866,0.0055050906,0.0008891183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043492087,0.0000034863517,0.000021952515,0.000029559757,0.000002699465,0.000010359048,0.000105512154,0.0005223607,0.000081168364,0.9942768,0.0018969832,0.003044903],"study_design_scores_gemma":[0.0000021014353,0.0000018767303,0.000025185393,0.00001410874,0.0000015253985,0.000014520149,0.000018722532,0.00067750283,0.000052286872,0.9927039,0.0064859246,0.0000023539899],"about_ca_topic_score_codex":0.001833942,"about_ca_topic_score_gemma":0.0015331556,"teacher_disagreement_score":0.006477035,"about_ca_system_score_codex":0.0031504072,"about_ca_system_score_gemma":0.0010503333,"threshold_uncertainty_score":0.022857904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18529761,0.0012954687,0.53127944,0.004654964,0.0004528977,0.00015197265,0.00075802556,0.0007812135,0.27532834],"genre_scores_gemma":[0.92365956,0.00026155787,0.055568263,0.00058706576,0.0001370104,0.00007756717,0.0002647839,0.00007268314,0.019371439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991252,0.00019944108,0.000066195134,0.00021088593,0.00025430493,0.00014402527],"domain_scores_gemma":[0.99888486,0.00042693887,0.00011962382,0.00013511286,0.0002839596,0.00014942515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011350423,0.00035882965,0.0002953046,0.0013809142,0.0013998282,0.0024802515,0.000542605,0.00061742275,0.006671292],"category_scores_gemma":[0.0021690042,0.0003138674,0.00055374496,0.0006303843,0.002932967,0.004796954,0.0013193061,0.0018731545,0.0005868915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021605616,0.000006472117,0.0000812121,0.000011212534,0.0000017734834,0.0000578188,0.00024247976,0.00015445928,0.00084969494,0.9946636,0.00049593125,0.0034135617],"study_design_scores_gemma":[0.000017058217,0.00003393364,0.0004257354,0.000018434273,0.000008938971,0.00025957287,0.00026016394,0.0039307475,0.0029497906,0.9725625,0.019509483,0.000023637975],"about_ca_topic_score_codex":0.002335735,"about_ca_topic_score_gemma":0.0019726595,"teacher_disagreement_score":0.006671292,"about_ca_system_score_codex":0.0022657209,"about_ca_system_score_gemma":0.0006417692,"threshold_uncertainty_score":0.022317648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11559223,0.0016703709,0.77363247,0.0048659714,0.000858569,0.00010949333,0.00086861703,0.00069878495,0.101703465],"genre_scores_gemma":[0.86723775,0.0012019733,0.11171211,0.001068461,0.001521857,0.0002755689,0.0007495942,0.0002337093,0.015998952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719846,0.00050726155,0.00019087965,0.00068349915,0.0010210006,0.00039889108],"domain_scores_gemma":[0.9951892,0.0024176787,0.00034704382,0.00087505084,0.00067299977,0.000498009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035292916,0.0005553021,0.00085529935,0.0012748514,0.0027885444,0.00589887,0.0014849409,0.0013188074,0.007192109],"category_scores_gemma":[0.006770665,0.00053991535,0.0016444856,0.0015111509,0.009788025,0.013624136,0.005177458,0.00426654,0.0014454954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008830231,0.000010888065,0.00006943165,0.000015127572,0.0000026472412,0.000026810567,0.00017027676,0.00030895596,0.00031933896,0.995691,0.00046551717,0.0029110326],"study_design_scores_gemma":[0.0000098874125,0.000011384576,0.000044301833,0.00000686046,0.000002740205,0.00005922397,0.00003534446,0.0014103162,0.00053723773,0.9927993,0.0050773225,0.0000061478468],"about_ca_topic_score_codex":0.001047421,"about_ca_topic_score_gemma":0.00067614665,"teacher_disagreement_score":0.007192109,"about_ca_system_score_codex":0.0025970812,"about_ca_system_score_gemma":0.0017367897,"threshold_uncertainty_score":0.02406001},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44669315,0.0033407973,0.23395656,0.023204774,0.0011706875,0.00011252395,0.0008645364,0.00070985814,0.2899471],"genre_scores_gemma":[0.97629243,0.00036848223,0.012444148,0.00058607763,0.00021995735,0.00006194941,0.00016304693,0.00008190231,0.009781954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977701,0.000818579,0.00012915624,0.0003576332,0.0006517868,0.0002726977],"domain_scores_gemma":[0.9882357,0.008406144,0.0005669428,0.0013944563,0.0007694621,0.00062734325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032277743,0.0005826487,0.0013027932,0.0020302788,0.0039863936,0.007602681,0.0017359209,0.0030082546,0.011705486],"category_scores_gemma":[0.017612943,0.001171991,0.0010500161,0.0018444721,0.011006889,0.01755539,0.0049419254,0.0070519955,0.0009852045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025370822,0.0000050108465,0.00005477971,0.000015326685,0.0000026994444,0.000036561833,0.0002368144,0.00017594508,0.00013434303,0.99854904,0.0003584632,0.00040572666],"study_design_scores_gemma":[0.000009378573,0.000001908732,0.000036700956,0.000004518367,0.00000281996,0.000040651463,0.00009370524,0.0005477979,0.000087592125,0.9983266,0.00084470864,0.0000036271006],"about_ca_topic_score_codex":0.0010777736,"about_ca_topic_score_gemma":0.0013225935,"teacher_disagreement_score":0.011705486,"about_ca_system_score_codex":0.0024177628,"about_ca_system_score_gemma":0.00076309993,"threshold_uncertainty_score":0.03915876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012824781,0.010827568,0.016060222,0.0022387835,0.0017812172,0.00001472337,0.00006785939,0.000167883,0.9675592],"genre_scores_gemma":[0.075091146,0.018236643,0.017551031,0.0016126807,0.004397379,0.00007146938,0.00026118685,0.00033332242,0.88244504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996611,0.00010379395,0.000008358252,0.000049594993,0.00014227706,0.000034887486],"domain_scores_gemma":[0.9997589,0.00009646123,0.00001103654,0.000058212114,0.000045744797,0.00002961745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041077318,0.0008564542,0.00055713643,0.0015971496,0.0012650182,0.0027280087,0.0007486855,0.0009777034,0.039957996],"category_scores_gemma":[0.00107329,0.0003192325,0.0004673207,0.0013123514,0.0023533246,0.003790957,0.0018329517,0.0022967544,0.011694162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036359775,0.0000069576904,0.000017430235,0.000034873723,0.0000019123288,0.0000135099,0.00010247563,0.00013760754,0.00018141897,0.9467692,0.028745225,0.023985641],"study_design_scores_gemma":[0.0000018285845,0.000004718984,0.00005021362,0.000037131173,0.0000015241081,0.00006556383,0.00004368047,0.0003652711,0.00015387715,0.67003465,0.32923803,0.0000035211876],"about_ca_topic_score_codex":0.0005980021,"about_ca_topic_score_gemma":0.0010641863,"teacher_disagreement_score":0.039957996,"about_ca_system_score_codex":0.0014713829,"about_ca_system_score_gemma":0.00061150896,"threshold_uncertainty_score":0.13367283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.309932,0.0027157536,0.44468567,0.004669879,0.00042352572,0.00019112187,0.00042238622,0.00070131174,0.23625854],"genre_scores_gemma":[0.93761176,0.0005119564,0.04692587,0.00065881544,0.00022685755,0.000079259145,0.00023002035,0.000054306784,0.013701081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984743,0.00046879755,0.00008332703,0.00024040483,0.0004961415,0.00023702804],"domain_scores_gemma":[0.99854064,0.0005053202,0.00018185284,0.00016869705,0.00030977104,0.00029378643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022100778,0.0003190095,0.00039195264,0.0016187755,0.0014176335,0.0026177894,0.001170238,0.00086521433,0.0055769836],"category_scores_gemma":[0.0029305874,0.00024156675,0.00078871934,0.00090312277,0.003948592,0.0054129194,0.002683626,0.0021963469,0.00059592084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008318905,0.000008766435,0.00009205076,0.000008231983,0.0000018664089,0.000022454062,0.0000883004,0.00022610853,0.0002761798,0.9979342,0.00023140521,0.0011020611],"study_design_scores_gemma":[0.000009333161,0.000010854279,0.000075165146,0.000009824539,0.0000039711044,0.00005753655,0.00009736586,0.004702676,0.00036725824,0.99112564,0.0035329054,0.000007390936],"about_ca_topic_score_codex":0.0008791454,"about_ca_topic_score_gemma":0.00069924723,"teacher_disagreement_score":0.0055769836,"about_ca_system_score_codex":0.001787092,"about_ca_system_score_gemma":0.00076695066,"threshold_uncertainty_score":0.01865691},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041892245,0.0043194336,0.081909604,0.00950415,0.0038631554,0.000042180865,0.0011932516,0.0003427501,0.8569331],"genre_scores_gemma":[0.63232553,0.005578922,0.040435825,0.0037811948,0.0034711314,0.00014880813,0.0014300897,0.0002719661,0.31255656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996723,0.000092735005,0.000021331025,0.000055222776,0.000113699025,0.000044792687],"domain_scores_gemma":[0.9993594,0.0002263969,0.00006121901,0.000077735225,0.00019586703,0.00007931393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067972176,0.00032614399,0.00026736682,0.0010711756,0.0010817853,0.0022405374,0.00047596815,0.00045688153,0.024585066],"category_scores_gemma":[0.0016885985,0.00021904174,0.00046811654,0.001025759,0.0017712201,0.002786405,0.001415556,0.002007997,0.0030894366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001173713,0.0000047967246,0.00009177455,0.00002585092,0.000004135197,0.00004000823,0.00008711783,0.00016213181,0.00028738318,0.98883945,0.006568133,0.0038774277],"study_design_scores_gemma":[0.0000075864955,0.000013690965,0.0003376371,0.000024787447,0.000004831145,0.00011240555,0.00015169331,0.0005532109,0.00035592713,0.9540665,0.044366017,0.000005815836],"about_ca_topic_score_codex":0.0014628557,"about_ca_topic_score_gemma":0.0013383694,"teacher_disagreement_score":0.024585066,"about_ca_system_score_codex":0.00092241564,"about_ca_system_score_gemma":0.00064623746,"threshold_uncertainty_score":0.08224523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067049237,0.0032839235,0.8668613,0.010775469,0.0011421841,0.000041385712,0.00019746015,0.0005484003,0.11044493],"genre_scores_gemma":[0.454334,0.0055984915,0.49043688,0.004023565,0.0035125597,0.00020095732,0.00047523365,0.0009965615,0.04042176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733526,0.0011223188,0.00011747781,0.00041804498,0.00077031227,0.00023655519],"domain_scores_gemma":[0.99658465,0.0017977766,0.0001723386,0.0008657935,0.000435708,0.00014364015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044497442,0.000836262,0.000819303,0.002063915,0.0021088617,0.0067979214,0.0027096637,0.0021227368,0.009900896],"category_scores_gemma":[0.007734641,0.00079096225,0.0018432856,0.0020763632,0.012835145,0.023519712,0.0052364664,0.0062090405,0.0027835062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004062836,0.0000036543372,0.000014728482,0.000015029105,0.0000016024655,0.000020583886,0.00008081691,0.00021151296,0.000093623814,0.99523383,0.0009258166,0.003394763],"study_design_scores_gemma":[0.000005852826,0.0000046300365,0.000014810283,0.000014360437,0.0000026214823,0.00004619538,0.000034680303,0.0018306425,0.00018767922,0.9852196,0.012634107,0.000004954582],"about_ca_topic_score_codex":0.002177587,"about_ca_topic_score_gemma":0.0017313996,"teacher_disagreement_score":0.009900896,"about_ca_system_score_codex":0.0029430422,"about_ca_system_score_gemma":0.0016967715,"threshold_uncertainty_score":0.033121824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018693296,0.011029253,0.6836862,0.015951429,0.0024907375,0.000065105516,0.00031143037,0.0012645113,0.26650807],"genre_scores_gemma":[0.4377339,0.014717365,0.4161492,0.0066939844,0.0043517896,0.0002034712,0.00057771965,0.0010959371,0.11847673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.0005593659,0.00009775327,0.00026422396,0.00036500604,0.00010229],"domain_scores_gemma":[0.99648225,0.0025097588,0.000059525704,0.00053433585,0.00030673385,0.000107405824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034250943,0.0009077088,0.00080942764,0.0012294948,0.0018909122,0.0041943616,0.0021253393,0.001623729,0.0118930135],"category_scores_gemma":[0.006017538,0.0007652456,0.0013532947,0.0022555292,0.00729363,0.019634593,0.0024126894,0.007119598,0.0023214158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067571063,0.000009361293,0.000032877302,0.00004456706,0.0000037308528,0.000024156026,0.000117541575,0.0005192527,0.00012530864,0.9809717,0.0027829495,0.015361748],"study_design_scores_gemma":[0.0000027622411,0.0000028107106,0.000023161181,0.000019193092,0.0000047122962,0.000038026647,0.000022057136,0.0015848398,0.00019516388,0.9867269,0.011373489,0.0000069735934],"about_ca_topic_score_codex":0.0018472878,"about_ca_topic_score_gemma":0.0019310098,"teacher_disagreement_score":0.0118930135,"about_ca_system_score_codex":0.002034604,"about_ca_system_score_gemma":0.00089146005,"threshold_uncertainty_score":0.03978604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899092,0.0028797511,0.15910926,0.010548343,0.0004785179,0.00010030673,0.00048455532,0.0002540196,0.13623612],"genre_scores_gemma":[0.9800367,0.00057689357,0.0060866685,0.00035762947,0.00036572618,0.000069407564,0.00021259687,0.000037337526,0.012257129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681723,0.0014459167,0.0001762302,0.00048426184,0.00062423584,0.00045211968],"domain_scores_gemma":[0.9886901,0.008318572,0.0007717521,0.00081813097,0.0005587086,0.00084287697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043576253,0.0010247173,0.0016618741,0.0019844463,0.0027708302,0.0048452835,0.0019470508,0.0020419455,0.00852315],"category_scores_gemma":[0.010444652,0.0011180376,0.0013562203,0.0018478357,0.010374435,0.013663639,0.004352634,0.0052720183,0.0007082823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002226997,0.000020799032,0.000111647365,0.000013922614,0.000005840867,0.000032429696,0.000140799,0.00046502927,0.00013798093,0.99825567,0.00027536653,0.0005181697],"study_design_scores_gemma":[0.000019872374,0.0000056970825,0.00007240728,0.0000034762986,0.000002784396,0.00002314459,0.000030073283,0.0012194227,0.00007663796,0.99813783,0.00040340656,0.0000051210873],"about_ca_topic_score_codex":0.0013196598,"about_ca_topic_score_gemma":0.0014852465,"teacher_disagreement_score":0.00852315,"about_ca_system_score_codex":0.0025805507,"about_ca_system_score_gemma":0.0013033064,"threshold_uncertainty_score":0.028512716},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822295,0.0018479322,0.15688553,0.001934653,0.0003464772,0.000117837524,0.0016229037,0.0013889589,0.15362613],"genre_scores_gemma":[0.8604286,0.0012412812,0.06012573,0.00042212897,0.00041028648,0.0001610527,0.0020355477,0.0007056965,0.07446974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750465,0.00029109474,0.00013882699,0.0006009328,0.0010012998,0.00046325466],"domain_scores_gemma":[0.99202466,0.004011562,0.00059823424,0.0010519281,0.0016634178,0.00065013306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018330241,0.0009330871,0.001817167,0.0031952716,0.003103412,0.0075088926,0.0013275854,0.0015738185,0.008606096],"category_scores_gemma":[0.01061075,0.00091903826,0.0019372578,0.0024177008,0.0035602485,0.0037779321,0.002479718,0.003326509,0.0014211176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032427598,0.000051022264,0.0033554244,0.00009398304,0.000065688684,0.0010117049,0.00075411954,0.0032192925,0.008411605,0.95979214,0.0034360918,0.019484755],"study_design_scores_gemma":[0.00017888084,0.00009353243,0.008584082,0.00009300115,0.00018143392,0.0027344036,0.00063452794,0.023265194,0.018294599,0.9036456,0.04221877,0.000075973476],"about_ca_topic_score_codex":0.016884571,"about_ca_topic_score_gemma":0.015990064,"teacher_disagreement_score":0.016884571,"about_ca_system_score_codex":0.006454166,"about_ca_system_score_gemma":0.0023489927,"threshold_uncertainty_score":0.04682851},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24750973,0.004057254,0.35439956,0.0042768,0.0023146437,0.00027777764,0.003053812,0.00092821085,0.38318223],"genre_scores_gemma":[0.8953813,0.0014839952,0.051228106,0.0013242122,0.001006274,0.00021007723,0.0011296301,0.00017838224,0.04805794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987747,0.00021284238,0.00011515256,0.00023597619,0.00044138113,0.00022000395],"domain_scores_gemma":[0.99784267,0.0006072137,0.00045357188,0.000293732,0.0005222156,0.000280606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063615,0.0006274409,0.0005864165,0.0024297093,0.000974702,0.0031530736,0.00065287156,0.0006918883,0.016416617],"category_scores_gemma":[0.0035774526,0.00020484532,0.0006246,0.0014609979,0.0013009716,0.0035266127,0.0015594956,0.0014104996,0.0029040303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054904875,0.000021911896,0.0002547898,0.00008494253,0.000013478367,0.00009365777,0.000101026366,0.0006412761,0.0021249894,0.9789796,0.0035161544,0.014113203],"study_design_scores_gemma":[0.000013478127,0.000032750864,0.00043218056,0.000020132782,0.000010236226,0.0003648597,0.000039220125,0.00649933,0.0014996541,0.9811886,0.009875189,0.000024481731],"about_ca_topic_score_codex":0.0008753864,"about_ca_topic_score_gemma":0.0013390885,"teacher_disagreement_score":0.016416617,"about_ca_system_score_codex":0.0015729376,"about_ca_system_score_gemma":0.0006440731,"threshold_uncertainty_score":0.054919004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1720631,0.0018660306,0.79210204,0.0022236211,0.00019515524,0.00018803458,0.004311595,0.00061867974,0.02643174],"genre_scores_gemma":[0.83585966,0.002471899,0.13176994,0.0006504471,0.0008228806,0.00042690898,0.007723613,0.00041724116,0.019857485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811697,0.00061835296,0.00015941466,0.0005624195,0.0003898613,0.00015295229],"domain_scores_gemma":[0.9896774,0.0057553137,0.0017213026,0.0008841295,0.0011884392,0.0007734276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018101411,0.0010359589,0.0011484874,0.0024401706,0.0007969536,0.0035452012,0.001496766,0.0013462713,0.011051524],"category_scores_gemma":[0.011529182,0.00060222234,0.0014318335,0.0021317534,0.0020247109,0.0045252363,0.0018699203,0.002666645,0.0019670667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022064353,0.00015304549,0.0074784113,0.00049696147,0.00020860546,0.00042338533,0.0006034456,0.114336506,0.0030516775,0.7955754,0.01460016,0.062851794],"study_design_scores_gemma":[0.000026276897,0.00017457052,0.0024442046,0.0000795585,0.000042437707,0.0007231011,0.00017347666,0.34028405,0.000922749,0.64387536,0.011222238,0.000031912976],"about_ca_topic_score_codex":0.0008560361,"about_ca_topic_score_gemma":0.00063663797,"teacher_disagreement_score":0.011051524,"about_ca_system_score_codex":0.0012299364,"about_ca_system_score_gemma":0.00053278304,"threshold_uncertainty_score":0.036971092},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18571097,0.0069822944,0.2964593,0.0071267877,0.001303475,0.00016316802,0.0026097125,0.0013260305,0.4983183],"genre_scores_gemma":[0.874843,0.00178578,0.03531794,0.0011974716,0.0013715483,0.00011679103,0.0011881749,0.00021828843,0.08396109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951625,0.00010134877,0.00002143912,0.000089191344,0.00017927182,0.000092473805],"domain_scores_gemma":[0.99867415,0.0003411493,0.00022312911,0.00017942066,0.00035938635,0.0002227273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000429259,0.00029138062,0.00041208178,0.0015652574,0.0011662745,0.0024038912,0.00061449595,0.00059732114,0.02239312],"category_scores_gemma":[0.0028947322,0.0002254503,0.00033665245,0.0011634529,0.001894842,0.0032287869,0.0012702249,0.0016716851,0.0065632295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027665405,0.000017644348,0.0001747939,0.000032565746,0.0000048276497,0.00007179159,0.00010612831,0.00028921667,0.0009059142,0.98600185,0.0050170976,0.007350411],"study_design_scores_gemma":[0.0000120487075,0.000021467307,0.00026165205,0.000011035974,0.0000048633847,0.00028587558,0.00008853242,0.0035299307,0.0008951513,0.9788552,0.016019033,0.000015182209],"about_ca_topic_score_codex":0.0011250692,"about_ca_topic_score_gemma":0.0011749761,"teacher_disagreement_score":0.02239312,"about_ca_system_score_codex":0.00072536856,"about_ca_system_score_gemma":0.00058069604,"threshold_uncertainty_score":0.07491243},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33968568,0.004585264,0.28506607,0.032845013,0.0015011578,0.00039855266,0.000686225,0.0014081511,0.33382392],"genre_scores_gemma":[0.84966797,0.0021287529,0.099318765,0.004474656,0.0011186325,0.00021446824,0.0013210349,0.0005821679,0.04117359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985196,0.00039467582,0.00008002391,0.00039742986,0.00034907035,0.00025919487],"domain_scores_gemma":[0.9967098,0.002390674,0.00011958827,0.00032147375,0.00025924004,0.00019924412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411206,0.0006832455,0.0012649562,0.0015911562,0.0021953501,0.004630911,0.0017446355,0.0019353402,0.015268204],"category_scores_gemma":[0.0066126296,0.0007110518,0.0027718144,0.0015630828,0.004561911,0.0073222136,0.0027133967,0.006203123,0.0015809867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001628275,0.000085717045,0.00047169699,0.00026240977,0.000034975987,0.00016495897,0.00025443087,0.0017812994,0.002072093,0.9743344,0.0045452123,0.015830014],"study_design_scores_gemma":[0.000030037194,0.00003225331,0.00027205647,0.000039511437,0.000022801178,0.00013699403,0.00015645716,0.004081433,0.0010903421,0.98864704,0.0054782564,0.00001282214],"about_ca_topic_score_codex":0.0014832112,"about_ca_topic_score_gemma":0.0013964063,"teacher_disagreement_score":0.015268204,"about_ca_system_score_codex":0.0020581784,"about_ca_system_score_gemma":0.0017025401,"threshold_uncertainty_score":0.051077247},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04295195,0.0017655417,0.32307968,0.021524271,0.0012177248,0.0001576252,0.0012495448,0.000797417,0.60725623],"genre_scores_gemma":[0.85556746,0.0006169032,0.028634524,0.0040842844,0.001116083,0.00037124014,0.0012489146,0.0005199743,0.10784064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908875,0.003709009,0.00051178,0.0017445281,0.002226162,0.00092101685],"domain_scores_gemma":[0.9699827,0.017970461,0.0010521371,0.005152106,0.004170554,0.0016720043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006384805,0.00084711605,0.001739756,0.0021779651,0.004550879,0.006138729,0.0025269997,0.0038953458,0.041296363],"category_scores_gemma":[0.04647301,0.00070268416,0.0015061169,0.001852346,0.0062146415,0.013964441,0.006708908,0.0073294574,0.0053301724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002926339,0.000008555214,0.000078438985,0.000025310794,0.0000077047425,0.000022101049,0.00014010291,0.0002758468,0.00008435193,0.9936056,0.0029716669,0.0027510396],"study_design_scores_gemma":[0.000008276056,0.0000029177388,0.000035294932,0.000009488808,0.0000034466718,0.00001810248,0.000047413283,0.0013115982,0.00006643631,0.9953548,0.0031388968,0.000003185034],"about_ca_topic_score_codex":0.0012918438,"about_ca_topic_score_gemma":0.00096818944,"teacher_disagreement_score":0.041296363,"about_ca_system_score_codex":0.003145934,"about_ca_system_score_gemma":0.0018152196,"threshold_uncertainty_score":0.1381501},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027122223,0.0034644427,0.034175172,0.0009312246,0.00087408646,0.000026750795,0.00029211573,0.00032183703,0.9572022],"genre_scores_gemma":[0.04273488,0.0031132682,0.0093715545,0.00038080697,0.0004985128,0.000043932367,0.00047774508,0.00042557958,0.94295377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996866,0.00004479538,0.000012160509,0.00006943882,0.00015349888,0.000033486638],"domain_scores_gemma":[0.99980146,0.00004366971,0.000009432958,0.000057285502,0.000065731474,0.000022346227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030231584,0.00081284787,0.00046951306,0.0015071055,0.0013044806,0.002843798,0.0006909164,0.00054122356,0.083963804],"category_scores_gemma":[0.00069620745,0.00041400362,0.0004449087,0.0015887952,0.0017284744,0.005121826,0.0015266213,0.0018386906,0.025638131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010032709,0.000008497565,0.000021722526,0.000045708595,0.0000036154938,0.00001878616,0.00014227169,0.00012746052,0.00037791533,0.9170698,0.03976363,0.042410526],"study_design_scores_gemma":[0.000004113603,0.000009046359,0.00004670203,0.000025141264,0.0000042794127,0.00010056966,0.00004394632,0.0001996637,0.00062342803,0.45213714,0.5467999,0.000006139553],"about_ca_topic_score_codex":0.0007375519,"about_ca_topic_score_gemma":0.0011962663,"teacher_disagreement_score":0.083963804,"about_ca_system_score_codex":0.0008822066,"about_ca_system_score_gemma":0.0006986021,"threshold_uncertainty_score":0.28088695},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15269744,0.0044015604,0.7118238,0.004902858,0.0005643965,0.00010790654,0.000808022,0.000739391,0.123954564],"genre_scores_gemma":[0.9180977,0.0012219576,0.056322668,0.0010050625,0.0007812209,0.0002301674,0.00062144845,0.00026103653,0.021458799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414754,0.0014501368,0.00045354044,0.0016610036,0.0016217531,0.00066601054],"domain_scores_gemma":[0.983023,0.009365607,0.0006604031,0.0034472253,0.0025672324,0.0009364967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041678967,0.00082328176,0.0018759276,0.0019497938,0.0036715916,0.0063706418,0.0023416837,0.0019474743,0.007248249],"category_scores_gemma":[0.01191428,0.0014237895,0.0020161862,0.002691164,0.013680532,0.019063873,0.0068012574,0.0064745867,0.0010197413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020976502,0.000012176212,0.000074987605,0.000023532322,0.000008592089,0.000026031865,0.00028474996,0.00024209691,0.00023140495,0.9967147,0.00032930073,0.0020314765],"study_design_scores_gemma":[0.000008353614,0.000004292304,0.000056595472,0.0000052232226,0.00000555119,0.000025405063,0.000033415698,0.0005220046,0.0002872292,0.9977381,0.001307904,0.000005817764],"about_ca_topic_score_codex":0.0019765508,"about_ca_topic_score_gemma":0.0015961775,"teacher_disagreement_score":0.007248249,"about_ca_system_score_codex":0.002173489,"about_ca_system_score_gemma":0.0015549399,"threshold_uncertainty_score":0.024247825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040070545,0.039464254,0.28809863,0.0050104456,0.0026103016,0.00024435605,0.0018151616,0.0011216621,0.6576282],"genre_scores_gemma":[0.24153422,0.09082305,0.29461807,0.0077044917,0.008441118,0.0013358628,0.005939504,0.0009888557,0.3486148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829787,0.0003419155,0.00014043147,0.0003042031,0.00076025,0.00015535337],"domain_scores_gemma":[0.9993773,0.00023995106,0.000052438903,0.00008707383,0.00019168624,0.000051573697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009987801,0.0011875847,0.00083564786,0.002712046,0.0020271519,0.0046275146,0.0012628176,0.0011554769,0.03194469],"category_scores_gemma":[0.0021129346,0.00048196572,0.0009306889,0.0030448935,0.0027325193,0.0070824316,0.0017505276,0.0029721358,0.01084629],"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.000005118799,0.000010175094,0.00004505048,0.00008229375,0.000004479072,0.00004084035,0.0001463198,0.00024485897,0.0002769347,0.9718692,0.010767607,0.016507061],"study_design_scores_gemma":[0.0000041506596,0.000009094173,0.00006192754,0.000070054346,0.000004967092,0.00019154212,0.000055134573,0.00062978297,0.00032580952,0.6852677,0.3133713,0.000008528865],"about_ca_topic_score_codex":0.0014713324,"about_ca_topic_score_gemma":0.0014092556,"teacher_disagreement_score":0.03194469,"about_ca_system_score_codex":0.0021675485,"about_ca_system_score_gemma":0.0013783107,"threshold_uncertainty_score":0.106865644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017353116,0.0073076766,0.029582955,0.0012414422,0.00089405355,0.000037194404,0.00021978808,0.00023494834,0.9587466],"genre_scores_gemma":[0.053525746,0.007843022,0.019866277,0.0007067092,0.0010901691,0.000113794704,0.0005653394,0.00030888125,0.9159801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995592,0.00008388435,0.00001608412,0.0000793481,0.00022410604,0.000037298643],"domain_scores_gemma":[0.99978286,0.00006683007,0.000008184175,0.000043661483,0.00007217885,0.00002625588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040953877,0.00075420114,0.0005607722,0.0012531799,0.0017492473,0.0035092,0.0006115854,0.0004564027,0.03920255],"category_scores_gemma":[0.00070817664,0.00043299663,0.00029282374,0.0018863586,0.0023333104,0.0044245305,0.001284759,0.0019996702,0.012552797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008991931,0.000016521919,0.00002117321,0.00005100182,0.0000022326426,0.000018939656,0.00017752186,0.00017308773,0.00032290877,0.906522,0.04944115,0.0432445],"study_design_scores_gemma":[0.0000058132036,0.0000059604426,0.000051943083,0.000039701576,0.000002798547,0.000079048215,0.00006957431,0.0003441343,0.0003754094,0.43054223,0.56847763,0.000005845336],"about_ca_topic_score_codex":0.0010160505,"about_ca_topic_score_gemma":0.0022121747,"teacher_disagreement_score":0.03920255,"about_ca_system_score_codex":0.00211763,"about_ca_system_score_gemma":0.0012710771,"threshold_uncertainty_score":0.13114554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43672106,0.0030665684,0.4270014,0.004541132,0.0006925245,0.00031282904,0.0016942039,0.001301521,0.12466877],"genre_scores_gemma":[0.9227378,0.00084526424,0.06474089,0.00055431033,0.0004958288,0.00013120811,0.0008281335,0.00018844861,0.009478083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727136,0.00032414115,0.00019213594,0.00073226355,0.0009038558,0.0005762839],"domain_scores_gemma":[0.9953746,0.001299018,0.00066519104,0.0010090222,0.0008609332,0.00079120434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019163104,0.00056948897,0.0008322353,0.0011749727,0.0036954784,0.0047231773,0.0008288994,0.0010884451,0.00769169],"category_scores_gemma":[0.0052097905,0.0006713735,0.0010466708,0.0015885488,0.005861581,0.009065051,0.0047379495,0.0026560414,0.00083315925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007342416,0.00003271706,0.001238421,0.00007936857,0.000008238049,0.00016315079,0.00060669874,0.0003062589,0.0036172983,0.98258495,0.0014757168,0.009813786],"study_design_scores_gemma":[0.00005825542,0.00007164678,0.0012077747,0.00002949632,0.000015707728,0.0009793771,0.00071743224,0.002770635,0.0073541985,0.96032864,0.02642705,0.000039792114],"about_ca_topic_score_codex":0.00202487,"about_ca_topic_score_gemma":0.001684621,"teacher_disagreement_score":0.00769169,"about_ca_system_score_codex":0.0019328165,"about_ca_system_score_gemma":0.0015559929,"threshold_uncertainty_score":0.025731266},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34330776,0.0027996707,0.49861577,0.0027761857,0.00046110983,0.00008998779,0.00050456636,0.00028905325,0.15115593],"genre_scores_gemma":[0.9456061,0.0010340833,0.03489911,0.00033900188,0.00025813252,0.000097819495,0.00033802626,0.00010020447,0.01732739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988663,0.00033862272,0.00005699471,0.00021906747,0.00034507265,0.00017390803],"domain_scores_gemma":[0.9988764,0.00043690263,0.0001044416,0.00011654292,0.00026031674,0.00020540594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274231,0.0005570371,0.00053321436,0.0016659416,0.0018953984,0.003620149,0.0004731511,0.0006352188,0.004321751],"category_scores_gemma":[0.0018404882,0.0002660821,0.00085555745,0.0011967677,0.004572232,0.005773588,0.0028752186,0.0020276865,0.0004587082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006696244,0.0000048667034,0.00012726952,0.000011618501,0.0000034827826,0.00004390861,0.00013013463,0.00028506244,0.00037600123,0.99715024,0.00027818506,0.0015826167],"study_design_scores_gemma":[0.000006500003,0.000023998728,0.0003104868,0.000013980669,0.0000069653433,0.00018033184,0.00025769955,0.0038778663,0.0009503995,0.98326784,0.011093218,0.000010683448],"about_ca_topic_score_codex":0.0011969906,"about_ca_topic_score_gemma":0.00095756305,"teacher_disagreement_score":0.004321751,"about_ca_system_score_codex":0.0015765656,"about_ca_system_score_gemma":0.0008875364,"threshold_uncertainty_score":0.014457703},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23886538,0.0059764218,0.2732502,0.011527086,0.0012487969,0.00009648975,0.0002935776,0.0004039985,0.46833804],"genre_scores_gemma":[0.94012886,0.0025594824,0.022801563,0.0013292559,0.0009330938,0.000082176404,0.00029936695,0.00015614401,0.03171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837875,0.0005752366,0.00007854664,0.00034634827,0.00036114542,0.00025997966],"domain_scores_gemma":[0.99682933,0.0017598999,0.000197895,0.00040504165,0.0005402257,0.00026760565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028226383,0.0006160696,0.00061212183,0.0013083689,0.001985065,0.003049722,0.0008475161,0.000925287,0.006701079],"category_scores_gemma":[0.0053919046,0.00048535867,0.0010314535,0.0008923443,0.006689162,0.011003344,0.003551981,0.0042070197,0.0009945887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009622874,0.000011375211,0.00006771657,0.000013616994,0.000001904349,0.000019184241,0.0001366266,0.00015176252,0.00018179782,0.99745435,0.0003632435,0.0015888513],"study_design_scores_gemma":[0.0000032487185,0.0000067071064,0.000043016556,0.000009305965,0.0000015849427,0.000021520906,0.000050021103,0.00037375055,0.00013498962,0.99780434,0.0015484306,0.0000031823997],"about_ca_topic_score_codex":0.0007194517,"about_ca_topic_score_gemma":0.0005562577,"teacher_disagreement_score":0.006701079,"about_ca_system_score_codex":0.0016369583,"about_ca_system_score_gemma":0.0008539687,"threshold_uncertainty_score":0.022417367},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024450433,0.0005275992,0.25598982,0.003234934,0.003698691,0.00045084892,0.002833473,0.00793795,0.70087624],"genre_scores_gemma":[0.29924127,0.00066409784,0.10323378,0.0019099023,0.0014661293,0.00061175827,0.004676319,0.004196629,0.58400005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728143,0.00049524783,0.00012937325,0.00078721665,0.00060270674,0.00070394814],"domain_scores_gemma":[0.9975668,0.00038545893,0.00009673783,0.000911475,0.00073470385,0.00030487106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550497,0.0015688003,0.0010235923,0.0024133413,0.0053382204,0.004461794,0.0028068414,0.002059999,0.17139351],"category_scores_gemma":[0.005433054,0.00090898713,0.0012076027,0.0020292965,0.0027930683,0.011116162,0.0070871683,0.004635386,0.0398014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025757198,0.00012288183,0.0005582223,0.00017708083,0.00002372379,0.00016378456,0.00048743183,0.0003716373,0.0023062415,0.8372082,0.05858381,0.09973944],"study_design_scores_gemma":[0.00004441734,0.00005866372,0.00043258164,0.000075831405,0.000043394168,0.00030794984,0.0004262961,0.0015536471,0.0065974165,0.6595716,0.33083743,0.000050785155],"about_ca_topic_score_codex":0.0010474859,"about_ca_topic_score_gemma":0.0013404015,"teacher_disagreement_score":0.17139351,"about_ca_system_score_codex":0.0016185729,"about_ca_system_score_gemma":0.001700771,"threshold_uncertainty_score":0.57336843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4954117,0.00049436453,0.14205486,0.0045861076,0.00031345038,0.0001337193,0.00040394484,0.000383373,0.35621846],"genre_scores_gemma":[0.9612624,0.00014642075,0.018356364,0.00025511038,0.000054444437,0.000042047894,0.00013190786,0.000060751758,0.019690536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940014,0.00011677151,0.000035171277,0.0001408673,0.00013664542,0.00017039028],"domain_scores_gemma":[0.99939835,0.00012108528,0.00007049894,0.000111764304,0.00015980317,0.00013845805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074752665,0.000204253,0.00028443197,0.0006070443,0.002304645,0.002380624,0.00046443986,0.00061763317,0.008836089],"category_scores_gemma":[0.0018656239,0.00022399888,0.0003946501,0.00039361892,0.0033449933,0.0057052257,0.0020822384,0.0010079191,0.000924663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023239212,0.000011335029,0.00025690426,0.00001615568,0.0000037616728,0.00004883127,0.00045218083,0.00011031332,0.0010461421,0.9949532,0.00041136018,0.0026664566],"study_design_scores_gemma":[0.000018546536,0.0000605924,0.00055247935,0.000028549444,0.000018435825,0.00024821924,0.0018699942,0.0012897331,0.0039371364,0.9562326,0.035721634,0.00002195757],"about_ca_topic_score_codex":0.00077711535,"about_ca_topic_score_gemma":0.0012957453,"teacher_disagreement_score":0.008836089,"about_ca_system_score_codex":0.0010172911,"about_ca_system_score_gemma":0.00062219525,"threshold_uncertainty_score":0.029559672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13161057,0.034339596,0.34267816,0.014086938,0.0020462382,0.00013119943,0.0012086716,0.00081005576,0.47308847],"genre_scores_gemma":[0.83520186,0.007652027,0.08653456,0.001124951,0.002313936,0.0001541807,0.00095637527,0.0001405109,0.06592155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987966,0.0003573271,0.000095933014,0.00025553437,0.00035500483,0.00013949441],"domain_scores_gemma":[0.9971551,0.0016458723,0.00027475014,0.00025950852,0.0003567215,0.00030811934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015170475,0.00046191862,0.000558274,0.0010380697,0.0017640281,0.0028674572,0.0006249037,0.0005696714,0.008517429],"category_scores_gemma":[0.0033530456,0.0003811992,0.00060145283,0.0015030032,0.003866692,0.006161498,0.0014626482,0.0016636694,0.0011231487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037773185,0.000033596807,0.0002805827,0.000058274836,0.000009706944,0.00007963957,0.00029216942,0.00046276572,0.0004122118,0.9785855,0.004008247,0.015739443],"study_design_scores_gemma":[0.000011734208,0.000017132019,0.00034908397,0.000019692787,0.000005719385,0.00015343876,0.00015015231,0.0014697509,0.00030101757,0.9852858,0.012229227,0.000007307291],"about_ca_topic_score_codex":0.0021010083,"about_ca_topic_score_gemma":0.003380323,"teacher_disagreement_score":0.008517429,"about_ca_system_score_codex":0.00196066,"about_ca_system_score_gemma":0.001109975,"threshold_uncertainty_score":0.028493583},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022728637,0.00067181536,0.12884514,0.0028263207,0.0016222737,0.00012526536,0.0028476734,0.0031570536,0.8371758],"genre_scores_gemma":[0.627239,0.0011089208,0.066425376,0.002029977,0.0012290812,0.0003698185,0.005167119,0.0027321798,0.29369846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988771,0.00024859543,0.000104664425,0.00036660346,0.00025250472,0.00015041437],"domain_scores_gemma":[0.9989059,0.00026900353,0.00005731486,0.00027668054,0.00042170804,0.00006943689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010493231,0.00090182654,0.00057478703,0.0016593395,0.0028580094,0.003407169,0.0008941171,0.0010079661,0.06759022],"category_scores_gemma":[0.0014835452,0.00059850875,0.0008111792,0.0012046208,0.0021594535,0.009742658,0.0029894786,0.0026319444,0.0163295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009395335,0.000022278326,0.00020177863,0.00007851017,0.000011861438,0.00012690194,0.00055006007,0.000061407685,0.003721951,0.95052886,0.020434432,0.024167957],"study_design_scores_gemma":[0.000018526076,0.000023504135,0.0004302341,0.000056737983,0.00002762845,0.0003819097,0.0007036375,0.0014899685,0.0059269206,0.6851811,0.30572563,0.00003416852],"about_ca_topic_score_codex":0.0020399478,"about_ca_topic_score_gemma":0.0025135798,"teacher_disagreement_score":0.06759022,"about_ca_system_score_codex":0.0016535234,"about_ca_system_score_gemma":0.00075420114,"threshold_uncertainty_score":0.22611183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030187052,0.0033409528,0.5309617,0.004356144,0.0006378923,0.000111205045,0.0009276809,0.00076966884,0.42870775],"genre_scores_gemma":[0.79348356,0.001810521,0.1272594,0.0034409529,0.0005319923,0.00019760549,0.0007687115,0.00028097216,0.07222632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981298,0.00045222824,0.000104184044,0.00046223387,0.0005393244,0.00031221833],"domain_scores_gemma":[0.99914694,0.00028744995,0.00005840785,0.00017997526,0.00027238164,0.000054814238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014624059,0.00072831236,0.00060654583,0.0015309973,0.0020788962,0.0031104675,0.0009588786,0.0012940698,0.005733975],"category_scores_gemma":[0.0022418054,0.0004586868,0.0010799746,0.0012601183,0.0061748414,0.0036198415,0.0030430485,0.0026847608,0.0014611816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030065098,0.0000015441187,0.000044783348,0.000010663476,0.0000042421316,0.000020000942,0.000104536026,0.000106069885,0.00013430337,0.9965334,0.000649487,0.002388008],"study_design_scores_gemma":[0.0000053058184,0.000008545057,0.0001672002,0.000019670762,0.000016195008,0.00015034141,0.00007168143,0.0011216451,0.0007801082,0.94872516,0.048923012,0.000011166612],"about_ca_topic_score_codex":0.004716833,"about_ca_topic_score_gemma":0.0060633672,"teacher_disagreement_score":0.005733975,"about_ca_system_score_codex":0.0029504097,"about_ca_system_score_gemma":0.0013238903,"threshold_uncertainty_score":0.021406889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004915151,0.009406324,0.027378572,0.002133608,0.0008702365,0.000031220734,0.0006984402,0.00048652495,0.95408],"genre_scores_gemma":[0.15906253,0.014260721,0.013373769,0.0012579228,0.0011715216,0.000104745115,0.0012029978,0.00038195346,0.80918384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997788,0.000051148985,0.000011592741,0.000027773733,0.000103579805,0.00002716782],"domain_scores_gemma":[0.99978,0.00006565563,0.000014215435,0.00003760253,0.0000754695,0.000027093387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042629402,0.0004053131,0.00032063437,0.001200069,0.0009511798,0.002275156,0.00032893688,0.0004229038,0.05124448],"category_scores_gemma":[0.0008104707,0.00018495395,0.0003748964,0.0010121487,0.0012822932,0.003662419,0.00093498,0.0011617834,0.013198139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069117523,0.0000054079674,0.00003768634,0.00006382546,0.0000023849525,0.000025515883,0.00021877856,0.00015104208,0.00037984687,0.95031863,0.03089202,0.017897993],"study_design_scores_gemma":[0.000004593929,0.000011023132,0.00014842366,0.00007541282,0.0000040783684,0.00013676923,0.00011891469,0.00037267013,0.00038446527,0.7288422,0.26989442,0.000006986152],"about_ca_topic_score_codex":0.0006962204,"about_ca_topic_score_gemma":0.00078274444,"teacher_disagreement_score":0.05124448,"about_ca_system_score_codex":0.0010109368,"about_ca_system_score_gemma":0.0007091265,"threshold_uncertainty_score":0.17142987},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005864018,0.090612285,0.08439074,0.06609858,0.06810923,0.000063402724,0.0009021229,0.00030405083,0.6836557],"genre_scores_gemma":[0.21781513,0.094876215,0.07831111,0.033367854,0.13364665,0.00034159652,0.0015813877,0.0011252,0.43893483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833065,0.0004628159,0.00010843598,0.00031907324,0.0006415958,0.00013744821],"domain_scores_gemma":[0.9973922,0.0016635221,0.00006938319,0.00034266248,0.00039229574,0.00013997503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015787858,0.0013391753,0.0015113666,0.0034239795,0.0037482844,0.004267671,0.0016384599,0.0023069484,0.021071376],"category_scores_gemma":[0.005217843,0.0007332996,0.001474256,0.0063367444,0.0056398087,0.012752036,0.003307623,0.01117643,0.005153347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017909388,0.000014549292,0.000025971769,0.00009669664,0.00000716104,0.000040334955,0.00013524384,0.00012929435,0.0003407658,0.93354005,0.05193964,0.013712442],"study_design_scores_gemma":[0.0000069383964,0.000007962652,0.000094345225,0.000054461314,0.000007996402,0.000041098072,0.00002669385,0.00021187731,0.00021159925,0.83355516,0.1657708,0.000011128691],"about_ca_topic_score_codex":0.0030146225,"about_ca_topic_score_gemma":0.0023573146,"teacher_disagreement_score":0.021071376,"about_ca_system_score_codex":0.0028061634,"about_ca_system_score_gemma":0.0011942583,"threshold_uncertainty_score":0.07049078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019789528,0.0016065693,0.6353009,0.0008185153,0.0003195145,0.00017819235,0.0013475438,0.003729135,0.33691013],"genre_scores_gemma":[0.2733552,0.0021564737,0.47378474,0.00053598307,0.00032917154,0.0001893593,0.005635324,0.0015762864,0.24243739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995258,0.00006733768,0.000034077108,0.00012997365,0.0001712135,0.00007156965],"domain_scores_gemma":[0.99946684,0.00008074153,0.000027068376,0.00024183714,0.00013341614,0.000050124898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045810934,0.0004745896,0.0005240321,0.001128051,0.0010049179,0.0024271184,0.0009905994,0.00047761112,0.028011136],"category_scores_gemma":[0.0011062805,0.0005674947,0.00061810896,0.0016068155,0.0014217395,0.003630929,0.0015535924,0.0013635831,0.010458042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000318593,0.000023324817,0.00009721724,0.00007693554,0.000006443226,0.000053753472,0.00025776334,0.001077864,0.0022717835,0.9070144,0.015797013,0.07329169],"study_design_scores_gemma":[0.000014519664,0.000020722036,0.00021925346,0.00004530475,0.000016343387,0.00025526283,0.0001407378,0.006515994,0.0029428848,0.8279747,0.16183788,0.00001646689],"about_ca_topic_score_codex":0.0010481996,"about_ca_topic_score_gemma":0.0019165666,"teacher_disagreement_score":0.028011136,"about_ca_system_score_codex":0.0010141323,"about_ca_system_score_gemma":0.00073833886,"threshold_uncertainty_score":0.09370661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029055437,0.00024277945,0.9661339,0.00016962983,0.000019895737,0.000022671298,0.000030104045,0.000050551273,0.004275036],"genre_scores_gemma":[0.6107995,0.00073535024,0.38277423,0.00020374937,0.00010734339,0.00012772117,0.00015444715,0.00010170553,0.0049959417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986871,0.0005046127,0.000096940996,0.00028133136,0.00035166452,0.00007839329],"domain_scores_gemma":[0.9986475,0.0006954981,0.00018110746,0.00022975427,0.00017584566,0.00007038245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003101321,0.00068368675,0.00071815227,0.0008429403,0.00055427913,0.0015680015,0.0008418157,0.0006175566,0.0019423196],"category_scores_gemma":[0.0039609475,0.00033823663,0.0008751487,0.0009039897,0.0018931879,0.004146336,0.0018166103,0.0019496286,0.00025790877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019489014,0.000021552798,0.00030194636,0.00008119618,0.000017875736,0.000055711782,0.00010848414,0.033889372,0.0069404133,0.94670314,0.00022752106,0.01163318],"study_design_scores_gemma":[0.000008771441,0.00007693202,0.0004142281,0.000029343082,0.000018681718,0.0001015216,0.00007017096,0.3944581,0.005504138,0.59515405,0.004142198,0.000021925245],"about_ca_topic_score_codex":0.0005737142,"about_ca_topic_score_gemma":0.0007289221,"teacher_disagreement_score":0.003101321,"about_ca_system_score_codex":0.0011621248,"about_ca_system_score_gemma":0.00074412394,"threshold_uncertainty_score":0.01640153},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010936248,0.05125429,0.015551305,0.044164497,0.0027839707,0.00002326283,0.00031395597,0.00023816002,0.87473434],"genre_scores_gemma":[0.7056642,0.055809025,0.0095712105,0.0075415513,0.012901033,0.00007195731,0.00050936325,0.000307088,0.20762463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985545,0.0005695935,0.00007042585,0.00013113637,0.0005373446,0.00013690843],"domain_scores_gemma":[0.99631613,0.001815366,0.00032168956,0.0003330489,0.000880769,0.00033297332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012399779,0.00029653273,0.0005168853,0.0033914528,0.0026800502,0.0070266617,0.00037116138,0.0009824904,0.022846002],"category_scores_gemma":[0.0041400148,0.00019769972,0.0003975711,0.0032864315,0.008779586,0.005030712,0.0020090186,0.001710726,0.0037451787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058120313,0.0000037795162,0.00014930019,0.000059005437,0.0000066687144,0.00001683802,0.0003312311,0.000117721924,0.00007700222,0.96499777,0.02351179,0.010723121],"study_design_scores_gemma":[0.000004332426,0.0000040907175,0.00025239462,0.000042825955,0.000004068937,0.000046804933,0.00018508517,0.00013086908,0.00006434838,0.82802224,0.17123957,0.0000033943331],"about_ca_topic_score_codex":0.0036500492,"about_ca_topic_score_gemma":0.004941365,"teacher_disagreement_score":0.022846002,"about_ca_system_score_codex":0.004753377,"about_ca_system_score_gemma":0.002960915,"threshold_uncertainty_score":0.07642752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20076397,0.0033623,0.50918424,0.0029874346,0.0010937538,0.00025009844,0.0008965984,0.001249115,0.28021246],"genre_scores_gemma":[0.86480594,0.0010363457,0.08308544,0.0005507135,0.0005122967,0.0001741101,0.0003944001,0.00015526265,0.04928554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784327,0.00045847188,0.00012360721,0.00046432143,0.0008089423,0.00030134636],"domain_scores_gemma":[0.9972692,0.00073646504,0.000315354,0.00037204378,0.0008828681,0.00042405442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016502527,0.00054684404,0.00057257793,0.0018691906,0.0021804557,0.0043645618,0.0005991628,0.0007454718,0.008968269],"category_scores_gemma":[0.0022038815,0.00034087378,0.0004932901,0.0013374424,0.0036835873,0.0059457147,0.0024338737,0.001909396,0.0010910414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042218056,0.0000130317185,0.0001329352,0.000031079748,0.000005726319,0.00008896607,0.00018400721,0.00056226715,0.0019726874,0.99109906,0.0009711061,0.0048969625],"study_design_scores_gemma":[0.000026055804,0.00005557532,0.0003553103,0.000028679677,0.000013303066,0.00049975957,0.00035558507,0.0068071177,0.0048669344,0.9430343,0.043925986,0.000031413565],"about_ca_topic_score_codex":0.0014802191,"about_ca_topic_score_gemma":0.0013241764,"teacher_disagreement_score":0.008968269,"about_ca_system_score_codex":0.0016867835,"about_ca_system_score_gemma":0.0013699314,"threshold_uncertainty_score":0.03000182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028776368,0.0046212655,0.080040105,0.0040172236,0.0009475193,0.000049744893,0.00113849,0.00062915316,0.8797802],"genre_scores_gemma":[0.536117,0.00786213,0.030994575,0.0014474315,0.001225484,0.00011045681,0.002661588,0.00070321385,0.41887808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975127,0.000056664096,0.000010354718,0.0000599406,0.00009499156,0.000026793983],"domain_scores_gemma":[0.9996685,0.00011909967,0.000022129665,0.00007187956,0.0000773566,0.000041090596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025351843,0.000450874,0.00032026347,0.0013746409,0.0011876848,0.0020716458,0.00052091683,0.0006054031,0.024372622],"category_scores_gemma":[0.00097387814,0.00034036947,0.00032951345,0.0016225522,0.0012481255,0.0036783777,0.00094719755,0.0016091579,0.0050896914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007902289,0.00000534815,0.00003248679,0.000030954827,0.000001914657,0.0000122195715,0.000073202355,0.00023149222,0.0002449589,0.9788118,0.008284372,0.012263322],"study_design_scores_gemma":[0.0000029373407,0.0000038050096,0.00008111399,0.000017663957,0.0000041848957,0.00006537931,0.000043730055,0.000577522,0.00028359445,0.92958915,0.069327034,0.0000038431194],"about_ca_topic_score_codex":0.00093664957,"about_ca_topic_score_gemma":0.0009758213,"teacher_disagreement_score":0.024372622,"about_ca_system_score_codex":0.0010263264,"about_ca_system_score_gemma":0.00040939552,"threshold_uncertainty_score":0.081534505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061343163,0.0019569455,0.047790878,0.007033645,0.0011938635,0.000052843297,0.0005159121,0.00022459848,0.935097],"genre_scores_gemma":[0.21725665,0.008913054,0.043568276,0.002193864,0.0019548207,0.00024346854,0.002567939,0.0005439161,0.72275805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963546,0.00006688251,0.000013674833,0.00008730672,0.00015076822,0.000045922323],"domain_scores_gemma":[0.9997328,0.00009905355,0.00001713817,0.000046157984,0.000075027194,0.00002969986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618575,0.00068733055,0.00053484424,0.0010657219,0.0016866359,0.0027401024,0.001032407,0.0011486482,0.056529667],"category_scores_gemma":[0.0014712961,0.00029072602,0.0005501896,0.0015269135,0.0020500382,0.0069721364,0.0020301687,0.0038824952,0.012146397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007279829,0.000009054495,0.00001667266,0.00003470542,0.000002167261,0.000012705416,0.00004070016,0.0002408804,0.00006142634,0.96502674,0.020398999,0.014148777],"study_design_scores_gemma":[0.0000059449603,0.0000033100746,0.000027046113,0.000023238179,0.0000034363181,0.000046473808,0.00004619027,0.00064364704,0.00010030266,0.91312784,0.08596939,0.000003242741],"about_ca_topic_score_codex":0.0011355841,"about_ca_topic_score_gemma":0.0009652844,"teacher_disagreement_score":0.056529667,"about_ca_system_score_codex":0.0016549991,"about_ca_system_score_gemma":0.0016162613,"threshold_uncertainty_score":0.18911058},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07007758,0.14915805,0.15885907,0.026033107,0.0016559584,0.000053167027,0.0010404914,0.00059165835,0.5925309],"genre_scores_gemma":[0.86493975,0.026997464,0.03280065,0.0018380992,0.0022972515,0.00013992812,0.00096112554,0.000108614855,0.06991705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990482,0.00028343944,0.000059331058,0.00013203453,0.0003821103,0.00009492113],"domain_scores_gemma":[0.9992423,0.00036116107,0.000084203464,0.00012196949,0.000101397556,0.00008896008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009802959,0.0007195316,0.00075584376,0.0023885975,0.0017264754,0.00727377,0.0009745316,0.0013512683,0.0070412154],"category_scores_gemma":[0.0020244343,0.0004695833,0.0006709312,0.003582952,0.005595677,0.010490007,0.0024683797,0.0030451773,0.001060222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029340565,0.000004332261,0.000048113106,0.00002164871,0.000002343959,0.000007882133,0.000102888844,0.00015495653,0.00005219496,0.9954933,0.0016032978,0.00250605],"study_design_scores_gemma":[0.0000013701238,0.0000013531104,0.000036282305,0.000007428104,0.0000011070274,0.000017906674,0.000035510067,0.00017736183,0.00001379687,0.99401075,0.005694975,0.000002244761],"about_ca_topic_score_codex":0.0020385426,"about_ca_topic_score_gemma":0.002382076,"teacher_disagreement_score":0.00727377,"about_ca_system_score_codex":0.0029424434,"about_ca_system_score_gemma":0.0008434252,"threshold_uncertainty_score":0.02355522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08736874,0.00094377814,0.7165293,0.005559534,0.00045174707,0.0007619827,0.00049052254,0.0016169285,0.18627737],"genre_scores_gemma":[0.88456625,0.00044035126,0.09397163,0.0012103639,0.00034054584,0.00067573733,0.0004362125,0.0002477205,0.018111235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916053,0.0024106049,0.00061809696,0.0026762194,0.0018087323,0.0008810582],"domain_scores_gemma":[0.988267,0.004158283,0.0011111939,0.004072711,0.00208612,0.0003047277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068843835,0.0007018627,0.0009747461,0.0011915443,0.0015744758,0.0035510596,0.0014259707,0.0018636102,0.009053998],"category_scores_gemma":[0.016706819,0.00061830133,0.0022856994,0.0008158008,0.007360827,0.006679904,0.0039643953,0.004244381,0.0010621819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003168972,0.000029341454,0.0002695939,0.00005505769,0.00003453143,0.000091622336,0.0003163762,0.0008667509,0.0016832002,0.98736703,0.00077968714,0.00847516],"study_design_scores_gemma":[0.000059061684,0.00004602243,0.0003054232,0.000033938402,0.000037160324,0.00012877323,0.00016352773,0.0030198472,0.002953801,0.9820011,0.011231244,0.000020018217],"about_ca_topic_score_codex":0.0011744804,"about_ca_topic_score_gemma":0.00079356536,"teacher_disagreement_score":0.009053998,"about_ca_system_score_codex":0.0020170645,"about_ca_system_score_gemma":0.0021061553,"threshold_uncertainty_score":0.036408544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007311283,0.014942609,0.09660805,0.0079823565,0.00359926,0.000041935367,0.00031128209,0.00043944473,0.86876374],"genre_scores_gemma":[0.4996143,0.018191667,0.087897934,0.0075748265,0.004824305,0.00033326153,0.0010313446,0.0005704285,0.379962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991698,0.00033292477,0.00004647173,0.00012077254,0.00025469568,0.00007538295],"domain_scores_gemma":[0.9994198,0.00026074838,0.0000371183,0.000093163704,0.00013420358,0.000054949815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010487195,0.0005019756,0.00039786246,0.00176994,0.0019995691,0.004805345,0.000685922,0.0008132112,0.013654396],"category_scores_gemma":[0.0019243559,0.00027111248,0.00054724346,0.0014687176,0.0047723926,0.006852583,0.0028713183,0.0027342231,0.0031633074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021316025,0.0000020626435,0.0000140560105,0.00001550717,0.0000010652925,0.000019439663,0.0001686653,0.00003531494,0.00006244552,0.98951834,0.0048302757,0.0053307605],"study_design_scores_gemma":[0.0000039600914,0.000007721642,0.000068875364,0.000044434004,0.0000030873948,0.00011950967,0.000106692016,0.00028319156,0.00018287725,0.7897459,0.20942922,0.0000045559163],"about_ca_topic_score_codex":0.00095043425,"about_ca_topic_score_gemma":0.0011901883,"teacher_disagreement_score":0.013654396,"about_ca_system_score_codex":0.002028774,"about_ca_system_score_gemma":0.0010010245,"threshold_uncertainty_score":0.045678437},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031973843,0.0012501742,0.028212078,0.0020907498,0.005093434,0.00034243948,0.0060812845,0.007029726,0.9467027],"genre_scores_gemma":[0.04037419,0.0009412803,0.008545921,0.00083797803,0.0007730867,0.00029521043,0.009590507,0.0018601615,0.93678176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985576,0.0002284509,0.000054902517,0.00040511042,0.0004010968,0.00035282248],"domain_scores_gemma":[0.9984113,0.00021687344,0.00006164621,0.00048843597,0.0003947712,0.00042691128],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008589133,0.0020927317,0.0016306131,0.0020042784,0.0027362786,0.0032342165,0.0033749968,0.0018109822,0.71230155],"category_scores_gemma":[0.004050824,0.00074770476,0.0011479291,0.0016603747,0.001295209,0.0042106686,0.0042963396,0.0025904076,0.4332811],"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.00092482026,0.00026923174,0.00040322306,0.00092708884,0.00003585186,0.00029676562,0.00020136949,0.00052037317,0.008300403,0.14325352,0.6707208,0.1741466],"study_design_scores_gemma":[0.00008527164,0.00008677106,0.00029222405,0.00011742465,0.000024784053,0.00021787941,0.00008684806,0.0006406746,0.004566639,0.036516387,0.9573444,0.000020600677],"about_ca_topic_score_codex":0.0010765801,"about_ca_topic_score_gemma":0.0014111169,"teacher_disagreement_score":0.71230155,"about_ca_system_score_codex":0.0014465393,"about_ca_system_score_gemma":0.0013703691,"threshold_uncertainty_score":0.4103669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024849944,0.020298937,0.17398101,0.005284642,0.003972641,0.00010010732,0.0011576976,0.0006487602,0.76970625],"genre_scores_gemma":[0.46007907,0.020316256,0.15731624,0.0023333465,0.006890498,0.0003697891,0.005403764,0.0008927872,0.34639823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989483,0.00019145728,0.00009925647,0.00025097822,0.00038432286,0.00012571388],"domain_scores_gemma":[0.99904627,0.00040952212,0.00005037412,0.00017616301,0.0002540752,0.00006359742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010320368,0.0007578788,0.00092784595,0.0035697494,0.0019891937,0.004625007,0.0013718473,0.0011814941,0.018424809],"category_scores_gemma":[0.002853686,0.00041474093,0.000949473,0.003257829,0.0031705392,0.01051854,0.001601549,0.004253666,0.0055292435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011464163,0.000011330095,0.00008287089,0.000059699734,0.000003708802,0.000012872504,0.00017719346,0.00011781608,0.0002428136,0.94377464,0.010349289,0.045156226],"study_design_scores_gemma":[0.0000029569835,0.0000057249467,0.00014540153,0.000040105035,0.0000033586996,0.00006663078,0.000045847013,0.00040831076,0.00015399465,0.9405996,0.058522493,0.000005601285],"about_ca_topic_score_codex":0.0014778958,"about_ca_topic_score_gemma":0.000908804,"teacher_disagreement_score":0.018424809,"about_ca_system_score_codex":0.0021488164,"about_ca_system_score_gemma":0.00088707864,"threshold_uncertainty_score":0.061637104},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063997366,0.0036508746,0.070353866,0.006551897,0.0009901304,0.000077366116,0.0013959069,0.00082871655,0.8521539],"genre_scores_gemma":[0.65539587,0.002991991,0.021623246,0.001277674,0.00070273783,0.00013881663,0.0030187976,0.00057452684,0.31427625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979449,0.00046722594,0.00014809046,0.000525331,0.00054114504,0.0003732703],"domain_scores_gemma":[0.99881905,0.0003489252,0.00012082713,0.0001646989,0.00034314385,0.00020334244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012225109,0.001282821,0.0011088802,0.0031986362,0.0038522296,0.009035116,0.0012142013,0.0014838101,0.043575175],"category_scores_gemma":[0.003072272,0.00092338247,0.0009947309,0.0036286197,0.0037335714,0.0113319885,0.00568804,0.0051648906,0.010488804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000353974,0.00001788576,0.00010433762,0.000036707144,0.0000069940193,0.0000471535,0.0003318152,0.00019318004,0.00023505671,0.98899615,0.0045092446,0.0054860213],"study_design_scores_gemma":[0.000011972477,0.000007963714,0.00008501274,0.000026581916,0.000010157886,0.00012185353,0.0003910737,0.00045166918,0.0004093025,0.96096903,0.037504133,0.000011137311],"about_ca_topic_score_codex":0.0012859735,"about_ca_topic_score_gemma":0.0011578111,"teacher_disagreement_score":0.043575175,"about_ca_system_score_codex":0.0025134282,"about_ca_system_score_gemma":0.0013279805,"threshold_uncertainty_score":0.14577347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005807193,0.0021003857,0.04896226,0.0064676753,0.0010656796,0.00005073492,0.00045323113,0.00020487339,0.934888],"genre_scores_gemma":[0.21748208,0.009783855,0.046225972,0.0020567074,0.0018264286,0.00023398694,0.0023208049,0.000508841,0.7195614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996381,0.00006971246,0.000013952696,0.00008127719,0.00015141818,0.000045512483],"domain_scores_gemma":[0.9997514,0.00009281154,0.00001621184,0.000043537744,0.00006974916,0.000026384145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035523265,0.0006682761,0.0005262042,0.0010781151,0.0016252819,0.002585558,0.0010079833,0.0010800158,0.05271269],"category_scores_gemma":[0.0013791347,0.00028338959,0.0005302719,0.0015487396,0.0021096326,0.00678475,0.0019484867,0.003674394,0.0104879085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066833977,0.00000863882,0.000016898253,0.00003226865,0.000002169467,0.000013071739,0.000040932697,0.00025174062,0.000060826485,0.9639532,0.020163301,0.0154501805],"study_design_scores_gemma":[0.0000055497985,0.0000030758,0.000026915312,0.000023763554,0.000003169072,0.00004773249,0.00004789514,0.00067432626,0.00009991033,0.91252065,0.08654365,0.000003275796],"about_ca_topic_score_codex":0.0011940838,"about_ca_topic_score_gemma":0.0010721234,"teacher_disagreement_score":0.05271269,"about_ca_system_score_codex":0.0016333627,"about_ca_system_score_gemma":0.0015629454,"threshold_uncertainty_score":0.17634153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5232754,0.002248466,0.31546345,0.0047119865,0.00048477665,0.00019283599,0.00044305858,0.00042820312,0.15275179],"genre_scores_gemma":[0.95658505,0.0004281902,0.030996563,0.00043314672,0.00021245584,0.00009753215,0.00036282995,0.00007732629,0.010806828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705327,0.00093216635,0.00024678616,0.0005440157,0.000818431,0.00040528335],"domain_scores_gemma":[0.99408734,0.0034444148,0.0004453936,0.0007318257,0.0008812152,0.00040983126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004412176,0.0005322402,0.0006657966,0.0014191051,0.0019710595,0.0034699554,0.0010625614,0.0009710852,0.0036280267],"category_scores_gemma":[0.0092058815,0.0005626362,0.002085067,0.0007247063,0.007623814,0.0077387053,0.003989894,0.0048940065,0.00056377635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045058296,0.000046534326,0.00054072705,0.00005710892,0.000016220893,0.0001257832,0.0005121611,0.0006961256,0.0015354214,0.99362,0.0002969854,0.0025079136],"study_design_scores_gemma":[0.000017274178,0.000028442193,0.00019376933,0.000025746009,0.000019411733,0.00012842202,0.00013163546,0.0031254357,0.0021210106,0.9925713,0.0016219055,0.000015738866],"about_ca_topic_score_codex":0.0009079462,"about_ca_topic_score_gemma":0.0006880193,"teacher_disagreement_score":0.004412176,"about_ca_system_score_codex":0.002079281,"about_ca_system_score_gemma":0.0012100708,"threshold_uncertainty_score":0.023334086},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044507027,0.0023485697,0.107865,0.0071095573,0.0035904697,0.00011549926,0.0012959251,0.0011467909,0.8320212],"genre_scores_gemma":[0.4624703,0.002066056,0.01954943,0.002267658,0.0015108677,0.00018240539,0.0015469107,0.0010329495,0.50937337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998706,0.00023377163,0.00008344992,0.0003600977,0.00038841605,0.00022833998],"domain_scores_gemma":[0.9984615,0.00030817397,0.00012121683,0.00039617787,0.00053620856,0.00017677796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009388693,0.00081983715,0.0009109505,0.0028005727,0.0032269442,0.004453036,0.0010781381,0.0011862117,0.06391649],"category_scores_gemma":[0.0039639003,0.0005297745,0.0009590289,0.001317188,0.0043430044,0.009310659,0.00420884,0.0039250376,0.015523851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014942316,0.0000060703223,0.00004183592,0.000017403223,0.0000047358208,0.000017008964,0.00010683126,0.000031578747,0.00016896384,0.99187124,0.0038502081,0.0038692274],"study_design_scores_gemma":[0.000011740347,0.000007667933,0.00006773386,0.000017177605,0.000008737825,0.00007541097,0.000111966125,0.00018744398,0.00043724992,0.9544732,0.04459222,0.000009479049],"about_ca_topic_score_codex":0.0007120543,"about_ca_topic_score_gemma":0.0005586306,"teacher_disagreement_score":0.06391649,"about_ca_system_score_codex":0.0012690176,"about_ca_system_score_gemma":0.0008409815,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022621213,0.09963484,0.09089914,0.10266311,0.016336452,0.00008139745,0.0010262491,0.0005394318,0.66619813],"genre_scores_gemma":[0.72298056,0.050305363,0.017334206,0.018009648,0.015194261,0.00021920472,0.0018828353,0.00033424073,0.17373972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984769,0.00035174176,0.00008288422,0.0005378024,0.0003878449,0.00016295604],"domain_scores_gemma":[0.99611354,0.0019840926,0.00027253907,0.0006671529,0.00065358705,0.00030914426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020228445,0.0007162672,0.001076513,0.0008469816,0.002015721,0.005056265,0.0014129935,0.0020938592,0.02930517],"category_scores_gemma":[0.008459451,0.0004309096,0.00088363676,0.001628265,0.0057199704,0.013201051,0.0038583183,0.005496326,0.0069793407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044054632,0.000025100377,0.00030964648,0.00026605744,0.000021411704,0.00009772549,0.0002581714,0.0002661846,0.00020702007,0.9601665,0.019869536,0.018468576],"study_design_scores_gemma":[0.0000083894365,0.00001609139,0.0003050927,0.00014213128,0.000023212031,0.0001231445,0.00012814335,0.0003952048,0.00026227869,0.93866754,0.05991699,0.000011721504],"about_ca_topic_score_codex":0.0010625903,"about_ca_topic_score_gemma":0.0011563991,"teacher_disagreement_score":0.02930517,"about_ca_system_score_codex":0.001711121,"about_ca_system_score_gemma":0.0015551413,"threshold_uncertainty_score":0.098035514},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005826775,0.061734084,0.13493104,0.03007989,0.0065582953,0.00008900799,0.0016527871,0.0005533934,0.7585747],"genre_scores_gemma":[0.42499086,0.04186976,0.1003013,0.014086338,0.013008917,0.00045333107,0.003836734,0.0007000976,0.40075272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985794,0.00043309835,0.000088244225,0.00037074185,0.00042248543,0.00010609261],"domain_scores_gemma":[0.9990631,0.0004328571,0.00003402533,0.00019906118,0.00019058876,0.00008042224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014957493,0.00065262243,0.00087082497,0.001341038,0.0021984745,0.0046810578,0.0010529762,0.0011079567,0.025652632],"category_scores_gemma":[0.0021250157,0.0004009043,0.0010241703,0.0015047415,0.0037167312,0.0051992536,0.0024918055,0.0040242323,0.0065700323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006411032,0.000004114832,0.000050032722,0.000052964562,0.0000061853116,0.000013631462,0.00009526232,0.00014763512,0.00013653886,0.9624528,0.024652831,0.01238146],"study_design_scores_gemma":[0.0000045967713,0.0000071321165,0.00010462383,0.000039053146,0.000003901017,0.00006893668,0.000047611124,0.00036686563,0.00014745028,0.7874192,0.21178542,0.000005208179],"about_ca_topic_score_codex":0.0010386038,"about_ca_topic_score_gemma":0.0011941316,"teacher_disagreement_score":0.025652632,"about_ca_system_score_codex":0.002872203,"about_ca_system_score_gemma":0.0008581448,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7880576,0.00088207173,0.13285004,0.0021175314,0.00028469766,0.000048436028,0.0002751963,0.0002965287,0.075187795],"genre_scores_gemma":[0.981198,0.00018382553,0.0091973,0.00025698813,0.00016743554,0.00004561001,0.00018303275,0.000065575274,0.008702326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847907,0.00028150782,0.000078830555,0.0003133213,0.0005662803,0.00028098293],"domain_scores_gemma":[0.99718946,0.0010343355,0.00036283841,0.00022248316,0.0006492075,0.00054178474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011089784,0.000616968,0.00092697283,0.0024645622,0.0025866232,0.0040809005,0.0012144309,0.0011091843,0.00624496],"category_scores_gemma":[0.003600435,0.00047079925,0.0014535936,0.00094592763,0.0044600535,0.0039323075,0.0023782018,0.002642349,0.00076251436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032214673,0.000020632655,0.00041870776,0.000025043872,0.000009890776,0.00012382049,0.00017378025,0.00059320184,0.0009171009,0.9957022,0.00044283946,0.0015405396],"study_design_scores_gemma":[0.000028275648,0.000042243486,0.00060385274,0.000022720817,0.000016250724,0.00046005135,0.00019486302,0.015160262,0.0018416047,0.97993773,0.0016563673,0.000035806683],"about_ca_topic_score_codex":0.0014248211,"about_ca_topic_score_gemma":0.00080637744,"teacher_disagreement_score":0.00624496,"about_ca_system_score_codex":0.0021068307,"about_ca_system_score_gemma":0.0012136012,"threshold_uncertainty_score":0.020891488},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64213717,0.001915933,0.26503703,0.0006141071,0.00025978463,0.00012239159,0.00031876264,0.00030387373,0.08929094],"genre_scores_gemma":[0.9582694,0.0005108223,0.032135274,0.00012747779,0.00011485596,0.000043089927,0.0003255517,0.00004302435,0.008430659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986267,0.00025404795,0.00010673884,0.00030281907,0.00049372116,0.00021592314],"domain_scores_gemma":[0.99812466,0.0004265871,0.00030442252,0.00034611978,0.00063319673,0.00016506147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016251195,0.0003321733,0.00043269296,0.0008913233,0.0012523738,0.0031889265,0.0007316916,0.00042253846,0.0041687633],"category_scores_gemma":[0.0028081522,0.00024408243,0.00074435235,0.0007674036,0.002215658,0.0067374483,0.0011381616,0.0009781426,0.0008059768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003536254,0.000024323306,0.00082196493,0.000039484803,0.000008655498,0.00006319957,0.0003455157,0.00037013405,0.002688868,0.9888658,0.0002777376,0.0064589996],"study_design_scores_gemma":[0.000025272495,0.00014602869,0.0012294346,0.000043443895,0.00002754006,0.0004703583,0.00054969057,0.0053767497,0.009476712,0.9674884,0.015129401,0.00003709987],"about_ca_topic_score_codex":0.00039617144,"about_ca_topic_score_gemma":0.00041581097,"teacher_disagreement_score":0.0041687633,"about_ca_system_score_codex":0.0006857361,"about_ca_system_score_gemma":0.0005885044,"threshold_uncertainty_score":0.013945878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006606679,0.006474037,0.037362017,0.0028660826,0.0012895116,0.000044653385,0.00033402548,0.00034257272,0.95062643],"genre_scores_gemma":[0.02841637,0.0102632325,0.018877903,0.0017356465,0.0022697593,0.00014585302,0.0010097603,0.00042412776,0.9368574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951494,0.00009760323,0.00002248787,0.00008618525,0.00024678634,0.000031935444],"domain_scores_gemma":[0.99974686,0.00007837155,0.000011107841,0.000050831764,0.000089671164,0.000023209086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004814214,0.001003575,0.0006186978,0.0018820498,0.0016945573,0.004461155,0.0009044959,0.000745836,0.073249385],"category_scores_gemma":[0.0010028993,0.00047491788,0.00058999105,0.0019197535,0.002696279,0.006194449,0.0016152244,0.0029858993,0.036586933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004855613,0.000011988408,0.0000207777,0.000078446086,0.0000037971854,0.000015812631,0.000141706,0.00016090751,0.00019102207,0.88196295,0.08080281,0.036604915],"study_design_scores_gemma":[0.000003533823,0.0000035362505,0.00003890731,0.000051419887,0.00000365611,0.000044346503,0.00004311767,0.0002781661,0.00012695306,0.45092124,0.5484802,0.0000049197215],"about_ca_topic_score_codex":0.0012379109,"about_ca_topic_score_gemma":0.0018179916,"teacher_disagreement_score":0.073249385,"about_ca_system_score_codex":0.0023657277,"about_ca_system_score_gemma":0.0015236319,"threshold_uncertainty_score":0.24504358},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013733038,0.00049001176,0.029120978,0.011383508,0.015290883,0.0015042742,0.008294515,0.023770455,0.8964124],"genre_scores_gemma":[0.04230383,0.00037064115,0.027800413,0.0027411992,0.002565162,0.0013560295,0.0111718755,0.0036994175,0.90799135],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786276,0.00020902147,0.00006731173,0.0003288592,0.0010742181,0.00045785576],"domain_scores_gemma":[0.9892021,0.0007037894,0.0003238751,0.001108789,0.003397144,0.0052642617],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020544112,0.0010827101,0.00087420945,0.0015948093,0.002619949,0.00406756,0.0029727253,0.0013434739,0.51546186],"category_scores_gemma":[0.014126936,0.0005072443,0.0009291769,0.00072503474,0.0006878714,0.0027430907,0.006416339,0.003148669,0.20908564],"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.00021516289,0.00022247675,0.00033390458,0.00007517328,0.000003964133,0.00008430273,0.00024936494,0.00018920616,0.00086149696,0.0031874843,0.89243263,0.10214476],"study_design_scores_gemma":[0.00005028993,0.00014163375,0.002032777,0.00005374365,0.0000034956104,0.00012629945,0.00020940496,0.00033010132,0.0006368503,0.005261682,0.99112517,0.00002859442],"about_ca_topic_score_codex":0.0014408126,"about_ca_topic_score_gemma":0.0047965916,"teacher_disagreement_score":0.51546186,"about_ca_system_score_codex":0.0024615137,"about_ca_system_score_gemma":0.0028248725,"threshold_uncertainty_score":0.6911348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027066085,0.001502951,0.15286408,0.0015924827,0.0011018477,0.00011203372,0.001230522,0.003909785,0.8349797],"genre_scores_gemma":[0.08295089,0.0029324244,0.054311275,0.0008996585,0.0008730169,0.00020947511,0.004444807,0.0022864398,0.8510919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990701,0.00011977525,0.00005156596,0.0002479494,0.0004134479,0.0000972322],"domain_scores_gemma":[0.99955004,0.000075402,0.000016901573,0.00019228042,0.00012677448,0.00003855696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005772827,0.0011271617,0.00070036727,0.001510776,0.001461247,0.0040976927,0.0014053696,0.00077150087,0.15306295],"category_scores_gemma":[0.0018714275,0.00061529235,0.0011228748,0.0017638281,0.001395626,0.006342124,0.0036595403,0.0022056387,0.061919317],"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.000026753507,0.00001773707,0.00011024793,0.00011311076,0.0000095096275,0.000053699765,0.0002804439,0.00030157831,0.00084235327,0.79596883,0.09622354,0.1060522],"study_design_scores_gemma":[0.000011746336,0.000009794933,0.00013935869,0.000050840925,0.000014102378,0.00018842357,0.00010297669,0.0010614243,0.00089819194,0.37492168,0.6225895,0.000011986765],"about_ca_topic_score_codex":0.0021520949,"about_ca_topic_score_gemma":0.0015172636,"teacher_disagreement_score":0.15306295,"about_ca_system_score_codex":0.0012300694,"about_ca_system_score_gemma":0.0011912528,"threshold_uncertainty_score":0.5120466},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54556334,0.014209004,0.25216147,0.016165562,0.0005588411,0.00011330225,0.00037210638,0.0002319232,0.17062443],"genre_scores_gemma":[0.9625002,0.0020856936,0.0197018,0.0004226354,0.00051487307,0.000057225523,0.0002480802,0.000038211776,0.014431259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989672,0.0003576592,0.00007022641,0.00027872864,0.00020282157,0.00012332278],"domain_scores_gemma":[0.9969584,0.0019482698,0.00031562572,0.00027533647,0.00027326855,0.00022909655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019230656,0.0003293806,0.0006329758,0.0014018033,0.0018603889,0.0029222632,0.0008698377,0.0011448828,0.0042777597],"category_scores_gemma":[0.0066642426,0.0004064392,0.00083291554,0.0016617989,0.0065202997,0.010851268,0.0028412503,0.0029611166,0.00039945004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018563387,0.000010027422,0.00034204486,0.00003602782,0.000004132586,0.00004897499,0.00044056185,0.00054878223,0.00028708891,0.9931526,0.0005032615,0.0046078353],"study_design_scores_gemma":[0.000007973647,0.000014784219,0.00026245622,0.000021674354,0.000005290534,0.00009192807,0.00034381263,0.0025070275,0.00035265464,0.99178094,0.0046021454,0.000009383191],"about_ca_topic_score_codex":0.0017913294,"about_ca_topic_score_gemma":0.0009000268,"teacher_disagreement_score":0.0042777597,"about_ca_system_score_codex":0.0017697882,"about_ca_system_score_gemma":0.0006278148,"threshold_uncertainty_score":0.014310539},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047041606,0.0032615128,0.49910384,0.0022392962,0.0025541112,0.00024251147,0.002013387,0.0031481667,0.44039562],"genre_scores_gemma":[0.61617196,0.003905478,0.143679,0.0014925217,0.0020419243,0.00029671256,0.0026075172,0.0012016951,0.22860317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991431,0.00021029363,0.000051166797,0.00016061724,0.0002754269,0.00015937292],"domain_scores_gemma":[0.9993389,0.00012593718,0.0000912289,0.00014648674,0.00019802443,0.00009937609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060521474,0.0009623028,0.00058373844,0.0020297398,0.0015543604,0.0056008743,0.0014493971,0.0011591552,0.021067664],"category_scores_gemma":[0.0020129594,0.00043186508,0.0009909936,0.0028399185,0.0022052694,0.0067920997,0.0018114186,0.001676904,0.006255444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011231958,0.0000044788217,0.000035427303,0.000022848557,0.0000034678437,0.000027215952,0.00004356644,0.00010504174,0.00036212316,0.98950607,0.00298354,0.0068949675],"study_design_scores_gemma":[0.000006552688,0.0000046091386,0.000031510244,0.00001342921,0.000007933307,0.0000772867,0.000030705516,0.0011586274,0.0008635166,0.9607807,0.03701637,0.000008734713],"about_ca_topic_score_codex":0.0009859744,"about_ca_topic_score_gemma":0.0010924423,"teacher_disagreement_score":0.021067664,"about_ca_system_score_codex":0.0009636157,"about_ca_system_score_gemma":0.0011463233,"threshold_uncertainty_score":0.07047832},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39606696,0.0010678145,0.5170082,0.00104167,0.00021758344,0.00007749828,0.00017197434,0.0004508545,0.0838974],"genre_scores_gemma":[0.931995,0.00036216056,0.053370353,0.00018551588,0.00010136158,0.00005434002,0.00015567066,0.00010256832,0.013673045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987393,0.00037320348,0.0001309789,0.00026146474,0.00033653935,0.0001585404],"domain_scores_gemma":[0.99806947,0.0008056274,0.00018805848,0.00031945374,0.00036089172,0.000256471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002166801,0.0005022958,0.00048367336,0.0010265058,0.0013806518,0.0033772273,0.0007797509,0.00062345306,0.004839573],"category_scores_gemma":[0.0036375362,0.00038802173,0.0014106788,0.00063698203,0.003894921,0.00909339,0.002229294,0.0023915193,0.0007040637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003331451,0.000016740873,0.00026227068,0.00003468187,0.0000052510363,0.000117131276,0.00041608722,0.0008755022,0.0014938063,0.99241334,0.00017318428,0.0041585816],"study_design_scores_gemma":[0.0000081229555,0.000020059291,0.0001007672,0.000016716585,0.000008012563,0.00011710377,0.00012990063,0.0048499876,0.0026442406,0.99000823,0.0020856413,0.000011178079],"about_ca_topic_score_codex":0.0005753628,"about_ca_topic_score_gemma":0.00042967618,"teacher_disagreement_score":0.004839573,"about_ca_system_score_codex":0.001480905,"about_ca_system_score_gemma":0.0006298087,"threshold_uncertainty_score":0.016189992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044671693,0.0021004349,0.12246378,0.0026934864,0.0014077224,0.000032153126,0.00036653076,0.0008638968,0.8656049],"genre_scores_gemma":[0.24008484,0.004621307,0.06055303,0.002592939,0.002861746,0.00037259512,0.0016906918,0.003945259,0.68327755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985815,0.00033608626,0.000056609777,0.00029803035,0.00054975745,0.00017800601],"domain_scores_gemma":[0.99784994,0.0009770618,0.00010126844,0.00056511984,0.000376248,0.0001303946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013314538,0.0015707667,0.001506312,0.0031971526,0.0029080939,0.0049748407,0.0019707098,0.0022454872,0.075602114],"category_scores_gemma":[0.005882156,0.0008153388,0.0012841057,0.0023692134,0.0030409547,0.010404268,0.003472177,0.006574996,0.024936983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116059755,0.000012999402,0.000020658657,0.000029845709,0.0000034053107,0.000015911122,0.000060093327,0.00023023562,0.00016697288,0.9784223,0.012055998,0.008970094],"study_design_scores_gemma":[0.000005320126,0.0000050490275,0.00003286526,0.000033728065,0.000008030409,0.000050412116,0.000017822069,0.0013519723,0.0005403433,0.96707547,0.030869953,0.000009026224],"about_ca_topic_score_codex":0.00074779097,"about_ca_topic_score_gemma":0.00084091944,"teacher_disagreement_score":0.075602114,"about_ca_system_score_codex":0.002176343,"about_ca_system_score_gemma":0.0009854743,"threshold_uncertainty_score":0.25291425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004477345,0.015378069,0.4793274,0.002921233,0.0020518457,0.00011175165,0.0016633561,0.0029786574,0.49109042],"genre_scores_gemma":[0.16220495,0.019054087,0.33690417,0.0027465674,0.0022505252,0.000391638,0.0063311416,0.0026805517,0.4674364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992011,0.00013494623,0.00008775886,0.00021871936,0.00030179124,0.00005559386],"domain_scores_gemma":[0.99945587,0.00018317038,0.000023810211,0.00016764554,0.00013300993,0.00003648972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078642095,0.0010025592,0.0009457375,0.0023929975,0.0016742352,0.005055281,0.0014577036,0.0009211992,0.041762184],"category_scores_gemma":[0.0015637007,0.00068864645,0.0011101845,0.0036223873,0.0020709618,0.010373492,0.0026473035,0.0027574622,0.01518914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016195398,0.000021806762,0.0000682266,0.0001516663,0.000009724224,0.000042484684,0.00024636355,0.00028456992,0.0006573809,0.8965116,0.024016764,0.07797316],"study_design_scores_gemma":[0.0000072270727,0.000009754693,0.0000710316,0.00008018871,0.000010220335,0.00020591795,0.000056966517,0.0008127644,0.00074269803,0.74009264,0.25790033,0.00001026016],"about_ca_topic_score_codex":0.00077172887,"about_ca_topic_score_gemma":0.0010193018,"teacher_disagreement_score":0.041762184,"about_ca_system_score_codex":0.0013173447,"about_ca_system_score_gemma":0.0009153626,"threshold_uncertainty_score":0.1397084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101385135,0.001999793,0.04183913,0.0013453808,0.0007619841,0.00001777431,0.0002982261,0.00027801286,0.94332117],"genre_scores_gemma":[0.21821691,0.004282309,0.023918932,0.00077382475,0.00062156457,0.000058689908,0.000813447,0.0004240032,0.7508903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997688,0.000058357153,0.000010438115,0.000036148012,0.00010244559,0.000023703913],"domain_scores_gemma":[0.9998286,0.000034849134,0.000011526752,0.000033399854,0.000066326495,0.000025353354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003608469,0.00046427344,0.0002886067,0.00084016094,0.0009423169,0.0024931189,0.00035027525,0.00028176396,0.0247628],"category_scores_gemma":[0.00060195324,0.00032155422,0.00024114289,0.0010558396,0.0014749968,0.003234584,0.0010532867,0.0016124714,0.006598828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068020495,0.0000047854246,0.000020153826,0.000015716814,0.0000014083806,0.000011401929,0.000077560704,0.00010970406,0.00026830513,0.9790578,0.009180763,0.011245578],"study_design_scores_gemma":[0.000004910053,0.000009007643,0.00009442518,0.00003340728,0.0000040375558,0.00011932853,0.00012728042,0.00060553756,0.0006440816,0.74218667,0.25616342,0.000007803008],"about_ca_topic_score_codex":0.0005896835,"about_ca_topic_score_gemma":0.0010786611,"teacher_disagreement_score":0.0247628,"about_ca_system_score_codex":0.00089875294,"about_ca_system_score_gemma":0.00071886333,"threshold_uncertainty_score":0.08283985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58478093,0.00231386,0.06889645,0.0042432607,0.00075899845,0.00011738866,0.0010245868,0.00031201367,0.33755246],"genre_scores_gemma":[0.9644996,0.00048670228,0.008920621,0.00021739393,0.00038207896,0.00004793982,0.00048085814,0.00006403016,0.024900757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.00011843782,0.000043325705,0.00020158618,0.00016511143,0.00019313094],"domain_scores_gemma":[0.9983265,0.00043421515,0.00025526166,0.0002084162,0.0003537916,0.00042175935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134142,0.00050011487,0.00082997145,0.0023350448,0.004058472,0.004420875,0.0011303093,0.0012964964,0.009523992],"category_scores_gemma":[0.0025006474,0.00045610522,0.000897141,0.0019285016,0.0059531596,0.008877294,0.0041951863,0.00383722,0.00090504246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029372528,0.000008765667,0.00019998648,0.00001208063,0.0000021845103,0.000033925262,0.0002534376,0.00005540717,0.00024081462,0.99731123,0.00043545658,0.0014173073],"study_design_scores_gemma":[0.000015886282,0.000017526749,0.0004379912,0.000008327607,0.0000063477555,0.00016460643,0.00026587938,0.00036799427,0.00029709117,0.9924905,0.005920654,0.000007220806],"about_ca_topic_score_codex":0.00071033824,"about_ca_topic_score_gemma":0.00064836023,"teacher_disagreement_score":0.009523992,"about_ca_system_score_codex":0.0015651472,"about_ca_system_score_gemma":0.0008879826,"threshold_uncertainty_score":0.031860888},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051240914,0.004970967,0.019161534,0.0013495098,0.00063422543,0.000023675035,0.00013528568,0.00024760698,0.9729648],"genre_scores_gemma":[0.03212633,0.008107273,0.010512798,0.0014351464,0.0014330663,0.00008366706,0.00049154874,0.00035811716,0.945452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960583,0.00006776757,0.000012980636,0.00007205824,0.00020237044,0.00003909516],"domain_scores_gemma":[0.9998043,0.00007248911,0.0000084366475,0.00003375222,0.00006427178,0.000016781221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003568354,0.00086390704,0.00048464877,0.0017380591,0.001405719,0.002728276,0.001032591,0.00072805845,0.056621112],"category_scores_gemma":[0.00068318844,0.00040333078,0.00046374532,0.0012296436,0.0023740365,0.0040606367,0.001414544,0.002864801,0.025491206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067694295,0.000016627824,0.000030926174,0.00008748576,0.0000036416018,0.000020094396,0.00016013203,0.0001747863,0.0003247686,0.8803313,0.070009366,0.0488343],"study_design_scores_gemma":[0.0000037957632,0.0000046098385,0.000056188474,0.000080334285,0.0000046156365,0.00006218228,0.000045136738,0.00028382643,0.00040111408,0.32911074,0.6699417,0.0000057606226],"about_ca_topic_score_codex":0.00092943985,"about_ca_topic_score_gemma":0.0019333159,"teacher_disagreement_score":0.056621112,"about_ca_system_score_codex":0.0021194485,"about_ca_system_score_gemma":0.0011074698,"threshold_uncertainty_score":0.18941647},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040640068,0.0034733126,0.006412137,0.003995818,0.007912697,0.00010142083,0.0020116912,0.00091951597,0.97476715],"genre_scores_gemma":[0.0017286814,0.0022269222,0.0018710506,0.0013766408,0.0014658129,0.00007499588,0.0015425609,0.0003242689,0.989389],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993586,0.000072527786,0.000024614757,0.00013926538,0.00033811148,0.00006680216],"domain_scores_gemma":[0.9991258,0.00013128975,0.0000340856,0.0001316029,0.0004037431,0.00017345212],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00065247377,0.00091922295,0.00055654807,0.0017400509,0.0011985782,0.0040148688,0.0014620145,0.0015248851,0.52529126],"category_scores_gemma":[0.0026339553,0.0002977662,0.00050053216,0.001540388,0.00067714514,0.003288011,0.0022203836,0.0018394513,0.4355068],"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.000022689983,0.000026361939,0.00009542623,0.00015855765,0.0000023775528,0.000041482683,0.00012897533,0.00010452493,0.00034124206,0.058827415,0.7764287,0.1638223],"study_design_scores_gemma":[0.000001386394,0.00000484859,0.000054425567,0.00004550333,7.961444e-7,0.000027536067,0.000027316386,0.000019728615,0.000059759976,0.0053071594,0.9944494,0.0000021207793],"about_ca_topic_score_codex":0.001511607,"about_ca_topic_score_gemma":0.0023147494,"teacher_disagreement_score":0.47470874,"about_ca_system_score_codex":0.0011647275,"about_ca_system_score_gemma":0.0018560261,"threshold_uncertainty_score":0.67711437},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011910704,0.0037072857,0.016586646,0.2991481,0.67026585,0.00002384442,0.0005889154,0.0012492392,0.007238998],"genre_scores_gemma":[0.080524236,0.009871511,0.021687303,0.28593853,0.49156928,0.00023990926,0.0011899209,0.00308907,0.10589019],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99491704,0.00093006715,0.00051938766,0.0010838935,0.0019630142,0.00058670575],"domain_scores_gemma":[0.9839213,0.005019742,0.0008256518,0.0016640859,0.007848297,0.00072093034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058349795,0.0024522743,0.0014665667,0.0025982168,0.004334526,0.0031901244,0.005365217,0.0067849653,0.022162434],"category_scores_gemma":[0.03920575,0.0010372057,0.0020857549,0.0018603286,0.0072953496,0.007829305,0.0031719499,0.017480075,0.013148171],"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.000054827153,0.000012316555,0.00010403602,0.00014495125,0.000035854144,0.00025162686,0.00011845331,0.00012053493,0.00018856858,0.021111181,0.9704691,0.007388545],"study_design_scores_gemma":[0.00010590853,0.000042967407,0.00075403496,0.00028722943,0.00013577272,0.0009337041,0.00013111776,0.0021219472,0.0015687639,0.09446298,0.89930063,0.00015489943],"about_ca_topic_score_codex":0.006085174,"about_ca_topic_score_gemma":0.006202503,"teacher_disagreement_score":0.022162434,"about_ca_system_score_codex":0.0045919847,"about_ca_system_score_gemma":0.0036180462,"threshold_uncertainty_score":0.07414073},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013536116,0.1632394,0.2514167,0.022141712,0.023753673,0.00013609686,0.0017595522,0.0007185678,0.523298],"genre_scores_gemma":[0.31540567,0.27636704,0.15777318,0.016945396,0.050873727,0.00032584355,0.002305964,0.00060979894,0.17939347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.00011499424,0.000044891363,0.000090493755,0.00019161915,0.00004546382],"domain_scores_gemma":[0.9996593,0.00016108381,0.000028482022,0.0000249283,0.0000924351,0.00003375325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215333,0.00064481905,0.0004629075,0.0010987896,0.0012031307,0.0016434611,0.0005870786,0.00064318796,0.008568075],"category_scores_gemma":[0.000983417,0.0003078006,0.0006427167,0.0017319485,0.0015458696,0.0043419553,0.0010441426,0.0034667198,0.0032160347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019488878,0.000011621792,0.00008465551,0.00035067924,0.0000070633328,0.00016657081,0.00026476642,0.00032275508,0.0016803646,0.9538013,0.022292737,0.020998029],"study_design_scores_gemma":[0.000005101006,0.000055467593,0.0003424389,0.00016959362,0.00001720211,0.0003966013,0.00014378969,0.0010037804,0.0011612191,0.5416586,0.45501846,0.000027777458],"about_ca_topic_score_codex":0.0016842706,"about_ca_topic_score_gemma":0.001089732,"teacher_disagreement_score":0.008568075,"about_ca_system_score_codex":0.000942775,"about_ca_system_score_gemma":0.00062956056,"threshold_uncertainty_score":0.028663099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.587194,0.0019434234,0.3561448,0.0062163225,0.00016486128,0.0002023364,0.0013047328,0.0020197204,0.044809796],"genre_scores_gemma":[0.98470855,0.00029406877,0.009144133,0.00043639762,0.00008711237,0.000121779296,0.0005388642,0.00013619398,0.004532984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980678,0.00033640175,0.00007644324,0.000545694,0.00041702474,0.0005567639],"domain_scores_gemma":[0.99105877,0.006062543,0.00093926844,0.000554721,0.0005051873,0.00087952975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662978,0.0006155895,0.0017255134,0.0016441552,0.0012296214,0.0031950956,0.0024633994,0.0022111803,0.009937347],"category_scores_gemma":[0.0140002435,0.00059631147,0.0013171799,0.0011384424,0.0022652196,0.004689637,0.0023368318,0.0030329665,0.0007929557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063108944,0.00032776073,0.0056427037,0.00040188772,0.00014128441,0.0010670226,0.0005465621,0.20044468,0.009446881,0.7618541,0.008796178,0.0106998235],"study_design_scores_gemma":[0.00006281078,0.000058262078,0.0009893941,0.000032045227,0.0000306216,0.00023759878,0.00007768673,0.6561499,0.001020778,0.34059653,0.0007132696,0.000031082294],"about_ca_topic_score_codex":0.0046781423,"about_ca_topic_score_gemma":0.0034525143,"teacher_disagreement_score":0.009937347,"about_ca_system_score_codex":0.003866295,"about_ca_system_score_gemma":0.0014505576,"threshold_uncertainty_score":0.033243716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88127166,0.0004364947,0.0773767,0.00023366886,0.00011957456,0.00004563064,0.00015180405,0.00018551272,0.040178966],"genre_scores_gemma":[0.978204,0.0002937553,0.012170258,0.00010763362,0.00005273447,0.000039991068,0.00015851369,0.000050855713,0.008922256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997309,0.00004623653,0.000018076034,0.000038813538,0.00008703174,0.00007893887],"domain_scores_gemma":[0.99972373,0.00003398042,0.000063327476,0.00004608459,0.00005863031,0.00007432348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040400538,0.0002559498,0.000370118,0.0007434159,0.00079479173,0.0012085986,0.0004912695,0.00033669636,0.0026237946],"category_scores_gemma":[0.00072760513,0.00018702065,0.00059059163,0.0002924521,0.0015505502,0.0029615106,0.001092178,0.0009682794,0.00043944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004509424,0.000022690338,0.00048147308,0.000031614494,0.000006772982,0.00023418835,0.00024458728,0.0014807166,0.00804434,0.9851067,0.00039832623,0.0039036174],"study_design_scores_gemma":[0.00003917993,0.000078074205,0.0009304487,0.000032832668,0.000010723277,0.00047345978,0.00036158098,0.020879982,0.0052948752,0.96810126,0.0037607246,0.00003667761],"about_ca_topic_score_codex":0.0006984766,"about_ca_topic_score_gemma":0.00079043483,"teacher_disagreement_score":0.0026237946,"about_ca_system_score_codex":0.0005563635,"about_ca_system_score_gemma":0.0006193701,"threshold_uncertainty_score":0.008777499},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08142485,0.057715584,0.39162272,0.01402874,0.0026838728,0.00015706559,0.00152331,0.0016584219,0.44918543],"genre_scores_gemma":[0.82360095,0.014678114,0.041091334,0.0012216216,0.0025307252,0.00018034563,0.001243105,0.00040798247,0.11504583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989753,0.00034791394,0.000096287324,0.00019101198,0.00024580723,0.00014371132],"domain_scores_gemma":[0.99913675,0.00043906664,0.000077775876,0.00014972319,0.00013586649,0.000060806673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013144235,0.0010290478,0.0012471011,0.0031092477,0.0019398745,0.005208051,0.0011184722,0.0015769912,0.017981898],"category_scores_gemma":[0.002011409,0.0007669265,0.0007448523,0.0052257227,0.0049696174,0.010348018,0.0017254231,0.0031675205,0.0036071301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009040147,0.000007715182,0.000027485741,0.000036317666,0.0000041894823,0.000016216278,0.00014778467,0.00025875965,0.00014351524,0.9932114,0.0014412119,0.0046963384],"study_design_scores_gemma":[0.000005413567,0.0000037961008,0.000041428782,0.000012638872,0.0000038029862,0.00002354109,0.000038390997,0.0004393854,0.00009338177,0.9912258,0.008107634,0.0000047967724],"about_ca_topic_score_codex":0.0020062583,"about_ca_topic_score_gemma":0.0014127358,"teacher_disagreement_score":0.017981898,"about_ca_system_score_codex":0.0020084297,"about_ca_system_score_gemma":0.0009013973,"threshold_uncertainty_score":0.06015539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052976552,0.039413348,0.070018604,0.005352298,0.0014687381,0.000027545324,0.00020739001,0.00037619114,0.8778383],"genre_scores_gemma":[0.21376161,0.051259592,0.056523878,0.0035280203,0.0023935586,0.00011935582,0.00087916077,0.0003566625,0.6711782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997446,0.0000556014,0.000009362214,0.000036885394,0.00011978629,0.000033708264],"domain_scores_gemma":[0.9997849,0.00011170851,0.000012823203,0.000027521231,0.000047634578,0.000015396432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003309336,0.00052297424,0.00023011869,0.00090066466,0.0010405019,0.0018441527,0.00040393588,0.00059864734,0.018255567],"category_scores_gemma":[0.00059389777,0.00022491312,0.00035963583,0.0011768921,0.0018169398,0.0035881395,0.00060785405,0.0015717989,0.0047353595],"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.0000023781581,0.0000052626365,0.000018043216,0.000046681216,0.0000011175792,0.000016297143,0.00015080036,0.00023269109,0.00014726438,0.97460765,0.010140511,0.014631303],"study_design_scores_gemma":[0.0000022293768,0.0000072243106,0.000070867594,0.000069965456,0.0000019054511,0.00008594858,0.00006284074,0.00047598,0.00028876157,0.69438213,0.30454746,0.0000047601875],"about_ca_topic_score_codex":0.0010208202,"about_ca_topic_score_gemma":0.0014521421,"teacher_disagreement_score":0.018255567,"about_ca_system_score_codex":0.0014990638,"about_ca_system_score_gemma":0.0009722016,"threshold_uncertainty_score":0.06107092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3366438,0.0020843085,0.57957906,0.004320967,0.0004365666,0.00015779519,0.0015598517,0.0010033604,0.074214235],"genre_scores_gemma":[0.91363823,0.0006560858,0.06709459,0.00039828697,0.00056258333,0.00010782837,0.00095219334,0.00020663625,0.01638366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667645,0.0007172491,0.0003185005,0.0008113568,0.001088289,0.0003880495],"domain_scores_gemma":[0.98948705,0.005050596,0.0011395116,0.0008908495,0.0019459121,0.0014861615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023270815,0.0009322091,0.0010056496,0.0041236863,0.0020769136,0.008138076,0.0014379217,0.0012552656,0.0068254224],"category_scores_gemma":[0.0064649107,0.0010414227,0.0011620402,0.0034533478,0.0051019285,0.013469397,0.0035600504,0.00474572,0.001277823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054750093,0.00003052214,0.00047887187,0.000056045672,0.000011508355,0.00009098368,0.00036247945,0.00076367636,0.0016968271,0.9906176,0.00065015047,0.005186738],"study_design_scores_gemma":[0.000017148108,0.00004446761,0.00031737972,0.000023138698,0.000014978257,0.00024678948,0.00025747038,0.0053604837,0.0017136902,0.9860136,0.005963016,0.000027913742],"about_ca_topic_score_codex":0.00059344,"about_ca_topic_score_gemma":0.0007114917,"teacher_disagreement_score":0.008138076,"about_ca_system_score_codex":0.0022193855,"about_ca_system_score_gemma":0.0011541916,"threshold_uncertainty_score":0.022833288},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24927929,0.004713658,0.18883501,0.0072529567,0.001368319,0.0000777216,0.00075563305,0.00070643704,0.54701096],"genre_scores_gemma":[0.929562,0.0016093977,0.01827644,0.000955753,0.0014671911,0.00007218662,0.00069257367,0.00045098382,0.046913527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894184,0.00017216023,0.00006452556,0.00032605624,0.00030873387,0.00018660675],"domain_scores_gemma":[0.99776447,0.0010236114,0.00021753742,0.000297299,0.00041323574,0.00028386357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011238668,0.0007603996,0.0012863324,0.0031575644,0.002448499,0.005994321,0.001157052,0.0011061924,0.016501905],"category_scores_gemma":[0.0038168794,0.0007951209,0.0013423165,0.002464663,0.0045674574,0.00997146,0.0038202007,0.005695728,0.0016046574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018024606,0.0000123336695,0.00015722326,0.000020105754,0.000004787026,0.000028535162,0.00017318093,0.00010814342,0.00021554646,0.99598855,0.0009990663,0.0022744955],"study_design_scores_gemma":[0.0000067617784,0.0000053167932,0.00014311414,0.000011359671,0.00001021864,0.00006711298,0.00007303083,0.0006779655,0.00026598232,0.993407,0.0053257537,0.000006273957],"about_ca_topic_score_codex":0.00046517892,"about_ca_topic_score_gemma":0.0003908037,"teacher_disagreement_score":0.016501905,"about_ca_system_score_codex":0.0024988854,"about_ca_system_score_gemma":0.000609956,"threshold_uncertainty_score":0.05520439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002364717,0.0712741,0.12358101,0.018348204,0.0054177586,0.000058572616,0.0005029163,0.0010248378,0.77742785],"genre_scores_gemma":[0.12402655,0.10767968,0.18596216,0.013937983,0.010334163,0.0004162484,0.001677142,0.0013474878,0.5546186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995198,0.00014045126,0.00003064923,0.00006708844,0.00019919305,0.0000428413],"domain_scores_gemma":[0.99950373,0.00028358412,0.000017848986,0.000063390566,0.00008845371,0.00004303167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008465766,0.0004906392,0.00058497436,0.0017815686,0.0013469453,0.0052111475,0.0013111333,0.0010580452,0.032981288],"category_scores_gemma":[0.0014644985,0.0005771245,0.00050604925,0.0030017546,0.0030499105,0.009059372,0.0017609727,0.0040719165,0.011420707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004781454,0.000008674401,0.000016617843,0.000042158477,9.535305e-7,0.000018224468,0.00015697975,0.000116945615,0.0001483483,0.9538719,0.025466314,0.020148234],"study_design_scores_gemma":[0.000003165237,0.00000496219,0.000029940651,0.000060098046,7.913266e-7,0.00012111102,0.000075427946,0.00036779844,0.00010018658,0.4977989,0.50143224,0.0000054126062],"about_ca_topic_score_codex":0.000996023,"about_ca_topic_score_gemma":0.0014531513,"teacher_disagreement_score":0.032981288,"about_ca_system_score_codex":0.0018502902,"about_ca_system_score_gemma":0.0008300142,"threshold_uncertainty_score":0.11033338},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23334485,0.0007181705,0.7188185,0.0007738025,0.00026333635,0.00024301338,0.00035943458,0.00082669314,0.0446522],"genre_scores_gemma":[0.8040312,0.00065818965,0.17054954,0.00034449165,0.000363126,0.00044960764,0.00054874015,0.00054398976,0.02251109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658895,0.0007885298,0.00022944143,0.0007864101,0.00100609,0.00060063],"domain_scores_gemma":[0.99771273,0.0007978195,0.00019679456,0.0005180912,0.00047599882,0.00029849636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002623056,0.00083610625,0.0010950483,0.0031976236,0.0025599198,0.003971757,0.00099852,0.0010117611,0.006319716],"category_scores_gemma":[0.003536041,0.0005540781,0.001725953,0.0014933797,0.004997995,0.0060666725,0.004996383,0.0039268765,0.0014309816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000330119,0.000020343396,0.00020139714,0.000043650743,0.00001418579,0.00014049813,0.0005557469,0.0005889173,0.0050693876,0.9861326,0.0003619005,0.0068383985],"study_design_scores_gemma":[0.0000118426,0.000038445367,0.00016682094,0.000022144668,0.000017313041,0.00017337322,0.0002194952,0.0035094905,0.0056587425,0.98471606,0.005444786,0.00002144882],"about_ca_topic_score_codex":0.0004445369,"about_ca_topic_score_gemma":0.00039308006,"teacher_disagreement_score":0.006319716,"about_ca_system_score_codex":0.0009782205,"about_ca_system_score_gemma":0.0010995839,"threshold_uncertainty_score":0.02114153},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005645315,0.029838264,0.066792585,0.012118104,0.0036316973,0.000055193606,0.00094806403,0.00043755275,0.88053334],"genre_scores_gemma":[0.5032281,0.039614033,0.068100065,0.012121079,0.012310718,0.0004124888,0.0050586537,0.0011069201,0.35804787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985771,0.0004330187,0.00008672643,0.00032984716,0.00044111244,0.00013212857],"domain_scores_gemma":[0.9988657,0.0004611938,0.000057346893,0.0002362107,0.00031496456,0.000064556465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015616957,0.0007666116,0.0010784551,0.0034025137,0.0019437381,0.0024614527,0.0009842962,0.0013197422,0.03592937],"category_scores_gemma":[0.003703841,0.00039491223,0.0009024411,0.0022648587,0.0041063516,0.009212573,0.0026163168,0.003371283,0.008845845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017107988,0.0000119399765,0.00009807119,0.000077488054,0.000012191784,0.00003286456,0.00015339137,0.00010742506,0.000109284534,0.949152,0.030086514,0.020141773],"study_design_scores_gemma":[0.00000864193,0.0000061425576,0.00017505286,0.00003678094,0.000006646478,0.00006423611,0.000059034923,0.00024157387,0.00012689756,0.93581635,0.06345512,0.0000035979094],"about_ca_topic_score_codex":0.0018167018,"about_ca_topic_score_gemma":0.002125313,"teacher_disagreement_score":0.03592937,"about_ca_system_score_codex":0.0020261798,"about_ca_system_score_gemma":0.00061384856,"threshold_uncertainty_score":0.12019575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074655,0.0027900804,0.7842749,0.0036499915,0.0006845183,0.0001864811,0.00065323326,0.0018525333,0.13125335],"genre_scores_gemma":[0.73377544,0.0016773026,0.20533681,0.0011724002,0.00052291556,0.00031292954,0.0007290958,0.0006933554,0.05577979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985758,0.0004292114,0.000116024305,0.00024453405,0.00043517727,0.00019918129],"domain_scores_gemma":[0.9984895,0.0007379044,0.00011530834,0.0001999455,0.00028546166,0.0001718807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020688165,0.00083072117,0.0008995921,0.002820635,0.00332797,0.0063949465,0.0017606968,0.0017094682,0.009355413],"category_scores_gemma":[0.0036672733,0.0010101998,0.0017322791,0.0028410587,0.0038774696,0.008082174,0.0035669857,0.0041299537,0.0018623035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016034248,0.000017029704,0.000053009666,0.000039755756,0.0000055461305,0.000029514904,0.00014084723,0.000625201,0.00047036915,0.9936832,0.0006389213,0.0042805877],"study_design_scores_gemma":[0.000012685595,0.0000034256707,0.000028055145,0.000019575751,0.000009270497,0.000016357135,0.00003201267,0.004091047,0.00054796494,0.98972964,0.0054975534,0.000012418979],"about_ca_topic_score_codex":0.004565513,"about_ca_topic_score_gemma":0.00552608,"teacher_disagreement_score":0.009355413,"about_ca_system_score_codex":0.0054405597,"about_ca_system_score_gemma":0.0021533351,"threshold_uncertainty_score":0.03947425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031417978,0.0019427915,0.0027035284,0.0028653014,0.0046827723,0.00012510362,0.003126824,0.0009572986,0.98328227],"genre_scores_gemma":[0.0009793618,0.0011243301,0.00089575443,0.0010962947,0.00071724696,0.000072441515,0.002027458,0.00026421095,0.9928229],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992648,0.000071126306,0.000024186309,0.00014122509,0.00041682267,0.000081838785],"domain_scores_gemma":[0.9989225,0.00012928223,0.00003874367,0.00014627734,0.0005012157,0.00026196023],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000662519,0.0009413235,0.0006326549,0.0019940063,0.0015682171,0.005181893,0.0016559054,0.0016666292,0.70918167],"category_scores_gemma":[0.0027296322,0.00034060742,0.0005725321,0.0018649882,0.0006375612,0.003234029,0.002713554,0.0018851425,0.63831073],"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.000021674587,0.000028938295,0.000093080744,0.00012421807,0.0000017243061,0.00003469603,0.00008959602,0.00006523685,0.0002606989,0.020920372,0.8681784,0.11018139],"study_design_scores_gemma":[0.0000016702405,0.000005053729,0.00006706379,0.000047574307,7.0727424e-7,0.000021226448,0.000031589814,0.000012474494,0.000043850752,0.0023564473,0.99741024,0.0000020473701],"about_ca_topic_score_codex":0.0026038205,"about_ca_topic_score_gemma":0.0038928937,"teacher_disagreement_score":0.70918167,"about_ca_system_score_codex":0.0014796976,"about_ca_system_score_gemma":0.002246993,"threshold_uncertainty_score":0.41481704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5975684,0.0017899938,0.26876417,0.0008193082,0.0001339992,0.00012416384,0.00065990473,0.00094132114,0.12919874],"genre_scores_gemma":[0.96301675,0.00040201205,0.01928416,0.0001401956,0.000054962995,0.000066339584,0.00025543218,0.000081932274,0.016698118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956626,0.00007771662,0.00003208386,0.00008732383,0.00016441017,0.000072241164],"domain_scores_gemma":[0.9995646,0.00014216283,0.000044166467,0.000096667914,0.00007907982,0.000073211755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035922258,0.00024211186,0.0002137202,0.0009907664,0.0007497808,0.0016849884,0.0004869551,0.0005204379,0.005509149],"category_scores_gemma":[0.00076258194,0.0002255249,0.00038939223,0.000544261,0.0021114945,0.003995996,0.0019079136,0.0007988887,0.0006281081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000826371,0.000006059597,0.00044227263,0.000024203902,0.000003959726,0.000093857125,0.0005850752,0.0002566517,0.0014808135,0.98953164,0.0003135731,0.007253686],"study_design_scores_gemma":[0.000005908555,0.000039117,0.003042179,0.000027770953,0.000013137826,0.00029364537,0.00050094596,0.003312925,0.002487768,0.96310323,0.027155185,0.000018131477],"about_ca_topic_score_codex":0.0014011908,"about_ca_topic_score_gemma":0.0014700105,"teacher_disagreement_score":0.005509149,"about_ca_system_score_codex":0.0006915633,"about_ca_system_score_gemma":0.00044995858,"threshold_uncertainty_score":0.018429875},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2076918,0.020041395,0.29616076,0.1239325,0.002329156,0.00009591679,0.00036079626,0.00068160635,0.34870607],"genre_scores_gemma":[0.9455853,0.0029294146,0.027727243,0.006539953,0.0009513275,0.000101722384,0.00013893357,0.00010973929,0.015916329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970425,0.0012598801,0.00012379847,0.00038575043,0.0009743569,0.00021370107],"domain_scores_gemma":[0.99562234,0.0028400216,0.00024499907,0.0005937152,0.0005320876,0.00016686195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035857179,0.00033246542,0.00060055783,0.0011381286,0.0028494706,0.0029689355,0.0012153276,0.0030591586,0.003484588],"category_scores_gemma":[0.009385214,0.0004041891,0.0006732466,0.0013223328,0.013989334,0.017519567,0.003607999,0.0044645485,0.00066249695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064639007,0.0000052682512,0.00005735452,0.0000078149305,0.000001444378,0.00000985536,0.00018341809,0.00015234736,0.000047789235,0.9975943,0.00075310154,0.0011807702],"study_design_scores_gemma":[0.0000058075034,0.00000328767,0.000034696135,0.0000081965345,0.0000012626381,0.0000139489985,0.00005554196,0.0003156302,0.00012386533,0.9944788,0.00495494,0.0000039672],"about_ca_topic_score_codex":0.0019020096,"about_ca_topic_score_gemma":0.0010691421,"teacher_disagreement_score":0.0035857179,"about_ca_system_score_codex":0.0030025297,"about_ca_system_score_gemma":0.0013261769,"threshold_uncertainty_score":0.021784961},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581032,0.00016369099,0.0144384755,0.0003509811,0.00007405857,0.00001770758,0.00030671927,0.0008421563,0.025703],"genre_scores_gemma":[0.99500066,0.000024942497,0.0018101573,0.000030010544,0.0000048386264,0.0000035153614,0.00011920004,0.00011479657,0.002891767],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99992764,0.0000072419375,0.0000032258447,0.000022445336,0.000016757207,0.000022584065],"domain_scores_gemma":[0.99990773,0.000014590495,0.0000145898275,0.00002319074,0.000019849374,0.000020048907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000815376,0.00022474356,0.00026032637,0.00063334877,0.0006336349,0.001303479,0.0006424341,0.0007505861,0.0058096554],"category_scores_gemma":[0.0005724298,0.00030343965,0.00016165551,0.000450854,0.0009827843,0.00067569216,0.0004972514,0.00044548162,0.00044924457],"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.0021600574,0.00030460165,0.023722406,0.00033530733,0.00010006709,0.00330906,0.0029452953,0.20741452,0.36192688,0.35390478,0.0061133695,0.037763625],"study_design_scores_gemma":[0.00032440136,0.00024459534,0.07688525,0.00006214941,0.00009898127,0.0012135932,0.0035778761,0.6415964,0.071155414,0.17420676,0.030464103,0.0001705035],"about_ca_topic_score_codex":0.009047378,"about_ca_topic_score_gemma":0.0096345395,"teacher_disagreement_score":0.009047378,"about_ca_system_score_codex":0.000871489,"about_ca_system_score_gemma":0.00032162998,"threshold_uncertainty_score":0.019435287},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012733493,0.00066111283,0.032010194,0.002014809,0.0005520903,0.00010231127,0.0012744026,0.00053333666,0.9615785],"genre_scores_gemma":[0.0866173,0.0018202455,0.028314555,0.0018733228,0.00084774016,0.00033230495,0.0055191577,0.0007616891,0.8739138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985037,0.00032649716,0.000066210756,0.00038513343,0.0005371074,0.00018140477],"domain_scores_gemma":[0.99911815,0.00023328648,0.000036563277,0.00026467815,0.000282667,0.000064631866],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008410224,0.0010911803,0.0006923982,0.0026321046,0.00265086,0.006320842,0.0020330776,0.0016729995,0.17932343],"category_scores_gemma":[0.0026683095,0.0006024273,0.0008427311,0.0020173802,0.0030640212,0.008264368,0.0027169914,0.0037505839,0.066053145],"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.000006788526,0.0000080435575,0.000023905433,0.000026583199,0.0000029135113,0.000011994001,0.00009705201,0.00008624678,0.00008870604,0.9661062,0.022131361,0.011410314],"study_design_scores_gemma":[0.000009929543,0.000005695959,0.000040278523,0.00004047903,0.0000064533824,0.000049643786,0.00016836694,0.00043167296,0.00038496964,0.6443658,0.3544914,0.0000052748533],"about_ca_topic_score_codex":0.0022181652,"about_ca_topic_score_gemma":0.002159176,"teacher_disagreement_score":0.82067657,"about_ca_system_score_codex":0.0023623114,"about_ca_system_score_gemma":0.0017578179,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024027447,0.0025297962,0.1216699,0.0020069424,0.00050642627,0.00012346168,0.0010045222,0.000999369,0.86875683],"genre_scores_gemma":[0.16198495,0.0044826553,0.06909669,0.0013548955,0.0006998951,0.0003341316,0.0026745342,0.00088445755,0.7584879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993249,0.00016677959,0.00003361551,0.00015451209,0.0002625581,0.000057665962],"domain_scores_gemma":[0.99940634,0.00022705406,0.000026669428,0.00015470633,0.0001511648,0.000034057506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005773016,0.0007219256,0.00046664142,0.0012108,0.0012769969,0.0037121451,0.0011324531,0.00079412287,0.09473809],"category_scores_gemma":[0.0019206265,0.00053516525,0.00049122877,0.001123458,0.0015936345,0.0053117773,0.0017574681,0.002304875,0.028474078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068913278,0.000008429432,0.000019495259,0.00005776348,0.0000034719617,0.000012948403,0.00008277283,0.00021352676,0.0002718231,0.95496553,0.019462602,0.02489469],"study_design_scores_gemma":[0.000010108784,0.000006655164,0.000042974523,0.000037856877,0.0000055764494,0.000052828767,0.000038137274,0.0008706741,0.00066362653,0.7356105,0.26265618,0.000004841338],"about_ca_topic_score_codex":0.0006626172,"about_ca_topic_score_gemma":0.0006332262,"teacher_disagreement_score":0.09473809,"about_ca_system_score_codex":0.0014313727,"about_ca_system_score_gemma":0.000863146,"threshold_uncertainty_score":0.31693053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07413318,0.0013635476,0.65947556,0.0029321676,0.0009957084,0.0002418727,0.0009021696,0.0010742535,0.25888148],"genre_scores_gemma":[0.6984436,0.0017835753,0.26541838,0.0012549114,0.00038646715,0.00037942253,0.0010048698,0.000521243,0.030807493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999388,0.000098652075,0.000058932736,0.00014520579,0.00018547697,0.00012370084],"domain_scores_gemma":[0.99939203,0.00019589641,0.00008510873,0.000061573206,0.00017621306,0.000089202294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066556974,0.0003187198,0.0002825403,0.0015459734,0.0011952275,0.0027996418,0.00041294293,0.0004895306,0.007853362],"category_scores_gemma":[0.0016328637,0.00028903544,0.0006762243,0.00089020253,0.00217346,0.0043759937,0.0019976469,0.0014817063,0.0015100245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000366583,0.000008499084,0.0002906895,0.00006673194,0.0000051775305,0.00011445144,0.00029639906,0.00017875023,0.004127565,0.98011637,0.0019267176,0.012831964],"study_design_scores_gemma":[0.000042003372,0.000036345067,0.00070416485,0.000031972042,0.00001628105,0.00047011432,0.00038558288,0.0024055466,0.007724984,0.8895594,0.09860233,0.000021319836],"about_ca_topic_score_codex":0.002160294,"about_ca_topic_score_gemma":0.0026325167,"teacher_disagreement_score":0.007853362,"about_ca_system_score_codex":0.0007688737,"about_ca_system_score_gemma":0.0005884868,"threshold_uncertainty_score":0.026272118},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031059224,0.0016302404,0.0028843137,0.11843231,0.8575143,0.000027970125,0.0010191165,0.00065934187,0.017521864],"genre_scores_gemma":[0.02650009,0.008743247,0.0103576435,0.18192945,0.28770414,0.00025648306,0.00482128,0.0027177306,0.47696984],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99512416,0.00095188274,0.00047914367,0.00074658147,0.0021752834,0.000522928],"domain_scores_gemma":[0.985546,0.0028782266,0.0005544438,0.0013384492,0.009026028,0.00065686076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029200271,0.0015078771,0.001602314,0.0032442636,0.0036606777,0.003963691,0.0027615998,0.0045327866,0.07810133],"category_scores_gemma":[0.030431783,0.000907028,0.0021419208,0.0021510413,0.0027073466,0.003701412,0.0021270714,0.0073501603,0.04058973],"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.000012637786,0.000005453014,0.000023733304,0.00004499179,0.000007686442,0.0000557179,0.000017902335,0.000020109374,0.00003611195,0.0044832076,0.99308217,0.0022103537],"study_design_scores_gemma":[0.000029592591,0.000017754463,0.0005784822,0.00016518586,0.00004491997,0.00028453016,0.000067123474,0.000418476,0.0005102326,0.017356016,0.98047936,0.00004830635],"about_ca_topic_score_codex":0.012947605,"about_ca_topic_score_gemma":0.016401116,"teacher_disagreement_score":0.07810133,"about_ca_system_score_codex":0.0051968177,"about_ca_system_score_gemma":0.0034559087,"threshold_uncertainty_score":0.261275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011487758,0.000761549,0.9568574,0.00071027986,0.000109402485,0.00003802523,0.000079400874,0.00005241115,0.02990383],"genre_scores_gemma":[0.52311057,0.0034861828,0.42995512,0.0010740866,0.0008880127,0.00032775808,0.0003260318,0.00023224478,0.040600043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992606,0.00030640038,0.00004502731,0.00011941972,0.00021206032,0.000056504698],"domain_scores_gemma":[0.9992918,0.00027611727,0.00006859776,0.00009365477,0.00020764791,0.00006211681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019687507,0.00090845546,0.0006432174,0.0017237196,0.00097133324,0.0015528988,0.001179438,0.0008125513,0.0036491407],"category_scores_gemma":[0.0021348952,0.00034131994,0.00093105744,0.001325427,0.0023972518,0.004017083,0.0017650744,0.002776034,0.0005150933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028199413,0.000003887279,0.00003692857,0.000013961059,0.0000021788594,0.000017648163,0.000055580967,0.0021488294,0.00038733854,0.99401444,0.0002719484,0.0030443694],"study_design_scores_gemma":[0.000004262707,0.00003072397,0.000081122846,0.00002276795,0.0000071220447,0.00007280215,0.00008668594,0.032863148,0.00059761415,0.9575909,0.008629592,0.000013260331],"about_ca_topic_score_codex":0.0009030505,"about_ca_topic_score_gemma":0.0008620527,"teacher_disagreement_score":0.0036491407,"about_ca_system_score_codex":0.0012490281,"about_ca_system_score_gemma":0.0009399676,"threshold_uncertainty_score":0.012207627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39980558,0.0016638739,0.23274672,0.0037652391,0.00092742604,0.000121014484,0.001065997,0.0010963272,0.35880777],"genre_scores_gemma":[0.8829542,0.0008788514,0.040486496,0.0007755223,0.00047533397,0.00013464711,0.00071047555,0.00043968117,0.073144734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919826,0.0002191223,0.00004302287,0.00012748338,0.00020771085,0.00020441515],"domain_scores_gemma":[0.9985837,0.0005847564,0.00018956346,0.00017472166,0.0002040972,0.00026316245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074165926,0.0007513633,0.0009857842,0.001978418,0.0021960638,0.0031518543,0.0010911932,0.000760538,0.018978275],"category_scores_gemma":[0.0031224329,0.00069516356,0.0007979198,0.0016911437,0.0032875093,0.0043233475,0.0035961526,0.0023115429,0.0030215785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035733912,0.000007574995,0.000056373945,0.000023248112,0.00000280804,0.000034106062,0.00014088802,0.00047757835,0.00027712763,0.99538076,0.00097223325,0.002591712],"study_design_scores_gemma":[0.000015676509,0.000011041461,0.000058176567,0.0000120402,0.000004201355,0.000053260617,0.0001225468,0.0024905847,0.00027631441,0.99349207,0.0034561462,0.000007884598],"about_ca_topic_score_codex":0.0019571548,"about_ca_topic_score_gemma":0.0018898435,"teacher_disagreement_score":0.018978275,"about_ca_system_score_codex":0.0013695367,"about_ca_system_score_gemma":0.00067038275,"threshold_uncertainty_score":0.0634886},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026913347,0.024858562,0.28658387,0.0059508868,0.0019683442,0.000037832826,0.00026625764,0.0003462251,0.6530746],"genre_scores_gemma":[0.6788112,0.017899757,0.10758115,0.0012669609,0.0042571337,0.000102255566,0.0002860886,0.00014840516,0.18964703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996147,0.00012636119,0.000021197175,0.00007050479,0.00013911269,0.000028138367],"domain_scores_gemma":[0.9996606,0.0001684465,0.000027364245,0.000057188627,0.000058124184,0.00002814234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128571,0.0005466903,0.00042934908,0.0011933208,0.0008425291,0.0033953697,0.0008958649,0.00055565045,0.0072410167],"category_scores_gemma":[0.0011061302,0.00025272975,0.00047757107,0.001177603,0.0035584606,0.003929326,0.0010384624,0.0022924608,0.0014529459],"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.0000014002234,0.0000018765151,0.0000069414614,0.000008063416,8.603422e-7,0.000008053218,0.000049936403,0.00013067471,0.000095404015,0.99734014,0.0004650279,0.0018915893],"study_design_scores_gemma":[0.0000024740593,0.0000070850983,0.000035507077,0.000009083888,0.0000029300659,0.000056482833,0.000049727703,0.0006384953,0.0001299412,0.9666104,0.032454386,0.000003636406],"about_ca_topic_score_codex":0.00079025334,"about_ca_topic_score_gemma":0.0006882613,"teacher_disagreement_score":0.0072410167,"about_ca_system_score_codex":0.0014349915,"about_ca_system_score_gemma":0.0005707396,"threshold_uncertainty_score":0.024223566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71855915,0.00071772694,0.14904627,0.0023518563,0.00017244832,0.000045184865,0.00025648208,0.0004941634,0.12835683],"genre_scores_gemma":[0.99275655,0.000068123736,0.005406487,0.00011110701,0.000036832906,0.000014613553,0.000051790674,0.00003114548,0.0015234681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979851,0.00083121844,0.000162184,0.0003677982,0.00041998026,0.00023370718],"domain_scores_gemma":[0.9966137,0.0015259328,0.00024928732,0.00086400163,0.00055933034,0.0001877453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028889643,0.00021287517,0.00049022073,0.001386293,0.0016074773,0.0032346023,0.00064434786,0.00088462455,0.0029491533],"category_scores_gemma":[0.0040028687,0.00033201184,0.0005840242,0.0007579991,0.007199979,0.0059829615,0.0028929862,0.0014908868,0.0002484946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010047475,0.0000035370404,0.0001568131,0.000009769249,0.0000025958714,0.000041678013,0.00033193597,0.000107462714,0.0005121218,0.99790335,0.00011377906,0.0008069083],"study_design_scores_gemma":[0.00001511897,0.000015201842,0.0003708936,0.000012169723,0.0000071119466,0.00011487496,0.000421391,0.0018579856,0.001269719,0.9927059,0.0031978898,0.000011816874],"about_ca_topic_score_codex":0.00051158987,"about_ca_topic_score_gemma":0.00051799923,"teacher_disagreement_score":0.0032346023,"about_ca_system_score_codex":0.0011300391,"about_ca_system_score_gemma":0.00043708933,"threshold_uncertainty_score":0.015278459},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21620733,0.005004822,0.30429456,0.004182208,0.0029895834,0.00013535429,0.0019671053,0.0015212437,0.46369776],"genre_scores_gemma":[0.881297,0.0025057958,0.06940114,0.00083020213,0.0010453948,0.00020668046,0.0010429958,0.0004725687,0.043198183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978446,0.00051159697,0.00021496534,0.00049999246,0.00054777856,0.0003811055],"domain_scores_gemma":[0.9931865,0.0033237669,0.00063430215,0.0011163452,0.00070889987,0.0010302614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018686258,0.00076472404,0.0010387345,0.004628121,0.00298646,0.005514666,0.0013328984,0.0014216623,0.015955744],"category_scores_gemma":[0.011940705,0.0007002018,0.0009558435,0.0027412286,0.0054351236,0.013272902,0.0041688783,0.0034679605,0.0039156848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006377681,0.000007858926,0.00028518034,0.0000504239,0.000006440971,0.00005368037,0.00014984171,0.00032074575,0.00049450103,0.98377013,0.0022326042,0.012564826],"study_design_scores_gemma":[0.000007681051,0.000015078116,0.0002198332,0.000039241655,0.000010806729,0.0001393568,0.00008548904,0.0010598132,0.00093410077,0.9866002,0.010873912,0.000014510678],"about_ca_topic_score_codex":0.0007371619,"about_ca_topic_score_gemma":0.00089070055,"teacher_disagreement_score":0.015955744,"about_ca_system_score_codex":0.0015570178,"about_ca_system_score_gemma":0.00090706773,"threshold_uncertainty_score":0.05337727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04948552,0.0023278578,0.70085776,0.008635935,0.0031854415,0.00019612316,0.0012612713,0.0015162032,0.23253387],"genre_scores_gemma":[0.6786164,0.0029707968,0.2294248,0.0069126235,0.0022221399,0.00057255605,0.0016042562,0.0019189029,0.075757496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835145,0.0004926346,0.00010261577,0.0003830071,0.00043787487,0.00023251024],"domain_scores_gemma":[0.9923368,0.004864551,0.00032148825,0.00094568037,0.0009760742,0.00055537856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018486081,0.00086899847,0.0011291486,0.0012474225,0.003474765,0.002990697,0.0023482833,0.0023936876,0.016144032],"category_scores_gemma":[0.010726274,0.0011266345,0.0021556295,0.0016635046,0.004042535,0.013765438,0.007389162,0.008343468,0.0035419164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003141153,0.00006128019,0.00019500247,0.00013021579,0.000016949321,0.0001814121,0.00048544048,0.0004829124,0.0012833884,0.9789523,0.009234648,0.008944913],"study_design_scores_gemma":[0.000017035634,0.000014534212,0.00020937259,0.000035782963,0.00002335924,0.00028009617,0.00012873804,0.0015426989,0.0008819776,0.98446876,0.012377903,0.000019663194],"about_ca_topic_score_codex":0.0021537398,"about_ca_topic_score_gemma":0.003016618,"teacher_disagreement_score":0.016144032,"about_ca_system_score_codex":0.0019934885,"about_ca_system_score_gemma":0.0013767186,"threshold_uncertainty_score":0.054007173},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03287576,0.002365856,0.6452006,0.0183893,0.0033707626,0.00010919968,0.0012249062,0.0012133669,0.29525015],"genre_scores_gemma":[0.68237895,0.002772286,0.21868603,0.0076200548,0.0029151922,0.00027797505,0.0012722565,0.00086499786,0.08321223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989637,0.00023135493,0.000046341513,0.00028893896,0.00029718265,0.00017241655],"domain_scores_gemma":[0.99783224,0.0009290206,0.00009147736,0.00040846903,0.00061606144,0.00012278074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715352,0.0012084098,0.0009183555,0.0020057133,0.0015234068,0.0022196348,0.0024071534,0.001752314,0.030446144],"category_scores_gemma":[0.004733688,0.0005414723,0.0020905652,0.0017099646,0.002907324,0.009128971,0.0039155283,0.0030461545,0.0037303837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003523962,0.000017842873,0.00011535084,0.00007956396,0.000013452668,0.00009153373,0.0001544846,0.0002530175,0.00053149665,0.9860735,0.00626943,0.0063649835],"study_design_scores_gemma":[0.00002613486,0.000016375456,0.000215793,0.000027729558,0.000021968628,0.00016006138,0.000064260705,0.0023218063,0.00055885076,0.9739699,0.02260317,0.000013898146],"about_ca_topic_score_codex":0.0022651323,"about_ca_topic_score_gemma":0.0016071736,"teacher_disagreement_score":0.030446144,"about_ca_system_score_codex":0.001718604,"about_ca_system_score_gemma":0.00094868045,"threshold_uncertainty_score":0.10185248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48161224,0.0009895558,0.40435553,0.0022466185,0.00043741686,0.00017224412,0.00085202313,0.00072312617,0.10861126],"genre_scores_gemma":[0.93175304,0.0004422537,0.06048646,0.00045692179,0.0002815118,0.00008256274,0.00050362543,0.00015977495,0.0058338665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872285,0.00022146665,0.00008627956,0.00026892064,0.00044859466,0.00025177468],"domain_scores_gemma":[0.9964349,0.0016576643,0.0002726782,0.00047807797,0.0006734089,0.00048326983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513144,0.00041477729,0.0005934366,0.00096419244,0.0017691895,0.0027885323,0.0006072237,0.00062438933,0.004217678],"category_scores_gemma":[0.005770354,0.00044540118,0.0012163469,0.0011416314,0.0052021574,0.0042027985,0.0029168688,0.0026442294,0.0007203714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013500603,0.00002944836,0.00097546645,0.000064848304,0.000008630705,0.0002574789,0.00055348827,0.000950631,0.006830579,0.98030716,0.0011955603,0.008691721],"study_design_scores_gemma":[0.00009454567,0.0001383177,0.0013259695,0.000028420043,0.000021336724,0.0006816187,0.00059677183,0.00911878,0.017192392,0.9542544,0.016499674,0.000047835336],"about_ca_topic_score_codex":0.0025010232,"about_ca_topic_score_gemma":0.001758679,"teacher_disagreement_score":0.004217678,"about_ca_system_score_codex":0.0015361214,"about_ca_system_score_gemma":0.0010709882,"threshold_uncertainty_score":0.014109552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064898,0.00029903767,0.92963254,0.00025364672,0.000057668596,0.00010250249,0.00021163853,0.000473556,0.0040713903],"genre_scores_gemma":[0.81093156,0.00034335672,0.18309285,0.00018882468,0.00006902359,0.0003485307,0.0006019231,0.00018620897,0.0042376844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960961,0.0012737922,0.00035158038,0.00071762997,0.0011668025,0.00039413603],"domain_scores_gemma":[0.9898078,0.006486286,0.00086901156,0.001363639,0.0011193298,0.00035403922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031092258,0.00096243486,0.0014048404,0.001835839,0.0012555831,0.003377972,0.0022269408,0.001595438,0.005654759],"category_scores_gemma":[0.020027222,0.0008433963,0.0015737227,0.0019792987,0.002290053,0.006225896,0.003275594,0.0026450697,0.0006955976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005027571,0.00009229009,0.00068933156,0.00018421888,0.00011744411,0.00009978804,0.00045044336,0.31885505,0.0022925022,0.6307338,0.0009716766,0.045010727],"study_design_scores_gemma":[0.00002815392,0.00004912224,0.00008841379,0.000026351454,0.000025372126,0.00003230733,0.00007819019,0.46960786,0.0019528273,0.52711743,0.00097549974,0.00001855314],"about_ca_topic_score_codex":0.0026916028,"about_ca_topic_score_gemma":0.0026014945,"teacher_disagreement_score":0.005654759,"about_ca_system_score_codex":0.002770777,"about_ca_system_score_gemma":0.0015671275,"threshold_uncertainty_score":0.020103514},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20332971,0.02038813,0.1550018,0.23494487,0.004685256,0.00011695654,0.001012437,0.000583834,0.37993708],"genre_scores_gemma":[0.94073886,0.0044444725,0.015675494,0.011767839,0.004077658,0.000108248,0.0004579321,0.00024169534,0.022487847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979942,0.0007213027,0.00013423689,0.00042190094,0.0004554838,0.0002729026],"domain_scores_gemma":[0.9933694,0.0043447046,0.00031925197,0.0009982102,0.00068414997,0.0002844071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043204254,0.0006168275,0.0018052007,0.0023257213,0.0052552056,0.0054211556,0.0022113286,0.005736689,0.012456574],"category_scores_gemma":[0.014917984,0.00085924775,0.0014646727,0.0031194773,0.013517613,0.04177995,0.0062426287,0.0070132236,0.0013415528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013754406,0.0000093371455,0.000050060687,0.000011526228,0.0000029585576,0.000014340493,0.00017751525,0.00006316674,0.000028722632,0.9972464,0.001416811,0.00096544897],"study_design_scores_gemma":[0.0000063031725,0.0000011887033,0.000019665442,0.000003666884,0.0000012614547,0.000011527963,0.000032626653,0.00008781959,0.000023293234,0.998389,0.0014209257,0.0000028243564],"about_ca_topic_score_codex":0.0014891912,"about_ca_topic_score_gemma":0.00089221844,"teacher_disagreement_score":0.012456574,"about_ca_system_score_codex":0.0023745403,"about_ca_system_score_gemma":0.0016679411,"threshold_uncertainty_score":0.041671336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5419147,0.0009913791,0.3719364,0.0021558166,0.0003052594,0.00018661219,0.00045814557,0.0022774434,0.07977415],"genre_scores_gemma":[0.9230757,0.00031871596,0.059134893,0.00024936826,0.00012540077,0.00008335221,0.00029563214,0.000275642,0.016441256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978969,0.00048227963,0.00015634335,0.0005705186,0.0006247123,0.00026922507],"domain_scores_gemma":[0.99254894,0.0032222697,0.00090447173,0.0016952257,0.0012774189,0.00035164418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293278,0.00048411984,0.0006344876,0.0020280222,0.0018348772,0.0031128444,0.000961927,0.0008438089,0.009984672],"category_scores_gemma":[0.012289976,0.00045180955,0.0010139236,0.0018032633,0.0031703538,0.004210983,0.004637926,0.0022064124,0.0008169829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000294913,0.000082959996,0.011118051,0.00022180316,0.00009627245,0.0019829313,0.0023251488,0.005949356,0.010871367,0.9058351,0.0044773496,0.05674482],"study_design_scores_gemma":[0.00006367673,0.00015207504,0.005773483,0.0001143683,0.00016440394,0.0030130865,0.0021887906,0.10825607,0.017513623,0.8302993,0.032391187,0.00006986101],"about_ca_topic_score_codex":0.0036389157,"about_ca_topic_score_gemma":0.006182091,"teacher_disagreement_score":0.009984672,"about_ca_system_score_codex":0.0015002034,"about_ca_system_score_gemma":0.000726501,"threshold_uncertainty_score":0.033402085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34002405,0.0032298279,0.5524176,0.00664267,0.0004632968,0.00017158862,0.0011799436,0.0005964544,0.095274635],"genre_scores_gemma":[0.8833797,0.002875494,0.07576003,0.00081382476,0.00053191674,0.00020196667,0.0012012483,0.0002668649,0.03496903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978904,0.0008166795,0.00013806114,0.00062936597,0.00026221192,0.00026320558],"domain_scores_gemma":[0.9904529,0.0066518816,0.0007057709,0.0009086153,0.000530145,0.00075067754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020964693,0.00053189765,0.0010117616,0.0020277018,0.002715843,0.0046925023,0.002572671,0.0024043096,0.009675273],"category_scores_gemma":[0.013720276,0.0009588115,0.0014242288,0.0025973767,0.0042190985,0.018442513,0.003921268,0.0040255454,0.0012021163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042147258,0.00002787975,0.00026213954,0.00006130542,0.000009844882,0.00007278859,0.00046575884,0.0014824457,0.00020930124,0.98861176,0.0012992304,0.007455248],"study_design_scores_gemma":[0.000009800153,0.00000706699,0.000065332264,0.000011635395,0.0000070451333,0.000066373825,0.00018012292,0.003587637,0.00015908107,0.9936924,0.0022061483,0.0000074566865],"about_ca_topic_score_codex":0.0023930124,"about_ca_topic_score_gemma":0.0013874652,"teacher_disagreement_score":0.009675273,"about_ca_system_score_codex":0.0014559736,"about_ca_system_score_gemma":0.0011525265,"threshold_uncertainty_score":0.03236699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75446826,0.0005226332,0.1470187,0.0005429407,0.00013166567,0.00011605136,0.0004907131,0.0004320986,0.096276976],"genre_scores_gemma":[0.9640794,0.00025326837,0.020421673,0.00013336113,0.00009224935,0.00010426946,0.00039047014,0.00009263982,0.014432669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990453,0.00017713758,0.000051603787,0.00023204494,0.00028200666,0.00021187315],"domain_scores_gemma":[0.998971,0.00036691685,0.00014216163,0.00011663624,0.000111567664,0.00029173316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056776847,0.00062256504,0.0005062379,0.0011933617,0.0021010241,0.0022782476,0.0008025722,0.0005084443,0.010422341],"category_scores_gemma":[0.0014755257,0.0004998952,0.00073206756,0.0010129185,0.0026058485,0.004425558,0.0025872483,0.0016881091,0.000977437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010709227,0.000052379997,0.001064789,0.0000486093,0.000011574738,0.0002666237,0.0009816677,0.002033912,0.0062890174,0.9821177,0.0006215022,0.0064052152],"study_design_scores_gemma":[0.00003456035,0.00010719757,0.0016616131,0.000021452543,0.00002262368,0.0007458492,0.001283859,0.010300187,0.00923301,0.96345943,0.01308071,0.000049465776],"about_ca_topic_score_codex":0.0009500196,"about_ca_topic_score_gemma":0.001043548,"teacher_disagreement_score":0.010422341,"about_ca_system_score_codex":0.0008438347,"about_ca_system_score_gemma":0.0003593296,"threshold_uncertainty_score":0.034866214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3578463,0.0010993084,0.5456877,0.00045391166,0.00017989348,0.00009293797,0.00037324033,0.00036440406,0.093902394],"genre_scores_gemma":[0.897211,0.00020909235,0.08585181,0.000100167395,0.00006878963,0.00008230161,0.00031117344,0.000081888225,0.016083704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987527,0.00021609521,0.00008148222,0.0002802436,0.00047709636,0.00019247769],"domain_scores_gemma":[0.99851424,0.0003239616,0.00018583813,0.00014702913,0.00055611465,0.00027278793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013882793,0.0003554435,0.00036223076,0.0016250599,0.0017002287,0.0030659428,0.0006419889,0.00047041773,0.004153904],"category_scores_gemma":[0.002061565,0.0002488583,0.0005084647,0.000981349,0.0036152555,0.0037390809,0.0012868844,0.0011188143,0.00065523747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011073109,0.00002089143,0.0006776649,0.00004325021,0.000010186234,0.00019854383,0.00093441794,0.0026837501,0.004133006,0.9784081,0.00039889183,0.0123804975],"study_design_scores_gemma":[0.000034630863,0.00015188745,0.0013566168,0.00004453719,0.000017896211,0.00035634122,0.0010206879,0.038923644,0.009840862,0.92074263,0.027455773,0.000054359356],"about_ca_topic_score_codex":0.0013559742,"about_ca_topic_score_gemma":0.0011426726,"teacher_disagreement_score":0.004153904,"about_ca_system_score_codex":0.0013225047,"about_ca_system_score_gemma":0.0006407061,"threshold_uncertainty_score":0.013896227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040708496,0.03600026,0.012170936,0.003814877,0.0008353363,0.000018142666,0.0002558913,0.00030135093,0.9425323],"genre_scores_gemma":[0.23915346,0.04788583,0.007795014,0.0024966772,0.0015962635,0.00006445828,0.00071377336,0.00030722324,0.69998723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998129,0.00004121593,0.0000104058045,0.00003630958,0.00007692275,0.000022412369],"domain_scores_gemma":[0.99988997,0.000041553565,0.000005545143,0.000027072294,0.000026961812,0.000008859449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037352456,0.00040488984,0.0003322753,0.0010062122,0.00080614234,0.0022751668,0.0004472323,0.0004900682,0.025716523],"category_scores_gemma":[0.0006802668,0.00021020914,0.00041471006,0.0012318493,0.0022662824,0.0032521219,0.00097342924,0.0012147218,0.0052209655],"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.0000054506695,0.0000031596878,0.000019999994,0.00006266922,0.0000018358951,0.000022277267,0.0001727703,0.00031614513,0.00013540761,0.9469417,0.033943538,0.018375143],"study_design_scores_gemma":[0.0000034063723,0.0000048812785,0.00013853457,0.000073068266,0.0000034860548,0.000073163654,0.000110970854,0.00035560539,0.00014454691,0.65469384,0.34439304,0.000005400945],"about_ca_topic_score_codex":0.0028999806,"about_ca_topic_score_gemma":0.0030553467,"teacher_disagreement_score":0.025716523,"about_ca_system_score_codex":0.0020729604,"about_ca_system_score_gemma":0.0005488722,"threshold_uncertainty_score":0.086030304},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15016231,0.022880353,0.15966395,0.009957238,0.0028163276,0.00014406009,0.0016303344,0.00053726515,0.65220827],"genre_scores_gemma":[0.8734518,0.006786738,0.0456794,0.0018536658,0.0028198701,0.00027569657,0.0011834836,0.0002565487,0.06769268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841297,0.00044455245,0.00013872908,0.0003031593,0.00046922296,0.000231337],"domain_scores_gemma":[0.99771285,0.0010115276,0.0002039974,0.0003102874,0.0003808681,0.00038053046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383628,0.0006387731,0.00079006737,0.0032344593,0.0032853433,0.0053587854,0.0009023362,0.0010119597,0.01092292],"category_scores_gemma":[0.0027870862,0.00072243175,0.0011223349,0.0023159678,0.0064905654,0.010043608,0.0039240182,0.0032812762,0.0016441717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077820705,0.0000052868213,0.00008081727,0.000018457678,0.0000022724485,0.000037679987,0.0001899649,0.0001213719,0.00010418573,0.9967866,0.0008748729,0.0017707968],"study_design_scores_gemma":[0.0000038594817,0.0000071604786,0.00012730864,0.000013897812,0.00000189967,0.000062012434,0.00007738843,0.0006556666,0.0000658142,0.9918052,0.0071746493,0.000005240837],"about_ca_topic_score_codex":0.0022632214,"about_ca_topic_score_gemma":0.0027857572,"teacher_disagreement_score":0.01092292,"about_ca_system_score_codex":0.0023199662,"about_ca_system_score_gemma":0.00071217417,"threshold_uncertainty_score":0.036540747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39690048,0.0018639195,0.49779055,0.0013878045,0.0005669821,0.0001085188,0.00036257273,0.00037549116,0.10064368],"genre_scores_gemma":[0.9576465,0.00024721152,0.035877235,0.00020523835,0.000101652004,0.00007385157,0.00013307514,0.000029930126,0.005685393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880016,0.00041919516,0.00006426893,0.00017087362,0.00037065957,0.00017480954],"domain_scores_gemma":[0.999097,0.0002263681,0.00014730221,0.000116830866,0.00024013003,0.00017235306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452656,0.00025484528,0.0003134105,0.0011303772,0.0010692033,0.0021245608,0.00043837892,0.0003566973,0.0030165452],"category_scores_gemma":[0.0014150115,0.00015860566,0.00041777213,0.0005071012,0.0031461753,0.0029769314,0.0022265126,0.0009103839,0.00026213133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017834243,0.00001292079,0.0001474971,0.000015994534,0.0000034580842,0.00006329238,0.00016059134,0.0005029301,0.0010302688,0.9951509,0.00020654385,0.002687704],"study_design_scores_gemma":[0.00001904003,0.00004631754,0.0003830536,0.00002296931,0.0000065386726,0.00021997473,0.00044129268,0.0074076517,0.0018691407,0.9715897,0.017976068,0.000018307615],"about_ca_topic_score_codex":0.0007955487,"about_ca_topic_score_gemma":0.0008041821,"teacher_disagreement_score":0.0030165452,"about_ca_system_score_codex":0.00086188765,"about_ca_system_score_gemma":0.0005438915,"threshold_uncertainty_score":0.010091305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42295125,0.0058455416,0.37133616,0.0015548883,0.0006285148,0.0001575647,0.00032059485,0.0003252006,0.1968802],"genre_scores_gemma":[0.91136754,0.0016607944,0.06798444,0.0002530987,0.000629826,0.00012044285,0.00023776946,0.00006919868,0.017676866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985324,0.00044262485,0.00009742708,0.00024497273,0.00043491443,0.00024769924],"domain_scores_gemma":[0.9978028,0.0009925201,0.00029688372,0.00014471095,0.00034686786,0.00041621522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017058598,0.0006179431,0.0004894277,0.0021430615,0.0018447855,0.002944463,0.00065178546,0.0005455667,0.0038578438],"category_scores_gemma":[0.0028655534,0.00046427987,0.0007234291,0.0013219009,0.005568926,0.0052224044,0.0026258419,0.0019315702,0.0006039727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046116325,0.00002445238,0.0002707697,0.000042978376,0.0000056133945,0.00014172016,0.0003456278,0.00085520453,0.0016345292,0.9922019,0.00024182614,0.0041893194],"study_design_scores_gemma":[0.000021905622,0.00006701177,0.00035325304,0.000025447416,0.0000067466767,0.0002718059,0.00024824918,0.0058987574,0.0017238606,0.98552346,0.005841519,0.000018031022],"about_ca_topic_score_codex":0.00047639213,"about_ca_topic_score_gemma":0.0003996091,"teacher_disagreement_score":0.0038578438,"about_ca_system_score_codex":0.0010407398,"about_ca_system_score_gemma":0.0005862332,"threshold_uncertainty_score":0.0129057765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24791312,0.00043143606,0.7274385,0.00025529464,0.000058277543,0.00015903813,0.00022594565,0.0007119483,0.022806382],"genre_scores_gemma":[0.87737143,0.0002365482,0.11435878,0.00008594541,0.000027603075,0.000079274316,0.00029897565,0.00008228584,0.007459064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900395,0.00015925683,0.00008581076,0.0003797224,0.000255614,0.00011564997],"domain_scores_gemma":[0.9990626,0.0002761187,0.00009730586,0.00023141823,0.0002804787,0.000052110656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063227,0.00039172065,0.00041570136,0.0007563795,0.00069928716,0.0010579601,0.0007244798,0.0004898356,0.0031716542],"category_scores_gemma":[0.0017705727,0.00022092253,0.0010451359,0.000577254,0.0015213432,0.0025995097,0.0010623853,0.0006908696,0.00032109534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004300727,0.00008184639,0.0051371767,0.00024225202,0.000077694174,0.0008057482,0.002105446,0.04385295,0.061652586,0.8030171,0.0008967802,0.0817003],"study_design_scores_gemma":[0.00005769362,0.00039986515,0.0031833076,0.00010295795,0.00019370417,0.0008995714,0.0008105711,0.3952059,0.039620012,0.53558654,0.023843722,0.00009613564],"about_ca_topic_score_codex":0.0047506415,"about_ca_topic_score_gemma":0.0032702114,"teacher_disagreement_score":0.0047506415,"about_ca_system_score_codex":0.0011026631,"about_ca_system_score_gemma":0.00072483305,"threshold_uncertainty_score":0.010610223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214594,0.00057169056,0.39263391,0.0014428393,0.00025905948,0.00015118741,0.0005259368,0.0005915677,0.08236436],"genre_scores_gemma":[0.9101707,0.00014264256,0.08016321,0.00021101758,0.000119297845,0.00011453674,0.00036783595,0.00018083164,0.008529936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943698,0.0013844165,0.00039759083,0.0012488805,0.0016454493,0.00095393776],"domain_scores_gemma":[0.99423933,0.0018005671,0.00072392815,0.0009504158,0.0011808109,0.0011048745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002778357,0.0004882898,0.0008016022,0.0017266315,0.0024276474,0.007034665,0.0010811847,0.001016643,0.005236648],"category_scores_gemma":[0.006730878,0.0007591658,0.0015021855,0.00089197623,0.0064244187,0.008762075,0.0057172105,0.0034338636,0.00086576364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103484774,0.000054384578,0.0008294082,0.000031765416,0.0000073528,0.00017349886,0.0007987671,0.00078217546,0.00394222,0.989062,0.0003286488,0.0038862682],"study_design_scores_gemma":[0.000056048586,0.000073070194,0.00039042468,0.000032236498,0.000021894793,0.0004881468,0.00071560836,0.00999654,0.014152612,0.9653513,0.008674243,0.000047879807],"about_ca_topic_score_codex":0.0006311635,"about_ca_topic_score_gemma":0.0005381146,"teacher_disagreement_score":0.007034665,"about_ca_system_score_codex":0.0019848307,"about_ca_system_score_gemma":0.00091709895,"threshold_uncertainty_score":0.017518342},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7061799,0.0009355634,0.23127,0.0003702458,0.00016088318,0.00006155087,0.00030009905,0.00043043448,0.060291354],"genre_scores_gemma":[0.96594405,0.00024539538,0.021963542,0.00008216017,0.00011553472,0.000055040342,0.00016476167,0.00006463214,0.011364925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994992,0.00010603965,0.000026718748,0.00010232053,0.0001515575,0.00011412013],"domain_scores_gemma":[0.9994031,0.00014320729,0.000089567446,0.00007417913,0.00011855443,0.00017138998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060781924,0.00029593453,0.00027590423,0.0014411241,0.0005884279,0.0019770006,0.00048952433,0.00035074158,0.0050108023],"category_scores_gemma":[0.0010010479,0.00028759646,0.00048607582,0.0005811274,0.0016348928,0.0021810306,0.0013164793,0.00085228565,0.0006304183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040695046,0.000023722274,0.00062341965,0.000019808742,0.00001218962,0.00017051474,0.0005019233,0.0013737401,0.0052246405,0.98477954,0.00030014213,0.0069297664],"study_design_scores_gemma":[0.000026066677,0.00005844533,0.00071797764,0.000018435312,0.00001326193,0.000282134,0.0002893087,0.013763324,0.00287202,0.9727861,0.009155323,0.000017684066],"about_ca_topic_score_codex":0.0004474615,"about_ca_topic_score_gemma":0.00035105133,"teacher_disagreement_score":0.0050108023,"about_ca_system_score_codex":0.00070578046,"about_ca_system_score_gemma":0.00026627825,"threshold_uncertainty_score":0.016762853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65785855,0.004942991,0.10365139,0.0059448625,0.0010332509,0.000110577486,0.00035033273,0.0006185893,0.2254895],"genre_scores_gemma":[0.94571495,0.0011963629,0.010707848,0.00032944157,0.0004938646,0.00012777034,0.00030621528,0.00012693438,0.040996633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947876,0.00013552353,0.000025179505,0.00013396483,0.00012978746,0.00009692222],"domain_scores_gemma":[0.9994023,0.00018996508,0.000067492394,0.000080827136,0.00010139348,0.00015793614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066255656,0.0006973243,0.00083895726,0.0012789188,0.0017388279,0.002610762,0.0005253975,0.0006841717,0.0060170474],"category_scores_gemma":[0.0019613702,0.0004129101,0.00086969015,0.0007865563,0.0019650972,0.0023173653,0.0021674074,0.0014547277,0.0012508736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011211986,0.000016161457,0.0007002418,0.000045792825,0.0000145332,0.00024571855,0.00058357994,0.00045836013,0.003464875,0.98689306,0.0018374982,0.0056280363],"study_design_scores_gemma":[0.000095109775,0.000076775985,0.0010241955,0.000035580488,0.00002895828,0.00063975225,0.0003574004,0.004479878,0.0043303124,0.9563971,0.032506093,0.000028944612],"about_ca_topic_score_codex":0.00067087845,"about_ca_topic_score_gemma":0.00042226107,"teacher_disagreement_score":0.0060170474,"about_ca_system_score_codex":0.0010873791,"about_ca_system_score_gemma":0.0007167257,"threshold_uncertainty_score":0.020129085},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014140275,0.00311022,0.032006107,0.0011365699,0.0006890904,0.000017725928,0.000092159535,0.00011583905,0.9614183],"genre_scores_gemma":[0.0846797,0.004674219,0.024317697,0.0013396754,0.0014006591,0.00010328192,0.0002526401,0.00033287075,0.8828993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999571,0.000112491354,0.000022711387,0.00009153265,0.00016761418,0.00003452494],"domain_scores_gemma":[0.9997241,0.000113955575,0.000013561972,0.000066116605,0.000065912565,0.00001639003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042632633,0.00087315886,0.0005661845,0.0012221774,0.0016283364,0.0035765432,0.0008374003,0.000822903,0.029635565],"category_scores_gemma":[0.0013066025,0.00042747575,0.00050643703,0.0012347096,0.0036345841,0.0058268392,0.0014954859,0.0026633965,0.010089234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021015467,0.0000044954363,0.000010929493,0.00001719026,0.0000016023564,0.000010187126,0.00012513691,0.000054931133,0.00010233958,0.9810595,0.009396015,0.0092156455],"study_design_scores_gemma":[0.000001944331,0.0000042963406,0.000051989125,0.00001891849,0.0000036807894,0.00006964687,0.000064231805,0.00020361302,0.00020591827,0.80186087,0.19751093,0.0000038916355],"about_ca_topic_score_codex":0.0011839466,"about_ca_topic_score_gemma":0.0018344852,"teacher_disagreement_score":0.029635565,"about_ca_system_score_codex":0.001165088,"about_ca_system_score_gemma":0.0006089221,"threshold_uncertainty_score":0.09914088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28195292,0.0012193016,0.6401834,0.0010281844,0.00035887727,0.00016429284,0.00030621552,0.00037764417,0.0744092],"genre_scores_gemma":[0.90649825,0.00043080936,0.08178252,0.00022345247,0.00026019118,0.00010042501,0.0002515724,0.00007374446,0.010379012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781215,0.00046915773,0.00020404885,0.0005096711,0.00064469187,0.00036028566],"domain_scores_gemma":[0.9979336,0.000496532,0.00021485766,0.00033618356,0.0006665207,0.00035231427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002734152,0.00032320776,0.0005708054,0.0013554101,0.0016348703,0.002712709,0.00047782628,0.00052006595,0.004846601],"category_scores_gemma":[0.003347848,0.00031991498,0.0010502762,0.0006993645,0.0043542874,0.005829862,0.0022156665,0.001636349,0.00063880655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016030748,0.000015311856,0.00019558973,0.000012711977,0.000003360452,0.000053207965,0.00032102253,0.0002080353,0.00091157673,0.9957182,0.00016982373,0.00237519],"study_design_scores_gemma":[0.000012201765,0.000021181528,0.0002094617,0.000012300678,0.0000062467548,0.00009630815,0.0001529342,0.0032562423,0.0011386758,0.99115175,0.0039327857,0.000009934762],"about_ca_topic_score_codex":0.0015706522,"about_ca_topic_score_gemma":0.0010164556,"teacher_disagreement_score":0.004846601,"about_ca_system_score_codex":0.0011879683,"about_ca_system_score_gemma":0.0009148111,"threshold_uncertainty_score":0.016213477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061494853,0.002445646,0.83353484,0.0060454085,0.00034330573,0.00015950011,0.00041265023,0.00066134514,0.09490248],"genre_scores_gemma":[0.82492673,0.0009574528,0.16132933,0.0011946517,0.00034958814,0.00019873423,0.00030681735,0.00009920553,0.010637477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769944,0.0008978412,0.00014819205,0.00027663828,0.00075470516,0.00022310276],"domain_scores_gemma":[0.9982811,0.0010450782,0.00010533425,0.00022805377,0.0002443761,0.00009595779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196075,0.00048514307,0.0004654282,0.0013488593,0.0012931407,0.003517637,0.0009930175,0.0011372676,0.00288312],"category_scores_gemma":[0.00490724,0.00042904995,0.0016921293,0.0009538866,0.00520627,0.0069349236,0.0033799792,0.0035241835,0.00038812956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030119463,0.0000036265928,0.000027376098,0.000010791864,0.000003416842,0.000021534417,0.000110963105,0.00067309977,0.0001983568,0.99696916,0.00020770673,0.0017709042],"study_design_scores_gemma":[0.000005820538,0.000006006762,0.00006560357,0.000011350429,0.0000044882377,0.00002807105,0.000034284778,0.004386081,0.0003095979,0.9896554,0.0054850704,0.000008267369],"about_ca_topic_score_codex":0.0022153154,"about_ca_topic_score_gemma":0.0016921728,"teacher_disagreement_score":0.0037397435,"about_ca_system_score_codex":0.0037397435,"about_ca_system_score_gemma":0.0011831338,"threshold_uncertainty_score":0.027133882},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5648708,0.00586385,0.10204358,0.012548783,0.001633704,0.000069898044,0.0005620158,0.00041321243,0.3119943],"genre_scores_gemma":[0.9450489,0.00090506003,0.0062792106,0.00051397213,0.0009285105,0.000051369745,0.00012220151,0.00004258799,0.04610808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994417,0.00017597496,0.000023196515,0.00008644085,0.00012805917,0.00014462345],"domain_scores_gemma":[0.9993647,0.00022479353,0.00008943938,0.000075147116,0.00009839899,0.00014754107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009574057,0.00065792544,0.0008563317,0.0019139253,0.0022529617,0.0023177124,0.00073863444,0.000938737,0.008760001],"category_scores_gemma":[0.0021190525,0.00028391773,0.0007908036,0.0013926069,0.0033429118,0.0044015003,0.0025072086,0.0023007034,0.00073537166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002653927,0.0000050801145,0.00008427087,0.000011893389,0.0000043520745,0.0000276586,0.00011034737,0.00015573173,0.00029071522,0.99731356,0.0004930265,0.0014766899],"study_design_scores_gemma":[0.000013644778,0.0000098098635,0.00019217179,0.0000041623825,0.0000066456155,0.00005158987,0.00006320621,0.0008524303,0.00022778477,0.99563557,0.0029367814,0.0000061050405],"about_ca_topic_score_codex":0.0007588385,"about_ca_topic_score_gemma":0.00070796575,"teacher_disagreement_score":0.008760001,"about_ca_system_score_codex":0.0017445334,"about_ca_system_score_gemma":0.00082848134,"threshold_uncertainty_score":0.02930516},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075079594,0.022080967,0.012836454,0.0025585226,0.0012688624,0.000020858435,0.00020318563,0.00013659631,0.9601436],"genre_scores_gemma":[0.03200449,0.011218925,0.00450359,0.0012331284,0.001759063,0.00008248179,0.0003423258,0.0002455262,0.9486105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966145,0.000090430374,0.000012244059,0.00007286026,0.00013037506,0.000032565553],"domain_scores_gemma":[0.99983466,0.00006093114,0.000008656597,0.000039174247,0.00003821452,0.000018275698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038940983,0.001021747,0.0007490056,0.0015840651,0.0017530592,0.004437608,0.0007233753,0.0010022221,0.040574454],"category_scores_gemma":[0.0008914456,0.00042427366,0.000357656,0.0021300428,0.0044757994,0.0054800753,0.001374163,0.0027715429,0.018669114],"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.0000042555807,0.000004720122,0.000018446764,0.00003573581,0.0000018430065,0.00001001637,0.00023556415,0.00009407503,0.0001208618,0.9262415,0.0543016,0.018931275],"study_design_scores_gemma":[0.0000023501586,0.000005115654,0.000078288096,0.000043856213,0.0000025766092,0.000042489228,0.00009502076,0.0001468193,0.00009114984,0.49877834,0.5007105,0.000003376121],"about_ca_topic_score_codex":0.0031061145,"about_ca_topic_score_gemma":0.0039550355,"teacher_disagreement_score":0.040574454,"about_ca_system_score_codex":0.0026109745,"about_ca_system_score_gemma":0.001079556,"threshold_uncertainty_score":0.1357351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46862775,0.0007097327,0.4939634,0.00040497744,0.0002931313,0.0001045147,0.00019506077,0.00023226353,0.035469033],"genre_scores_gemma":[0.86424273,0.00032903743,0.12303224,0.00016810292,0.0002248048,0.0001525184,0.00016553933,0.00007943179,0.0116054965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754035,0.0006494455,0.00021493198,0.00034994836,0.0009868663,0.00025851777],"domain_scores_gemma":[0.997259,0.00083965756,0.000529132,0.00034675523,0.00067028945,0.0003550968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021080992,0.00040943647,0.0006268319,0.0017234522,0.0020076623,0.0025780764,0.00094374066,0.00050132954,0.0034036813],"category_scores_gemma":[0.0028425124,0.00043202608,0.00074085535,0.0014818191,0.0039146617,0.0048643094,0.0014218275,0.0012255424,0.00051311235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000407194,0.000022037515,0.0003378483,0.00003297664,0.00001201923,0.00013033525,0.00022535725,0.00092978135,0.0028699352,0.99004656,0.00013917424,0.0052132737],"study_design_scores_gemma":[0.000026328531,0.00007358642,0.0005015337,0.000017624818,0.00001422161,0.0007169998,0.00017622807,0.010557292,0.003997567,0.9785485,0.0053298655,0.00004024995],"about_ca_topic_score_codex":0.00062315987,"about_ca_topic_score_gemma":0.00078132993,"teacher_disagreement_score":0.0034036813,"about_ca_system_score_codex":0.0007020517,"about_ca_system_score_gemma":0.0008276918,"threshold_uncertainty_score":0.011386514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22176206,0.0005276736,0.67065805,0.0019628284,0.0001812231,0.00028469818,0.0015903406,0.000988451,0.102044605],"genre_scores_gemma":[0.88718957,0.00051159743,0.0856919,0.0005278952,0.0002317737,0.00045735083,0.0017028343,0.0001935744,0.02349359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674183,0.0008406957,0.0003698555,0.00062426715,0.0009874841,0.00043578047],"domain_scores_gemma":[0.9918371,0.0027962148,0.00041736054,0.0012779256,0.0030334103,0.00063787075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003586573,0.0008268992,0.0009437824,0.0014249017,0.0020293458,0.0023252377,0.0013632047,0.0006348629,0.009863432],"category_scores_gemma":[0.0078733275,0.0006952467,0.0019365666,0.001136635,0.003925021,0.011055684,0.006366052,0.0023114327,0.0013513679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011409007,0.000060919625,0.0010138686,0.00015822114,0.000038445243,0.00011758535,0.0005714766,0.0016764903,0.003396883,0.9802034,0.0019722148,0.010676522],"study_design_scores_gemma":[0.000039148894,0.00008825781,0.001069961,0.000038135302,0.000040735744,0.00014103543,0.00028549563,0.013010805,0.007656386,0.9668769,0.010721269,0.000031727934],"about_ca_topic_score_codex":0.0019829255,"about_ca_topic_score_gemma":0.002411722,"teacher_disagreement_score":0.009863432,"about_ca_system_score_codex":0.0012311994,"about_ca_system_score_gemma":0.001961104,"threshold_uncertainty_score":0.032996476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124057174,0.006638513,0.7956619,0.003460148,0.00020576383,0.0001560212,0.001545813,0.0005029931,0.06777176],"genre_scores_gemma":[0.7254512,0.0039355764,0.24309674,0.0005693818,0.00053928146,0.0002766482,0.0022716313,0.00017739878,0.023682244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851304,0.00037042404,0.00010066264,0.00033396605,0.0005155537,0.00016629847],"domain_scores_gemma":[0.9968368,0.0015092124,0.0002714395,0.00045841234,0.00056024356,0.000363861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002271403,0.00046506737,0.00068114355,0.0017490317,0.0013596831,0.0032364875,0.0010183384,0.00081341894,0.0031583195],"category_scores_gemma":[0.003518799,0.00055403216,0.0010880501,0.0016756043,0.0049228165,0.007851991,0.0015501028,0.0028772918,0.0007321063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010222186,0.000010150339,0.0001906783,0.000052926986,0.0000055505975,0.000023128328,0.00027783666,0.0017721702,0.00057959446,0.99317366,0.00082698895,0.003077076],"study_design_scores_gemma":[0.00000878971,0.000019743116,0.00029416132,0.000027847407,0.0000066357065,0.0000929738,0.0001916656,0.0059224046,0.0007709416,0.97916573,0.013488794,0.000010256278],"about_ca_topic_score_codex":0.0015750232,"about_ca_topic_score_gemma":0.0013712327,"teacher_disagreement_score":0.0032364875,"about_ca_system_score_codex":0.0018016205,"about_ca_system_score_gemma":0.001334181,"threshold_uncertainty_score":0.013071775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056276243,0.00048372042,0.90511173,0.00096277613,0.00012737061,0.00009012561,0.00024939407,0.000269429,0.036429223],"genre_scores_gemma":[0.64825517,0.000719685,0.32961965,0.0009033852,0.00015328056,0.0006270141,0.0005533475,0.00042412244,0.018744403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.0003634192,0.00003274474,0.00007000611,0.00034893333,0.00011638173],"domain_scores_gemma":[0.99921906,0.00021863506,0.00007052335,0.0002657242,0.00014147557,0.000084526626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020711422,0.00070050283,0.0010772722,0.001003587,0.000969996,0.0013741736,0.0024476151,0.0014155437,0.0030028082],"category_scores_gemma":[0.0027583372,0.00039844602,0.0010358923,0.001127356,0.0021333597,0.002163354,0.002289369,0.0012931543,0.00074825436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032585056,0.000037891074,0.00024616474,0.00007062504,0.000017905833,0.00012677324,0.00007731349,0.10367156,0.0012069473,0.8888611,0.0010316146,0.0046194843],"study_design_scores_gemma":[0.000025980584,0.00002686705,0.0001443938,0.000018561166,0.0000071758122,0.000057621208,0.000031532505,0.8095674,0.0005571043,0.1877142,0.0018301891,0.00001894],"about_ca_topic_score_codex":0.0062600495,"about_ca_topic_score_gemma":0.0045906897,"teacher_disagreement_score":0.0062600495,"about_ca_system_score_codex":0.0012569644,"about_ca_system_score_gemma":0.0019115682,"threshold_uncertainty_score":0.012447178},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00456611,0.0024618402,0.2726774,0.002634191,0.0006966425,0.000056153534,0.00020588255,0.0004494269,0.7162524],"genre_scores_gemma":[0.34318346,0.00518075,0.12543526,0.0011137244,0.0009814174,0.00034385818,0.0005015308,0.0006798323,0.52258027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995534,0.00017635769,0.000027872109,0.0000645605,0.00014993927,0.000027882663],"domain_scores_gemma":[0.9997019,0.00012728626,0.000017352093,0.00006738039,0.000058372287,0.000027612667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059305324,0.0006569311,0.0004932812,0.0010803764,0.0015961697,0.0052371575,0.00078351377,0.0011003079,0.013178435],"category_scores_gemma":[0.0007026239,0.0004414069,0.0005791296,0.0010741568,0.0040082447,0.0069697103,0.0017305672,0.0022375176,0.0041765226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.3730606e-7,0.0000015435028,0.00000346834,0.0000052930727,4.7185912e-7,0.0000057584944,0.0000592229,0.00015417756,0.00006955109,0.9976598,0.0007783835,0.0012615604],"study_design_scores_gemma":[0.0000019990682,0.000004426114,0.00001251772,0.000015799242,0.0000028566458,0.00004795449,0.00006990411,0.002172673,0.00028980448,0.9157538,0.081624165,0.0000040070136],"about_ca_topic_score_codex":0.0013470826,"about_ca_topic_score_gemma":0.0015588654,"teacher_disagreement_score":0.013178435,"about_ca_system_score_codex":0.0017797786,"about_ca_system_score_gemma":0.001048805,"threshold_uncertainty_score":0.044086277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14995266,0.0023003214,0.6941109,0.0018320977,0.00051500264,0.00023086881,0.00076096196,0.0005938108,0.14970338],"genre_scores_gemma":[0.91035753,0.00080279744,0.06781629,0.0005788722,0.0005372697,0.00017900024,0.00068097777,0.0001156525,0.018931549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972185,0.0006842369,0.0002175447,0.0005563958,0.0009492976,0.00037408012],"domain_scores_gemma":[0.99747235,0.0007590402,0.00042694813,0.00031356802,0.00075289025,0.0002751384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021193982,0.0005042112,0.0005239522,0.002340677,0.002098956,0.0031158288,0.0010322429,0.0010325792,0.008309034],"category_scores_gemma":[0.003845432,0.00034116476,0.0010490243,0.001408912,0.003367406,0.0076220213,0.0019839997,0.0015937141,0.00094689615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066509356,0.0000064499486,0.00010459775,0.000017051436,0.0000053808803,0.00005209744,0.00013053052,0.00039719383,0.0005681259,0.99663407,0.00028395056,0.0017939513],"study_design_scores_gemma":[0.000011856636,0.00002392668,0.00019649227,0.000028918943,0.00001623763,0.00024491272,0.0001687288,0.0048580063,0.0010363624,0.9791574,0.014238592,0.000018556108],"about_ca_topic_score_codex":0.0016275443,"about_ca_topic_score_gemma":0.00076586095,"teacher_disagreement_score":0.008309034,"about_ca_system_score_codex":0.0011527045,"about_ca_system_score_gemma":0.0009787141,"threshold_uncertainty_score":0.027796507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3372492,0.0134964585,0.5012105,0.0064478423,0.0005382251,0.00011455579,0.000455139,0.0002900179,0.14019811],"genre_scores_gemma":[0.96943474,0.0015738133,0.025478566,0.00038985733,0.00016524942,0.000057433368,0.00021988364,0.000025527743,0.0026548908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696773,0.001112646,0.0001770179,0.00058261794,0.0009827807,0.00017733216],"domain_scores_gemma":[0.9960924,0.001947647,0.0005138325,0.0004653854,0.0006951918,0.00028557592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723722,0.00032075756,0.0005299192,0.0023372988,0.001418054,0.0036482376,0.0012076037,0.0011645489,0.003433534],"category_scores_gemma":[0.00623462,0.00021888768,0.0006021615,0.0016966898,0.0057098013,0.00813309,0.002942344,0.0023219516,0.00049540086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006568113,0.0000035084563,0.00011130594,0.000025061245,0.000007766011,0.000018632038,0.00011344109,0.00047134087,0.00027362452,0.9959407,0.00012741527,0.0029005145],"study_design_scores_gemma":[0.0000034333925,0.000008575998,0.00018652991,0.000012692407,0.0000044229405,0.000051632614,0.000059688347,0.0014360966,0.00021145077,0.99531037,0.0027102581,0.0000049690098],"about_ca_topic_score_codex":0.00083404133,"about_ca_topic_score_gemma":0.00041632776,"teacher_disagreement_score":0.0036482376,"about_ca_system_score_codex":0.0019841224,"about_ca_system_score_gemma":0.00072655716,"threshold_uncertainty_score":0.014395833},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008171949,0.007951732,0.06006285,0.0026351374,0.00095875777,0.000019425059,0.00028013636,0.0004436368,0.91947633],"genre_scores_gemma":[0.19855212,0.005575411,0.009736369,0.00056210096,0.0012561124,0.00004334664,0.0004211004,0.00048610082,0.78336746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998154,0.000031055766,0.0000070239425,0.000040754505,0.00008412666,0.00002157784],"domain_scores_gemma":[0.9998622,0.000036211357,0.000009724531,0.000038793507,0.00003607827,0.000016844408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022344959,0.00052960997,0.00047918918,0.0010280963,0.0008261663,0.0026427864,0.00046855002,0.0005577349,0.023027264],"category_scores_gemma":[0.0007314744,0.00025238612,0.0002771531,0.0011263147,0.0017723384,0.0042578545,0.0010296263,0.0018198079,0.006738345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033089432,0.000005026992,0.000015981432,0.000012373754,0.0000014938263,0.0000069334187,0.00007797293,0.00010199619,0.00015079092,0.9805195,0.009279786,0.009824892],"study_design_scores_gemma":[0.0000014466486,0.0000036940132,0.00007566951,0.000009428136,0.0000021049336,0.000036309604,0.000042282314,0.00048723991,0.00019172167,0.9222959,0.07685114,0.0000029864232],"about_ca_topic_score_codex":0.001468054,"about_ca_topic_score_gemma":0.0012051206,"teacher_disagreement_score":0.023027264,"about_ca_system_score_codex":0.0014205923,"about_ca_system_score_gemma":0.00060984754,"threshold_uncertainty_score":0.07703388},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035932176,0.0006988503,0.016966233,0.0005898077,0.0014157409,0.00004993022,0.0013515847,0.0018834908,0.97345114],"genre_scores_gemma":[0.027299996,0.0006908813,0.006396619,0.0005227424,0.000272118,0.00006679359,0.0017358653,0.0008843816,0.9621306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973124,0.000016709859,0.0000067934,0.00008270446,0.00011001909,0.00005256915],"domain_scores_gemma":[0.99977297,0.000019952595,0.000012952162,0.00006917798,0.00008882162,0.0000361643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018591332,0.0008354703,0.00040024254,0.001724437,0.0015288237,0.0026805764,0.0009520584,0.000938669,0.33440334],"category_scores_gemma":[0.0005900093,0.00036194752,0.00035816783,0.0010051362,0.0007134539,0.0019740749,0.0012435486,0.0013346615,0.19183493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020658749,0.00005233556,0.0002743456,0.000170227,0.000012017816,0.000115455856,0.00017456354,0.00039227086,0.012056439,0.4132298,0.36373553,0.20958042],"study_design_scores_gemma":[0.00000845246,0.000018937424,0.00026612706,0.000037134087,0.0000063570806,0.00016213594,0.00008710385,0.00042677674,0.0050250203,0.035615243,0.9583363,0.0000105094],"about_ca_topic_score_codex":0.0013027616,"about_ca_topic_score_gemma":0.0014123067,"teacher_disagreement_score":0.33440334,"about_ca_system_score_codex":0.0006016739,"about_ca_system_score_gemma":0.0004282303,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21670169,0.009474339,0.525058,0.0013438078,0.0005022731,0.00010632083,0.00042897585,0.00048650466,0.24589808],"genre_scores_gemma":[0.89267814,0.006597281,0.061540984,0.00078963325,0.0010382959,0.00014597402,0.00043777362,0.00016899823,0.036602948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907887,0.0002574699,0.00005232584,0.0001402528,0.00029648255,0.00017468932],"domain_scores_gemma":[0.998944,0.0003903723,0.00016071531,0.00012583831,0.00023988156,0.0001392052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010646203,0.00058794126,0.0004708217,0.0019471387,0.0013433791,0.0015965428,0.0005942805,0.0005064322,0.007902034],"category_scores_gemma":[0.0021202122,0.00030961918,0.0005818335,0.0022357267,0.0031068735,0.005928506,0.0027762346,0.0015283936,0.0016135335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008800416,0.000007289737,0.000157326,0.00005399949,0.000005761429,0.00007228977,0.0003039064,0.0005293364,0.000744891,0.99244446,0.00037741123,0.0052945046],"study_design_scores_gemma":[0.0000041962962,0.000026437543,0.00031712424,0.000038571496,0.000008163596,0.00015695285,0.00011729133,0.0024032127,0.0009203844,0.9856899,0.010305154,0.000012640962],"about_ca_topic_score_codex":0.0007092201,"about_ca_topic_score_gemma":0.00043554127,"teacher_disagreement_score":0.007902034,"about_ca_system_score_codex":0.00069524406,"about_ca_system_score_gemma":0.00053118553,"threshold_uncertainty_score":0.026434898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01041726,0.00013268496,0.98715836,0.00014686886,0.00002595734,0.00006004915,0.000068384965,0.00029663715,0.0016938004],"genre_scores_gemma":[0.25969467,0.00036167697,0.73631895,0.00016944016,0.00006688268,0.00025351316,0.0005184609,0.00013067423,0.0024856902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969489,0.0011104274,0.00019793819,0.0005606297,0.0008237167,0.00035840078],"domain_scores_gemma":[0.99467224,0.00360324,0.00035580175,0.0007615285,0.00044916235,0.0001580248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041165766,0.0012045262,0.0012027703,0.001045242,0.00077119947,0.001972656,0.0022742178,0.0011395242,0.0029109865],"category_scores_gemma":[0.014185511,0.00065797655,0.0014959972,0.0024060018,0.0011541306,0.0040156906,0.001888351,0.0033946324,0.00053092133],"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.00028812862,0.0001429783,0.0010229348,0.00020111531,0.00010006466,0.00006172293,0.00015543641,0.72216994,0.0016081794,0.15270251,0.002965088,0.11858196],"study_design_scores_gemma":[0.000016863807,0.000025856296,0.000060616825,0.0000099118015,0.000010745511,0.000025767578,0.000018108554,0.9369852,0.00066954555,0.061258703,0.0009133074,0.0000054414586],"about_ca_topic_score_codex":0.0041474863,"about_ca_topic_score_gemma":0.004462985,"teacher_disagreement_score":0.0041474863,"about_ca_system_score_codex":0.0030723347,"about_ca_system_score_gemma":0.0023907379,"threshold_uncertainty_score":0.022291481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037983775,0.00063310843,0.0019460705,0.00070351525,0.00016083961,0.00008945928,0.9777064,0.0065369033,0.0084253205],"genre_scores_gemma":[0.004868772,0.00016566306,0.002255852,0.00015665664,0.000020761698,0.0001461889,0.99036074,0.00041884443,0.0016065139],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747014,0.00044924367,0.0002561132,0.00054372643,0.00094499416,0.00033583964],"domain_scores_gemma":[0.99281037,0.003478572,0.000506904,0.0018879571,0.0010435262,0.00027272315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018782358,0.002513305,0.0009999713,0.003606287,0.0013921176,0.0023037253,0.0035559016,0.0029651723,0.08133945],"category_scores_gemma":[0.015093405,0.0008043185,0.0018839542,0.004251812,0.0007651596,0.0022854067,0.0020462272,0.00329857,0.058589313],"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.00017630374,0.00008134134,0.0010638217,0.0009890291,0.000042922293,0.00010575174,0.000034363613,0.0016091171,0.00038551175,0.0029444844,0.9839828,0.008584668],"study_design_scores_gemma":[0.0014718417,0.00011889427,0.008057393,0.0006680431,0.00011102528,0.0007331003,0.00023945558,0.01730295,0.00549116,0.031495742,0.9342227,0.000087790206],"about_ca_topic_score_codex":0.007943072,"about_ca_topic_score_gemma":0.017563064,"teacher_disagreement_score":0.08133945,"about_ca_system_score_codex":0.0031010425,"about_ca_system_score_gemma":0.0033693032,"threshold_uncertainty_score":0.27210754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31814146,0.0073382114,0.36050105,0.0057422663,0.0016181375,0.00012841701,0.0017568712,0.0010197093,0.30375388],"genre_scores_gemma":[0.9215973,0.0015179367,0.03666709,0.00049879734,0.0008161228,0.00008090441,0.0008175253,0.00014504041,0.03785931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982204,0.0005694583,0.00012747817,0.00023518219,0.00052937446,0.00031811895],"domain_scores_gemma":[0.9977685,0.00081397005,0.00039850298,0.00025528623,0.00030772755,0.00045610752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070595,0.00050852087,0.00064336235,0.0021090354,0.0018113919,0.005375127,0.0008978175,0.0008883571,0.009978279],"category_scores_gemma":[0.003583679,0.0005104827,0.00081408146,0.0018815331,0.004649468,0.007018402,0.0033996871,0.0029666163,0.0017819903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016888878,0.000007753811,0.00012870746,0.000016221937,0.0000039301704,0.00004012599,0.00008825171,0.0002409537,0.00019947151,0.99661946,0.0006458004,0.00199239],"study_design_scores_gemma":[0.0000100560555,0.000007705754,0.00010257568,0.000012322888,0.000004134947,0.000110252055,0.00009794283,0.001436638,0.00031155295,0.9937219,0.004176382,0.000008487129],"about_ca_topic_score_codex":0.0013294213,"about_ca_topic_score_gemma":0.0013064656,"teacher_disagreement_score":0.009978279,"about_ca_system_score_codex":0.0016446938,"about_ca_system_score_gemma":0.00081727956,"threshold_uncertainty_score":0.033380628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037983775,0.00063310843,0.0019460705,0.00070351525,0.00016083961,0.00008945928,0.9777064,0.0065369033,0.0084253205],"genre_scores_gemma":[0.004868772,0.00016566306,0.002255852,0.00015665664,0.000020761698,0.0001461889,0.99036074,0.00041884443,0.0016065139],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747014,0.00044924367,0.0002561132,0.00054372643,0.00094499416,0.00033583964],"domain_scores_gemma":[0.99281037,0.003478572,0.000506904,0.0018879571,0.0010435262,0.00027272315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018782358,0.002513305,0.0009999713,0.003606287,0.0013921176,0.0023037253,0.0035559016,0.0029651723,0.08133945],"category_scores_gemma":[0.015093405,0.0008043185,0.0018839542,0.004251812,0.0007651596,0.0022854067,0.0020462272,0.00329857,0.058589313],"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.00017630374,0.00008134134,0.0010638217,0.0009890291,0.000042922293,0.00010575174,0.000034363613,0.0016091171,0.00038551175,0.0029444844,0.9839828,0.008584668],"study_design_scores_gemma":[0.0014718417,0.00011889427,0.008057393,0.0006680431,0.00011102528,0.0007331003,0.00023945558,0.01730295,0.00549116,0.031495742,0.9342227,0.000087790206],"about_ca_topic_score_codex":0.007943072,"about_ca_topic_score_gemma":0.017563064,"teacher_disagreement_score":0.08133945,"about_ca_system_score_codex":0.0031010425,"about_ca_system_score_gemma":0.0033693032,"threshold_uncertainty_score":0.27210754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43687227,0.0028553375,0.22195664,0.0065285903,0.0008414518,0.00025015915,0.003164393,0.001651109,0.32588017],"genre_scores_gemma":[0.9166391,0.0009331736,0.0363683,0.00078016316,0.0004946733,0.00014060673,0.0018229237,0.00044944874,0.042371657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761343,0.000547995,0.00026376543,0.00071770704,0.000504594,0.0003525356],"domain_scores_gemma":[0.9926086,0.004097483,0.0005135423,0.0012947714,0.00064811186,0.0008374978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019560384,0.0009289512,0.002209977,0.002435401,0.004537984,0.007427427,0.0016925345,0.001575371,0.014085383],"category_scores_gemma":[0.005379654,0.0015091749,0.0024762189,0.0023571297,0.0045436113,0.013673025,0.0040748045,0.0052947225,0.0019373795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095249125,0.000037839385,0.00027796093,0.0000606137,0.000022520344,0.000105513645,0.00043401815,0.00019676276,0.00090570486,0.99193734,0.0015019127,0.004424592],"study_design_scores_gemma":[0.000030021829,0.000019289468,0.00021636383,0.000019747562,0.000031029434,0.00025743683,0.00015237418,0.00047716126,0.0006276489,0.99281234,0.005343662,0.00001300732],"about_ca_topic_score_codex":0.0007760644,"about_ca_topic_score_gemma":0.0010829592,"teacher_disagreement_score":0.014085383,"about_ca_system_score_codex":0.0015553709,"about_ca_system_score_gemma":0.0012315249,"threshold_uncertainty_score":0.047120273},"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":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22812565,0.0029961758,0.4851621,0.0045435927,0.00046211778,0.00083117123,0.24644339,0.0069977026,0.024438163],"genre_scores_gemma":[0.566658,0.00062288373,0.17743185,0.0015200272,0.00032932122,0.0015943944,0.24740328,0.0006689038,0.0037712706],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99248546,0.0037192565,0.000564389,0.0018428923,0.001134036,0.0002540348],"domain_scores_gemma":[0.96779364,0.022928882,0.0013685991,0.0057799704,0.0017970459,0.0003318458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013226027,0.0008257082,0.0011987631,0.003060232,0.0010888972,0.0017867797,0.00251149,0.0013767718,0.005618971],"category_scores_gemma":[0.06563091,0.0002569185,0.0012687233,0.004259642,0.0013163923,0.0021176836,0.0017474066,0.0018313254,0.0022266104],"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.0022224272,0.00034868837,0.14357321,0.0015739062,0.0014767026,0.0011322094,0.0003229272,0.09433744,0.0031408344,0.082570784,0.3093714,0.3599294],"study_design_scores_gemma":[0.00088421936,0.00033299054,0.05340147,0.00022028756,0.0004491184,0.0020776086,0.00029663913,0.46829668,0.005456206,0.34506452,0.12336171,0.00015853226],"about_ca_topic_score_codex":0.0031574129,"about_ca_topic_score_gemma":0.0052791825,"teacher_disagreement_score":0.013226027,"about_ca_system_score_codex":0.0011038939,"about_ca_system_score_gemma":0.002358627,"threshold_uncertainty_score":0.069946766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7490182,0.002692323,0.07451855,0.00093148777,0.00016014367,0.000047621837,0.00017626122,0.00026661294,0.17218886],"genre_scores_gemma":[0.9792473,0.00067900465,0.004549516,0.000093672475,0.00007766987,0.000024244398,0.00009784163,0.000042674274,0.015188226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995396,0.000073229196,0.00003149194,0.00015072155,0.000102327496,0.00010262029],"domain_scores_gemma":[0.99936694,0.00019683663,0.00008335971,0.000083241175,0.00012588428,0.0001436472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062098016,0.0005452748,0.00033539935,0.0014004736,0.0014796976,0.0015420824,0.00034000754,0.00043094595,0.004482255],"category_scores_gemma":[0.0012613955,0.00028494795,0.00044654476,0.00046155087,0.0029633008,0.0031577866,0.002387391,0.00098763,0.0004556693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002051455,0.000009044087,0.0006532908,0.000026585625,0.000006300197,0.0002900993,0.00039341082,0.0004523297,0.0019633311,0.9919476,0.00028040292,0.0039572218],"study_design_scores_gemma":[0.000026010224,0.000056165853,0.0018875772,0.000039440656,0.000029777388,0.0009038838,0.0005928035,0.0047551333,0.0061346735,0.96636224,0.019191582,0.00002064052],"about_ca_topic_score_codex":0.000961451,"about_ca_topic_score_gemma":0.0006134865,"teacher_disagreement_score":0.004482255,"about_ca_system_score_codex":0.0011329699,"about_ca_system_score_gemma":0.00028795013,"threshold_uncertainty_score":0.014994681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69287384,0.001439827,0.21989936,0.0006938735,0.00018286835,0.00016524244,0.00016238345,0.00024192756,0.08434082],"genre_scores_gemma":[0.9563364,0.0007121776,0.031963475,0.00020732963,0.00017966257,0.00010945204,0.00022002604,0.000076546516,0.0101949135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983138,0.0004884558,0.0001551499,0.00021967414,0.0004634797,0.00035938312],"domain_scores_gemma":[0.99728847,0.00086201663,0.00075717067,0.000332123,0.00041998777,0.0003402365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018215048,0.0007599215,0.00059313467,0.0011089547,0.001803466,0.0021491875,0.0009707698,0.0009320986,0.005783807],"category_scores_gemma":[0.004358223,0.0003650695,0.0010496291,0.0012547761,0.0043542134,0.004656498,0.002289796,0.0012255978,0.0011091041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034588684,0.000055458313,0.0008104544,0.00004427581,0.000011337197,0.0003194804,0.00075893884,0.0013161461,0.002430917,0.98899287,0.0003147692,0.0049108188],"study_design_scores_gemma":[0.000024960671,0.00008178063,0.0003052198,0.000024187728,0.000012436701,0.00040313267,0.0006472145,0.006854383,0.002545248,0.9848573,0.004212943,0.00003117071],"about_ca_topic_score_codex":0.0009122212,"about_ca_topic_score_gemma":0.0007817418,"teacher_disagreement_score":0.005783807,"about_ca_system_score_codex":0.00093185174,"about_ca_system_score_gemma":0.00079543504,"threshold_uncertainty_score":0.01934874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39607602,0.0040022633,0.50090843,0.009385902,0.00043092942,0.00019697951,0.0018095467,0.0022104918,0.08497947],"genre_scores_gemma":[0.95302707,0.0007181558,0.035439998,0.00092628965,0.0004888976,0.00020659939,0.00103576,0.00018865289,0.007968569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944442,0.0014460185,0.00030428448,0.0011604489,0.001320071,0.0013250405],"domain_scores_gemma":[0.9627187,0.033020943,0.001322069,0.0012152344,0.001079977,0.0006431128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006913994,0.00094937487,0.0011566497,0.0023736933,0.0026457792,0.006259928,0.0031751357,0.0014496885,0.0051385066],"category_scores_gemma":[0.01544965,0.0010592343,0.003594072,0.0022005402,0.006324866,0.010800114,0.0033728965,0.0059065847,0.0005159218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011761496,0.0000846942,0.0012462094,0.00016946669,0.000043453052,0.00015650582,0.0006851365,0.0063238745,0.0016318752,0.9808075,0.001288005,0.0074456697],"study_design_scores_gemma":[0.00006213667,0.000052711584,0.0006822225,0.00005498362,0.0000686019,0.0001458608,0.00025142566,0.056611177,0.0042318287,0.9339429,0.0038506405,0.000045611636],"about_ca_topic_score_codex":0.0065739425,"about_ca_topic_score_gemma":0.007339365,"teacher_disagreement_score":0.007251125,"about_ca_system_score_codex":0.007251125,"about_ca_system_score_gemma":0.003657974,"threshold_uncertainty_score":0.052610874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080079466,0.000096158794,0.000050755993,0.00008121319,0.000032165637,0.000009792168,0.9972861,0.0010619743,0.0013018168],"genre_scores_gemma":[0.00040208604,0.0000803845,0.00018313469,0.000076598306,0.0000136877925,0.00004940392,0.9981201,0.00018393759,0.0008906923],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988902,0.00014874351,0.00011363164,0.00041936632,0.00021078186,0.00021727027],"domain_scores_gemma":[0.99790514,0.00047825355,0.00016131614,0.0006713633,0.0004662859,0.000317636],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009479567,0.0039894828,0.002537308,0.005985196,0.0013594332,0.004634559,0.0048762783,0.0034185445,0.2311803],"category_scores_gemma":[0.0061140102,0.0010996289,0.0015480805,0.0093873385,0.0007126765,0.0033552004,0.0030477727,0.002547841,0.31248635],"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.00003148909,0.000013704279,0.00018950566,0.00037840405,0.000013554206,0.000008661028,0.00000923122,0.000080782134,0.000043055792,0.00034528584,0.99776626,0.0011199686],"study_design_scores_gemma":[0.00029226494,0.000021604086,0.0012779958,0.00026303655,0.000024750056,0.000051214443,0.000067436034,0.00039900345,0.00036406706,0.0022541727,0.9949555,0.000028997238],"about_ca_topic_score_codex":0.017953014,"about_ca_topic_score_gemma":0.02544333,"teacher_disagreement_score":0.7688197,"about_ca_system_score_codex":0.0019739696,"about_ca_system_score_gemma":0.0028097644,"threshold_uncertainty_score":0.77337515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35787836,0.00062535563,0.509178,0.0009366871,0.0005873512,0.000070160815,0.00024713864,0.00027528455,0.13020177],"genre_scores_gemma":[0.9367099,0.00027511036,0.04193969,0.00027412223,0.00022241476,0.000036356716,0.00010401173,0.000060751252,0.020377608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955827,0.000079583406,0.000017080634,0.00010086532,0.00016481969,0.00007945381],"domain_scores_gemma":[0.999428,0.0001432461,0.00007571711,0.00009704854,0.00015678076,0.000099142315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004929091,0.00023442398,0.00020688413,0.0008113076,0.00068729813,0.001176116,0.00074954034,0.00032480818,0.006708936],"category_scores_gemma":[0.0011397825,0.00014221757,0.00037024912,0.00038605861,0.0015348368,0.0032438412,0.0011922215,0.00086184946,0.00076504325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063699745,0.000005321648,0.00011812545,0.000008496187,0.0000011756284,0.000028986338,0.00006656315,0.00031078904,0.0010838582,0.993968,0.00024078431,0.0041613895],"study_design_scores_gemma":[0.0000075894845,0.000046835667,0.00034984437,0.00001256441,0.000005452703,0.0003261592,0.00013896059,0.014040301,0.0038634092,0.9641287,0.017067313,0.000012740771],"about_ca_topic_score_codex":0.00044318763,"about_ca_topic_score_gemma":0.00059206545,"teacher_disagreement_score":0.006708936,"about_ca_system_score_codex":0.00086330343,"about_ca_system_score_gemma":0.0004217781,"threshold_uncertainty_score":0.022443652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10525564,0.0010050716,0.81513554,0.0035691308,0.00015225176,0.00009008599,0.0009021672,0.0011486434,0.07274152],"genre_scores_gemma":[0.85791147,0.00077525456,0.12245048,0.0006013697,0.00017806537,0.00013536542,0.0009605901,0.00015353005,0.016833905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868685,0.0003602323,0.00008327597,0.00030691942,0.00039107155,0.00017173671],"domain_scores_gemma":[0.99841225,0.00089461455,0.00013469048,0.0002400348,0.00023035081,0.00008809897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114001,0.000405487,0.00038854827,0.00083938794,0.0009251865,0.0024909284,0.0010813165,0.00058315706,0.00581641],"category_scores_gemma":[0.0027613044,0.00036304214,0.0010571918,0.0013882833,0.0029714848,0.004709217,0.0019459964,0.0030900547,0.0006869982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016087337,0.000010217078,0.00013518316,0.000030353576,0.000004608721,0.000032458815,0.0001666229,0.002704721,0.0005674723,0.99091434,0.0005846357,0.004833357],"study_design_scores_gemma":[0.000013331316,0.0000141233895,0.00013721109,0.000012318709,0.0000067481005,0.00003078273,0.00006410754,0.013728617,0.0006048215,0.9788294,0.0065503186,0.000008273522],"about_ca_topic_score_codex":0.004336465,"about_ca_topic_score_gemma":0.0033353614,"teacher_disagreement_score":0.00581641,"about_ca_system_score_codex":0.002933222,"about_ca_system_score_gemma":0.0012280921,"threshold_uncertainty_score":0.021282077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10525564,0.0010050716,0.81513554,0.0035691308,0.00015225176,0.00009008599,0.0009021672,0.0011486434,0.07274152],"genre_scores_gemma":[0.85791147,0.00077525456,0.12245048,0.0006013697,0.00017806537,0.00013536542,0.0009605901,0.00015353005,0.016833905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868685,0.0003602323,0.00008327597,0.00030691942,0.00039107155,0.00017173671],"domain_scores_gemma":[0.99841225,0.00089461455,0.00013469048,0.0002400348,0.00023035081,0.00008809897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114001,0.000405487,0.00038854827,0.00083938794,0.0009251865,0.0024909284,0.0010813165,0.00058315706,0.00581641],"category_scores_gemma":[0.0027613044,0.00036304214,0.0010571918,0.0013882833,0.0029714848,0.004709217,0.0019459964,0.0030900547,0.0006869982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016087337,0.000010217078,0.00013518316,0.000030353576,0.000004608721,0.000032458815,0.0001666229,0.002704721,0.0005674723,0.99091434,0.0005846357,0.004833357],"study_design_scores_gemma":[0.000013331316,0.0000141233895,0.00013721109,0.000012318709,0.0000067481005,0.00003078273,0.00006410754,0.013728617,0.0006048215,0.9788294,0.0065503186,0.000008273522],"about_ca_topic_score_codex":0.004336465,"about_ca_topic_score_gemma":0.0033353614,"teacher_disagreement_score":0.00581641,"about_ca_system_score_codex":0.002933222,"about_ca_system_score_gemma":0.0012280921,"threshold_uncertainty_score":0.021282077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036229998,0.005792881,0.47979125,0.053866196,0.0020467653,0.00015570648,0.00071184605,0.00074490666,0.42066038],"genre_scores_gemma":[0.8866776,0.0023686609,0.04723495,0.0074981237,0.0008132824,0.00030726547,0.00045153731,0.0003586444,0.05428995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809057,0.0009202875,0.00005277358,0.00032447765,0.0003181231,0.00029360838],"domain_scores_gemma":[0.99783164,0.0012803102,0.00011158994,0.0004256819,0.00024902966,0.000101755744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033754124,0.00059766107,0.00043231918,0.00082488917,0.0038108702,0.003545678,0.0015879846,0.003039381,0.024909815],"category_scores_gemma":[0.008264493,0.00047094875,0.0007525241,0.0008037205,0.010606,0.012413562,0.004470317,0.0048854006,0.0026727377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045741754,0.000001961601,0.00003338749,0.000008623205,0.0000014874296,0.000017801278,0.00032655976,0.00016492995,0.000048563823,0.99644333,0.001792393,0.0011563839],"study_design_scores_gemma":[0.0000065757213,0.000006804486,0.000041879724,0.000020232215,0.000003641592,0.0000316683,0.00017409661,0.0020150002,0.00013472067,0.9797243,0.01783312,0.000008010559],"about_ca_topic_score_codex":0.006843671,"about_ca_topic_score_gemma":0.0044956496,"teacher_disagreement_score":0.024909815,"about_ca_system_score_codex":0.0031760596,"about_ca_system_score_gemma":0.0014634173,"threshold_uncertainty_score":0.083331645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5522417,0.0006334643,0.4354431,0.0004565118,0.00012573079,0.0000734473,0.00016259975,0.00030364539,0.010559815],"genre_scores_gemma":[0.9413616,0.00029566258,0.05091246,0.000098872246,0.00012652864,0.00010809665,0.00017782957,0.000059652306,0.0068591586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817765,0.00039593113,0.00017245677,0.00050614733,0.0005018517,0.00024598092],"domain_scores_gemma":[0.99709463,0.0011493152,0.00051774253,0.00044651103,0.00040780287,0.00038399003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016624581,0.00044752355,0.0010633285,0.0017037878,0.00093783444,0.0018597028,0.0006607166,0.0006774195,0.0021994442],"category_scores_gemma":[0.0035937955,0.00036092466,0.0020290783,0.0005960296,0.002909578,0.0026193561,0.0022667558,0.0012348255,0.00045343264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012555295,0.000045082823,0.0014099567,0.00007744629,0.000046808316,0.00033524958,0.0007174545,0.00916882,0.010600595,0.96115553,0.00050003064,0.015817488],"study_design_scores_gemma":[0.000034140496,0.00025639145,0.0019293623,0.000024485033,0.000032386703,0.000342422,0.00023898217,0.09119186,0.0058949846,0.8952241,0.0047779507,0.000052978736],"about_ca_topic_score_codex":0.0007715053,"about_ca_topic_score_gemma":0.00027287094,"teacher_disagreement_score":0.0021994442,"about_ca_system_score_codex":0.0008773052,"about_ca_system_score_gemma":0.00061541615,"threshold_uncertainty_score":0.008792043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033725328,0.018045943,0.021809421,0.013116141,0.0018956263,0.000015035577,0.0000745735,0.000079096906,0.94159156],"genre_scores_gemma":[0.5018582,0.023434496,0.015843527,0.010372514,0.0050951187,0.00015031877,0.00020807213,0.00036423467,0.44267362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937916,0.00032618435,0.000014107776,0.00009998365,0.00010925015,0.00007131744],"domain_scores_gemma":[0.9994628,0.00031555915,0.000030040233,0.00005298001,0.0000910482,0.000047665213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009844726,0.00048258397,0.000417543,0.0017745205,0.0033383856,0.0066985437,0.0008846852,0.002312359,0.01274262],"category_scores_gemma":[0.0014751091,0.00026154218,0.00026908942,0.0026595562,0.012919926,0.011046632,0.0020533937,0.0040984987,0.0021849535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.697493e-7,0.0000012776537,0.0000065054064,0.0000045391716,1.8815294e-7,0.0000040152977,0.00016145897,0.000012752404,0.000007162174,0.9964234,0.0022528532,0.0011249016],"study_design_scores_gemma":[0.000001386494,0.0000034809746,0.000039891478,0.000038206115,8.935706e-7,0.00004888734,0.0003625658,0.00010602138,0.00004518827,0.8383081,0.16104226,0.000003083755],"about_ca_topic_score_codex":0.0028675569,"about_ca_topic_score_gemma":0.0031079946,"teacher_disagreement_score":0.01274262,"about_ca_system_score_codex":0.0034446174,"about_ca_system_score_gemma":0.0016810346,"threshold_uncertainty_score":0.04262829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5372324,0.0011658688,0.41274598,0.003560251,0.00012448392,0.00012221154,0.00061374484,0.0004417823,0.04399325],"genre_scores_gemma":[0.95938826,0.00041031113,0.033735085,0.00026838892,0.000093548864,0.00013948952,0.00041056122,0.00007796498,0.0054764054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808794,0.00071824633,0.00007817647,0.0005864753,0.00032910507,0.0002000428],"domain_scores_gemma":[0.990958,0.004782315,0.0011362628,0.0012957706,0.00083152007,0.0009961389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165484,0.00033597526,0.0008100198,0.0024898755,0.0020399254,0.0035681925,0.0011387717,0.0014502965,0.006503971],"category_scores_gemma":[0.014307102,0.00047472803,0.0005449919,0.0017698413,0.004826766,0.009473493,0.0038154903,0.0014657729,0.0005511306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008425236,0.000027009582,0.002395026,0.000059911945,0.00002513012,0.0002377622,0.00056418864,0.008418708,0.0014778761,0.9738017,0.0014104024,0.011498066],"study_design_scores_gemma":[0.000016426184,0.000026937894,0.00090270414,0.000025498011,0.000019905538,0.0003393554,0.00035101906,0.0370847,0.0008038194,0.9527427,0.007667462,0.000019446059],"about_ca_topic_score_codex":0.0010919872,"about_ca_topic_score_gemma":0.001064088,"teacher_disagreement_score":0.006503971,"about_ca_system_score_codex":0.0013415248,"about_ca_system_score_gemma":0.00038417798,"threshold_uncertainty_score":0.02175796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.251839,0.0022809098,0.5735911,0.001399519,0.0004846799,0.00016108128,0.0007018671,0.0008380893,0.16870372],"genre_scores_gemma":[0.80900466,0.0020489434,0.15502109,0.00064943684,0.0005374476,0.00018342637,0.0004997823,0.0005094837,0.031545825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978345,0.0005622695,0.0001042185,0.00047602056,0.000536685,0.0004863309],"domain_scores_gemma":[0.9939499,0.0029388287,0.00069058494,0.0010878579,0.0007957321,0.00053715706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00233179,0.00097287423,0.00067268807,0.0018671091,0.0016340237,0.0023278212,0.0011594307,0.00075051346,0.0072394805],"category_scores_gemma":[0.0059427987,0.0006113482,0.0010827457,0.0016910874,0.0054753157,0.0055195456,0.0027642315,0.0025308526,0.0013418723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070664544,0.000019496532,0.00024859642,0.000051507457,0.000007249311,0.000046678895,0.00017922968,0.0045647575,0.0011430535,0.9813975,0.0010802853,0.011190895],"study_design_scores_gemma":[0.000025382315,0.000060671122,0.00038269997,0.000030949854,0.000014591233,0.0001778931,0.00014735163,0.022633657,0.0014292642,0.9590641,0.015992107,0.000041217678],"about_ca_topic_score_codex":0.0020917652,"about_ca_topic_score_gemma":0.0024587836,"teacher_disagreement_score":0.0072394805,"about_ca_system_score_codex":0.002199457,"about_ca_system_score_gemma":0.0010164513,"threshold_uncertainty_score":0.0242185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38773134,0.0038377002,0.3954213,0.0018502222,0.00037863286,0.00014135051,0.0008865664,0.00059243647,0.20916054],"genre_scores_gemma":[0.9146713,0.0018406892,0.055950135,0.00035036856,0.0004393265,0.00020537789,0.00071096,0.00025773453,0.025574073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889684,0.00029978174,0.000085251486,0.00027409432,0.00025060796,0.00019328416],"domain_scores_gemma":[0.99875784,0.00048068803,0.0001620105,0.00016942678,0.00019607012,0.00023385535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581866,0.00077091774,0.0009523483,0.002924459,0.0027352495,0.0034891742,0.0007697978,0.00066016585,0.009288448],"category_scores_gemma":[0.0017907217,0.0005364942,0.0010975505,0.002131291,0.0054535093,0.005942207,0.005179047,0.0024287319,0.0015085442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028333066,0.000010915164,0.00032269195,0.000027951932,0.0000070356145,0.000080538084,0.00062739605,0.0010596754,0.0009297802,0.9893968,0.0005541106,0.0069547454],"study_design_scores_gemma":[0.000013870806,0.000073877134,0.00038609857,0.000047482714,0.000018755713,0.00029585478,0.00084035116,0.007593758,0.001356831,0.9611003,0.028245838,0.000027036263],"about_ca_topic_score_codex":0.0010662214,"about_ca_topic_score_gemma":0.001208822,"teacher_disagreement_score":0.009288448,"about_ca_system_score_codex":0.0010502296,"about_ca_system_score_gemma":0.0006358366,"threshold_uncertainty_score":0.031072974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6424275,0.0010195336,0.33509934,0.00065601623,0.00009702946,0.00009787985,0.00040207122,0.00036739104,0.01983315],"genre_scores_gemma":[0.94871014,0.00021600004,0.046888184,0.000080973994,0.00007121166,0.000060715694,0.00025883224,0.000042819,0.0036711216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800926,0.0003857921,0.00017942674,0.00036510357,0.0007946187,0.0002658291],"domain_scores_gemma":[0.9951243,0.0015350153,0.00079955434,0.0005158297,0.0011625505,0.0008627585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018217249,0.00042111662,0.00031961984,0.001851967,0.0011055155,0.003933837,0.000780114,0.0005987552,0.0021511363],"category_scores_gemma":[0.0033511561,0.0004172207,0.0005225799,0.0008145638,0.0041921074,0.0055939765,0.0017934734,0.0016194693,0.00039944623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013553203,0.00008361688,0.0038575532,0.0001022122,0.000024973235,0.0003439377,0.0014857337,0.0053544384,0.022987267,0.95458895,0.0004115885,0.010624203],"study_design_scores_gemma":[0.00004847398,0.0003098157,0.003067983,0.000079606914,0.00005243532,0.0010764824,0.00203062,0.063830204,0.031869564,0.878837,0.018689618,0.000108263426],"about_ca_topic_score_codex":0.0005904723,"about_ca_topic_score_gemma":0.00090196356,"teacher_disagreement_score":0.003933837,"about_ca_system_score_codex":0.0011296523,"about_ca_system_score_gemma":0.0008027136,"threshold_uncertainty_score":0.009634316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21772404,0.003917176,0.5608694,0.0028589417,0.0006877306,0.00012245617,0.0018564708,0.00025823273,0.21170564],"genre_scores_gemma":[0.9055338,0.0040502143,0.06738248,0.0005118361,0.0007508283,0.00020905987,0.0016485836,0.0002142798,0.019698957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987841,0.00035147037,0.00006199249,0.00022948676,0.00041268853,0.00016017763],"domain_scores_gemma":[0.99811894,0.0008232631,0.00019926055,0.00012501843,0.00045057412,0.00028290914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011072751,0.000601661,0.0005832109,0.0021837687,0.001203666,0.0044737943,0.00062733813,0.00039683311,0.005229236],"category_scores_gemma":[0.0037975572,0.00044374054,0.0005010835,0.0015590851,0.005102851,0.005030511,0.002495988,0.0028569605,0.0013128351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005605442,0.0000062420345,0.00019794464,0.000040269966,0.000004684646,0.000048652968,0.00019678294,0.0012197202,0.0010115491,0.98971444,0.0010183338,0.0064854207],"study_design_scores_gemma":[0.000019843817,0.000038624665,0.00043943073,0.000043932992,0.000008122525,0.00022783021,0.0005640559,0.012283675,0.0026734066,0.9648081,0.018865196,0.000027830225],"about_ca_topic_score_codex":0.0011647608,"about_ca_topic_score_gemma":0.0005693069,"teacher_disagreement_score":0.005229236,"about_ca_system_score_codex":0.0012574226,"about_ca_system_score_gemma":0.000618967,"threshold_uncertainty_score":0.017493546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63965356,0.0012957356,0.26015,0.00091619923,0.00021487073,0.00008270187,0.0003440613,0.00048736812,0.09685546],"genre_scores_gemma":[0.9552019,0.0003640732,0.031001296,0.00013734431,0.00013352743,0.000095034055,0.00031094358,0.00008279584,0.012672996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987527,0.00031877647,0.00008832573,0.00023013001,0.00039024916,0.00021972587],"domain_scores_gemma":[0.9981515,0.0005617121,0.00023568257,0.00019203774,0.00035946793,0.0004995347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011777718,0.0004501055,0.0003763529,0.002433252,0.0019393067,0.0033725472,0.0008581942,0.0005728531,0.004630696],"category_scores_gemma":[0.0024221463,0.00040332368,0.0007692578,0.001307858,0.0049108528,0.006604447,0.0027403254,0.0014453166,0.0006537255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011283567,0.000009742155,0.00022724444,0.0000141843,0.0000019963782,0.000094077404,0.0005821509,0.00052103796,0.00070951914,0.9952878,0.00012489359,0.0024161814],"study_design_scores_gemma":[0.000007849084,0.000025313871,0.00040736012,0.000015298303,0.0000042744177,0.00020260921,0.0004566372,0.0038734917,0.0019031069,0.98681074,0.006275326,0.000017994083],"about_ca_topic_score_codex":0.0010714674,"about_ca_topic_score_gemma":0.0010176809,"teacher_disagreement_score":0.004630696,"about_ca_system_score_codex":0.0015058345,"about_ca_system_score_gemma":0.0006797043,"threshold_uncertainty_score":0.015491188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0337936,0.028491525,0.11955363,0.0038206787,0.0008197576,0.00004802251,0.0007285647,0.0007090653,0.8120352],"genre_scores_gemma":[0.69686705,0.014874272,0.032600597,0.0011089859,0.0018724537,0.00012453647,0.0011504475,0.0002270515,0.2511746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997428,0.000051019262,0.000010761486,0.00003880101,0.00011523055,0.00004133818],"domain_scores_gemma":[0.9997948,0.000057771642,0.000013702849,0.000026347345,0.000075958,0.000031470252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036793752,0.0005137226,0.00044254318,0.0013818278,0.0010038902,0.0023100993,0.00073648506,0.0005183961,0.010265748],"category_scores_gemma":[0.00051025377,0.00023995369,0.00036288644,0.0016637604,0.001623804,0.003161146,0.0007677543,0.0015794007,0.0025241012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036231697,0.0000059787835,0.000032312648,0.000037939277,0.0000031825844,0.000014662522,0.00008379408,0.0002514001,0.00031662878,0.9862884,0.0056566815,0.007305278],"study_design_scores_gemma":[0.0000040951695,0.0000074484074,0.00015280276,0.000018492388,0.000004187065,0.00007199117,0.000038041748,0.001057552,0.00033318106,0.9572456,0.041060872,0.000005719918],"about_ca_topic_score_codex":0.0016169194,"about_ca_topic_score_gemma":0.0011229957,"teacher_disagreement_score":0.010265748,"about_ca_system_score_codex":0.0015181046,"about_ca_system_score_gemma":0.000970989,"threshold_uncertainty_score":0.03434229},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004079159,0.0111747915,0.5280733,0.0030517043,0.000953327,0.00007030224,0.0009192154,0.0016556627,0.45002255],"genre_scores_gemma":[0.19914688,0.015042306,0.3486567,0.0011711014,0.0016104995,0.000223447,0.005042217,0.0010227395,0.42808405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890816,0.00018385137,0.000063221945,0.00015077365,0.0006400386,0.000053957592],"domain_scores_gemma":[0.99908674,0.00031758656,0.000031644362,0.00035949112,0.00017357424,0.000031009404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093338545,0.0009427731,0.001205693,0.0013449622,0.000842611,0.0042657526,0.00174591,0.0011498897,0.058321442],"category_scores_gemma":[0.0042087,0.00058247097,0.0010055485,0.002316315,0.0013036366,0.005010389,0.0018815598,0.0021467593,0.0143506825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057928017,0.000037669,0.0002193699,0.00021872972,0.00003697411,0.000054056934,0.00010944739,0.007823039,0.0006829704,0.57336146,0.051792093,0.3656063],"study_design_scores_gemma":[0.000012956218,0.000015615638,0.00026813144,0.00013430983,0.000032980934,0.00014660171,0.000073575924,0.037087858,0.0011231819,0.7721362,0.18895593,0.000012647448],"about_ca_topic_score_codex":0.0028625708,"about_ca_topic_score_gemma":0.0029136504,"teacher_disagreement_score":0.058321442,"about_ca_system_score_codex":0.0014979893,"about_ca_system_score_gemma":0.00084827637,"threshold_uncertainty_score":0.19510466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19138426,0.009764314,0.6973717,0.01032651,0.00074920326,0.00019155338,0.0016563142,0.001073043,0.087483004],"genre_scores_gemma":[0.89821714,0.005709834,0.0620419,0.0023168945,0.0017693936,0.00033375958,0.0016643192,0.0010251222,0.02692155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517524,0.0014701094,0.00019625269,0.0007910096,0.001450587,0.00091690273],"domain_scores_gemma":[0.94036174,0.045115385,0.002531777,0.0045367745,0.0029832134,0.00447116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008140044,0.002947614,0.0038256303,0.006690287,0.0037111896,0.007285956,0.005702916,0.00446596,0.015926953],"category_scores_gemma":[0.04871481,0.0018771322,0.0024040374,0.004754963,0.0089130225,0.01996472,0.012197234,0.012415679,0.0018116168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002434022,0.0000785585,0.00086790597,0.00022825827,0.00006321364,0.00007472365,0.00027663645,0.01970451,0.0009663465,0.9661794,0.0030364827,0.008280578],"study_design_scores_gemma":[0.000013556045,0.00003336153,0.0003232584,0.000061802006,0.000033076063,0.000044291955,0.000040788098,0.08211497,0.00056506717,0.91560376,0.0011374888,0.00002851868],"about_ca_topic_score_codex":0.0016844872,"about_ca_topic_score_gemma":0.0019487073,"teacher_disagreement_score":0.015926953,"about_ca_system_score_codex":0.005683519,"about_ca_system_score_gemma":0.0020112435,"threshold_uncertainty_score":0.05328101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650323,0.0013851271,0.23526342,0.0021804662,0.00028029864,0.000059087397,0.00051596126,0.00032463128,0.09495869],"genre_scores_gemma":[0.95477945,0.00041869457,0.02193796,0.0002375556,0.00012210952,0.00005743251,0.00025609718,0.000101367004,0.022089303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995484,0.00009239911,0.000028125714,0.00011981099,0.00009694756,0.00011424924],"domain_scores_gemma":[0.9986941,0.000576192,0.00016635464,0.00020520714,0.00016321096,0.00019496777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122801,0.0003882254,0.0007662117,0.0018947257,0.0021880725,0.0019823187,0.0008873474,0.0007918042,0.0097757485],"category_scores_gemma":[0.003259559,0.00037755026,0.0010554912,0.0015527465,0.0030023314,0.0051293857,0.0025756669,0.0018000621,0.00059355085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030343794,0.000009457177,0.00020064949,0.000014533295,0.0000039131464,0.000077414836,0.00027094464,0.0006638654,0.00047011246,0.9932929,0.0006555698,0.004310231],"study_design_scores_gemma":[0.000012427907,0.00001936804,0.0002528668,0.000009031972,0.000005360179,0.0001047275,0.00018526422,0.0037807797,0.00025723572,0.9931804,0.0021806832,0.000011798868],"about_ca_topic_score_codex":0.0017205316,"about_ca_topic_score_gemma":0.0013731355,"teacher_disagreement_score":0.0097757485,"about_ca_system_score_codex":0.00084613834,"about_ca_system_score_gemma":0.00047536698,"threshold_uncertainty_score":0.03270316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15345077,0.0014144018,0.5995512,0.0009029925,0.0013514115,0.00024402942,0.0008112962,0.0016028967,0.24067104],"genre_scores_gemma":[0.7461489,0.0010534177,0.19017944,0.00047888487,0.00029131724,0.00033466035,0.0006281393,0.0005706364,0.0603146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996099,0.00008375614,0.000027243186,0.00008579486,0.000119484714,0.00007378452],"domain_scores_gemma":[0.9995721,0.00013243097,0.00004757868,0.00010272212,0.000089696034,0.00005549524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037179867,0.0003540284,0.00026667892,0.00056914333,0.0011191617,0.0017712066,0.00042965342,0.0004024394,0.008733591],"category_scores_gemma":[0.0012910155,0.00021246233,0.00045363454,0.000687898,0.0015436447,0.0020604313,0.0009514381,0.0012157282,0.0019149028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014429328,0.0000074291193,0.00012429485,0.000018624902,0.0000014825795,0.000054666816,0.00012474135,0.0005893542,0.001809286,0.9837149,0.0010812655,0.012459684],"study_design_scores_gemma":[0.000010388337,0.000046134668,0.0002607908,0.000029275745,0.0000072597704,0.00028312704,0.00014349808,0.006781435,0.0048038005,0.9153686,0.07224208,0.000023555463],"about_ca_topic_score_codex":0.0006801634,"about_ca_topic_score_gemma":0.001228875,"teacher_disagreement_score":0.008733591,"about_ca_system_score_codex":0.00072433584,"about_ca_system_score_gemma":0.0005158138,"threshold_uncertainty_score":0.029216826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8306363,0.0005258521,0.092736945,0.00069646543,0.0001232034,0.0000833488,0.0009941721,0.00047498304,0.073728666],"genre_scores_gemma":[0.9526572,0.00042709173,0.029727532,0.00016934235,0.00015181936,0.00007712174,0.0010545057,0.0000901145,0.015645195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991505,0.0001318652,0.00005933504,0.00019591427,0.00021170275,0.0002507192],"domain_scores_gemma":[0.9980558,0.0005233783,0.00038448378,0.00033264366,0.0003021162,0.00040155146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041215052,0.00036632808,0.0003678991,0.0012342628,0.0014189226,0.0017161409,0.0007059745,0.00050840067,0.0059407875],"category_scores_gemma":[0.0021476103,0.0004806455,0.000547716,0.0013369857,0.0015972272,0.0025894656,0.0011622299,0.001082608,0.0005710552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705252,0.000048161826,0.0019988497,0.00007019906,0.00001326307,0.00023017342,0.00041952444,0.0065649077,0.0049459958,0.96002376,0.0025039534,0.023084147],"study_design_scores_gemma":[0.000030643434,0.00008686824,0.00223766,0.00003557505,0.000032804604,0.00043843756,0.00032555635,0.02934048,0.006068587,0.9361899,0.025167266,0.000046149584],"about_ca_topic_score_codex":0.0036528565,"about_ca_topic_score_gemma":0.003908644,"teacher_disagreement_score":0.0059407875,"about_ca_system_score_codex":0.0013169685,"about_ca_system_score_gemma":0.0007647852,"threshold_uncertainty_score":0.019873917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4224745,0.0036149113,0.3570901,0.0065845926,0.002543518,0.00014369268,0.001926816,0.0015424929,0.20407942],"genre_scores_gemma":[0.9295811,0.00090479176,0.034507908,0.0011607329,0.00066997966,0.0001841334,0.0015582917,0.00039051066,0.031042496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536055,0.00060111895,0.00047025274,0.0015749369,0.0013976247,0.00059555745],"domain_scores_gemma":[0.98733693,0.0042995024,0.0011342419,0.002337124,0.0032055723,0.0016866012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032461442,0.0012675993,0.002067132,0.0027149052,0.0044837785,0.0077247773,0.0025360833,0.0026210821,0.006311098],"category_scores_gemma":[0.0071070064,0.0013227497,0.0024250965,0.0019224873,0.010091435,0.02677196,0.010250823,0.0048196386,0.0018585738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001446641,0.00005183341,0.00097391685,0.00009484996,0.000047092526,0.00020778732,0.0003444867,0.00012681971,0.0007671521,0.9905123,0.0013191453,0.005409973],"study_design_scores_gemma":[0.00003014396,0.000059858845,0.0004319066,0.000018960116,0.0000419984,0.00082070427,0.00020924554,0.00077195774,0.0010240535,0.9874942,0.009070963,0.000026092426],"about_ca_topic_score_codex":0.0007009065,"about_ca_topic_score_gemma":0.0005591676,"teacher_disagreement_score":0.0077247773,"about_ca_system_score_codex":0.0012073865,"about_ca_system_score_gemma":0.0013378195,"threshold_uncertainty_score":0.02111268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028467064,0.008740846,0.4101303,0.0033013902,0.0009157563,0.00019731623,0.00081868056,0.0031299023,0.5699191],"genre_scores_gemma":[0.06412564,0.008497956,0.4538233,0.0025221983,0.0004810487,0.0004596388,0.0013809472,0.0016399457,0.46706933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995906,0.00010784951,0.000026800717,0.00007323698,0.00015815026,0.000043367894],"domain_scores_gemma":[0.9996184,0.00019795536,0.000018364964,0.000053740845,0.00008959545,0.00002189751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041256365,0.0010489543,0.00050014775,0.0012122021,0.0009803659,0.0020648225,0.0012477932,0.0012582426,0.07963042],"category_scores_gemma":[0.0023706418,0.00040360464,0.0008766079,0.0016823066,0.0010979259,0.0029379828,0.001161587,0.0019763617,0.033877667],"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.000032404772,0.000043541724,0.00013694173,0.00036315047,0.000011423522,0.00025589342,0.00037316466,0.0039474536,0.0011632247,0.76243126,0.118448965,0.11279261],"study_design_scores_gemma":[0.000015424008,0.000022296223,0.00025840395,0.00019115848,0.0000066369403,0.00045601415,0.00012418142,0.0080593135,0.00069514895,0.35774997,0.6324001,0.00002127632],"about_ca_topic_score_codex":0.0014658518,"about_ca_topic_score_gemma":0.0025022856,"teacher_disagreement_score":0.07963042,"about_ca_system_score_codex":0.00081014493,"about_ca_system_score_gemma":0.00062456756,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22155343,0.00289828,0.54523647,0.00081773015,0.00037860515,0.00013389101,0.0004579729,0.0004052759,0.2281183],"genre_scores_gemma":[0.87383866,0.001110558,0.08712087,0.00039630293,0.00036932452,0.00016928108,0.0004492255,0.000101687525,0.03644407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998979,0.0002156202,0.000062854284,0.00026275546,0.00035223475,0.00012749562],"domain_scores_gemma":[0.99892116,0.00020365068,0.00009914611,0.00013266355,0.0004480864,0.00019523186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012096881,0.00033733415,0.00036801488,0.0011668053,0.0011969467,0.0021545812,0.0005306891,0.00040872366,0.004965738],"category_scores_gemma":[0.0019169097,0.00024522122,0.0005563916,0.00056716375,0.001944159,0.004748935,0.0019981423,0.0010666344,0.0007803876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001852357,0.00000978614,0.00027064746,0.000034681616,0.000008619224,0.00007842913,0.0002627687,0.00025318417,0.0015081072,0.99132955,0.0004452609,0.0057803],"study_design_scores_gemma":[0.000015395071,0.00007276859,0.00066466007,0.000045801135,0.000034443437,0.00078070455,0.00034398993,0.0066181915,0.0049399347,0.94196784,0.04449354,0.00002275218],"about_ca_topic_score_codex":0.00028337876,"about_ca_topic_score_gemma":0.00021667624,"teacher_disagreement_score":0.004965738,"about_ca_system_score_codex":0.0005431949,"about_ca_system_score_gemma":0.00054442213,"threshold_uncertainty_score":0.016612113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7158127,0.00037973997,0.1640704,0.0009344276,0.00013713795,0.00006657005,0.00030905602,0.0006893122,0.11760073],"genre_scores_gemma":[0.9769116,0.000069549955,0.01726818,0.000095153046,0.000046862213,0.000028762943,0.00009025377,0.000038284063,0.005451384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936885,0.00012128707,0.000038426493,0.00009472703,0.0002181413,0.00015854352],"domain_scores_gemma":[0.99912244,0.00025932366,0.000114913186,0.00018519441,0.00020866058,0.00010944679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045921924,0.00018529392,0.0003118787,0.00085735234,0.0013828514,0.0013429839,0.00050151546,0.00054017117,0.0034487578],"category_scores_gemma":[0.0015264135,0.00021482033,0.00037131322,0.00051798567,0.0027217735,0.0022810076,0.0020513886,0.0009071939,0.00031471837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017263372,0.00000955555,0.00043251822,0.00002968252,0.000004207075,0.00014010504,0.00021768335,0.0005331083,0.0022262943,0.9926508,0.0002999095,0.0034388928],"study_design_scores_gemma":[0.000014414405,0.000029741313,0.0009248343,0.000025746547,0.000014426617,0.0003297161,0.00029527897,0.0060678814,0.004621348,0.9735597,0.0140987635,0.000018134439],"about_ca_topic_score_codex":0.00053489674,"about_ca_topic_score_gemma":0.000676602,"teacher_disagreement_score":0.0034487578,"about_ca_system_score_codex":0.00079722475,"about_ca_system_score_gemma":0.00046274712,"threshold_uncertainty_score":0.011537254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07299345,0.0012891863,0.51129425,0.009273336,0.0020176219,0.00013126168,0.00044216108,0.0009224784,0.40163627],"genre_scores_gemma":[0.7816362,0.0010523787,0.12756331,0.0045437166,0.0024000718,0.0005019586,0.00049851707,0.00095744035,0.08084643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988967,0.0002269149,0.000056195055,0.00023231884,0.0004627671,0.00012511823],"domain_scores_gemma":[0.9981273,0.0008135222,0.00012358838,0.00033129595,0.00044838962,0.00015590548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011099931,0.0009068166,0.00071209884,0.0017259249,0.0021037683,0.0017585509,0.002290297,0.0013322498,0.01961173],"category_scores_gemma":[0.0041131414,0.00053530984,0.0016778326,0.0007216866,0.0036205722,0.0052641868,0.0035243193,0.0030634853,0.002335828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031823329,0.000009851861,0.000036673744,0.000015671567,0.0000022710096,0.000039102193,0.00004147468,0.00025823843,0.0003227094,0.9970975,0.00095428707,0.0012190249],"study_design_scores_gemma":[0.00001011252,0.0000072708244,0.000100835765,0.000009235309,0.0000045527654,0.00010348507,0.000016425045,0.0035848785,0.00036774256,0.9896828,0.006104705,0.000007966597],"about_ca_topic_score_codex":0.00094777474,"about_ca_topic_score_gemma":0.0009788073,"teacher_disagreement_score":0.01961173,"about_ca_system_score_codex":0.0016466555,"about_ca_system_score_gemma":0.00084693683,"threshold_uncertainty_score":0.06560773},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7721327,0.00064131833,0.1698214,0.0014365342,0.0003313893,0.000050886956,0.00018318438,0.00031054922,0.05509203],"genre_scores_gemma":[0.97832936,0.00010786929,0.017521167,0.00011312542,0.0000600898,0.00002598014,0.00004439203,0.00003696539,0.0037609297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00016233351,0.00002662889,0.000075442375,0.00018672415,0.00015298184],"domain_scores_gemma":[0.9985268,0.00048642379,0.0002279407,0.00020663114,0.00020778339,0.00034430396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805112,0.00029340835,0.0004480877,0.0013040756,0.001241523,0.0019546174,0.0008496771,0.00081439805,0.005048879],"category_scores_gemma":[0.0024621147,0.00022838645,0.0004678602,0.0004520594,0.0031983517,0.0021576786,0.00167797,0.0014447372,0.00045276774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017568924,0.000016256661,0.0001951686,0.000013091139,0.000003170126,0.00010175511,0.00004585745,0.0047434163,0.0009488569,0.99166954,0.0004437467,0.0018015888],"study_design_scores_gemma":[0.000011522595,0.000013444159,0.00019512144,0.000011453343,0.0000019549188,0.0001179006,0.00008693228,0.043832336,0.0008984163,0.95369804,0.001117926,0.0000149801745],"about_ca_topic_score_codex":0.0008559977,"about_ca_topic_score_gemma":0.0008267557,"teacher_disagreement_score":0.005048879,"about_ca_system_score_codex":0.0008318598,"about_ca_system_score_gemma":0.0004672209,"threshold_uncertainty_score":0.016890168},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59582514,0.0012327322,0.2593278,0.0018083254,0.00043787822,0.00010735666,0.0005587112,0.0005237855,0.14017832],"genre_scores_gemma":[0.949014,0.00047206756,0.024795186,0.00020612672,0.0002756926,0.00005109985,0.00040052793,0.000060244398,0.024725031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991015,0.00011976119,0.000071106,0.00013774284,0.00033633565,0.00023359897],"domain_scores_gemma":[0.99845994,0.00024783818,0.00026030026,0.00015227015,0.00047469503,0.00040498562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013865498,0.00040183536,0.00033571912,0.0022761056,0.0019065238,0.0036313704,0.0006700966,0.00053413305,0.0053577055],"category_scores_gemma":[0.0021768203,0.00027288188,0.0006541961,0.0014292514,0.0026682217,0.004921994,0.0015293187,0.0014688785,0.0009608672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015112861,0.000010466276,0.00045771594,0.0000121368785,0.0000025903798,0.000017512142,0.00015913806,0.00014641247,0.00043441044,0.9947227,0.0004540799,0.003567726],"study_design_scores_gemma":[0.000008451885,0.000022669858,0.00096321356,0.000014723925,0.000008881352,0.000094024006,0.00020508743,0.0029765752,0.001425818,0.9858521,0.008406808,0.00002159473],"about_ca_topic_score_codex":0.0024276448,"about_ca_topic_score_gemma":0.0013811174,"teacher_disagreement_score":0.0053577055,"about_ca_system_score_codex":0.0016662794,"about_ca_system_score_gemma":0.0009861497,"threshold_uncertainty_score":0.017923355},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049628355,0.004218471,0.11512001,0.00823752,0.010005567,0.00013169007,0.0024559493,0.001454927,0.8087475],"genre_scores_gemma":[0.434124,0.0031443867,0.046365056,0.001780668,0.002878599,0.00015679932,0.0023262894,0.0011161407,0.50810814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964106,0.00004935874,0.000030333034,0.00007533619,0.00014787067,0.00005591142],"domain_scores_gemma":[0.9995431,0.000085143605,0.000041167335,0.00009368762,0.00016310623,0.000073886265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047871712,0.00043620568,0.00040797173,0.0015595091,0.0016710638,0.0025190974,0.000904701,0.00041732012,0.035846986],"category_scores_gemma":[0.001417963,0.00031835475,0.00064949517,0.0014381093,0.0016959162,0.006274774,0.0019081704,0.0017806616,0.005978865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015268573,0.000006360641,0.00010229102,0.0000384091,0.0000029094322,0.000027945029,0.0001973374,0.00006842044,0.00042944093,0.973725,0.016245425,0.009141163],"study_design_scores_gemma":[0.00000779517,0.000018236336,0.0008534216,0.000041056028,0.00001368745,0.0001779064,0.00023516503,0.0005364314,0.0011174392,0.76995486,0.2270152,0.000028858354],"about_ca_topic_score_codex":0.00131645,"about_ca_topic_score_gemma":0.002149028,"teacher_disagreement_score":0.035846986,"about_ca_system_score_codex":0.0012426967,"about_ca_system_score_gemma":0.0007543636,"threshold_uncertainty_score":0.119920075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5386401,0.0025709653,0.3442499,0.0014303579,0.00024441374,0.00014717392,0.00048783436,0.00033395787,0.11189544],"genre_scores_gemma":[0.952636,0.00050174847,0.035614155,0.00018889425,0.00018159929,0.00009550445,0.00025338144,0.000020727257,0.010508021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987047,0.0002994998,0.00010560581,0.00014885308,0.00055394415,0.00018735856],"domain_scores_gemma":[0.9985246,0.0003870738,0.00021972136,0.00014849054,0.00041684136,0.00030322417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015104703,0.00035402115,0.00054587127,0.0018253669,0.0016336931,0.0023595404,0.0005943516,0.0006240699,0.0044743614],"category_scores_gemma":[0.0020313805,0.00034722165,0.001025395,0.0014125339,0.0023906196,0.0043610777,0.0013955235,0.0013820983,0.0005150624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047304093,0.000023556837,0.0003886033,0.000047087866,0.000017316184,0.00013487152,0.00054167164,0.0008966905,0.0015512714,0.99138194,0.0004403589,0.004529297],"study_design_scores_gemma":[0.000015536958,0.000033793996,0.0005870869,0.000016534465,0.000013097026,0.0003074709,0.00021655018,0.006596882,0.0010985777,0.9880967,0.0029924905,0.000025389923],"about_ca_topic_score_codex":0.00070675474,"about_ca_topic_score_gemma":0.0005892403,"teacher_disagreement_score":0.0044743614,"about_ca_system_score_codex":0.0012605397,"about_ca_system_score_gemma":0.00088694924,"threshold_uncertainty_score":0.014968276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024515318,0.00042456036,0.00091185275,0.0003219369,0.00014914612,0.000037277317,0.0008175842,0.00086946593,0.996223],"genre_scores_gemma":[0.0004967308,0.00022808134,0.00031912734,0.00009429365,0.00003357008,0.00002395195,0.00043656077,0.00022196861,0.9981457],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952173,0.00003147015,0.000034679124,0.00015953583,0.0001656504,0.00008691831],"domain_scores_gemma":[0.99844223,0.0004517824,0.0001273116,0.0002573895,0.0002895915,0.00043170742],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00080017204,0.0021925266,0.0012757053,0.0021831547,0.0014788433,0.005464243,0.0026334394,0.0042793644,0.97422475],"category_scores_gemma":[0.0015902193,0.0009917151,0.00080783025,0.0030045372,0.0013094099,0.006316603,0.0031656947,0.0021040065,0.98561734],"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.000107261454,0.000099879646,0.00045546898,0.0004345419,0.000015662758,0.00012035589,0.00009523223,0.000326053,0.0020276615,0.011468551,0.4271415,0.55770785],"study_design_scores_gemma":[0.00001329916,0.00003337976,0.00052651874,0.00019464034,0.000006530173,0.00013862351,0.00007397527,0.00013390339,0.00032790555,0.0014053567,0.99713576,0.000010288895],"about_ca_topic_score_codex":0.0033740492,"about_ca_topic_score_gemma":0.0037759875,"teacher_disagreement_score":0.025775254,"about_ca_system_score_codex":0.001055579,"about_ca_system_score_gemma":0.000952399,"threshold_uncertainty_score":0.036765277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024082155,0.00040873047,0.0010146399,0.00032954186,0.00015790119,0.000040468083,0.0008827674,0.0009330117,0.9959921],"genre_scores_gemma":[0.00051373604,0.000214845,0.0003297255,0.00009359925,0.000033671735,0.00002407714,0.00045771615,0.00024756562,0.99808514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994535,0.000034832934,0.00003791851,0.00018229842,0.00019519865,0.0000963915],"domain_scores_gemma":[0.99825984,0.0004917713,0.00013424382,0.000297973,0.00035958277,0.0004565637],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00085745,0.0021712903,0.0013503534,0.0022510288,0.0015267201,0.0058594886,0.002836782,0.004348491,0.97719574],"category_scores_gemma":[0.0016188186,0.001012535,0.0008923027,0.003077496,0.0013907618,0.0061208457,0.0032740594,0.0022293143,0.9876988],"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.000118222146,0.00009771766,0.00043331875,0.0004349745,0.000017028933,0.00012237701,0.000083465646,0.00035997806,0.002219431,0.0103802495,0.4159462,0.5697871],"study_design_scores_gemma":[0.000013941289,0.000035407364,0.00046636057,0.00020354033,0.000006760656,0.00013722958,0.00007116566,0.00015218726,0.00037725593,0.0012734015,0.99725133,0.000011265811],"about_ca_topic_score_codex":0.0035426852,"about_ca_topic_score_gemma":0.0037524127,"teacher_disagreement_score":0.02280426,"about_ca_system_score_codex":0.0011750702,"about_ca_system_score_gemma":0.00097487285,"threshold_uncertainty_score":0.032527447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020442168,0.00041711566,0.0012698189,0.00034725314,0.00016562628,0.00003999274,0.0007960523,0.0010426186,0.9957172],"genre_scores_gemma":[0.000634932,0.0002693424,0.00048288796,0.000124763,0.00003564046,0.000031283515,0.00053106586,0.00031118272,0.9975789],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994898,0.00003066313,0.000032640422,0.00018077236,0.00017785029,0.0000882261],"domain_scores_gemma":[0.99832934,0.0004782682,0.00013290423,0.00026744508,0.00033338182,0.00045865102],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009426366,0.0020641712,0.0014062526,0.001940218,0.0015196378,0.0056278654,0.0027420188,0.0043022363,0.9795974],"category_scores_gemma":[0.001571564,0.0008827497,0.0009359064,0.0023442025,0.0013635189,0.0056178197,0.0032554485,0.0022432588,0.9898555],"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.00013587334,0.000103868886,0.00042780655,0.0004774785,0.000020769081,0.0001299678,0.000099754456,0.00038181306,0.0027946192,0.011472327,0.35926735,0.62468827],"study_design_scores_gemma":[0.0000149334355,0.000036351412,0.00043858774,0.00022115413,0.000008215501,0.00018901545,0.00008082992,0.00012402298,0.00036606292,0.001454487,0.99705386,0.000012407427],"about_ca_topic_score_codex":0.0027317554,"about_ca_topic_score_gemma":0.0025127432,"teacher_disagreement_score":0.02040261,"about_ca_system_score_codex":0.0011055224,"about_ca_system_score_gemma":0.00093281147,"threshold_uncertainty_score":0.029101849},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024858862,0.0016578787,0.0076932125,0.00095217634,0.0005877856,0.0000127740905,0.00024142349,0.00014177742,0.9862271],"genre_scores_gemma":[0.10450884,0.003077246,0.00473424,0.00044534888,0.00086142943,0.00004606713,0.00077662105,0.00030470634,0.88524556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968827,0.00007000652,0.000009552941,0.00006841339,0.00012301018,0.000040859995],"domain_scores_gemma":[0.99984336,0.000021096577,0.000008954791,0.000033958248,0.00006507773,0.00002750505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025795746,0.0005962296,0.0003757872,0.001237865,0.0014645576,0.0037989484,0.0005127435,0.00047348026,0.051792264],"category_scores_gemma":[0.0006613851,0.0002884084,0.00025318388,0.0012977028,0.001861387,0.0036906835,0.0014024422,0.0019593877,0.016736666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032898424,0.0000031365325,0.000018142273,0.000012679645,9.776243e-7,0.000006492993,0.000078477045,0.000037811275,0.00009626945,0.9735996,0.018387198,0.0077559147],"study_design_scores_gemma":[0.0000031003137,0.0000050655294,0.000119335135,0.000019311636,0.0000027205956,0.00008807574,0.00012315613,0.00019140833,0.00024339819,0.60695565,0.39224416,0.0000046503683],"about_ca_topic_score_codex":0.0011510969,"about_ca_topic_score_gemma":0.0013371272,"teacher_disagreement_score":0.051792264,"about_ca_system_score_codex":0.0013052897,"about_ca_system_score_gemma":0.0006256495,"threshold_uncertainty_score":0.17326236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5280791,0.0025440087,0.40151215,0.0022896908,0.00014238973,0.00004590564,0.00013836546,0.00009997457,0.06514839],"genre_scores_gemma":[0.95592445,0.00051411503,0.04023586,0.00014743872,0.00007410984,0.00004550157,0.000086451364,0.000025845264,0.0029463402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901044,0.00040054,0.000039059392,0.0002339397,0.0002037355,0.00011225674],"domain_scores_gemma":[0.9980393,0.0011737674,0.00022306385,0.0001946054,0.00022132754,0.00014800958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014542539,0.00031019264,0.0003686413,0.0016035822,0.0013321349,0.0027553274,0.0005797153,0.0008321124,0.0025057765],"category_scores_gemma":[0.0032988223,0.0001844844,0.00041014163,0.0008978979,0.004642591,0.008960788,0.0026027951,0.0011770845,0.0002522204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015439806,0.000004387287,0.00041602663,0.000017846278,0.0000018745869,0.000037658836,0.00059737876,0.0005009575,0.00049973215,0.9940177,0.00010777329,0.0037832165],"study_design_scores_gemma":[0.0000069180173,0.000052961936,0.00060722063,0.000020783318,0.0000043176237,0.00022817966,0.0009794573,0.006745329,0.0005842071,0.9799896,0.010769556,0.000011536283],"about_ca_topic_score_codex":0.0007154479,"about_ca_topic_score_gemma":0.0005960808,"teacher_disagreement_score":0.0027553274,"about_ca_system_score_codex":0.0013064961,"about_ca_system_score_gemma":0.00040973423,"threshold_uncertainty_score":0.009479284},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038225815,0.002556402,0.6610668,0.0036702836,0.0016616369,0.0002556141,0.004325164,0.003213806,0.2850245],"genre_scores_gemma":[0.54987043,0.0023986048,0.23680691,0.0034968539,0.0017853754,0.0010676347,0.00900624,0.0024823605,0.19308561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959378,0.0007645603,0.00042846325,0.0009371001,0.0013829051,0.000549178],"domain_scores_gemma":[0.9959824,0.0012497486,0.00028637235,0.0007719432,0.0012908716,0.00041869897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024370572,0.0011968879,0.0013171547,0.0038509287,0.004529182,0.0064018676,0.0020691138,0.0018307526,0.03717614],"category_scores_gemma":[0.0068125115,0.0007467253,0.0028060179,0.003051545,0.0027382777,0.009563906,0.0047450014,0.004558361,0.010600918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021811698,0.000014460827,0.000073741394,0.000039948456,0.0000075109115,0.000058875863,0.00011540215,0.00035967692,0.00025238763,0.98820704,0.0039689397,0.006880103],"study_design_scores_gemma":[0.00001095771,0.00001002019,0.000077701625,0.000027302014,0.000009653559,0.0000969597,0.000067067354,0.003901606,0.00069538783,0.9713742,0.02371051,0.00001858995],"about_ca_topic_score_codex":0.0033028428,"about_ca_topic_score_gemma":0.002938614,"teacher_disagreement_score":0.03717614,"about_ca_system_score_codex":0.0052991244,"about_ca_system_score_gemma":0.0018623141,"threshold_uncertainty_score":0.12436658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057037614,0.004479846,0.75664675,0.0040414585,0.0012855701,0.000063569634,0.00037602714,0.0006199037,0.17544927],"genre_scores_gemma":[0.64410967,0.0038509802,0.2874649,0.0013516692,0.0020805977,0.00021058557,0.00068791135,0.0005922957,0.05965144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929416,0.00024690863,0.000035351346,0.00014838377,0.00021095741,0.00006419067],"domain_scores_gemma":[0.9986242,0.00082351925,0.00007593125,0.00023625135,0.00015290383,0.000087260836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954002,0.00071105006,0.00064043293,0.001122702,0.001167336,0.0031873463,0.0013863979,0.0009445219,0.008308333],"category_scores_gemma":[0.0028493255,0.0004560126,0.0007425301,0.0013311565,0.0050384672,0.011411839,0.0022660538,0.00337331,0.001908425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007993513,0.000005670487,0.000034969144,0.000019898518,0.0000017014204,0.000011860572,0.00014733219,0.0003593472,0.00024920242,0.991657,0.0013428726,0.006162175],"study_design_scores_gemma":[0.0000016746443,0.0000033328683,0.000017239265,0.00000599632,0.0000011567257,0.000017139153,0.000028428842,0.0015967818,0.00018278607,0.9928161,0.0053258347,0.000003549823],"about_ca_topic_score_codex":0.0005257023,"about_ca_topic_score_gemma":0.0006852131,"teacher_disagreement_score":0.008308333,"about_ca_system_score_codex":0.0008396823,"about_ca_system_score_gemma":0.00047671553,"threshold_uncertainty_score":0.027794123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42022362,0.0015620223,0.42490917,0.0018256988,0.0006875097,0.00021283803,0.0005058918,0.0007505129,0.14932272],"genre_scores_gemma":[0.92128795,0.00077875645,0.052973256,0.00065097015,0.00037084406,0.00014139371,0.00032839802,0.00015291703,0.023315424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993094,0.00012406669,0.00005680452,0.00017463484,0.00020914512,0.00012590212],"domain_scores_gemma":[0.9989273,0.00022680154,0.0002448895,0.00024191737,0.00021069784,0.00014845243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067154656,0.0005114234,0.00051744434,0.00192929,0.0020670688,0.00206736,0.0009188797,0.0009646684,0.0077983956],"category_scores_gemma":[0.0023116923,0.00041146725,0.00095624884,0.0017526271,0.0028883447,0.0076063913,0.0020379324,0.0021695793,0.001093056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001188519,0.000007299858,0.0001644069,0.000031890064,0.0000049805353,0.000065935674,0.0002088435,0.00039393423,0.00081522565,0.994323,0.000603733,0.0033688569],"study_design_scores_gemma":[0.000006931875,0.000017855416,0.00028364002,0.000016931692,0.000009519092,0.00018174092,0.00017582055,0.002402412,0.00059408176,0.9905077,0.0057845344,0.00001889656],"about_ca_topic_score_codex":0.0011983521,"about_ca_topic_score_gemma":0.0009906008,"teacher_disagreement_score":0.0077983956,"about_ca_system_score_codex":0.0009186924,"about_ca_system_score_gemma":0.00048123626,"threshold_uncertainty_score":0.026088238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048361927,0.0060924073,0.88183177,0.0016135337,0.0010274424,0.00018405996,0.00066722237,0.0004538072,0.059767835],"genre_scores_gemma":[0.585837,0.0038116628,0.37729394,0.0007396761,0.0005305796,0.00026950822,0.00072857353,0.0002851938,0.030503847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986541,0.00043571804,0.0001491704,0.00032585728,0.0003211411,0.000113870745],"domain_scores_gemma":[0.9983669,0.00055910955,0.00010120752,0.00020731846,0.00065067085,0.00011483035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019199728,0.00061848963,0.000486766,0.0015256621,0.0014912873,0.0025275887,0.0006654537,0.0007106409,0.004737003],"category_scores_gemma":[0.004577754,0.00053805404,0.0010867367,0.0011079488,0.002838061,0.004824927,0.0016410305,0.0021752724,0.0015106048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015637122,0.000007058394,0.00012226817,0.000054572516,0.0000068975896,0.00006793104,0.00032605845,0.00049734407,0.0009827776,0.98843443,0.0005362599,0.008948702],"study_design_scores_gemma":[0.000015631895,0.0000259723,0.00013877657,0.00006348415,0.000013495651,0.00017522552,0.0001021524,0.0044450383,0.0036588113,0.95060563,0.040733464,0.00002243415],"about_ca_topic_score_codex":0.0008227046,"about_ca_topic_score_gemma":0.0007311859,"teacher_disagreement_score":0.004737003,"about_ca_system_score_codex":0.0016478334,"about_ca_system_score_gemma":0.0010407026,"threshold_uncertainty_score":0.015846789},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38735035,0.005453525,0.41744345,0.010625378,0.0006232606,0.00014194062,0.0012538508,0.0003918994,0.17671639],"genre_scores_gemma":[0.93169516,0.0021788361,0.044052526,0.0009780198,0.0007726289,0.00012486435,0.0006531222,0.00013989612,0.019404948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988537,0.00039474425,0.00007162262,0.00021614633,0.0002693257,0.00019436785],"domain_scores_gemma":[0.99512285,0.0031784594,0.00035747988,0.0004061651,0.0005781613,0.0003568933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029690824,0.00066232646,0.0010572381,0.0026659146,0.0034760628,0.004618422,0.0016583849,0.0019213961,0.008643091],"category_scores_gemma":[0.006628303,0.0008408385,0.0013103262,0.0034382737,0.008201218,0.021872029,0.0031103268,0.003964348,0.0006995368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017605835,0.00000991468,0.00006116205,0.000009755941,0.0000025019704,0.000019967596,0.00020736211,0.00016071052,0.0001683498,0.99763,0.00024405445,0.0014685795],"study_design_scores_gemma":[0.000005382976,0.000006304185,0.00007251815,0.0000062481795,0.0000030333229,0.000015762891,0.00004939331,0.0011102448,0.000087540095,0.99798006,0.0006581663,0.0000053796557],"about_ca_topic_score_codex":0.002440246,"about_ca_topic_score_gemma":0.002196237,"teacher_disagreement_score":0.008643091,"about_ca_system_score_codex":0.0021459393,"about_ca_system_score_gemma":0.001133805,"threshold_uncertainty_score":0.028914034},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025489999,0.0011429017,0.14585125,0.0028292297,0.00088935276,0.00012033695,0.0019083109,0.0019291517,0.8427805],"genre_scores_gemma":[0.16114901,0.0023888692,0.06124692,0.0022079484,0.0012107239,0.0003534554,0.0056197196,0.0025616242,0.7632618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886876,0.00023579504,0.00007001253,0.00038219808,0.00031791907,0.00012522312],"domain_scores_gemma":[0.9994406,0.00012292729,0.00002412419,0.00017959464,0.00019050248,0.000042277825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007953012,0.0011131788,0.0006812649,0.001751703,0.0022110948,0.0062517463,0.0014872433,0.0011689038,0.10730188],"category_scores_gemma":[0.0019504998,0.0005576597,0.0008412933,0.001519122,0.0027318567,0.010117218,0.0029824318,0.0026059279,0.05011292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010221094,0.000008861864,0.000030077526,0.00003282662,0.0000033561605,0.000015735732,0.00016225589,0.00008441826,0.000202528,0.9679249,0.016430791,0.015094027],"study_design_scores_gemma":[0.000007122283,0.00000463741,0.0000364748,0.000022553788,0.000005972273,0.000053450298,0.00012870661,0.0003414535,0.00045443673,0.7116795,0.28726026,0.0000054187244],"about_ca_topic_score_codex":0.0016567309,"about_ca_topic_score_gemma":0.001242818,"teacher_disagreement_score":0.10730188,"about_ca_system_score_codex":0.001750285,"about_ca_system_score_gemma":0.0013006923,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109852046,0.018576752,0.08371963,0.019791039,0.0038181453,0.00015476567,0.00094559597,0.00029238936,0.7628496],"genre_scores_gemma":[0.84122264,0.012856817,0.047041763,0.007770408,0.007137811,0.0002754658,0.00095498376,0.0003570352,0.082383096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981286,0.00034487963,0.00015449116,0.0005274902,0.00043886228,0.0004058296],"domain_scores_gemma":[0.9958627,0.0022850772,0.00029454895,0.0004493051,0.0005914337,0.00051693426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994877,0.0007130506,0.00078410463,0.0021096235,0.0036597492,0.0037778567,0.0012422575,0.001223042,0.012590122],"category_scores_gemma":[0.0054698684,0.00059459044,0.0014378936,0.0015099612,0.00497481,0.014897725,0.0036789093,0.007959615,0.0026345216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023414697,0.000014034188,0.0005084532,0.000045382483,0.0000044353037,0.00008644329,0.0002932256,0.00010579341,0.00035721148,0.9871703,0.0047163097,0.0066749617],"study_design_scores_gemma":[0.000016138965,0.000043946595,0.0011468048,0.00008576888,0.000010587998,0.00028332832,0.00036193657,0.0006829916,0.0007882648,0.889993,0.106568776,0.000018380091],"about_ca_topic_score_codex":0.00251953,"about_ca_topic_score_gemma":0.0012149573,"teacher_disagreement_score":0.012590122,"about_ca_system_score_codex":0.0019909192,"about_ca_system_score_gemma":0.00074173167,"threshold_uncertainty_score":0.042118132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85417384,0.00028527604,0.1269474,0.00025595108,0.000046929195,0.00005442387,0.0011048659,0.00037173455,0.016759686],"genre_scores_gemma":[0.9624388,0.0001836735,0.025436858,0.00008077885,0.00003864886,0.0001264525,0.0017156743,0.00010410016,0.009875029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.00009307313,0.00005791208,0.00021962957,0.00019113712,0.00018304176],"domain_scores_gemma":[0.9981426,0.00053514756,0.00029273902,0.00028924158,0.00031390588,0.00042645383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940444,0.00044233463,0.0005458562,0.0012303565,0.002241218,0.0014017039,0.00073732773,0.00041429044,0.006350354],"category_scores_gemma":[0.001712348,0.00046644037,0.0009453344,0.0011683801,0.0012929703,0.0027383324,0.0023249767,0.0007665535,0.00064102036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039621833,0.00006934162,0.0129150385,0.00021777287,0.000096508484,0.0007992106,0.0014765699,0.018411372,0.017214764,0.91770285,0.004971149,0.025729174],"study_design_scores_gemma":[0.00008205475,0.00025626796,0.013681121,0.00009400718,0.00012218348,0.0038856855,0.001980173,0.09371877,0.031394787,0.8178188,0.036797166,0.0001689177],"about_ca_topic_score_codex":0.0015198339,"about_ca_topic_score_gemma":0.0013475182,"teacher_disagreement_score":0.006350354,"about_ca_system_score_codex":0.0010541094,"about_ca_system_score_gemma":0.00047329883,"threshold_uncertainty_score":0.021244109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57208884,0.0019426064,0.31489593,0.0019570144,0.00091443275,0.00028094868,0.007858895,0.0028894334,0.09717191],"genre_scores_gemma":[0.8559269,0.00054622546,0.115061544,0.0003135795,0.00033467737,0.00024747793,0.006305715,0.000736784,0.020527216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937476,0.0010511897,0.0006152833,0.0014158705,0.0023493662,0.0008207147],"domain_scores_gemma":[0.9860977,0.0052974024,0.001150008,0.0025993977,0.003559501,0.0012959455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024438761,0.0009761736,0.001164041,0.0055892733,0.0030169496,0.0038495245,0.001761038,0.00084336253,0.010394826],"category_scores_gemma":[0.01810371,0.00063379493,0.001433752,0.0037821252,0.0035886834,0.007115918,0.0034758928,0.0022101672,0.00172736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009706379,0.00016246826,0.028890727,0.000595414,0.00011705478,0.0007472257,0.0013436961,0.0050987457,0.0071284394,0.8292563,0.011865418,0.11382396],"study_design_scores_gemma":[0.00008999586,0.00028031153,0.006507241,0.00021720599,0.00013773942,0.0029308817,0.0012314261,0.038919,0.025306886,0.8363775,0.08775667,0.000245161],"about_ca_topic_score_codex":0.0017966537,"about_ca_topic_score_gemma":0.0017268545,"teacher_disagreement_score":0.010394826,"about_ca_system_score_codex":0.0021915887,"about_ca_system_score_gemma":0.0016781746,"threshold_uncertainty_score":0.034774125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6693559,0.0055583864,0.22175513,0.003822508,0.0005172763,0.0001569099,0.0003502033,0.0004622058,0.09802138],"genre_scores_gemma":[0.9518982,0.0013327879,0.03155572,0.0003316722,0.0003809826,0.000078919635,0.00026821072,0.00010099637,0.014052386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994351,0.00011705535,0.000031580676,0.00015316639,0.00011970673,0.00014331093],"domain_scores_gemma":[0.9986534,0.0007065669,0.00016872802,0.00015224623,0.00012437486,0.00019469655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389487,0.00036725926,0.00034961503,0.0013878847,0.0016711139,0.0017121335,0.0006832975,0.0005722067,0.0059950193],"category_scores_gemma":[0.002105506,0.0003527275,0.0011002913,0.0010848229,0.0034570324,0.0037556903,0.0011304655,0.0012953188,0.0004466269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017062179,0.000021535441,0.00046332818,0.000052695937,0.0000045629695,0.0000818883,0.00047670442,0.0019939407,0.001110451,0.9863196,0.0006203959,0.008837829],"study_design_scores_gemma":[0.0000136820245,0.0000558994,0.00044680215,0.000029833831,0.000007001643,0.00019855742,0.00031619944,0.006026077,0.0024880182,0.98057884,0.009818953,0.000020098085],"about_ca_topic_score_codex":0.001367663,"about_ca_topic_score_gemma":0.0011984097,"teacher_disagreement_score":0.0059950193,"about_ca_system_score_codex":0.0015812379,"about_ca_system_score_gemma":0.0006644346,"threshold_uncertainty_score":0.020055294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4425457,0.0022301306,0.31722552,0.0023629945,0.00068774045,0.0001728717,0.0006385192,0.0008763252,0.23326021],"genre_scores_gemma":[0.9521126,0.00053266465,0.033856228,0.00019464015,0.0004189259,0.00012930747,0.0003854824,0.00011874683,0.01225144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964651,0.00079284917,0.0002594952,0.0005575888,0.0014370205,0.00048796594],"domain_scores_gemma":[0.9963153,0.0014413904,0.00033100785,0.0005679705,0.0006555655,0.00068870914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018589293,0.00038563157,0.0006995801,0.0014384818,0.0027472249,0.006299551,0.00079046644,0.0005133178,0.0036991283],"category_scores_gemma":[0.0050998665,0.00067221094,0.0009380803,0.0012915068,0.0059955963,0.0067530833,0.0034521339,0.0024396006,0.0006768268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005200697,0.00002599311,0.00030178356,0.000021504578,0.0000060371353,0.00012930192,0.00045880256,0.0003524671,0.0018097715,0.9916647,0.0004853592,0.0046921247],"study_design_scores_gemma":[0.0000444978,0.000019366038,0.00030015156,0.000012681157,0.000008016829,0.000169819,0.00024656637,0.0023586357,0.002312988,0.9860443,0.00846815,0.000014720519],"about_ca_topic_score_codex":0.0022614035,"about_ca_topic_score_gemma":0.0015331031,"teacher_disagreement_score":0.006299551,"about_ca_system_score_codex":0.0018735933,"about_ca_system_score_gemma":0.0011906135,"threshold_uncertainty_score":0.013593972},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59436744,0.0039490224,0.19423193,0.0025450708,0.000361037,0.00009297039,0.0011003916,0.0002629065,0.20308924],"genre_scores_gemma":[0.9697496,0.0005264001,0.017879225,0.00027484525,0.00013506798,0.000082476225,0.0003604132,0.000035729056,0.010956152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988624,0.0002666962,0.00007415675,0.0002243104,0.00038652308,0.00018587474],"domain_scores_gemma":[0.99854445,0.0005436174,0.0001975152,0.000118998774,0.00033891707,0.00025657204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007476449,0.00043226645,0.0005214772,0.0026646242,0.0018288107,0.003124997,0.0005868798,0.00040491958,0.005226218],"category_scores_gemma":[0.0020832354,0.0004103383,0.0004463473,0.001133847,0.0034283607,0.0035591119,0.0022616896,0.0014526955,0.00060471805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038399176,0.000012219716,0.00027462983,0.000025914967,0.000007807272,0.000052515235,0.00030227582,0.00041557552,0.00085395726,0.9940935,0.00065349665,0.0032697464],"study_design_scores_gemma":[0.00001787526,0.000022913906,0.0013795434,0.000032636064,0.000007765476,0.00015836957,0.00052467786,0.0061970116,0.0012683608,0.9815591,0.008811187,0.000020642634],"about_ca_topic_score_codex":0.0028480932,"about_ca_topic_score_gemma":0.002230892,"teacher_disagreement_score":0.005226218,"about_ca_system_score_codex":0.0021688628,"about_ca_system_score_gemma":0.0005113754,"threshold_uncertainty_score":0.017483473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43142483,0.0008878569,0.45626426,0.0017749579,0.00017056632,0.000089107896,0.00029937807,0.00017236728,0.108916715],"genre_scores_gemma":[0.91775113,0.0005435916,0.062357116,0.00020313152,0.00020967938,0.00014417748,0.00025333394,0.000055897093,0.018481947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.00040441228,0.000060394494,0.00033644697,0.0002256675,0.00012213644],"domain_scores_gemma":[0.9980751,0.0007269676,0.00018811281,0.0003212051,0.00034637604,0.00034222734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016898917,0.00035824825,0.00038689128,0.0009617909,0.0010527229,0.001839432,0.00063653995,0.0004730278,0.0026060506],"category_scores_gemma":[0.003712265,0.00016808251,0.00065572356,0.00054156984,0.0059194104,0.0037530595,0.0022961274,0.0013724791,0.0003557715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017165166,0.000009268421,0.0002412455,0.000009581584,0.0000017200817,0.000028311646,0.00015830941,0.0012102795,0.00056078343,0.99394953,0.0001661792,0.0036475705],"study_design_scores_gemma":[0.000014106333,0.000058262565,0.0006002537,0.00001684354,0.0000037163445,0.000106219784,0.00017576262,0.02262881,0.00087881275,0.96976537,0.005736405,0.000015497975],"about_ca_topic_score_codex":0.0012389666,"about_ca_topic_score_gemma":0.00080079446,"teacher_disagreement_score":0.0026060506,"about_ca_system_score_codex":0.0013071646,"about_ca_system_score_gemma":0.0007267839,"threshold_uncertainty_score":0.009484172},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046047318,0.011340665,0.0014185697,0.9437019,0.031599022,0.000005148607,0.00002601496,0.00002903668,0.0114191575],"genre_scores_gemma":[0.06364924,0.054291807,0.0033216565,0.68717784,0.13172136,0.000055134245,0.00006965648,0.0003070142,0.059406336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947443,0.0019887378,0.00023999535,0.0007631861,0.0018935878,0.00037029435],"domain_scores_gemma":[0.98574936,0.008505711,0.00042738623,0.00044588593,0.0038325582,0.0010390098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005491235,0.00065235194,0.00061165675,0.0010713403,0.003655099,0.004451259,0.0014675816,0.0045493087,0.0032430307],"category_scores_gemma":[0.016340956,0.00041482277,0.00051232893,0.0012501266,0.008013021,0.007973705,0.0019578226,0.022018932,0.0016471408],"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.000018514767,0.000008293925,0.00007995866,0.00007525827,0.0000058585683,0.00018203464,0.0005357678,0.00012150557,0.00007781001,0.11338562,0.879986,0.0055234893],"study_design_scores_gemma":[0.0000064430487,0.000012914892,0.00019734586,0.0002083116,0.000005409698,0.00032303864,0.00039971687,0.00031319895,0.00021996215,0.05683056,0.9414564,0.000026651602],"about_ca_topic_score_codex":0.008791059,"about_ca_topic_score_gemma":0.007935527,"teacher_disagreement_score":0.008791059,"about_ca_system_score_codex":0.0051701367,"about_ca_system_score_gemma":0.0038633547,"threshold_uncertainty_score":0.037512124},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032662426,0.001143574,0.004589778,0.038001552,0.93633807,0.000025551322,0.0023993407,0.0009034844,0.016272051],"genre_scores_gemma":[0.038299657,0.0073986026,0.01871709,0.03281624,0.22901112,0.00018072818,0.005426288,0.0055682934,0.6625819],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99528813,0.00073008845,0.00066381897,0.0007705478,0.0021789877,0.00036846823],"domain_scores_gemma":[0.9461478,0.008647235,0.0015497985,0.0044543925,0.037829433,0.0013712952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036572216,0.0016033088,0.0013438769,0.0043445146,0.0033515352,0.0065093585,0.0028086957,0.0033118606,0.12962516],"category_scores_gemma":[0.06134004,0.0009875242,0.0012789695,0.005110579,0.0027179527,0.005201306,0.0022147906,0.0089842575,0.05664909],"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.000026804895,0.000004221937,0.00006605449,0.00009773036,0.0000075137946,0.00006877449,0.00005130987,0.000091282556,0.000056886736,0.012208219,0.9801301,0.00719113],"study_design_scores_gemma":[0.00001863606,0.000010754048,0.00038038177,0.00015726822,0.000017959559,0.00019348622,0.00008272166,0.00045399158,0.00045977347,0.008404943,0.98978454,0.00003546361],"about_ca_topic_score_codex":0.01387835,"about_ca_topic_score_gemma":0.016472409,"teacher_disagreement_score":0.12962516,"about_ca_system_score_codex":0.0046137352,"about_ca_system_score_gemma":0.0066369744,"threshold_uncertainty_score":0.43363935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4252819,0.0015446282,0.50563455,0.00062469894,0.00029991224,0.00017023551,0.00077210605,0.00091327645,0.06475869],"genre_scores_gemma":[0.8953801,0.00045871068,0.08737987,0.0003785536,0.0002942172,0.00015559347,0.0010134669,0.00023533293,0.014704218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837023,0.00022139332,0.00013346474,0.0005070161,0.00044711208,0.000320883],"domain_scores_gemma":[0.99757594,0.0006338293,0.00050430495,0.00047165775,0.00057313713,0.00024106169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328976,0.00067100086,0.0005374293,0.0015629476,0.001914284,0.0018151478,0.0010875149,0.0012563469,0.007745071],"category_scores_gemma":[0.0029923453,0.00043839167,0.00068956456,0.0015229558,0.0020177192,0.0045229816,0.001264378,0.001284335,0.0013369323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010877769,0.000037186965,0.00086308806,0.000110578825,0.000013672885,0.00042198572,0.0005195961,0.0042593046,0.012294964,0.9563169,0.001689452,0.023364518],"study_design_scores_gemma":[0.000018954628,0.00014156997,0.000822042,0.000047962134,0.000022396674,0.0014309805,0.0005168335,0.020528926,0.010580173,0.94059306,0.025210334,0.00008671793],"about_ca_topic_score_codex":0.00073272607,"about_ca_topic_score_gemma":0.0006371967,"teacher_disagreement_score":0.007745071,"about_ca_system_score_codex":0.0010270273,"about_ca_system_score_gemma":0.00055132323,"threshold_uncertainty_score":0.025909781},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031204013,0.14920415,0.34906155,0.049447373,0.017096953,0.00010988253,0.0043242197,0.0038158447,0.39573607],"genre_scores_gemma":[0.43850803,0.06482296,0.111598946,0.006370018,0.0077521116,0.00041579426,0.0017132706,0.0015279247,0.36729097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965644,0.000055943805,0.000029004945,0.00008713928,0.0001155495,0.000055910576],"domain_scores_gemma":[0.9991295,0.00032670022,0.00006969461,0.00016006762,0.0002210031,0.00009300039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006147399,0.00067251694,0.0006802149,0.0034887218,0.0023956378,0.0016081922,0.0016527215,0.0021050912,0.031024376],"category_scores_gemma":[0.0023156924,0.00074958144,0.0007293236,0.0023261928,0.0032492557,0.008567504,0.002161857,0.0032712577,0.008215359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008699629,0.00003001956,0.00018121868,0.0001418184,0.000017706778,0.00021128479,0.00033958064,0.00041390446,0.0015040194,0.7894204,0.14475891,0.06289408],"study_design_scores_gemma":[0.00002041826,0.00002396964,0.0004861659,0.000071518174,0.000020542873,0.0003735595,0.00016338433,0.0006419688,0.0018586954,0.831383,0.16492003,0.000036812326],"about_ca_topic_score_codex":0.0032325059,"about_ca_topic_score_gemma":0.004086985,"teacher_disagreement_score":0.031024376,"about_ca_system_score_codex":0.0013448815,"about_ca_system_score_gemma":0.0004390378,"threshold_uncertainty_score":0.103786826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4157801,0.0007976945,0.3232927,0.0014011916,0.0004539759,0.000118028176,0.0004797221,0.0004601076,0.25721645],"genre_scores_gemma":[0.95509535,0.00068619516,0.02036736,0.00030225274,0.0002879048,0.00008717497,0.00040683313,0.00015005078,0.022616914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899775,0.00014604135,0.000049417853,0.00022819267,0.000376505,0.00020203856],"domain_scores_gemma":[0.9969709,0.0011368115,0.0003864149,0.00041346444,0.000543118,0.0005492666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552965,0.00057306985,0.0004002139,0.00402202,0.0020308595,0.0032398521,0.0009644961,0.00085550355,0.014008736],"category_scores_gemma":[0.003606801,0.00044993628,0.0006930306,0.0019541327,0.0030432309,0.0069148024,0.0038260592,0.003068197,0.0013810443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001063357,0.000013353344,0.00042326818,0.000016646136,0.0000043938003,0.00008440878,0.00022234042,0.0004885315,0.0008028563,0.9925452,0.00066073285,0.004727628],"study_design_scores_gemma":[0.0000068086115,0.000013277074,0.0006667574,0.000015663323,0.000011562117,0.00032099462,0.00024025113,0.0054076617,0.0015681081,0.98386985,0.007862993,0.000016026437],"about_ca_topic_score_codex":0.0013937717,"about_ca_topic_score_gemma":0.000917866,"teacher_disagreement_score":0.014008736,"about_ca_system_score_codex":0.001012291,"about_ca_system_score_gemma":0.0005011439,"threshold_uncertainty_score":0.046863854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14797127,0.006461626,0.6452243,0.0043192236,0.0012527413,0.0001000675,0.00033050333,0.00028864422,0.19405167],"genre_scores_gemma":[0.8310622,0.0022176825,0.13633002,0.0018368039,0.00084626884,0.00020196012,0.0002976792,0.00010653335,0.027100934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.0005028289,0.0000859557,0.00023351659,0.000359781,0.00012961036],"domain_scores_gemma":[0.9993266,0.00021127654,0.000070131246,0.00007743523,0.00021474021,0.00009975962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018612738,0.00043331226,0.00061106915,0.0011411607,0.0019142048,0.003163581,0.00058346696,0.00092964625,0.0027173157],"category_scores_gemma":[0.0018671572,0.00034649385,0.0011383427,0.0010837241,0.003058987,0.006005121,0.0019482602,0.0028255724,0.0007191289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008300794,0.000006414338,0.000042292264,0.0000104639375,0.0000029128662,0.000032398475,0.0000977438,0.000114829265,0.00035328337,0.9974316,0.00027935609,0.0016204005],"study_design_scores_gemma":[0.000006058937,0.000016854587,0.00004875827,0.000007828981,0.0000034602417,0.00009699173,0.000045319077,0.0015277528,0.000736896,0.990366,0.0071350383,0.00000897842],"about_ca_topic_score_codex":0.00034714554,"about_ca_topic_score_gemma":0.0003048498,"teacher_disagreement_score":0.003163581,"about_ca_system_score_codex":0.0010684116,"about_ca_system_score_gemma":0.00066198694,"threshold_uncertainty_score":0.009843469},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56768423,0.0021342777,0.33750924,0.0022490039,0.00018633323,0.00009556443,0.00022354542,0.00045052305,0.08946726],"genre_scores_gemma":[0.9845516,0.00030621412,0.010907635,0.00011971521,0.00011724866,0.00003506103,0.0001038304,0.000040497802,0.0038182558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838257,0.00029307787,0.00012371979,0.0004155351,0.00044563384,0.00033943204],"domain_scores_gemma":[0.9925161,0.0037749987,0.0006958747,0.0010420019,0.0010210952,0.0009500243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023314608,0.00045509398,0.00066468894,0.0020379566,0.0027701303,0.0034853993,0.0009478602,0.0010827886,0.0037852202],"category_scores_gemma":[0.006235512,0.0003874654,0.0012881162,0.0011519837,0.009168765,0.00789592,0.0036598204,0.0025127265,0.00036307314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037651655,0.000024946245,0.0010020921,0.000052871976,0.000007909591,0.00024716055,0.00093573186,0.00070134393,0.002593559,0.9911929,0.00020932422,0.002994516],"study_design_scores_gemma":[0.000013909283,0.000049186343,0.0008539956,0.000037293277,0.000019341462,0.00036597165,0.00051257457,0.0051028365,0.0044167475,0.9842324,0.0043782135,0.0000175147],"about_ca_topic_score_codex":0.0012949673,"about_ca_topic_score_gemma":0.001211566,"teacher_disagreement_score":0.0037852202,"about_ca_system_score_codex":0.0016491832,"about_ca_system_score_gemma":0.0008964024,"threshold_uncertainty_score":0.012662828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32564443,0.0011998714,0.6099695,0.0008806201,0.00045936176,0.00012077613,0.0004020208,0.00028611833,0.061037254],"genre_scores_gemma":[0.8950522,0.00051290425,0.092705764,0.00026620238,0.00029092038,0.000111417474,0.0002499338,0.000098552104,0.010712114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976138,0.00060614105,0.00018113406,0.00044023618,0.0008727781,0.00028597444],"domain_scores_gemma":[0.99617684,0.0012478873,0.0005104733,0.00033475776,0.0011484477,0.00058153697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022813852,0.000532567,0.00063384237,0.00181464,0.0023231767,0.0032969287,0.0008152385,0.00074565405,0.0043728887],"category_scores_gemma":[0.0046163066,0.0005295633,0.00096400693,0.0012902846,0.004439374,0.008519283,0.0030102315,0.001933187,0.0006304711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003395935,0.000011944431,0.00031322747,0.000040236908,0.0000089903715,0.00011415454,0.00020782893,0.0005158607,0.0015804466,0.9930281,0.00022042824,0.0039249198],"study_design_scores_gemma":[0.000017288403,0.000088605004,0.00046711758,0.00003522017,0.000020999423,0.00058268214,0.00038886318,0.008693683,0.003935485,0.9763941,0.0093378,0.00003825773],"about_ca_topic_score_codex":0.0006076171,"about_ca_topic_score_gemma":0.0006419555,"teacher_disagreement_score":0.0043728887,"about_ca_system_score_codex":0.0010711163,"about_ca_system_score_gemma":0.000892261,"threshold_uncertainty_score":0.014628768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48471037,0.001373184,0.3492423,0.0011766952,0.00056675693,0.00015588551,0.0006060676,0.0007460587,0.16142276],"genre_scores_gemma":[0.9501195,0.0003992076,0.032618724,0.0002678423,0.00021763303,0.00007645833,0.00035078247,0.0000800489,0.015869891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985423,0.00019095487,0.00008488429,0.00025232573,0.00068874966,0.00024083954],"domain_scores_gemma":[0.99841046,0.00031827303,0.0001576263,0.00015980986,0.00058627524,0.00036759215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095577334,0.0004397576,0.00033343481,0.0016353686,0.0014763451,0.0022574682,0.00082008133,0.00049828715,0.0043257703],"category_scores_gemma":[0.0018357551,0.00022278419,0.0005813878,0.0008538528,0.0029635346,0.003556179,0.0027432134,0.0014341903,0.0006942807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014662036,0.000014396145,0.0002164363,0.000023125736,0.0000038109117,0.00009207784,0.00024911333,0.0002787078,0.0012857249,0.9944641,0.0003410539,0.003016877],"study_design_scores_gemma":[0.000010886393,0.000050338218,0.000532463,0.000021016156,0.000014085661,0.00034915502,0.00028354555,0.009151496,0.0051998473,0.96753657,0.016827065,0.000023582857],"about_ca_topic_score_codex":0.0012706897,"about_ca_topic_score_gemma":0.00061665644,"teacher_disagreement_score":0.0043257703,"about_ca_system_score_codex":0.0009611071,"about_ca_system_score_gemma":0.0007594429,"threshold_uncertainty_score":0.014471173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92057276,0.0006358199,0.056950796,0.00020751478,0.00002320015,0.000046743826,0.00051732006,0.00015268878,0.020893233],"genre_scores_gemma":[0.9842771,0.00022144035,0.011157883,0.00005267977,0.00007757246,0.00005068687,0.0005351239,0.00002901808,0.003598384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995653,0.0000565008,0.000021764457,0.00011754023,0.00015962862,0.00007917488],"domain_scores_gemma":[0.9988871,0.00026217516,0.00021605793,0.00014268197,0.0001485725,0.00034340948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003351555,0.00044826177,0.00041898515,0.001728236,0.00075263204,0.0020293545,0.00074551516,0.00058448466,0.003228167],"category_scores_gemma":[0.0014258056,0.00040759996,0.0003849486,0.001375515,0.0013624135,0.0020319142,0.0013186435,0.00092893786,0.00038153806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042603276,0.00014066818,0.013152764,0.0002901932,0.00007326227,0.0009913344,0.002086829,0.008676732,0.06495131,0.8607343,0.0022236288,0.046252985],"study_design_scores_gemma":[0.00007309122,0.00052115996,0.023424959,0.00009857416,0.00012117431,0.003720333,0.0015939474,0.07536603,0.030462492,0.8328627,0.03165894,0.00009659154],"about_ca_topic_score_codex":0.00085141836,"about_ca_topic_score_gemma":0.0007649803,"teacher_disagreement_score":0.003228167,"about_ca_system_score_codex":0.0008357586,"about_ca_system_score_gemma":0.00026043958,"threshold_uncertainty_score":0.010799289},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029523714,0.00719696,0.86509275,0.0047575217,0.0014632203,0.0007435971,0.002246298,0.008763921,0.080212034],"genre_scores_gemma":[0.52763444,0.0062776976,0.42061043,0.002787577,0.0034243735,0.0018897159,0.00354555,0.003984149,0.02984609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96783227,0.0051038587,0.0019343457,0.005881313,0.01198759,0.0072606695],"domain_scores_gemma":[0.8738468,0.09200004,0.0028184925,0.020099662,0.007109922,0.0041250167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01636243,0.004832388,0.0060932375,0.008228685,0.0058076615,0.014973837,0.014564704,0.0046590576,0.026602626],"category_scores_gemma":[0.066939086,0.004214649,0.008205858,0.00719469,0.007863269,0.029779669,0.021941826,0.022530833,0.007671169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023874629,0.00093374815,0.0028453916,0.0020514573,0.00041824885,0.00038028497,0.0009380551,0.16976656,0.010216157,0.59736556,0.028338237,0.18435888],"study_design_scores_gemma":[0.00012673085,0.00016886306,0.0005249132,0.0003201498,0.00048068038,0.00022003027,0.00016785572,0.37977442,0.008940918,0.59801686,0.011111344,0.00014722852],"about_ca_topic_score_codex":0.005006064,"about_ca_topic_score_gemma":0.0102967,"teacher_disagreement_score":0.026602626,"about_ca_system_score_codex":0.012846883,"about_ca_system_score_gemma":0.011816333,"threshold_uncertainty_score":0.093211114},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012160287,0.03226236,0.28233123,0.29906732,0.022024041,0.00007640537,0.0008746191,0.0005564122,0.35064736],"genre_scores_gemma":[0.5033663,0.039083384,0.20665497,0.073351525,0.029566593,0.0004186983,0.0008170865,0.0011263444,0.14561518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972525,0.0011449578,0.00014607012,0.0004708771,0.00080649776,0.00017902278],"domain_scores_gemma":[0.99561864,0.0025230465,0.00016806743,0.00074733654,0.0007149316,0.0002279054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004928882,0.0009363145,0.001261473,0.0021440845,0.0028172415,0.00420857,0.0023330082,0.0034869434,0.013906832],"category_scores_gemma":[0.015009721,0.00048618935,0.0010568777,0.0039004565,0.008438099,0.011888655,0.0031768312,0.011187311,0.0028713385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011691807,0.000008676665,0.00003365592,0.000029049042,0.000006246201,0.000012059449,0.000046357327,0.0003288771,0.000040761006,0.96823144,0.02267276,0.008578529],"study_design_scores_gemma":[0.00000456626,0.0000024138853,0.000021128835,0.000021810516,0.0000014291596,0.000011041431,0.0000118089,0.00038125325,0.000038063656,0.9837661,0.015736328,0.000004027063],"about_ca_topic_score_codex":0.0023776554,"about_ca_topic_score_gemma":0.0022278503,"teacher_disagreement_score":0.013906832,"about_ca_system_score_codex":0.0035517868,"about_ca_system_score_gemma":0.0031310918,"threshold_uncertainty_score":0.046522975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21500015,0.0011284429,0.6705376,0.0014500967,0.00037199204,0.00010148256,0.0007943083,0.00047468822,0.11014126],"genre_scores_gemma":[0.88757986,0.000749823,0.07464473,0.0003044488,0.0003482898,0.0002606342,0.0010500314,0.00016807407,0.03489406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980835,0.00048514295,0.00011525222,0.0004132082,0.0007417652,0.00016121747],"domain_scores_gemma":[0.99747425,0.00078560284,0.00025179732,0.0004030692,0.0006467291,0.00043848614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013944256,0.00053695,0.00045045317,0.0017764474,0.0013005307,0.0030322224,0.0010557319,0.00069707516,0.00800098],"category_scores_gemma":[0.0031610136,0.00032335418,0.0008092719,0.0009368454,0.0028928292,0.0064954963,0.0032776385,0.0016139846,0.0011683083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014068996,0.0000084970425,0.00015370766,0.000028437938,0.0000074603245,0.00008450048,0.0002643277,0.0008839425,0.001352105,0.99282986,0.00040674853,0.003966343],"study_design_scores_gemma":[0.000014907249,0.00006120015,0.00024384064,0.000020644586,0.000010286027,0.00026082483,0.00026775163,0.009348866,0.0033057083,0.9696492,0.016799921,0.000016969323],"about_ca_topic_score_codex":0.0003394584,"about_ca_topic_score_gemma":0.00030028322,"teacher_disagreement_score":0.00800098,"about_ca_system_score_codex":0.00081501214,"about_ca_system_score_gemma":0.00040594937,"threshold_uncertainty_score":0.026765883},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6969408,0.0013193894,0.19921707,0.001696215,0.00024959,0.000100420235,0.0007560524,0.00032624838,0.09939428],"genre_scores_gemma":[0.9681024,0.00018897557,0.025650267,0.00019750565,0.000091109294,0.00008590482,0.00032947413,0.00006759087,0.0052869017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983713,0.00026221274,0.00014750211,0.00039942976,0.0005654582,0.00025415502],"domain_scores_gemma":[0.9962954,0.0015959432,0.0004047645,0.00062745105,0.0005744519,0.00050193205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334635,0.0003585299,0.0009469548,0.0017788666,0.0027285381,0.0054559535,0.0011617435,0.0010902331,0.0042797504],"category_scores_gemma":[0.0055171354,0.0004427968,0.0009552808,0.0010127699,0.008324823,0.0053751217,0.0031379873,0.0028329324,0.00062723196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032278997,0.0000152467055,0.0004926623,0.000030461624,0.000005064519,0.00013358376,0.0007236085,0.0005705308,0.0015015051,0.99318486,0.00032159546,0.0029886607],"study_design_scores_gemma":[0.000032801305,0.000035092908,0.00046300358,0.000041786963,0.000008489262,0.00038434015,0.00065577286,0.0058825775,0.0020966476,0.9836215,0.006735278,0.000042773423],"about_ca_topic_score_codex":0.0019304171,"about_ca_topic_score_gemma":0.0014299402,"teacher_disagreement_score":0.0054559535,"about_ca_system_score_codex":0.0017533136,"about_ca_system_score_gemma":0.0008201169,"threshold_uncertainty_score":0.0143172145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6684822,0.0017940651,0.09826075,0.004029097,0.00054668746,0.00006403073,0.00034624655,0.0004277312,0.22604924],"genre_scores_gemma":[0.95689994,0.0006520951,0.020976804,0.00048277713,0.00032837436,0.00009267252,0.00026426997,0.00009777178,0.0202052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996165,0.00011386184,0.00002119107,0.000062763655,0.00012375992,0.00006187716],"domain_scores_gemma":[0.9993728,0.00021183105,0.00006830237,0.0001368395,0.00012421698,0.00008604768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044832757,0.0003824184,0.0005240898,0.0017255069,0.00166481,0.0022263222,0.0012309045,0.0010250697,0.00691498],"category_scores_gemma":[0.0016060332,0.00027408285,0.00045210545,0.0006975197,0.0027652988,0.00392304,0.0016588824,0.0014951697,0.0008070051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008102328,0.0000063850844,0.000049949835,0.000010319435,0.0000010619077,0.000009316247,0.000058444683,0.00033796605,0.000424881,0.9972811,0.00042725133,0.0013851289],"study_design_scores_gemma":[0.000003198099,0.0000054368093,0.00012226717,0.0000053895633,0.0000010808834,0.00003550459,0.000046265708,0.0035804273,0.0003557497,0.9941788,0.0016601357,0.0000056384833],"about_ca_topic_score_codex":0.0005456172,"about_ca_topic_score_gemma":0.00053259445,"teacher_disagreement_score":0.00691498,"about_ca_system_score_codex":0.0009611835,"about_ca_system_score_gemma":0.00046876178,"threshold_uncertainty_score":0.02313286},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59882224,0.0014265411,0.30255497,0.0027373557,0.00025022958,0.00009444345,0.00054024154,0.00064834923,0.09292574],"genre_scores_gemma":[0.97729295,0.00023692554,0.016210739,0.00021553542,0.00018039909,0.0000823899,0.0002334493,0.000073058734,0.0054745087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986683,0.00028807056,0.00011069735,0.00026619696,0.00046566827,0.00020100022],"domain_scores_gemma":[0.99836606,0.00055095606,0.00021993887,0.00020388293,0.0005410034,0.00011810702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011112494,0.00033488846,0.00045069584,0.0016960858,0.0015137756,0.0020416607,0.000785995,0.00065036915,0.0026704688],"category_scores_gemma":[0.002199078,0.00029745948,0.0007808603,0.0008844386,0.004636577,0.004552862,0.002934148,0.0019283786,0.00031098444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015472011,0.000006798819,0.000652931,0.000029521994,0.0000046209243,0.00008908785,0.0007009778,0.0003094789,0.002754294,0.99220204,0.00035745386,0.0028774373],"study_design_scores_gemma":[0.0000140306465,0.000057772828,0.0021683848,0.000048533744,0.000030838306,0.00051270996,0.0010538461,0.0055683795,0.0074517555,0.95633507,0.026719531,0.000039194118],"about_ca_topic_score_codex":0.0005697118,"about_ca_topic_score_gemma":0.00037902995,"teacher_disagreement_score":0.0026704688,"about_ca_system_score_codex":0.0011789679,"about_ca_system_score_gemma":0.0006850411,"threshold_uncertainty_score":0.008933604},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9148607,0.00060318003,0.049760584,0.00093764206,0.00006552745,0.00003898375,0.0002685954,0.00013763893,0.03332704],"genre_scores_gemma":[0.9944423,0.000107476335,0.003611106,0.000027517179,0.00005683554,0.000016133561,0.00012864766,0.000009902198,0.0016000913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987784,0.00024766722,0.00006433842,0.00018915326,0.00052388984,0.00019658473],"domain_scores_gemma":[0.9973091,0.0009883848,0.00048180233,0.00025456466,0.00044648736,0.0005195779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010918461,0.0002777557,0.00036538776,0.0026706504,0.0015319102,0.0033775673,0.0006545001,0.0004136348,0.0038093587],"category_scores_gemma":[0.002419447,0.00020045163,0.0004622959,0.0015486055,0.004602421,0.00458771,0.0023141592,0.0010935882,0.00028308443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042958196,0.00002645861,0.0025098815,0.000044728113,0.0000090965705,0.00018003712,0.0009928247,0.0008709619,0.0034384832,0.9886811,0.00020753553,0.00299596],"study_design_scores_gemma":[0.000029773804,0.000099289755,0.004572722,0.000019524368,0.000022219008,0.0007930922,0.0012792001,0.00692273,0.004705948,0.9730232,0.008500449,0.000031963136],"about_ca_topic_score_codex":0.000962733,"about_ca_topic_score_gemma":0.0005891024,"teacher_disagreement_score":0.0038093587,"about_ca_system_score_codex":0.0010924928,"about_ca_system_score_gemma":0.00044340504,"threshold_uncertainty_score":0.012743592},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26816446,0.0091886455,0.39866644,0.002368277,0.0011920648,0.0004594956,0.0021667222,0.00094749645,0.31684646],"genre_scores_gemma":[0.9130017,0.0014910185,0.056857824,0.00082333613,0.00044344168,0.00029010535,0.0011401722,0.0000972856,0.025855184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875665,0.00030808608,0.000084993415,0.00022774348,0.00043048107,0.00019203564],"domain_scores_gemma":[0.9991068,0.0002635081,0.00013057578,0.00014349508,0.00023527905,0.00012035952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010692624,0.00032495405,0.00037237103,0.0018424244,0.0009027902,0.0035670905,0.00064385496,0.0005617659,0.004459459],"category_scores_gemma":[0.0022214118,0.00023056079,0.00053960073,0.0012022422,0.0048897057,0.005404644,0.0023636974,0.0011008474,0.00056588725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005669906,0.0000033007486,0.00016558047,0.000024075725,0.000004459894,0.000040090887,0.00020837801,0.00012873892,0.00032489776,0.9958977,0.0004143726,0.002782619],"study_design_scores_gemma":[0.000010613682,0.000014543656,0.0007583,0.000025287227,0.000010518479,0.00023342819,0.00031070778,0.0008209357,0.00055976864,0.96207833,0.035164807,0.000012829873],"about_ca_topic_score_codex":0.00065045967,"about_ca_topic_score_gemma":0.0006452654,"teacher_disagreement_score":0.004459459,"about_ca_system_score_codex":0.0006993585,"about_ca_system_score_gemma":0.00050221436,"threshold_uncertainty_score":0.014918387},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22903305,0.0032598414,0.46552703,0.010137,0.00086436357,0.00012038905,0.00043062272,0.0004534125,0.2901743],"genre_scores_gemma":[0.95018053,0.0007989011,0.035335418,0.00048793713,0.0010392453,0.00011013994,0.00021461546,0.00008983541,0.011743449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958912,0.001074366,0.00020678542,0.0007919816,0.0015099881,0.0005255903],"domain_scores_gemma":[0.9935579,0.0031740542,0.00055891863,0.001028592,0.0010008286,0.00067969185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033259874,0.00039208235,0.0006982267,0.0017256933,0.0033854835,0.0063865716,0.0015104063,0.001539613,0.0066230902],"category_scores_gemma":[0.008230565,0.00046047286,0.0006909424,0.0020128924,0.0135249775,0.010332555,0.0053892173,0.004052305,0.00094032363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006000044,0.000009660626,0.00020387041,0.000009411959,9.896698e-7,0.00003036326,0.00021108687,0.00011293765,0.00020452414,0.9978955,0.00017100075,0.0011446235],"study_design_scores_gemma":[0.000011263143,0.000014352189,0.0002777021,0.000009180513,0.0000036912588,0.000089830966,0.00016063843,0.0014860184,0.00044688737,0.99133974,0.006153759,0.0000069155094],"about_ca_topic_score_codex":0.0015036302,"about_ca_topic_score_gemma":0.0010289772,"teacher_disagreement_score":0.0066230902,"about_ca_system_score_codex":0.0022589907,"about_ca_system_score_gemma":0.0010933148,"threshold_uncertainty_score":0.022156417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72227603,0.0012340068,0.19958808,0.0009977055,0.0003000961,0.0001388664,0.00026025786,0.00072250015,0.07448249],"genre_scores_gemma":[0.9662878,0.00039125356,0.020510156,0.00024381733,0.00015628837,0.00015069504,0.00032090838,0.00008911193,0.011850031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731845,0.0007534514,0.00018916787,0.0005424107,0.000684686,0.0005118031],"domain_scores_gemma":[0.9959447,0.0016863513,0.00038702312,0.00047721295,0.0008029552,0.0007017212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023378013,0.0005494501,0.0006179143,0.0047503547,0.001709516,0.0039105345,0.0012437897,0.0008535262,0.004422412],"category_scores_gemma":[0.005758758,0.0005288074,0.00079225027,0.0012276828,0.0049173674,0.005781381,0.00598175,0.002188663,0.000496978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000315814,0.000031286007,0.00082870293,0.000034695175,0.000008785768,0.00012563489,0.00095628726,0.00021999159,0.001414348,0.9911678,0.0002086015,0.004972313],"study_design_scores_gemma":[0.000022975755,0.000072018585,0.0015615969,0.000025435846,0.00002731456,0.00033393537,0.0006291753,0.0038609167,0.004839477,0.9794837,0.009115839,0.000027549013],"about_ca_topic_score_codex":0.00081569277,"about_ca_topic_score_gemma":0.00047837044,"teacher_disagreement_score":0.0047503547,"about_ca_system_score_codex":0.0016360725,"about_ca_system_score_gemma":0.00061094103,"threshold_uncertainty_score":0.014794469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16957311,0.020262124,0.4239042,0.006576102,0.0010156754,0.00018136199,0.0020609011,0.002187543,0.37423903],"genre_scores_gemma":[0.8984443,0.0032180825,0.05905487,0.001827249,0.000766707,0.00019419409,0.0015487501,0.0001813739,0.034764446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810225,0.0005508457,0.0001208374,0.00036554222,0.0006245066,0.00023590638],"domain_scores_gemma":[0.99792176,0.0006977307,0.00018165227,0.00022568776,0.00063215045,0.000341017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061629,0.00044283646,0.00045131773,0.002568134,0.00254265,0.0057117837,0.0013265244,0.00091489253,0.0062898067],"category_scores_gemma":[0.0025550725,0.00030441413,0.00052038237,0.0019662338,0.0044012745,0.006901942,0.0034436793,0.0014566927,0.0017058655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014295058,0.000008591701,0.00027776344,0.00007958944,0.00001008528,0.00010993089,0.0004438859,0.00028410647,0.0007293428,0.98570377,0.0023193979,0.010019202],"study_design_scores_gemma":[0.0000072669973,0.000016350681,0.0003705478,0.000034607856,0.00000842162,0.00029518464,0.00023182372,0.0015481327,0.0005061294,0.9472374,0.049728084,0.000016050159],"about_ca_topic_score_codex":0.0017137694,"about_ca_topic_score_gemma":0.00082510384,"teacher_disagreement_score":0.0062898067,"about_ca_system_score_codex":0.0014831326,"about_ca_system_score_gemma":0.0014621099,"threshold_uncertainty_score":0.021041512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3989644,0.0050782138,0.42604873,0.0045672837,0.00056739186,0.000090406866,0.00047500865,0.00048645725,0.16372201],"genre_scores_gemma":[0.9726738,0.00048980495,0.014666526,0.0003863256,0.00016332834,0.00005122072,0.00018693658,0.00004681176,0.011335359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984156,0.00039111468,0.00013277002,0.00033765266,0.0004181766,0.00030474254],"domain_scores_gemma":[0.99799204,0.0006927595,0.00021370966,0.00037056915,0.0005484443,0.00018247752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016016983,0.00046971513,0.00043414542,0.0014222629,0.0012931813,0.0017950713,0.00084606494,0.0008907805,0.005096887],"category_scores_gemma":[0.0028298697,0.0004140735,0.0007271614,0.0007145359,0.005736795,0.006323778,0.0039377254,0.002595233,0.00049084827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026175065,0.000007663992,0.0005759091,0.00005870699,0.000011099995,0.000116239746,0.00039354595,0.00042123764,0.0018352404,0.9917277,0.00036229243,0.004464166],"study_design_scores_gemma":[0.000009704731,0.000081445,0.00077955617,0.00003438566,0.000019887688,0.00070912816,0.00037386894,0.0028196801,0.005178676,0.9737092,0.0162547,0.000029692934],"about_ca_topic_score_codex":0.00037532605,"about_ca_topic_score_gemma":0.00032921546,"teacher_disagreement_score":0.005096887,"about_ca_system_score_codex":0.0010137106,"about_ca_system_score_gemma":0.00046180832,"threshold_uncertainty_score":0.017050743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3942327,0.0031563612,0.33767846,0.0024734915,0.00081395096,0.00023587077,0.0009980964,0.0014139875,0.25899696],"genre_scores_gemma":[0.94282955,0.0006111367,0.03202286,0.00041300833,0.00035884275,0.000109519686,0.0005031054,0.0001802641,0.022971736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711215,0.0005540084,0.000236653,0.00064963615,0.0009067779,0.00054067594],"domain_scores_gemma":[0.99748504,0.00047000064,0.00024435524,0.0003026151,0.0009951901,0.0005028116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022451067,0.0005128899,0.00071345805,0.0016253548,0.0016833816,0.0043975064,0.0008231806,0.0006788546,0.008830244],"category_scores_gemma":[0.0025089204,0.00046903978,0.0009086338,0.0007100482,0.0054092626,0.0094322255,0.0042497395,0.0020818668,0.0016548889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042392523,0.000021781048,0.0005350152,0.00005722884,0.000015674452,0.000100342375,0.0006529154,0.00010869814,0.0020019587,0.98998463,0.0005144705,0.005964893],"study_design_scores_gemma":[0.000038674105,0.00005513662,0.0015860868,0.000028212049,0.00002383095,0.00045031143,0.00078227144,0.0013043043,0.0045068245,0.9640167,0.027180979,0.000026724698],"about_ca_topic_score_codex":0.0006261509,"about_ca_topic_score_gemma":0.0005759691,"teacher_disagreement_score":0.008830244,"about_ca_system_score_codex":0.0011344181,"about_ca_system_score_gemma":0.00061148073,"threshold_uncertainty_score":0.029540122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41915157,0.013638629,0.3676808,0.002749345,0.0009658732,0.000141883,0.00034080105,0.00047326126,0.19485793],"genre_scores_gemma":[0.92028487,0.0021994167,0.035871107,0.0003787588,0.000291548,0.00007688313,0.00031025225,0.000070013964,0.040517118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.00016942578,0.000051942054,0.00018127657,0.00026398632,0.00014615685],"domain_scores_gemma":[0.9993175,0.00021609249,0.0000782986,0.00008113846,0.000173285,0.00013361279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971533,0.000278431,0.00028037798,0.0014539944,0.0016552955,0.0025338635,0.00048368378,0.0004417567,0.0035229349],"category_scores_gemma":[0.0015146234,0.00020222756,0.0005035621,0.00084384315,0.003472718,0.0041864524,0.0025887487,0.0015041828,0.00043964988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013815151,0.000012717698,0.0006261587,0.000026283593,0.0000045837273,0.0000650016,0.0007082872,0.00027094258,0.00083169714,0.98990554,0.00048379748,0.007051125],"study_design_scores_gemma":[0.0000062476147,0.000055886117,0.0010404269,0.00004409696,0.000014130816,0.00026504294,0.0007701918,0.0028470503,0.0019776737,0.958113,0.034850147,0.000016092146],"about_ca_topic_score_codex":0.0032923454,"about_ca_topic_score_gemma":0.0021458461,"teacher_disagreement_score":0.0035229349,"about_ca_system_score_codex":0.0016601179,"about_ca_system_score_gemma":0.0009582082,"threshold_uncertainty_score":0.012045085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32338503,0.003671162,0.51843727,0.001853408,0.00028316508,0.00018525516,0.0016144605,0.0015393908,0.149031],"genre_scores_gemma":[0.9341737,0.0006286074,0.044928808,0.00046456367,0.00018378878,0.00013470379,0.0007342268,0.00009328381,0.018658284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00014386346,0.000044799322,0.00018832875,0.00033958873,0.00013318512],"domain_scores_gemma":[0.99914145,0.00017496587,0.00013356504,0.00025488334,0.00018362794,0.00011154446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056898355,0.00033957767,0.00045177227,0.0010504948,0.00076636585,0.0014454294,0.00109293,0.000691827,0.0052016685],"category_scores_gemma":[0.0012359939,0.00024177435,0.00062431797,0.0006692264,0.0018851865,0.0040385146,0.002330976,0.0016166869,0.0005837565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020888663,0.000011596947,0.0009690476,0.000071997914,0.000021151549,0.00035605032,0.00057022186,0.00109003,0.0053883134,0.9794333,0.0009354925,0.01113212],"study_design_scores_gemma":[0.000009835269,0.00006876403,0.0024419767,0.000033713775,0.000028346074,0.0017972331,0.0004872765,0.006207273,0.0037476313,0.89297754,0.092163086,0.000037310383],"about_ca_topic_score_codex":0.000728781,"about_ca_topic_score_gemma":0.00065478927,"teacher_disagreement_score":0.0052016685,"about_ca_system_score_codex":0.00069862703,"about_ca_system_score_gemma":0.0003008724,"threshold_uncertainty_score":0.017401338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20163389,0.03529939,0.55521667,0.005323353,0.0010247502,0.00018402043,0.0005218516,0.00080723426,0.19998878],"genre_scores_gemma":[0.84609073,0.011233466,0.11057757,0.0012230433,0.0007737468,0.0001744764,0.00055789703,0.00017107627,0.029197996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989047,0.00031575072,0.000071776645,0.00021232145,0.000341307,0.00015415164],"domain_scores_gemma":[0.998923,0.00043895512,0.00011850403,0.00017502757,0.00018701567,0.0001575566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013197202,0.00062217005,0.0005670178,0.0030224705,0.0020312665,0.0029069576,0.00076602487,0.0009876654,0.005342121],"category_scores_gemma":[0.0014627847,0.0003458549,0.0008262919,0.0024350144,0.0057875235,0.0078349775,0.0032349005,0.0020148626,0.0010203302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040796317,0.000005836684,0.0002331273,0.000053071115,0.0000057867464,0.0000765229,0.0006680996,0.0002929277,0.00033298522,0.9922389,0.00057281833,0.0055158976],"study_design_scores_gemma":[0.000003089864,0.00003055464,0.0004946572,0.000054163964,0.00001079827,0.00036146952,0.00059140276,0.0008267502,0.0005154581,0.9298476,0.067251354,0.000012662196],"about_ca_topic_score_codex":0.0017707371,"about_ca_topic_score_gemma":0.0013990646,"teacher_disagreement_score":0.005342121,"about_ca_system_score_codex":0.0015676394,"about_ca_system_score_gemma":0.0006097177,"threshold_uncertainty_score":0.017871201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06907085,0.0066218167,0.6989066,0.015817944,0.0019902012,0.000086632615,0.0003979521,0.0005544731,0.20655361],"genre_scores_gemma":[0.81138337,0.003628118,0.15214391,0.003001142,0.0039198156,0.00022788945,0.00027680147,0.0003402791,0.025078602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594444,0.00091789936,0.00022607988,0.00079354923,0.0016793951,0.0004386468],"domain_scores_gemma":[0.99365544,0.0035672626,0.00032088833,0.0010397703,0.0008777373,0.00053892494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045067733,0.00057756994,0.0010782691,0.0015628478,0.0025764252,0.0037679027,0.0016642577,0.0013901872,0.007948561],"category_scores_gemma":[0.008166732,0.0004895521,0.0013219424,0.0019687375,0.012135771,0.011586391,0.008041126,0.006341772,0.001149386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012722342,0.000008640534,0.0001966884,0.000024438976,0.0000033263498,0.000042876403,0.00030104967,0.00016471354,0.00062512455,0.99484646,0.00056628924,0.0032076293],"study_design_scores_gemma":[0.000009748687,0.000021633525,0.00030750447,0.0000128761985,0.000005615536,0.00007253185,0.00006513823,0.0007188791,0.0005454893,0.9865736,0.011654586,0.000012347213],"about_ca_topic_score_codex":0.0016149991,"about_ca_topic_score_gemma":0.0009132879,"teacher_disagreement_score":0.007948561,"about_ca_system_score_codex":0.0013241204,"about_ca_system_score_gemma":0.0009128563,"threshold_uncertainty_score":0.026590526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28207675,0.003181601,0.46434864,0.0051821545,0.00088946684,0.00012457283,0.00092748017,0.0006274525,0.2426418],"genre_scores_gemma":[0.93869483,0.0004947475,0.035243176,0.0005442032,0.00042449418,0.000178659,0.00026631384,0.00007722758,0.024076393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920964,0.00022284417,0.000055656932,0.00019045791,0.0002049019,0.00011650423],"domain_scores_gemma":[0.99889296,0.0003651161,0.00010631901,0.00021493564,0.00022993812,0.00019069304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014037973,0.0002766755,0.00031968113,0.0010974539,0.0018548612,0.0033216684,0.00046202954,0.00058640196,0.0042545083],"category_scores_gemma":[0.0019293845,0.00023789008,0.00062575925,0.0006054793,0.005894496,0.005355703,0.0027124444,0.001782551,0.0005393753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037757118,0.000002413056,0.00010329006,0.0000055185124,0.0000012266921,0.000020219191,0.00020700108,0.00007717433,0.00027059327,0.9982103,0.0002459331,0.00085260277],"study_design_scores_gemma":[0.0000064724836,0.000011804442,0.0002963981,0.000008596771,0.000002338781,0.000073772135,0.00017001988,0.0010561587,0.00033284686,0.9877238,0.01031208,0.000005717735],"about_ca_topic_score_codex":0.0010698752,"about_ca_topic_score_gemma":0.00089077104,"teacher_disagreement_score":0.0042545083,"about_ca_system_score_codex":0.0014950451,"about_ca_system_score_gemma":0.0006384127,"threshold_uncertainty_score":0.014232814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11893452,0.0013363675,0.80214494,0.0032172827,0.00011382438,0.00012940152,0.0009574518,0.0009989315,0.07216719],"genre_scores_gemma":[0.8768323,0.0003947113,0.108277604,0.00049495936,0.0000766792,0.00022362161,0.000608182,0.000111291076,0.012980552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984529,0.00043785817,0.00008006376,0.00021066064,0.00063337665,0.00018518223],"domain_scores_gemma":[0.9989507,0.00041246423,0.000127728,0.00017353205,0.00020294166,0.00013250942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013179441,0.0005428373,0.00048520273,0.0011640515,0.0012534442,0.003455467,0.0020476368,0.0013038316,0.005106912],"category_scores_gemma":[0.0018012587,0.0005022723,0.0011665124,0.0010030502,0.0032176203,0.0071335225,0.0026317853,0.0020651212,0.0007806427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006805705,0.000006982097,0.00009923633,0.000012215586,0.000003047807,0.000033980697,0.00016960254,0.0014882241,0.00030085153,0.99628735,0.00029686,0.0012948061],"study_design_scores_gemma":[0.000011506225,0.000013463884,0.00008866068,0.000014349489,0.000006748137,0.0000855294,0.0001279228,0.019693756,0.00054989307,0.97104406,0.008353067,0.000011068341],"about_ca_topic_score_codex":0.0031092698,"about_ca_topic_score_gemma":0.002472322,"teacher_disagreement_score":0.005106912,"about_ca_system_score_codex":0.003001308,"about_ca_system_score_gemma":0.0012516619,"threshold_uncertainty_score":0.02177608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42913875,0.0037010831,0.35898992,0.0018606061,0.00054954115,0.000094256895,0.00068956893,0.0005648676,0.20441131],"genre_scores_gemma":[0.95860624,0.00031061974,0.027933601,0.00020751992,0.000098307166,0.000052179177,0.0002214047,0.00004062227,0.012529532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994326,0.00018267767,0.000041244715,0.00009075097,0.00018182688,0.0000709315],"domain_scores_gemma":[0.9992478,0.00020799828,0.00007612728,0.00009185506,0.00023129738,0.00014494194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086325855,0.00024211993,0.00021152847,0.000790688,0.0011637149,0.0018731963,0.0005304997,0.00035246904,0.0028025925],"category_scores_gemma":[0.0009898131,0.0002109967,0.00032223063,0.0006378213,0.0027516661,0.0041661216,0.0018020793,0.0006744607,0.00035817004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022869252,0.000006042453,0.00033971822,0.00002775338,0.000003262206,0.000058768313,0.00028015734,0.00017209219,0.00082695927,0.99345016,0.00049749773,0.004314821],"study_design_scores_gemma":[0.000012157982,0.000052841493,0.0010884603,0.000020489895,0.000006960402,0.0005278335,0.00043184173,0.0035316146,0.0023064371,0.95244056,0.039562564,0.00001831581],"about_ca_topic_score_codex":0.0006081602,"about_ca_topic_score_gemma":0.00039601832,"teacher_disagreement_score":0.0028025925,"about_ca_system_score_codex":0.0005583562,"about_ca_system_score_gemma":0.00045391786,"threshold_uncertainty_score":0.009375572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13504769,0.0019743147,0.682703,0.0032863268,0.0007149846,0.0000938669,0.00021201746,0.00025776954,0.17571004],"genre_scores_gemma":[0.87602466,0.0013576585,0.10362282,0.0010186324,0.00052597123,0.0001206204,0.0001585994,0.000094891715,0.017076027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988224,0.000384969,0.00006138747,0.00021133653,0.0003135023,0.00020637794],"domain_scores_gemma":[0.9990914,0.00022710463,0.00010627383,0.00016404725,0.00027161583,0.00013950537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019291817,0.00052172254,0.00062899024,0.0018971566,0.0019077992,0.0030975167,0.0007443311,0.0009775567,0.0045483154],"category_scores_gemma":[0.0020300613,0.00025860808,0.0011302754,0.0013074577,0.0040671406,0.00646255,0.0034082963,0.0021138438,0.00057873013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003167443,0.0000046884998,0.00005715767,0.000006609922,0.0000021155672,0.000032142332,0.00010400667,0.00017248787,0.00016821266,0.99775225,0.00018286984,0.0015144483],"study_design_scores_gemma":[0.0000028011004,0.00000832681,0.00006810584,0.0000064316378,0.000003285523,0.000061469145,0.00007718661,0.0013280628,0.00035754396,0.99425405,0.003826999,0.000005666852],"about_ca_topic_score_codex":0.0010482565,"about_ca_topic_score_gemma":0.0010900337,"teacher_disagreement_score":0.0045483154,"about_ca_system_score_codex":0.0015520849,"about_ca_system_score_gemma":0.0008146523,"threshold_uncertainty_score":0.015215635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.738296,0.0012068469,0.15993766,0.0011009544,0.00016292502,0.000032609936,0.00011159869,0.00022552995,0.09892585],"genre_scores_gemma":[0.9875464,0.00020669999,0.0075291335,0.0001018906,0.0000763364,0.000015689067,0.000024351484,0.000020252417,0.0044792993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960107,0.00010834402,0.000016105976,0.000047919217,0.0001509378,0.00007558989],"domain_scores_gemma":[0.99966085,0.00008216807,0.00006982231,0.00005833327,0.000060155704,0.000068637564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054756674,0.00032218883,0.00026424817,0.0012211046,0.0008068437,0.0017855545,0.00043027027,0.0004906457,0.0023340941],"category_scores_gemma":[0.00087433774,0.00014168683,0.00035168414,0.0005928509,0.0027509455,0.0024497607,0.00091304077,0.00074405805,0.00031571582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008642516,0.000005454854,0.000073413066,0.00000553521,0.000001997,0.000057578847,0.00007332763,0.00043183376,0.0010114515,0.9968299,0.00010358847,0.0013971807],"study_design_scores_gemma":[0.0000069282337,0.000014531629,0.0002359847,0.000008731821,0.0000037047828,0.00017571732,0.000162325,0.008506179,0.0012004442,0.9879936,0.0016811952,0.000010705483],"about_ca_topic_score_codex":0.00079649885,"about_ca_topic_score_gemma":0.00062157173,"teacher_disagreement_score":0.0023340941,"about_ca_system_score_codex":0.00067605934,"about_ca_system_score_gemma":0.0003343146,"threshold_uncertainty_score":0.0078083277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11298059,0.0011445764,0.84731394,0.0008709462,0.00020675268,0.00008440306,0.00022630379,0.0002274349,0.036945187],"genre_scores_gemma":[0.74077123,0.0009151281,0.24361145,0.00042881886,0.00021565451,0.00010256173,0.00018080542,0.00014952604,0.013624827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990146,0.00027534025,0.00008663147,0.00021350286,0.0003104091,0.000099550125],"domain_scores_gemma":[0.99876803,0.0003450756,0.00013180668,0.00019624422,0.00042101298,0.00013783429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014126054,0.00023123465,0.000273032,0.0005915716,0.001015226,0.0013176084,0.0008009238,0.00058161333,0.0027964863],"category_scores_gemma":[0.0029439155,0.0002189624,0.0004668127,0.0005856158,0.0026538963,0.003685807,0.0014725885,0.0012870046,0.0006700474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008877808,0.000005029085,0.00013712262,0.00002631454,0.0000042208712,0.00012431714,0.0002491319,0.00066037755,0.0010777446,0.99051076,0.0001773091,0.0070187696],"study_design_scores_gemma":[0.0000058972737,0.000013608216,0.00015434231,0.000016336104,0.0000055752485,0.00020370718,0.00008371606,0.0050451416,0.0013977597,0.9861682,0.0068933596,0.000012280195],"about_ca_topic_score_codex":0.0011936118,"about_ca_topic_score_gemma":0.0007933714,"teacher_disagreement_score":0.0027964863,"about_ca_system_score_codex":0.0006539651,"about_ca_system_score_gemma":0.0008506139,"threshold_uncertainty_score":0.009355247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6113835,0.0022179254,0.13883372,0.0034122139,0.00061509764,0.00008188239,0.0005217785,0.0008822752,0.24205163],"genre_scores_gemma":[0.97960097,0.00024069729,0.0076338984,0.00032959055,0.00023268501,0.000041917767,0.00015466334,0.000071158334,0.011694282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848664,0.0004899282,0.00006287713,0.00031344086,0.00032967638,0.00031739005],"domain_scores_gemma":[0.99793446,0.0009645827,0.00022908565,0.00017452567,0.0002494135,0.00044788505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206638,0.00025952913,0.000407328,0.0011920223,0.0015512347,0.0014348392,0.00033259887,0.00038758197,0.009061941],"category_scores_gemma":[0.0025524695,0.00021587861,0.0008105893,0.0006380429,0.0038894594,0.0020303444,0.0019785338,0.001400105,0.0008538097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052328403,0.000011876384,0.00024885306,0.000030236499,0.0000069952025,0.00024820745,0.000576326,0.00031161623,0.0028953415,0.9914357,0.000765349,0.0034172346],"study_design_scores_gemma":[0.000016992613,0.00003113962,0.000747092,0.000017328306,0.0000069396924,0.00016117452,0.00033848628,0.0013495581,0.0012947064,0.9879209,0.008102564,0.000013089663],"about_ca_topic_score_codex":0.001432332,"about_ca_topic_score_gemma":0.0017529007,"teacher_disagreement_score":0.009061941,"about_ca_system_score_codex":0.0013482608,"about_ca_system_score_gemma":0.0005715507,"threshold_uncertainty_score":0.03031516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17681873,0.0046451557,0.40608883,0.008911071,0.0021395334,0.00013959296,0.0028220734,0.0068844687,0.39155057],"genre_scores_gemma":[0.90248024,0.0014966071,0.025236,0.00095872866,0.0007918622,0.00007188469,0.0013534265,0.001247027,0.06636428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954945,0.0000919987,0.000020762014,0.00014481047,0.00010700786,0.000086009306],"domain_scores_gemma":[0.99864775,0.00048755208,0.00011738049,0.00036984318,0.00016037922,0.00021709866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215707,0.00053505355,0.00053272414,0.001717396,0.0016291513,0.0030603788,0.00080458407,0.00077039923,0.026842164],"category_scores_gemma":[0.002517132,0.0003776851,0.0006621996,0.0015750749,0.0024189374,0.006807241,0.0020366488,0.0015815729,0.0025542767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002556392,0.0000096542635,0.00016922387,0.000047203997,0.0000044492845,0.00003199555,0.00022924543,0.00035726957,0.0006666713,0.9782577,0.007308631,0.012892408],"study_design_scores_gemma":[0.0000049841033,0.0000043307596,0.00026946416,0.000014401405,0.000005716281,0.00006712561,0.000061586004,0.00081163493,0.00041738528,0.9710921,0.027244605,0.000006798241],"about_ca_topic_score_codex":0.0014613221,"about_ca_topic_score_gemma":0.0012364956,"teacher_disagreement_score":0.026842164,"about_ca_system_score_codex":0.0015650279,"about_ca_system_score_gemma":0.0004511386,"threshold_uncertainty_score":0.08979601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7817883,0.0012480458,0.17764176,0.0012292475,0.0002762682,0.00015264146,0.0048490325,0.0012588599,0.03155587],"genre_scores_gemma":[0.88729835,0.0004374679,0.097630605,0.00021096545,0.00015085549,0.00018221393,0.0055454234,0.0004065434,0.008137613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99570674,0.0006723847,0.0004456272,0.0011872358,0.0014552048,0.00053280854],"domain_scores_gemma":[0.9871113,0.0056860577,0.0012106432,0.0023873323,0.0026718944,0.00093277177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020419261,0.00075672375,0.0011176015,0.0037808858,0.0023724684,0.0031152838,0.0018323488,0.0009221051,0.0052600936],"category_scores_gemma":[0.0154516,0.0006600737,0.0013520089,0.002577537,0.00399206,0.0066989246,0.0027548398,0.0015952073,0.00090507173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021599734,0.00021342786,0.061618667,0.0010573171,0.00017017592,0.0012957313,0.0020683229,0.014987335,0.022511588,0.76596856,0.009137046,0.1188119],"study_design_scores_gemma":[0.00012953392,0.0003501494,0.00988521,0.00022980776,0.00022587064,0.0025655192,0.0013786821,0.060342018,0.053690504,0.82644063,0.044522256,0.0002397237],"about_ca_topic_score_codex":0.001876381,"about_ca_topic_score_gemma":0.0016875353,"teacher_disagreement_score":0.0052600936,"about_ca_system_score_codex":0.0019866338,"about_ca_system_score_gemma":0.0015037038,"threshold_uncertainty_score":0.017596722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81684405,0.00044057376,0.14676335,0.00070692925,0.00011950611,0.000033149365,0.00015592869,0.00023647549,0.03469997],"genre_scores_gemma":[0.9878599,0.00010678254,0.008058563,0.00010192974,0.00007093978,0.000027198521,0.00007521249,0.000031818618,0.0036677408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949527,0.00011214275,0.000026988362,0.0000885789,0.00016795749,0.00010900328],"domain_scores_gemma":[0.9989543,0.00039029107,0.00016462839,0.00011881566,0.00014526326,0.00022669024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005623027,0.000314224,0.00048061003,0.00089390634,0.0010065007,0.0012008288,0.00075686723,0.00044062748,0.0047739237],"category_scores_gemma":[0.0021031727,0.00023935849,0.0005810465,0.0004339555,0.0014283193,0.0029908533,0.001593407,0.0012562242,0.00042343306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053609834,0.000020978083,0.00039010134,0.000024340456,0.0000081806265,0.00007036954,0.00013059936,0.0010151423,0.0038247532,0.991318,0.00034635354,0.0027976914],"study_design_scores_gemma":[0.000016844473,0.000025876676,0.00039355244,0.00000708885,0.0000096581725,0.000113255686,0.00006802801,0.018817926,0.0021003091,0.9771254,0.0013074047,0.000014753439],"about_ca_topic_score_codex":0.0006458314,"about_ca_topic_score_gemma":0.0008359123,"teacher_disagreement_score":0.0047739237,"about_ca_system_score_codex":0.000564048,"about_ca_system_score_gemma":0.00041183297,"threshold_uncertainty_score":0.01597035},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5697663,0.0016108986,0.18093462,0.0068175634,0.0007332294,0.00014325067,0.0012732397,0.00083319854,0.23788776],"genre_scores_gemma":[0.9799586,0.0002158267,0.013074033,0.0002958693,0.00014416095,0.000060937247,0.00024493996,0.00004271635,0.005962998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782205,0.0005645024,0.00016933263,0.000347236,0.00068678544,0.00041005493],"domain_scores_gemma":[0.99094427,0.003767306,0.0008142167,0.0014339339,0.0016693629,0.0013708123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021937182,0.00027880608,0.0008490049,0.0010057118,0.0026753335,0.0043665054,0.0009849594,0.0013393092,0.010015296],"category_scores_gemma":[0.0076869205,0.00046765624,0.00077396695,0.0007904334,0.005696139,0.0072924257,0.0036089215,0.0015532766,0.0010864841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009178845,0.000026906224,0.000708093,0.00006380566,0.000016421349,0.00022542769,0.00030569002,0.00074517354,0.0012866698,0.9916073,0.0017140863,0.0032085648],"study_design_scores_gemma":[0.00003698222,0.000034381846,0.0005416434,0.00003774469,0.000014839437,0.00038133207,0.0005227386,0.004243513,0.0010744088,0.98187953,0.011199211,0.00003360378],"about_ca_topic_score_codex":0.0020410002,"about_ca_topic_score_gemma":0.0017519448,"teacher_disagreement_score":0.010015296,"about_ca_system_score_codex":0.0011114182,"about_ca_system_score_gemma":0.0009947029,"threshold_uncertainty_score":0.033504546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74560845,0.0010810546,0.17007186,0.00047191107,0.0001818034,0.00007374757,0.00025698473,0.00029547524,0.081958845],"genre_scores_gemma":[0.96826375,0.00023456116,0.019859252,0.000072265044,0.00011365776,0.000049970204,0.00018699098,0.00006503894,0.011154428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911124,0.0001367214,0.000062542276,0.0001897101,0.0002962745,0.00020348653],"domain_scores_gemma":[0.99865496,0.00032053675,0.00019911675,0.00013588167,0.0003671921,0.00032226826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011611881,0.00032720226,0.00056005083,0.0018917694,0.0017315471,0.0029135009,0.00054557715,0.00034660453,0.0050020614],"category_scores_gemma":[0.0020256736,0.00028443956,0.0004962722,0.0007302594,0.0038987226,0.0035817812,0.0022833212,0.0010933945,0.0008271151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057074925,0.000012896345,0.0005417817,0.000025964051,0.0000042705155,0.00009864861,0.00046767373,0.00042215397,0.0020124193,0.9914322,0.00024024952,0.004684663],"study_design_scores_gemma":[0.000036853817,0.000096197575,0.0009766215,0.000031178497,0.0000145186905,0.0004256471,0.00079329824,0.006413511,0.0054147094,0.96996385,0.015802952,0.0000307639],"about_ca_topic_score_codex":0.0014389313,"about_ca_topic_score_gemma":0.00097092375,"teacher_disagreement_score":0.0050020614,"about_ca_system_score_codex":0.001352425,"about_ca_system_score_gemma":0.0006457788,"threshold_uncertainty_score":0.016733527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3980822,0.00058710645,0.5411326,0.001298499,0.00018774833,0.00011346037,0.00047639216,0.00039315684,0.05772883],"genre_scores_gemma":[0.9362337,0.00049659837,0.05361927,0.00012541875,0.0001949749,0.000057754532,0.00028689124,0.00009586057,0.008889406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.00026608293,0.0000650091,0.0002260438,0.00019687708,0.0001492358],"domain_scores_gemma":[0.99662066,0.001589727,0.0003311415,0.0005047432,0.00032820125,0.00062563294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020546927,0.00051755924,0.000864142,0.0021217957,0.0019949707,0.003787693,0.0015883293,0.0010360462,0.003916278],"category_scores_gemma":[0.007287574,0.00062207517,0.0012501933,0.0019452929,0.0031538594,0.0064232103,0.002803676,0.002425168,0.00037816478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026924467,0.000025388414,0.00049984816,0.000017402785,0.0000051256347,0.0000790033,0.00017425745,0.0011805781,0.0003871452,0.9924178,0.0003408501,0.00484566],"study_design_scores_gemma":[0.000020846102,0.000029653842,0.0005048758,0.000023197743,0.000017706965,0.00016820552,0.00023790442,0.029832091,0.00072544435,0.9664069,0.0020181283,0.000015131682],"about_ca_topic_score_codex":0.0025591615,"about_ca_topic_score_gemma":0.0019555208,"teacher_disagreement_score":0.003916278,"about_ca_system_score_codex":0.0019282885,"about_ca_system_score_gemma":0.0012199216,"threshold_uncertainty_score":0.01399076},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33581033,0.00042607906,0.18920825,0.0017865759,0.0019918077,0.00021283799,0.00085630926,0.0027473343,0.4669605],"genre_scores_gemma":[0.8718188,0.00028257538,0.015350588,0.00063672365,0.00047397582,0.00011083872,0.00070149166,0.0009953837,0.10962966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998156,0.00023375277,0.00008525702,0.00044850857,0.00045327947,0.00062316266],"domain_scores_gemma":[0.9987888,0.00031039695,0.00013550467,0.00026375777,0.00029257004,0.00020906905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009459377,0.00075008697,0.0005359524,0.0012756123,0.0019743473,0.0028089788,0.00064581697,0.00084564625,0.02745455],"category_scores_gemma":[0.0020140144,0.00044570208,0.0014918346,0.0008501601,0.0034905341,0.0027541483,0.0038993189,0.0021717926,0.00553455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008401603,0.00003511165,0.00031671324,0.000037276342,0.0000151398635,0.00023556138,0.00048127602,0.00033088942,0.0020603463,0.9796651,0.005030557,0.011707969],"study_design_scores_gemma":[0.00005497324,0.00007632861,0.0007457411,0.000025500502,0.000028116867,0.00035677108,0.00042432878,0.0022884046,0.0071344115,0.95566416,0.033159178,0.000042035805],"about_ca_topic_score_codex":0.001562025,"about_ca_topic_score_gemma":0.0011684885,"teacher_disagreement_score":0.02745455,"about_ca_system_score_codex":0.0017452353,"about_ca_system_score_gemma":0.0007683006,"threshold_uncertainty_score":0.09184462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3664529,0.0013581384,0.36169678,0.0018189879,0.0010829706,0.00009665396,0.0006954262,0.0010272,0.26577094],"genre_scores_gemma":[0.9078686,0.00048407094,0.019723028,0.0004563656,0.00026331696,0.00011121824,0.00043443096,0.00035544115,0.07030356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917406,0.00010741838,0.000055014683,0.00018229039,0.00022046581,0.0002607146],"domain_scores_gemma":[0.9991677,0.0002556359,0.000099018434,0.00012736706,0.00014689527,0.00020346271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006574187,0.0007037447,0.0009484528,0.001767612,0.0028759898,0.0032205503,0.0010121877,0.0007923786,0.013682919],"category_scores_gemma":[0.0013971891,0.0006167035,0.0011916584,0.0015321677,0.0037393863,0.0055832495,0.003110874,0.0033716704,0.0015274843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013969087,0.000005831796,0.000039545404,0.000010575539,0.000002297393,0.000033890912,0.00009212373,0.00008266901,0.00024856027,0.99806553,0.00026540936,0.0011396133],"study_design_scores_gemma":[0.000012792969,0.000009887441,0.00014111232,0.00001024073,0.000009016992,0.00008828142,0.00011682947,0.0007637104,0.0007249003,0.9940555,0.004053617,0.000014099643],"about_ca_topic_score_codex":0.0015311575,"about_ca_topic_score_gemma":0.0021441132,"teacher_disagreement_score":0.013682919,"about_ca_system_score_codex":0.0012118598,"about_ca_system_score_gemma":0.00060842576,"threshold_uncertainty_score":0.045773983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159988,0.0015483495,0.35632876,0.0006166017,0.00007741918,0.00011677423,0.00039577347,0.0002529397,0.024664627],"genre_scores_gemma":[0.9531639,0.00044298233,0.04337327,0.00011848001,0.00007605171,0.00007290381,0.00021276792,0.00005844515,0.0024812105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831796,0.00034203456,0.0002038906,0.00046629846,0.00047528365,0.00019459272],"domain_scores_gemma":[0.99600863,0.0013104932,0.00071801164,0.0005667543,0.0008024632,0.0005935766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017393494,0.00027791384,0.0006638106,0.0015168324,0.0020072362,0.0021009052,0.0009018544,0.0008601016,0.0021178308],"category_scores_gemma":[0.00591589,0.00039432614,0.00083801534,0.0013085913,0.0038661743,0.004973769,0.0021321815,0.001560653,0.00039034165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027076912,0.000015101647,0.0012035584,0.000047828587,0.000011256227,0.0002082161,0.00059018115,0.0014855097,0.0024303251,0.98846227,0.00012060718,0.005398117],"study_design_scores_gemma":[0.000014976445,0.000030644944,0.0007958984,0.000023048495,0.000013235119,0.00042828676,0.00024955577,0.009585898,0.0032270302,0.98365533,0.0019464054,0.000029761075],"about_ca_topic_score_codex":0.0007611713,"about_ca_topic_score_gemma":0.000527872,"teacher_disagreement_score":0.0021178308,"about_ca_system_score_codex":0.0011741448,"about_ca_system_score_gemma":0.0010026509,"threshold_uncertainty_score":0.009198666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3783046,0.0015291463,0.5702511,0.003843969,0.00026556427,0.0002541395,0.0012219748,0.0003399278,0.04398945],"genre_scores_gemma":[0.904971,0.0011102151,0.07704617,0.00058558,0.00039282296,0.00030534726,0.00093824876,0.00013322612,0.014517432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978157,0.00046751625,0.00013857326,0.00064828526,0.00057093834,0.00035891173],"domain_scores_gemma":[0.98857075,0.006753148,0.0015775927,0.0012989312,0.0007559121,0.0010436449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022548886,0.0011669318,0.0011827664,0.0011370038,0.0018063792,0.003821442,0.0036880248,0.00251065,0.010465095],"category_scores_gemma":[0.015472188,0.0006771106,0.0014187396,0.0016787971,0.0020985114,0.008465432,0.0025763481,0.0050438535,0.0007063103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014443239,0.00011412638,0.0013751317,0.0002217281,0.00006021596,0.00020007294,0.00028869088,0.020929039,0.0032050803,0.95062804,0.0028854513,0.019948129],"study_design_scores_gemma":[0.000048173188,0.00009205625,0.0005867246,0.000046878493,0.000030165884,0.00037006303,0.00014779762,0.124061145,0.0012776133,0.86866367,0.0046477923,0.000027772363],"about_ca_topic_score_codex":0.0010322483,"about_ca_topic_score_gemma":0.0012163376,"teacher_disagreement_score":0.010465095,"about_ca_system_score_codex":0.0018211441,"about_ca_system_score_gemma":0.0008915989,"threshold_uncertainty_score":0.035009205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020281104,0.02383371,0.046497267,0.0035420936,0.0009922084,0.000047507645,0.001204306,0.0006744028,0.9211804],"genre_scores_gemma":[0.11696571,0.038123146,0.0372923,0.0030680147,0.0019018297,0.00020521414,0.002759751,0.0011653248,0.79851866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994955,0.00009985435,0.000026636626,0.00010682711,0.00021620025,0.00005486412],"domain_scores_gemma":[0.9996598,0.00012765384,0.00001426884,0.00007261284,0.00008838369,0.000037288206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054707815,0.00076493755,0.0006681685,0.00190723,0.0017081391,0.0040715006,0.00084767473,0.00066566555,0.035595663],"category_scores_gemma":[0.00096223183,0.0004070796,0.0008645592,0.002041006,0.0031368062,0.0049635093,0.0014120903,0.0024001182,0.011690889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009107065,0.0000072289477,0.00006585351,0.00014657773,0.0000075789508,0.00003911407,0.00017871465,0.00020691086,0.0002525863,0.91743165,0.056136247,0.025518397],"study_design_scores_gemma":[0.0000054381712,0.000005432682,0.0001941076,0.00009295828,0.000007852144,0.00014707427,0.00007095368,0.00032368474,0.00023317148,0.50178385,0.49712667,0.000008772451],"about_ca_topic_score_codex":0.0043474934,"about_ca_topic_score_gemma":0.0059863366,"teacher_disagreement_score":0.035595663,"about_ca_system_score_codex":0.0036633133,"about_ca_system_score_gemma":0.0018361423,"threshold_uncertainty_score":0.11907935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005074903,0.019475272,0.039482813,0.003514136,0.0014420144,0.000027852895,0.00024376102,0.00028999147,0.9304492],"genre_scores_gemma":[0.1897111,0.030343274,0.027938634,0.0016019789,0.0034270247,0.00017324908,0.0007871984,0.000652086,0.74536544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994917,0.00013377378,0.000022623659,0.000063391984,0.00023850326,0.000049982555],"domain_scores_gemma":[0.99971026,0.00012267525,0.000016163225,0.00006204003,0.000055991382,0.000032782747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003830021,0.0009183078,0.00074053917,0.0018498498,0.0018795595,0.0050537363,0.0009298721,0.0006884161,0.023643201],"category_scores_gemma":[0.0010571918,0.00054543436,0.00051221397,0.002722523,0.004531158,0.005940416,0.0015497783,0.0029737826,0.0077570598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035551593,0.0000068727495,0.000013985234,0.000034483804,0.0000017465436,0.00000973593,0.00009489872,0.00023394686,0.00008523201,0.9779824,0.010959381,0.010573702],"study_design_scores_gemma":[0.000003341571,0.0000023260616,0.00003609954,0.00004477796,0.0000021186465,0.000038223734,0.00006130697,0.0004093447,0.00011580289,0.861001,0.13828,0.0000057064844],"about_ca_topic_score_codex":0.0023343905,"about_ca_topic_score_gemma":0.003201552,"teacher_disagreement_score":0.023643201,"about_ca_system_score_codex":0.0036948852,"about_ca_system_score_gemma":0.0013715109,"threshold_uncertainty_score":0.07909435},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035204885,0.04695752,0.0098876925,0.009636953,0.005569529,0.000027159896,0.001449209,0.0004931838,0.9224583],"genre_scores_gemma":[0.047425736,0.03638998,0.00594214,0.0018876365,0.0050255195,0.000057395362,0.0015553797,0.00029424383,0.9014219],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997818,0.000026988067,0.000007536099,0.00004263168,0.00010840682,0.00003261118],"domain_scores_gemma":[0.9997298,0.000066489476,0.000016586268,0.00002728983,0.00007524422,0.00008465254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033419798,0.0009666249,0.0006280231,0.0009847052,0.0008599595,0.002181616,0.0005284819,0.0006778105,0.08700368],"category_scores_gemma":[0.0010414063,0.00033246636,0.00047014543,0.0017128395,0.00079714,0.0034675898,0.001131204,0.0021920602,0.026486969],"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.000016083844,0.000043579053,0.00019663115,0.0001787002,0.000008146871,0.000052033,0.00025417705,0.00040076906,0.00084484514,0.35477963,0.5754401,0.06778538],"study_design_scores_gemma":[0.000005902279,0.000013922116,0.0006081779,0.00012304907,0.0000051840934,0.000103346036,0.00007637654,0.00023502669,0.00015035369,0.16667098,0.8320014,0.0000062763315],"about_ca_topic_score_codex":0.0014222804,"about_ca_topic_score_gemma":0.0031125424,"teacher_disagreement_score":0.08700368,"about_ca_system_score_codex":0.0017875334,"about_ca_system_score_gemma":0.0012982188,"threshold_uncertainty_score":0.29105628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15288553,0.0025672363,0.4542924,0.0040469416,0.00061461434,0.00036552583,0.008736206,0.0021714245,0.3743201],"genre_scores_gemma":[0.820831,0.0008305323,0.05890746,0.00082379044,0.00037757965,0.00041373575,0.0049047763,0.0005065939,0.11240451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823976,0.00025122226,0.0001503359,0.0005378342,0.0005102303,0.00031056974],"domain_scores_gemma":[0.9960672,0.0013572302,0.00050707336,0.0008932525,0.0006179854,0.00055720407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013424034,0.00063144893,0.0007861321,0.001747171,0.0035491416,0.006454185,0.0020165232,0.0015543485,0.025265608],"category_scores_gemma":[0.0057758223,0.00078742125,0.0008837685,0.00243367,0.0032643215,0.011860578,0.0032954328,0.0026658792,0.003201628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006676517,0.000028284956,0.00041000533,0.000045813656,0.000011916017,0.00009128188,0.00023467923,0.0003378912,0.00078848895,0.9804894,0.00496594,0.012529567],"study_design_scores_gemma":[0.000038838127,0.000016522694,0.0008332723,0.00006521616,0.000038217808,0.000394682,0.00035715406,0.0041407803,0.003026813,0.9243858,0.06666859,0.00003410068],"about_ca_topic_score_codex":0.0053828955,"about_ca_topic_score_gemma":0.0066437996,"teacher_disagreement_score":0.025265608,"about_ca_system_score_codex":0.0027870515,"about_ca_system_score_gemma":0.0018761747,"threshold_uncertainty_score":0.08452189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013847434,0.010359436,0.04910804,0.0019019261,0.0008003461,0.000041568117,0.0002928938,0.0003731549,0.9357379],"genre_scores_gemma":[0.07211384,0.019053131,0.039363757,0.0016497636,0.0016385594,0.00018257977,0.00093494164,0.00038897453,0.8646745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976665,0.000040508094,0.000012703866,0.000040926145,0.00011545737,0.000023627937],"domain_scores_gemma":[0.9998461,0.000053812786,0.000006939478,0.00003254474,0.00004611428,0.000014473311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036445385,0.0011043603,0.0007393901,0.0012372473,0.0014155458,0.0031652763,0.0010576698,0.00079879386,0.02611023],"category_scores_gemma":[0.0005579535,0.00052302436,0.0005039191,0.0020649808,0.0022001276,0.0051847524,0.001022115,0.0026914722,0.012759565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037668963,0.000013085991,0.00001590999,0.000072233015,0.000002634595,0.000015968895,0.00011066264,0.00019138448,0.00023945681,0.9361709,0.028935907,0.03422807],"study_design_scores_gemma":[0.0000033957233,0.0000053356544,0.00005184632,0.00005081293,0.0000038169533,0.000067050816,0.000027794375,0.00045285467,0.00017982016,0.7550261,0.24412526,0.0000059692075],"about_ca_topic_score_codex":0.0008278062,"about_ca_topic_score_gemma":0.0013389769,"teacher_disagreement_score":0.02611023,"about_ca_system_score_codex":0.0017134234,"about_ca_system_score_gemma":0.001131898,"threshold_uncertainty_score":0.08734745},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33240286,0.0045995936,0.22387436,0.013217744,0.0010034993,0.00013061837,0.0017658395,0.00081065675,0.4221948],"genre_scores_gemma":[0.91712385,0.0015666632,0.022261212,0.00086805737,0.00085721706,0.00008218802,0.0008494644,0.00020481729,0.056186453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990177,0.0002761187,0.00005620315,0.00013908144,0.0003237947,0.00018704285],"domain_scores_gemma":[0.99788934,0.0011825323,0.00018058637,0.00023980343,0.0002099981,0.00029776583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014287825,0.00055347825,0.0010048045,0.0015757941,0.0017182358,0.0039032488,0.0012084651,0.0011800178,0.02177468],"category_scores_gemma":[0.0053236466,0.0004320479,0.00069264695,0.0014392595,0.0027226978,0.009362182,0.0030909951,0.0026891883,0.0027780002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006844592,0.000019793466,0.00023261615,0.00007442762,0.000009119736,0.00006262481,0.000074587915,0.00080475333,0.00034850853,0.98823047,0.0037805054,0.0062941546],"study_design_scores_gemma":[0.000024036653,0.000008451252,0.00010498608,0.00001679998,0.000009274498,0.00010512023,0.00007045891,0.0034063,0.0003534932,0.99150133,0.0043927305,0.0000069522616],"about_ca_topic_score_codex":0.00077251316,"about_ca_topic_score_gemma":0.001154556,"teacher_disagreement_score":0.02177468,"about_ca_system_score_codex":0.0016114616,"about_ca_system_score_gemma":0.00090928504,"threshold_uncertainty_score":0.07284355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025912414,0.0100023,0.065070875,0.0022305797,0.000785219,0.000033791322,0.00017083905,0.00033677518,0.9187784],"genre_scores_gemma":[0.24518245,0.017602675,0.09129832,0.002043167,0.0018142336,0.0002659535,0.001014855,0.00073148834,0.64004683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944454,0.00020276275,0.00002439646,0.000085140324,0.00019411278,0.000049012462],"domain_scores_gemma":[0.99970907,0.000111257876,0.000013248001,0.000073627,0.00006599964,0.000026740778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070745585,0.0008362269,0.0005304395,0.0015799995,0.0020367187,0.0044520916,0.00087436184,0.000848284,0.017037313],"category_scores_gemma":[0.0013158821,0.00056163425,0.00071560027,0.0015541982,0.005320231,0.0060594515,0.0017572364,0.0033750115,0.005620002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011854183,0.0000015108974,0.000007578517,0.000011647758,8.756646e-7,0.000003424614,0.000090372145,0.00003640676,0.00004322569,0.99236804,0.0042885053,0.0031472442],"study_design_scores_gemma":[0.0000024171616,0.0000021156475,0.000027710266,0.000023450433,0.0000021756643,0.000037186353,0.000051471117,0.0002162766,0.00012616938,0.8656682,0.13383935,0.0000034243023],"about_ca_topic_score_codex":0.0011085919,"about_ca_topic_score_gemma":0.0014860895,"teacher_disagreement_score":0.017037313,"about_ca_system_score_codex":0.0023072886,"about_ca_system_score_gemma":0.001067768,"threshold_uncertainty_score":0.05699545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.452692,0.0015646436,0.40959138,0.0008209486,0.0003006123,0.00008143894,0.00021027267,0.0005980936,0.13414069],"genre_scores_gemma":[0.96665436,0.0004845187,0.018989317,0.0001621392,0.00029614108,0.000033693803,0.00014356863,0.00007761005,0.013158645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916613,0.0001713075,0.00003896822,0.00019020333,0.0003188105,0.00011462892],"domain_scores_gemma":[0.999086,0.00026417186,0.00011400194,0.00012826167,0.00025940695,0.00014818925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007938168,0.00038097016,0.0004181616,0.00095440424,0.0009827792,0.0015243944,0.0005147939,0.00029493772,0.0051601543],"category_scores_gemma":[0.0017170797,0.00018013464,0.000522353,0.0004798723,0.0021020242,0.0037533913,0.0020683636,0.0009030531,0.00069604826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003410667,0.000011059411,0.00018948989,0.000023650293,0.000004824284,0.00007046318,0.00025989322,0.0010502893,0.0032437725,0.98862386,0.00022356855,0.006265052],"study_design_scores_gemma":[0.000014563789,0.00007896564,0.00047521517,0.000014720293,0.000011919367,0.00020865894,0.00014747081,0.0114644235,0.004950248,0.9722607,0.010354107,0.000019086643],"about_ca_topic_score_codex":0.0007317516,"about_ca_topic_score_gemma":0.00043293595,"teacher_disagreement_score":0.0051601543,"about_ca_system_score_codex":0.00090775767,"about_ca_system_score_gemma":0.0005494831,"threshold_uncertainty_score":0.017262459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07753654,0.0005218114,0.794098,0.0013549817,0.000654412,0.00019139172,0.00065117044,0.0008838831,0.124107644],"genre_scores_gemma":[0.79252946,0.0005941853,0.16386418,0.00093317346,0.0003161434,0.00049640005,0.0007869924,0.00047682773,0.040002607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862933,0.00028409308,0.000111453584,0.00033700877,0.00039138275,0.00024679542],"domain_scores_gemma":[0.9991122,0.00025820313,0.00007032937,0.00015255167,0.00028231076,0.00012449302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010913627,0.00070373865,0.0005431781,0.0009832451,0.0015004749,0.0029114045,0.0011973275,0.00097064534,0.012275559],"category_scores_gemma":[0.0018388525,0.0003129337,0.0008367917,0.00082018063,0.0029012633,0.005228125,0.00223454,0.0027531832,0.0017025652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009288499,0.0000065858235,0.00002778066,0.000012858289,0.000001406357,0.00004216738,0.00015153867,0.00019454444,0.0011511152,0.9955149,0.00039067952,0.0024972009],"study_design_scores_gemma":[0.000011664784,0.00001938962,0.000027232572,0.000012910089,0.000006300203,0.000117952586,0.00011646316,0.003840009,0.0033356932,0.97735524,0.015141903,0.00001536306],"about_ca_topic_score_codex":0.00072783325,"about_ca_topic_score_gemma":0.00061248103,"teacher_disagreement_score":0.012275559,"about_ca_system_score_codex":0.001623426,"about_ca_system_score_gemma":0.001078938,"threshold_uncertainty_score":0.041065812},"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":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99755377,0.0011492677,0.00048630653,0.000018066006,0.000013647761,0.000018656767,0.000094677875,0.000007064097,0.0006584733],"genre_scores_gemma":[0.99585634,0.0013465026,0.0013380399,0.00005626968,0.0000069114512,0.000021939153,0.00016410564,0.0000048817665,0.0012051119],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997943,0.000023641755,0.000017965538,0.000033676202,0.00007394502,0.000056528246],"domain_scores_gemma":[0.99986696,0.000036213776,0.000035999972,0.00000796476,0.000036273257,0.000016630249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016591218,0.00028282436,0.00017474167,0.0001269234,0.00013711085,0.0002483449,0.000113620845,0.0002548708,0.00054476026],"category_scores_gemma":[0.00017404776,0.00009510507,0.00027253266,0.00017831703,0.00013705973,0.00015657276,0.00015801271,0.00030666293,0.00011631485],"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.00017332859,0.000057492827,0.0012585247,0.00009663376,0.000017485894,0.000055677847,0.000031094925,0.00013557156,0.99545836,0.000021232136,0.0000162215,0.0026784067],"study_design_scores_gemma":[0.00001287874,0.0019428782,0.03651071,0.000013966441,0.000052413103,0.00009970419,0.00013077667,0.0007598262,0.95899516,0.000024159408,0.0014447934,0.000012671724],"about_ca_topic_score_codex":0.004502067,"about_ca_topic_score_gemma":0.006745265,"teacher_disagreement_score":0.004502067,"about_ca_system_score_codex":0.0002063408,"about_ca_system_score_gemma":0.0003257071,"threshold_uncertainty_score":0.008951724},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11979986,0.004669974,0.5287426,0.010043512,0.0012546962,0.00007582096,0.0010940165,0.000664519,0.33365506],"genre_scores_gemma":[0.9202024,0.0015332024,0.040991876,0.0016112976,0.000709349,0.0000820472,0.0003959477,0.00012082029,0.034353193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913615,0.00027183947,0.000038787603,0.00018242974,0.0002641204,0.000106646934],"domain_scores_gemma":[0.9989863,0.00045124427,0.00008518272,0.000117156305,0.0002942075,0.00006595557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007899921,0.00035518527,0.00027464473,0.0010688311,0.0010132974,0.001941183,0.0005471934,0.00058812427,0.014504357],"category_scores_gemma":[0.0020818957,0.00021588168,0.0005456949,0.0012936656,0.003105726,0.004253024,0.0027431548,0.0018814137,0.0011125777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000853081,0.0000047639182,0.000053822776,0.000026833237,0.0000035400203,0.000032655225,0.00011715416,0.00019213345,0.00041941137,0.99451077,0.0011679756,0.0034625586],"study_design_scores_gemma":[0.0000040178275,0.000006133687,0.00011232349,0.000010280833,0.0000036062934,0.000074685915,0.000045904177,0.0015317826,0.00035693336,0.9886968,0.009151382,0.0000060577077],"about_ca_topic_score_codex":0.0013588364,"about_ca_topic_score_gemma":0.001075554,"teacher_disagreement_score":0.014504357,"about_ca_system_score_codex":0.001234324,"about_ca_system_score_gemma":0.000610425,"threshold_uncertainty_score":0.048521876},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81917626,0.010805177,0.03850906,0.0010907056,0.000842233,0.00024856566,0.028089674,0.004929574,0.09630878],"genre_scores_gemma":[0.8644903,0.0036843987,0.01602594,0.00022888639,0.00006621875,0.00009851822,0.02034224,0.00021619869,0.094847254],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999571,0.000005588199,0.0000026530593,0.000012669501,0.000011129307,0.0000108912545],"domain_scores_gemma":[0.99997556,0.0000029953676,0.000004000523,0.000006061141,0.000004062127,0.000007243452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006827276,0.0003826162,0.00013775495,0.00027006867,0.00016715823,0.00034085574,0.00019685514,0.00012685673,0.014492529],"category_scores_gemma":[0.00004722203,0.000082869316,0.00026154864,0.0002579469,0.00012393347,0.00016849668,0.00012643539,0.00022627725,0.002947341],"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.00082326855,0.00009181268,0.0004025828,0.00021557338,0.000016830367,0.00011301664,0.000017082435,0.00016547117,0.9794592,0.0010974825,0.0019422348,0.015655361],"study_design_scores_gemma":[0.000090744594,0.00036756473,0.0098032635,0.000013950377,0.000034127046,0.00027593327,0.000036322133,0.0007828122,0.92658114,0.00035680574,0.061649833,0.0000074885647],"about_ca_topic_score_codex":0.0008586453,"about_ca_topic_score_gemma":0.0013887951,"teacher_disagreement_score":0.014492529,"about_ca_system_score_codex":0.0002178911,"about_ca_system_score_gemma":0.00019025887,"threshold_uncertainty_score":0.04848236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7436519,0.0019434777,0.002907924,0.00015411306,0.00029385588,0.00020056819,0.0029206653,0.0004426962,0.2474847],"genre_scores_gemma":[0.9391761,0.00081933767,0.0031210487,0.00015150817,0.000058491707,0.00009618072,0.0023844333,0.000029620198,0.054163355],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999845,0.000011051784,0.000013507627,0.00005507111,0.000051720308,0.000023674362],"domain_scores_gemma":[0.9997631,0.000040334788,0.000051094652,0.000022699076,0.00008643534,0.00003634151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013636088,0.00042350974,0.00022824625,0.0015801934,0.0021079318,0.00048386038,0.00035086297,0.00029128088,0.013935934],"category_scores_gemma":[0.00034657956,0.00022992877,0.00024228179,0.0012835439,0.00051098067,0.0006461639,0.00060581294,0.00046553888,0.0058528343],"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.0012352027,0.0002827888,0.12243264,0.0011186899,0.00017227582,0.006646932,0.008358484,0.0029064203,0.06886454,0.0067794924,0.025263986,0.75593865],"study_design_scores_gemma":[0.00011865529,0.001187163,0.52215487,0.0006375911,0.00015665397,0.008194078,0.0060825306,0.001494083,0.009835432,0.0018339455,0.44822922,0.00007576931],"about_ca_topic_score_codex":0.019629156,"about_ca_topic_score_gemma":0.043738704,"teacher_disagreement_score":0.019629156,"about_ca_system_score_codex":0.0009831341,"about_ca_system_score_gemma":0.00064696744,"threshold_uncertainty_score":0.04662031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53809017,0.0054616695,0.42560062,0.005608308,0.00018832016,0.00014946134,0.0020229553,0.0019601977,0.020918254],"genre_scores_gemma":[0.90162575,0.0014550278,0.09188117,0.00034764127,0.00028675798,0.00014766822,0.001092536,0.0006342679,0.0025291864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99073446,0.0027009747,0.0010894664,0.002044221,0.0025416343,0.00088928477],"domain_scores_gemma":[0.9160388,0.0652122,0.005416579,0.008157485,0.002888324,0.0022866246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007443415,0.0005502095,0.0018098146,0.0029477475,0.0013514567,0.005320337,0.0033464485,0.0020256196,0.0053784624],"category_scores_gemma":[0.055863746,0.0015102624,0.0015621106,0.0026376923,0.003478548,0.014970996,0.004287412,0.0028900276,0.0007122281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021291974,0.00029423428,0.012173576,0.0023078134,0.0004408481,0.0009708338,0.0029162911,0.045539096,0.02274805,0.7763269,0.0059781084,0.12817517],"study_design_scores_gemma":[0.00010749668,0.00008684889,0.0013429635,0.00014234045,0.00015461257,0.00064571743,0.000281219,0.036447678,0.012002344,0.94403064,0.004708921,0.00004916134],"about_ca_topic_score_codex":0.00028414902,"about_ca_topic_score_gemma":0.0002867559,"teacher_disagreement_score":0.007443415,"about_ca_system_score_codex":0.0010547624,"about_ca_system_score_gemma":0.0007796324,"threshold_uncertainty_score":0.039364994},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012571479,0.00092042383,0.054772288,0.0029622621,0.0038652853,0.00004023057,0.0010272204,0.0014700759,0.9223708],"genre_scores_gemma":[0.60515857,0.0037363814,0.10105477,0.0021550404,0.00391441,0.00016609314,0.0023410907,0.0031914224,0.27828228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953306,0.000080588936,0.0000125157985,0.00013010792,0.00020448753,0.000039300485],"domain_scores_gemma":[0.9990544,0.00016675034,0.00008427534,0.0001334658,0.00046689017,0.00009422949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035948397,0.00037807482,0.00024757563,0.0014405986,0.0012349901,0.0028598867,0.00061580923,0.00059185585,0.061008334],"category_scores_gemma":[0.003015616,0.00024941415,0.0003031433,0.0013139084,0.0017907514,0.0023905206,0.00080959575,0.0014133891,0.009144374],"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.000048570437,0.0000058966025,0.0003660987,0.000060339644,0.000006915464,0.00013505369,0.0007547072,0.0012712926,0.0020814745,0.88919765,0.07922569,0.026846314],"study_design_scores_gemma":[0.000016972766,0.000054669243,0.005319856,0.00005790446,0.000012048471,0.0007169697,0.0007819153,0.004931612,0.0020595705,0.1532888,0.83268327,0.000076389726],"about_ca_topic_score_codex":0.011375654,"about_ca_topic_score_gemma":0.008335735,"teacher_disagreement_score":0.061008334,"about_ca_system_score_codex":0.0014447055,"about_ca_system_score_gemma":0.0004323227,"threshold_uncertainty_score":0.20409322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82980007,0.00048931106,0.16143274,0.00040233316,0.000045223045,0.00013263832,0.0011604297,0.00042927344,0.0061079822],"genre_scores_gemma":[0.9588751,0.00020859874,0.03778155,0.000051677423,0.000038796326,0.00020903445,0.0013514787,0.00014191458,0.0013418341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995352,0.0011640759,0.00032568304,0.0013357308,0.0013245968,0.0004979055],"domain_scores_gemma":[0.92200243,0.064167604,0.0036194248,0.006504324,0.002310975,0.0013952223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062114266,0.00060352444,0.0012137012,0.0039544473,0.0013029862,0.0029613094,0.0023405142,0.0017783747,0.0044018887],"category_scores_gemma":[0.053089477,0.00041722826,0.0011093033,0.0023075545,0.0025860097,0.0060617123,0.0018197976,0.0016624002,0.0002613764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013746255,0.00039130522,0.09330017,0.0007656308,0.0003622844,0.0006331565,0.0014665806,0.16034646,0.028603015,0.59278446,0.0036872306,0.11628507],"study_design_scores_gemma":[0.00010236353,0.00034118703,0.021672323,0.00011805737,0.00015318622,0.0010673316,0.0007514757,0.56681246,0.030406864,0.37497422,0.0034503357,0.00015020571],"about_ca_topic_score_codex":0.0009142652,"about_ca_topic_score_gemma":0.0013615835,"teacher_disagreement_score":0.0062114266,"about_ca_system_score_codex":0.002056711,"about_ca_system_score_gemma":0.0010515467,"threshold_uncertainty_score":0.03284955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80051136,0.0011395873,0.09026537,0.0016141472,0.00020452181,0.00006846534,0.00037332624,0.00031631257,0.10550698],"genre_scores_gemma":[0.9707106,0.0005452875,0.01045254,0.00018546298,0.00021044872,0.000043761982,0.00023196542,0.000056983106,0.017562894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924976,0.00017717587,0.000056292814,0.00016660934,0.00017892549,0.0001711698],"domain_scores_gemma":[0.9985877,0.00055836164,0.00017604556,0.00016665368,0.0001903842,0.00032091737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010165045,0.00040597413,0.0005523915,0.0019349958,0.002140245,0.0036806907,0.0006221961,0.000711512,0.0046492675],"category_scores_gemma":[0.001900409,0.00060744747,0.0008165128,0.001867846,0.0029987935,0.00754588,0.0018750097,0.0021967962,0.00041006305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002936113,0.000019060064,0.00028367242,0.0000104296605,0.0000043248892,0.00010125973,0.00036647863,0.00015102669,0.00056467095,0.9964424,0.00027562233,0.0017518033],"study_design_scores_gemma":[0.000021849022,0.00001998702,0.0006569733,0.000006578485,0.0000118798325,0.00026440588,0.00023815905,0.0011378513,0.00077051244,0.9931149,0.0037456995,0.000011245712],"about_ca_topic_score_codex":0.0007034822,"about_ca_topic_score_gemma":0.00079857925,"teacher_disagreement_score":0.0046492675,"about_ca_system_score_codex":0.0011070446,"about_ca_system_score_gemma":0.00047785928,"threshold_uncertainty_score":0.015553415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9164977,0.00034308812,0.05368483,0.00035770706,0.000033557302,0.000024046449,0.00013872514,0.000105991414,0.028814355],"genre_scores_gemma":[0.991143,0.00007328601,0.0067490237,0.000028062914,0.00005062967,0.000016658532,0.000067782945,0.000016255499,0.0018552213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892765,0.00017928555,0.000063967454,0.00027860838,0.00033261874,0.00021792711],"domain_scores_gemma":[0.9969695,0.0012430644,0.00052454555,0.00036725716,0.0002824497,0.0006131069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008979531,0.00027494074,0.0004174658,0.0013364442,0.001281648,0.0029931618,0.0007387837,0.00033082196,0.0034286412],"category_scores_gemma":[0.0030863788,0.00037983025,0.00056784693,0.00064687774,0.0036275475,0.0039062984,0.0022334643,0.0012567951,0.00024084486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010055559,0.00004110167,0.0032652037,0.000045615834,0.000012571289,0.00014864653,0.00052334584,0.0015799389,0.0049988595,0.9837277,0.00026324607,0.0052931956],"study_design_scores_gemma":[0.00003675058,0.000058832542,0.0034504298,0.000020875428,0.000019480469,0.00040515512,0.00041443098,0.013269813,0.0078393845,0.97104365,0.0034101792,0.00003101088],"about_ca_topic_score_codex":0.00048562774,"about_ca_topic_score_gemma":0.00068443513,"teacher_disagreement_score":0.0034286412,"about_ca_system_score_codex":0.0013326971,"about_ca_system_score_gemma":0.0003421791,"threshold_uncertainty_score":0.01146996},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002364631,0.82707846,0.0029570821,0.11626346,0.033135712,0.000016813565,0.0001879242,0.000101744205,0.020022294],"genre_scores_gemma":[0.010073791,0.77390337,0.0033659472,0.0832087,0.058124516,0.000085384745,0.00047395745,0.00033422912,0.07043004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854064,0.00040769306,0.00010582597,0.00026483642,0.0005470228,0.00013407812],"domain_scores_gemma":[0.9944068,0.0025357744,0.0002631047,0.00027464877,0.002107721,0.00041198928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002699332,0.000765711,0.00087461807,0.0052696886,0.0013108997,0.003488571,0.0013181174,0.0024311314,0.015510906],"category_scores_gemma":[0.010746542,0.00043067816,0.00056572305,0.004102305,0.004617322,0.00394756,0.002129676,0.0046382807,0.006224698],"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.000027519762,0.000010299736,0.00009842479,0.0011541942,0.000021243044,0.000048914364,0.00017458103,0.00015913774,0.00010369353,0.05856943,0.83999944,0.09963324],"study_design_scores_gemma":[0.0000055218156,0.000003983196,0.00012424293,0.00072462246,0.0000067959077,0.000045841614,0.000032202708,0.000022927617,0.00002918484,0.0056387065,0.99335986,0.000006220802],"about_ca_topic_score_codex":0.01982689,"about_ca_topic_score_gemma":0.023904182,"teacher_disagreement_score":0.01982689,"about_ca_system_score_codex":0.00717889,"about_ca_system_score_gemma":0.008891149,"threshold_uncertainty_score":0.05208671},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012550942,0.000068142,0.9750622,0.00024274256,0.00006790988,0.0000925139,0.00018654793,0.00040499194,0.011323961],"genre_scores_gemma":[0.21134943,0.00024486304,0.7731325,0.0002163379,0.00015864613,0.0004940024,0.0007938115,0.00031402623,0.013296429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980843,0.00050792476,0.00015778263,0.00042784202,0.0006126088,0.00020952657],"domain_scores_gemma":[0.9974685,0.0010383544,0.0002077218,0.00058010087,0.00050882844,0.00019659578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380283,0.00076918886,0.00063128344,0.0022463514,0.0017372022,0.0036019117,0.0017371924,0.0007691119,0.012959072],"category_scores_gemma":[0.0050129327,0.0005849333,0.0014662719,0.0020463567,0.0025465097,0.0065292916,0.0026806504,0.0023452411,0.0024137076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021015388,0.000027085409,0.0001650567,0.000033547567,0.0000048149054,0.000037418056,0.00017615831,0.0030898824,0.0017997731,0.9747686,0.00084357645,0.019033078],"study_design_scores_gemma":[0.000012184599,0.00005043532,0.000091164875,0.000025128003,0.000011304485,0.00017443839,0.00013805334,0.037401073,0.0056450088,0.9414781,0.01494419,0.000029061312],"about_ca_topic_score_codex":0.0009004016,"about_ca_topic_score_gemma":0.0019281657,"teacher_disagreement_score":0.012959072,"about_ca_system_score_codex":0.0014316692,"about_ca_system_score_gemma":0.0012104956,"threshold_uncertainty_score":0.043352365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50199413,0.007005014,0.17382443,0.08276643,0.004088754,0.0001927069,0.0029553236,0.0013987279,0.22577448],"genre_scores_gemma":[0.96732926,0.0012026906,0.016225627,0.005012296,0.0008037379,0.00007551952,0.0011100693,0.00007609339,0.008164642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961888,0.0007510267,0.00031944868,0.0013123888,0.000903469,0.0005249062],"domain_scores_gemma":[0.9751178,0.015553005,0.0015102312,0.0021603904,0.004302353,0.0013561602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036725982,0.000499159,0.0011624193,0.0018432224,0.0051134625,0.0046486384,0.0015544373,0.002605441,0.012389057],"category_scores_gemma":[0.019712446,0.0007358561,0.0014605318,0.0019614093,0.0101792235,0.013853332,0.003974704,0.003757373,0.0012834027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093178556,0.000101622325,0.01636099,0.00072903396,0.00017151753,0.0013211819,0.0030655607,0.000786978,0.005568925,0.90994704,0.023214247,0.037801053],"study_design_scores_gemma":[0.000049470786,0.00005719135,0.0030721913,0.00011730406,0.00009532496,0.001391837,0.0041825753,0.002609621,0.0029769503,0.9519526,0.03343451,0.000060416016],"about_ca_topic_score_codex":0.003623021,"about_ca_topic_score_gemma":0.0028686668,"teacher_disagreement_score":0.012389057,"about_ca_system_score_codex":0.0017849249,"about_ca_system_score_gemma":0.001060058,"threshold_uncertainty_score":0.041445553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8821648,0.00048728698,0.052814413,0.0003286535,0.000038119175,0.00003134411,0.00021178907,0.00024462567,0.063679114],"genre_scores_gemma":[0.9921033,0.00011322849,0.0024327305,0.00002227752,0.00003588509,0.000010476373,0.000071276845,0.000020231093,0.0051907883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948716,0.00008238414,0.000028148947,0.000078116536,0.00020088398,0.00012334781],"domain_scores_gemma":[0.9989207,0.00028261464,0.00016545547,0.00013692013,0.00026308667,0.00023130284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005649654,0.00023023676,0.00025437918,0.0010776375,0.0010559111,0.002465132,0.0004669344,0.00025707186,0.0054672183],"category_scores_gemma":[0.0015193671,0.0002081441,0.00028211746,0.00045866604,0.0016806554,0.003326634,0.0012993371,0.0007691665,0.00062943634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035323443,0.000020591275,0.001179117,0.000033920405,0.0000073852825,0.00007193603,0.00054383214,0.0010301643,0.005456424,0.9864839,0.0004048936,0.0047325664],"study_design_scores_gemma":[0.000015478308,0.00006145597,0.0014899306,0.000012176576,0.000018690924,0.00021230972,0.0004311598,0.01266453,0.011601494,0.9687396,0.0047239913,0.000029282355],"about_ca_topic_score_codex":0.00073240564,"about_ca_topic_score_gemma":0.00077044585,"teacher_disagreement_score":0.0054672183,"about_ca_system_score_codex":0.00059488125,"about_ca_system_score_gemma":0.0005008939,"threshold_uncertainty_score":0.018289626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045128785,0.0028879342,0.78935593,0.005884855,0.0008892435,0.00014168743,0.00080187997,0.00055092806,0.15435873],"genre_scores_gemma":[0.7111898,0.0021583277,0.25904012,0.002054802,0.001280639,0.0005343337,0.0013310153,0.0003698693,0.02204115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571437,0.0016085422,0.00040233118,0.00096554926,0.00088259275,0.00042647598],"domain_scores_gemma":[0.9936388,0.00361466,0.00044898695,0.0011177689,0.00094071287,0.00023906131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005279525,0.00069621805,0.0006688661,0.0031463502,0.0026793594,0.0055931173,0.0013534017,0.0017658694,0.009002246],"category_scores_gemma":[0.009281653,0.0005291858,0.003265614,0.0019597786,0.009369557,0.016907034,0.0043478752,0.0053367876,0.0013457149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011770259,0.0000016042579,0.00001692558,0.000007744072,0.0000018788186,0.000008724848,0.000097526034,0.00006205396,0.00004185448,0.9986796,0.00022043637,0.0008605559],"study_design_scores_gemma":[0.0000030298513,0.000004109778,0.000029846891,0.000009781618,0.0000032286944,0.0000380273,0.00004737506,0.0007045348,0.000099724646,0.9948084,0.0042473977,0.0000044257463],"about_ca_topic_score_codex":0.0011993308,"about_ca_topic_score_gemma":0.00076231826,"teacher_disagreement_score":0.009002246,"about_ca_system_score_codex":0.003456814,"about_ca_system_score_gemma":0.00091345544,"threshold_uncertainty_score":0.030115485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017755853,0.04824245,0.2986153,0.019823704,0.0022831478,0.00008084262,0.00054122874,0.0002990195,0.6123584],"genre_scores_gemma":[0.6012073,0.0353279,0.11405963,0.0026947705,0.005016732,0.00020537934,0.00050702656,0.00018216835,0.24079908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928087,0.00015684441,0.0000334924,0.00013422627,0.00037122154,0.0000234451],"domain_scores_gemma":[0.9986285,0.00078780006,0.00007785696,0.00014064152,0.00031108112,0.00005416591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472027,0.00056600757,0.00063551037,0.0015387125,0.0012303132,0.005140406,0.00055522186,0.0013349984,0.0146678435],"category_scores_gemma":[0.004767795,0.00046871082,0.00033636834,0.0019457698,0.0038718178,0.0051491726,0.000738564,0.002387216,0.001664471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003904232,0.000006746648,0.000017975439,0.000047669546,0.0000028329282,0.000016226575,0.00019589595,0.00033718784,0.00015456781,0.9838712,0.004439572,0.010906227],"study_design_scores_gemma":[0.0000025251475,0.0000031785794,0.00008550072,0.0000395448,0.0000053347517,0.000045628873,0.00006895605,0.0015061608,0.00023945926,0.96451455,0.033483725,0.0000053251088],"about_ca_topic_score_codex":0.0019867613,"about_ca_topic_score_gemma":0.0018912419,"teacher_disagreement_score":0.0146678435,"about_ca_system_score_codex":0.0022324817,"about_ca_system_score_gemma":0.0009121504,"threshold_uncertainty_score":0.04906881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13399693,0.0030445652,0.83364993,0.00096662884,0.00021357906,0.0001026336,0.00011766262,0.00016217353,0.027745944],"genre_scores_gemma":[0.6162674,0.0033906891,0.36818767,0.00033812167,0.00045759964,0.00020358448,0.0004047597,0.00019942872,0.010550801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997591,0.00064861536,0.00013472016,0.0005112192,0.0008133093,0.00030111134],"domain_scores_gemma":[0.99743015,0.0013551818,0.0002351552,0.0003712708,0.00045544785,0.00015275217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037432,0.0005089253,0.0008034597,0.001422626,0.0018815356,0.0017986875,0.0012743736,0.0008481398,0.0042096754],"category_scores_gemma":[0.0052505885,0.00042693634,0.0010832883,0.00197548,0.0025833764,0.0063206144,0.0016059726,0.002024942,0.000598737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006640168,0.000051824267,0.0008705354,0.00015463695,0.000016022243,0.00022106888,0.0003030123,0.0056389775,0.00554875,0.9563229,0.00068812235,0.030117813],"study_design_scores_gemma":[0.00003531393,0.00016808527,0.00064079656,0.00011139198,0.000057016863,0.0008525567,0.0003924608,0.05755594,0.012316754,0.9066753,0.021142073,0.00005226691],"about_ca_topic_score_codex":0.0010631832,"about_ca_topic_score_gemma":0.0009608096,"teacher_disagreement_score":0.0042096754,"about_ca_system_score_codex":0.0014271847,"about_ca_system_score_gemma":0.0011307251,"threshold_uncertainty_score":0.01408273},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2368211,0.0030520542,0.3458337,0.002021109,0.0012427893,0.00020227217,0.002438469,0.0022154923,0.4061731],"genre_scores_gemma":[0.8568579,0.0012194484,0.067469865,0.0006709902,0.000616412,0.00011676147,0.0024874585,0.00078831473,0.06977281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.0001127224,0.00007300052,0.00020553869,0.0002851514,0.0002715166],"domain_scores_gemma":[0.9984218,0.0003939068,0.00026233657,0.00031409704,0.0003142915,0.00029354816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008896734,0.00051527773,0.0006680698,0.0032692216,0.0022198693,0.0047570416,0.0010546312,0.0009728715,0.01677981],"category_scores_gemma":[0.0031083701,0.000566211,0.0011780317,0.002360605,0.0029815799,0.006232529,0.0023740851,0.0027065717,0.003213341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030853145,0.000017475737,0.00033876987,0.000026198935,0.000007958678,0.000073304414,0.0001938897,0.00032257973,0.00063836086,0.98298,0.004552452,0.010818153],"study_design_scores_gemma":[0.00001704517,0.000019450697,0.00071526534,0.000037248396,0.000025923373,0.0002711224,0.00026530673,0.0027043577,0.0015001302,0.97020626,0.024217196,0.000020716972],"about_ca_topic_score_codex":0.0024869272,"about_ca_topic_score_gemma":0.0029724906,"teacher_disagreement_score":0.01677981,"about_ca_system_score_codex":0.0022808188,"about_ca_system_score_gemma":0.00068773876,"threshold_uncertainty_score":0.056134045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46338364,0.004645415,0.25508896,0.0044300323,0.00076408434,0.0002427044,0.0008394999,0.00035680237,0.2702489],"genre_scores_gemma":[0.9473774,0.0018529396,0.030899072,0.00044348105,0.001039619,0.00016643519,0.00089296733,0.00018137181,0.017146893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976064,0.00072029664,0.00022074512,0.0004388923,0.0005828641,0.00043080375],"domain_scores_gemma":[0.99508035,0.0031237486,0.00026467684,0.00045328375,0.0006632726,0.00041471838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039721867,0.0008702928,0.0014777369,0.0030352194,0.0028665017,0.004954646,0.0009439745,0.0012415667,0.0066629983],"category_scores_gemma":[0.008147917,0.000760584,0.002078,0.0030208903,0.006173917,0.011848748,0.0037000335,0.0044645043,0.0008783483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006185351,0.000036656675,0.00033870313,0.00004174563,0.000007544561,0.00010594183,0.00039321758,0.00031216975,0.00052964874,0.9939359,0.00044191035,0.0037947316],"study_design_scores_gemma":[0.000029556624,0.000018873803,0.00028750268,0.000016967584,0.000009054738,0.00008289897,0.00011422649,0.0012071355,0.00042757226,0.9956269,0.0021696999,0.000009698903],"about_ca_topic_score_codex":0.0017237492,"about_ca_topic_score_gemma":0.001041632,"teacher_disagreement_score":0.0066629983,"about_ca_system_score_codex":0.002352895,"about_ca_system_score_gemma":0.0012091076,"threshold_uncertainty_score":0.022289932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010141731,0.0028648246,0.09333855,0.0043593505,0.0007198528,0.000033536147,0.0002108212,0.00044313143,0.8878882],"genre_scores_gemma":[0.5718062,0.005586066,0.048853464,0.0060448577,0.0020438212,0.0002530976,0.0006491513,0.0011627309,0.3636005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846077,0.0004678932,0.00007606036,0.00039332773,0.00043550035,0.00016648047],"domain_scores_gemma":[0.9984535,0.00081450434,0.00007882267,0.00021067382,0.00035469068,0.00008785258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012972042,0.00045281518,0.0003794869,0.0015583609,0.0021565394,0.004842727,0.0007701794,0.0011381318,0.025654154],"category_scores_gemma":[0.0034041507,0.00035564284,0.0005396488,0.0012743154,0.0049993447,0.008898892,0.0026273858,0.0038593686,0.0052573225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008551525,0.0000038766484,0.0000324702,0.000026716902,0.000001519476,0.000017079374,0.0002696647,0.000037022666,0.00016988494,0.9888713,0.0037108918,0.0068509975],"study_design_scores_gemma":[0.0000059580707,0.000008041997,0.00012413773,0.00003231462,0.0000031555019,0.000119641954,0.00013493387,0.00019756744,0.00037881808,0.9007199,0.098267786,0.000007753615],"about_ca_topic_score_codex":0.0011592314,"about_ca_topic_score_gemma":0.0007147381,"teacher_disagreement_score":0.025654154,"about_ca_system_score_codex":0.0018386374,"about_ca_system_score_gemma":0.0010610855,"threshold_uncertainty_score":0.08582175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010448891,0.0076641394,0.11211906,0.043436673,0.0044141505,0.00004476564,0.00058140286,0.0004272555,0.82086366],"genre_scores_gemma":[0.6130612,0.006073474,0.06690676,0.028995153,0.008851009,0.00031513124,0.0004739843,0.00065536896,0.2746679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799025,0.000694345,0.000099097175,0.00060758047,0.00044700288,0.0001617582],"domain_scores_gemma":[0.99812394,0.0010745373,0.00007191149,0.00034025114,0.00033451026,0.000054896886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026853164,0.0005418729,0.000702317,0.0010355854,0.00282206,0.0039998945,0.0016128538,0.0025209216,0.027844941],"category_scores_gemma":[0.0063809846,0.00050124095,0.0011380027,0.0010449203,0.011847397,0.010974882,0.0024823796,0.005841254,0.0052845487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036737272,0.0000014246386,0.000010918236,0.000010446688,0.0000017132844,0.0000095202395,0.00013595229,0.000024672601,0.000051795534,0.9963726,0.0024198773,0.0009575383],"study_design_scores_gemma":[0.000012502789,0.000010479288,0.000116973344,0.00002114873,0.0000053581803,0.00006909112,0.00007992598,0.0001757494,0.00013263756,0.9416129,0.057752382,0.000010860052],"about_ca_topic_score_codex":0.004251364,"about_ca_topic_score_gemma":0.0020537504,"teacher_disagreement_score":0.027844941,"about_ca_system_score_codex":0.0017988423,"about_ca_system_score_gemma":0.00092063856,"threshold_uncertainty_score":0.093150616},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18405086,0.0055670887,0.18856436,0.033201728,0.0031250878,0.00019667445,0.003521758,0.0011323631,0.5806401],"genre_scores_gemma":[0.8421106,0.0034525949,0.03211547,0.0031209209,0.0021939562,0.00016872729,0.002219568,0.00040891356,0.114209205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891317,0.00025057505,0.00005261974,0.0002985131,0.00018174209,0.00030341273],"domain_scores_gemma":[0.9955635,0.0027077217,0.00025231013,0.0006333045,0.00036361624,0.00047957787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014936129,0.0006563794,0.0007930483,0.0017222565,0.0038866135,0.0043372656,0.0017567505,0.0021512348,0.044953544],"category_scores_gemma":[0.0064157713,0.00056704483,0.001052139,0.0027495788,0.005312031,0.013758915,0.003667639,0.0056747408,0.004511088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005981547,0.00002241626,0.000274464,0.00007424658,0.000009129119,0.000048693764,0.00016211577,0.0006200509,0.00027432217,0.9808218,0.011572553,0.0060603614],"study_design_scores_gemma":[0.000017937798,0.0000116713145,0.00019569097,0.000018324521,0.000007828706,0.00007792323,0.00019740003,0.0011709041,0.00023583416,0.9901337,0.007922178,0.000010544756],"about_ca_topic_score_codex":0.0030302885,"about_ca_topic_score_gemma":0.0037415384,"teacher_disagreement_score":0.044953544,"about_ca_system_score_codex":0.0027822237,"about_ca_system_score_gemma":0.0013632028,"threshold_uncertainty_score":0.1503846},"labels":[],"label_agreement":null}]}