{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":15,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":15,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"536bb405ee9e","filters":{"venue":"Outstanding contributions to logic"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Congruence (geometry); Distributive property; Mathematics; Pure mathematics; Variety (cybernetics); Modular design; Computer science","authors":[{"name":"Alexandr Kazda","is_ca":false},{"name":"Marcin Kozik","is_ca":false},{"name":"Ralph McKenzie","is_ca":false},{"name":"Matthew Moore","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.019521090365919,"gpt":0.2754528691442911,"spread":0.2559317787783721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002839181,0.0004059689,0.0004704856,0.0003244299,0.0004188193,0.0002548427,0.0005245411,0.0003525438,0.0002245091],"category_scores_gemma":[0.0001989796,0.0003544943,0.000121463,0.0001465892,0.0001363053,0.000270706,0.0004074257,0.0003155033,0.0005642811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004164625,"about_ca_system_score_gemma":0.0000532773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002429219,"about_ca_topic_score_gemma":0.00001177123,"domain_scores_codex":[0.9980407,0.00003198695,0.0003553199,0.0008084829,0.0002877273,0.0004758302],"domain_scores_gemma":[0.9984991,0.0001455137,0.0002190688,0.0005974649,0.0002846543,0.0002542296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001022513,0.00001067859,0.00001101132,0.000009301469,0.00003267295,0.00002848222,0.0001198776,0.000005413169,0.0003008356,0.9927368,0.003288409,0.00344634],"study_design_scores_gemma":[0.0004415611,0.0003277909,0.0001878163,0.0002219264,0.00005256873,0.00006150773,0.00000516967,0.0008389625,0.000146081,0.8138965,0.1831172,0.0007028667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0001118564,0.0006549426,0.8277075,0.002199281,0.0008308223,0.0006594522,0.0002741953,0.001015173,0.1665468],"genre_scores_gemma":[0.3051157,0.00084753,0.04254301,0.002759036,0.001945573,0.0001474927,0.0003864202,0.0001482761,0.646107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7851645,"threshold_uncertainty_score":0.9998907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2794051391","doi":"10.1007/978-3-319-69917-2_3","title":"Larisa Maksimova’s Early Contributions to Relevance Logic","year":2018,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Relevance (law); Logical consequence; Ackermann function; Relation (database); Semantics (computer science); Computer science; Epistemology; Programming language; Philosophy; Artificial intelligence; Linguistics; Political science; Data mining","authors":[{"name":"Katalin Bimbó","is_ca":true},{"name":"J. Michael Dunn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02551498888633602,"gpt":0.2981960977255037,"spread":0.2726811088391677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001376481,0.001081708,0.001378809,0.0008113493,0.001394139,0.0008957331,0.002642349,0.001060862,0.0007290856],"category_scores_gemma":[0.003180601,0.0009927242,0.0006163256,0.0007238133,0.0003037359,0.0004526596,0.001462254,0.001084816,0.01131486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002567381,"about_ca_system_score_gemma":0.0006391996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003851492,"about_ca_topic_score_gemma":0.0001487313,"domain_scores_codex":[0.9941589,0.0001548602,0.001068763,0.001986654,0.0008729701,0.001757878],"domain_scores_gemma":[0.9927308,0.000696238,0.0005327257,0.002212233,0.002739137,0.001088857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003479665,0.00006082102,0.00002807349,0.00001479774,0.0001233048,0.000121348,0.0003823221,0.00002494321,0.0001264433,0.9349323,0.06345542,0.0006954711],"study_design_scores_gemma":[0.000775319,0.0007847021,0.0001381829,0.0003594166,0.000129298,0.00006584064,0.00001338639,0.0002125177,0.0001662307,0.3631794,0.6329041,0.001271615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00003386946,0.001165509,0.6930529,0.007057488,0.002197326,0.001522815,0.002257505,0.0009568998,0.2917557],"genre_scores_gemma":[0.1706345,0.0004037145,0.02403438,0.006054011,0.003698801,0.0004645719,0.000469283,0.0002112337,0.7940295],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.6690185,"threshold_uncertainty_score":0.9999059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3027886768","doi":"10.1007/978-3-031-24117-8_3","title":"Minimisation in Logical Form","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Automaton; Minimisation (clinical trials); Duality (order theory); Controllability; Algebra over a field; Pure mathematics; Discrete mathematics; Computer science; Theoretical computer science; Applied mathematics","authors":[{"name":"Nick Bezhanishvili","is_ca":false},{"name":"Marcello Bonsangue","is_ca":false},{"name":"Helle Hvid Hansen","is_ca":false},{"name":"Dexter Kozen","is_ca":false},{"name":"Clemens Kupke","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Alexandra Silva","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05648843169031397,"gpt":0.2978888442629068,"spread":0.2414004125725929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001000264,0.0003749463,0.0005724677,0.0005686212,0.0002273442,0.0003013237,0.0008037331,0.0005286948,0.00006208017],"category_scores_gemma":[0.000373817,0.0003237557,0.0002151699,0.0003322536,0.00005963874,0.0001879664,0.0003813558,0.0004256005,0.00171842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008808937,"about_ca_system_score_gemma":0.0001382765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002864343,"about_ca_topic_score_gemma":0.0001225453,"domain_scores_codex":[0.9975015,0.00005141015,0.00060721,0.0007599879,0.0004570968,0.0006227821],"domain_scores_gemma":[0.9984257,0.0002594421,0.0002325378,0.0006440272,0.0002349541,0.0002033216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006066896,0.00001750772,0.00004750955,0.00001532668,0.00002147298,0.0001385189,0.0001964258,0.00002288827,0.000008625823,0.9946063,0.002521359,0.002397963],"study_design_scores_gemma":[0.0004329156,0.0002020411,0.0001688589,0.00005662113,0.000019551,0.00003004558,0.00001976001,0.0007387966,0.00001053643,0.8328276,0.1649971,0.0004960987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000009708962,0.0001839903,0.6908339,0.003273483,0.001519543,0.001070738,0.00006812437,0.0007503662,0.3022902],"genre_scores_gemma":[0.6109488,0.00009719079,0.002314887,0.0005647713,0.0006245946,0.0002109478,0.0002530973,0.00006813338,0.3849176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.688519,"threshold_uncertainty_score":0.9999214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000371917","doi":"10.1007/978-3-030-66545-6_7","title":"Aspects of Categorical Recursion Theory","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Recursion (computer science); Categorical variable; Focus (optics); Computation; Category theory; Computer science; Epistemology; Mathematical economics; Mathematics; Calculus (dental); Algebra over a field; Pure mathematics; Algorithm; Philosophy; Physics; Machine learning","authors":[{"name":"Pieter Hofstra","is_ca":true},{"name":"Philip Scott","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02911258193846895,"gpt":0.2776253606016518,"spread":0.2485127786631829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009207794,0.0003477521,0.0006997598,0.0002861135,0.000237249,0.0001650594,0.000802378,0.0004332317,0.0001824644],"category_scores_gemma":[0.0004197621,0.0002939652,0.00031758,0.0002421317,0.00009285207,0.0001138306,0.0004394737,0.0003897064,0.0002385762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005539238,"about_ca_system_score_gemma":0.000310326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268241,"about_ca_topic_score_gemma":0.00001160487,"domain_scores_codex":[0.9977201,0.0001236209,0.0005368465,0.0006895163,0.0004800144,0.0004498793],"domain_scores_gemma":[0.9975899,0.0003057819,0.0003494353,0.0009018321,0.0006325492,0.0002204289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008707221,0.00003104239,0.000004526407,0.00003004374,0.00006775236,0.0001236739,0.0001224036,0.000006528726,0.00007709876,0.9953065,0.00135523,0.002866526],"study_design_scores_gemma":[0.000219746,0.0001983611,0.000006889776,0.00004724784,0.00004534553,0.000057835,0.00001757938,0.00004253928,0.00023939,0.8051395,0.1936701,0.0003154727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000001074633,0.001652789,0.6205621,0.0006265789,0.000930712,0.0003310482,0.00003435734,0.0001461468,0.3757151],"genre_scores_gemma":[0.7989821,0.0001304586,0.001346171,0.0002026203,0.0003903765,0.00002976302,0.0001041573,0.00003447333,0.1987799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.798981,"threshold_uncertainty_score":0.9999512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3157573770","doi":"10.1007/978-3-031-24117-8_13","title":"Closing Bell Boxing Black Box Simulations in the Resource Theory of Contextuality","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council","keywords":"Kochen–Specker theorem; Resource (disambiguation); Computer science; Black box; Exposition (narrative); Sheaf; Empirical research; Theoretical computer science; Mathematics; Artificial intelligence; Quantum; Pure mathematics; Statistics; Physics","authors":[{"name":"Rui Soares Barbosa","is_ca":false},{"name":"Martti Karvonen","is_ca":true},{"name":"Shane Mansfield","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04624961978499363,"gpt":0.3143831604006192,"spread":0.2681335406156256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217628,0.0002890153,0.0004642408,0.0002245477,0.0003881313,0.00007824202,0.0003968115,0.0001545327,0.0002489127],"category_scores_gemma":[0.0001105497,0.000240467,0.0002494961,0.0002570407,0.0001190114,0.00004431684,0.0001350754,0.0004894262,0.0001225815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001475682,"about_ca_system_score_gemma":0.00009079046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003326103,"about_ca_topic_score_gemma":0.00002505816,"domain_scores_codex":[0.9982204,0.0001182904,0.0006386519,0.0003911003,0.0002761625,0.0003553389],"domain_scores_gemma":[0.9975696,0.001204677,0.0003426285,0.0006130841,0.0001940212,0.00007599861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001148004,0.00003817674,0.00004126322,0.000009176744,0.00005980338,0.000001410438,0.0004443786,0.0004879048,0.0001295155,0.9975536,0.0008988798,0.000324386],"study_design_scores_gemma":[0.0003109343,0.00003490175,0.00004374677,0.0002298716,0.0001155844,3.937457e-7,0.0007120797,0.0007205548,0.00006464674,0.9575076,0.03999566,0.0002640958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002061354,0.0002023673,0.546254,0.005517033,0.0002471855,0.003088485,0.01454552,0.0001759771,0.4279081],"genre_scores_gemma":[0.9801167,0.000005516642,0.0000524004,0.0001539023,0.0002206862,0.00004377127,0.000578493,0.00004194042,0.01878664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9780553,"threshold_uncertainty_score":0.9805961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385444777","doi":"10.1007/978-3-031-24117-8_16","title":"Putting Paradoxes to Work: Contextuality in Measurement-Based Quantum Computation","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Kochen–Specker theorem; Equivalence (formal languages); Computation; Mathematical proof; Theoretical physics; Cohomology; Mathematics; Pure mathematics; Algebra over a field; Witness; Quantum; Computer science; Physics; Geometry; Quantum mechanics; Algorithm; Programming language","authors":[{"name":"Robert Raussendorf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1055580670724698,"gpt":0.3280187208301786,"spread":0.2224606537577088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002773672,0.0004495249,0.0008670546,0.001679103,0.0003390569,0.000398443,0.001036543,0.0003182131,0.0000560802],"category_scores_gemma":[0.002698578,0.0004038378,0.0002898356,0.002272868,0.00006521164,0.0001656474,0.0005147916,0.0004429918,0.0009883237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141043,"about_ca_system_score_gemma":0.0001677311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008505104,"about_ca_topic_score_gemma":0.0001970102,"domain_scores_codex":[0.9960858,0.0001493106,0.0008916411,0.001100645,0.001030671,0.0007419833],"domain_scores_gemma":[0.9972296,0.0007527434,0.0003139293,0.0006871148,0.0006644605,0.0003521492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002851661,0.00006217874,0.000267975,0.00001761365,0.00009099939,0.0001016238,0.00007005452,0.006348816,0.00001728398,0.9746808,0.004354953,0.01395911],"study_design_scores_gemma":[0.002337582,0.0006476484,0.006564588,0.001632684,0.0002727794,0.000007164483,0.00007040579,0.02706978,0.00006093369,0.9033792,0.05543176,0.002525432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00003874116,0.0001843664,0.9777606,0.01416167,0.0004743009,0.0007076384,0.0005568649,0.000477223,0.00563864],"genre_scores_gemma":[0.9693474,0.00002319941,0.01186949,0.001737176,0.0001793636,0.0001331368,0.0004190014,0.00004574171,0.01624544],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9693087,"threshold_uncertainty_score":0.9998413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949602603","doi":"10.1007/978-3-031-24117-8_22","title":"Compact Inverse Categories","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Inverse; Semilattice; Commutative property; Pure mathematics; Simple (philosophy); Structured program theorem; Abelian group; Algebra over a field; Discrete mathematics; Geometry","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Chris Heunen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05309027762294337,"gpt":0.2918311201606356,"spread":0.2387408425376922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006900809,0.0004848197,0.0006927524,0.0004750406,0.000530687,0.0005483281,0.001089878,0.0004214612,0.00008259682],"category_scores_gemma":[0.0002681809,0.0004203663,0.0003024462,0.0003145214,0.0001218392,0.000216682,0.0003940253,0.0004547302,0.004742318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007063458,"about_ca_system_score_gemma":0.0002465266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009151571,"about_ca_topic_score_gemma":0.0001527107,"domain_scores_codex":[0.9974618,0.00005419119,0.0005089479,0.0007702269,0.0005047513,0.0007000971],"domain_scores_gemma":[0.997754,0.0002282628,0.0002855509,0.0009670208,0.0004221321,0.0003430792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004486934,0.00001059615,0.00004240157,0.00002056095,0.00008421142,0.0001229141,0.0002045111,0.00003950507,0.0000114077,0.9681388,0.03087521,0.0004454304],"study_design_scores_gemma":[0.0002744695,0.0001556097,0.0000334187,0.00003389447,0.00004636833,0.00003014052,0.00002576868,0.0003021309,0.00002111812,0.531452,0.4670856,0.0005394655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000001835499,0.0002778044,0.5896735,0.00291815,0.002798096,0.0008077312,0.0001649081,0.001450046,0.401908],"genre_scores_gemma":[0.2233646,0.00009868356,0.0006349232,0.0005483572,0.0007066382,0.00004852076,0.0002382118,0.00007935785,0.7742807],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.5890385,"threshold_uncertainty_score":0.9998248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3139098693","doi":"10.1007/978-3-030-66545-6_8","title":"Morphisms of Rings","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Homomorphism; Morphism; Mathematics; Pure mathematics; Epimorphism; Algebra over a field","authors":[{"name":"Robert Paré","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08019171290917283,"gpt":0.3874239778124438,"spread":0.307232264903271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005360698,0.0003828795,0.0009073609,0.0003480781,0.0001942589,0.00005378233,0.0003780904,0.0003978553,0.001983822],"category_scores_gemma":[0.002464588,0.0003660498,0.0003015996,0.0001666661,0.0001472856,0.00007202492,0.0003674061,0.0006193329,0.0001938158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008808742,"about_ca_system_score_gemma":0.0002602203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003102313,"about_ca_topic_score_gemma":0.00001469875,"domain_scores_codex":[0.9976575,0.00004213858,0.0006428164,0.0005160727,0.0006431288,0.0004983493],"domain_scores_gemma":[0.9969384,0.0006568182,0.0002653513,0.0007978145,0.001107658,0.0002339564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001935768,0.00003000012,0.000008288687,0.0000843391,0.0001234058,0.00008532024,0.00005590984,0.00001351807,0.001179158,0.9944181,0.003808337,0.0001742693],"study_design_scores_gemma":[0.0005361748,0.0001564043,0.000005281161,0.0007454295,0.0001482029,0.00003056962,0.0000438589,0.0000183015,0.002674493,0.9257001,0.06942733,0.0005138332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0005244512,0.002137522,0.2500878,0.003129111,0.0006446196,0.002260318,0.004135337,0.0003857564,0.7366951],"genre_scores_gemma":[0.07316262,0.0002474559,0.02290835,0.0002102148,0.0004002557,0.0001016338,0.0002361073,0.000214594,0.9025187],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2271795,"threshold_uncertainty_score":0.9998791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403078881","doi":"10.1007/978-3-031-57635-5_6","title":"Entailment, Mingle and Binary Accessibility","year":2024,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Logical consequence; Binary number; Textual entailment; Computer science; Mathematics; Arithmetic; Artificial intelligence","authors":[{"name":"Katalin Bimbó","is_ca":true},{"name":"J. Michael Dunn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02701303931922408,"gpt":0.3029527247962412,"spread":0.2759396854770171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006102301,0.0004740869,0.0005504363,0.0003715485,0.000434778,0.0006970324,0.0008270335,0.0003661251,0.0001750512],"category_scores_gemma":[0.0001933602,0.0003983407,0.000221195,0.0001978131,0.0001353569,0.0002804511,0.001286982,0.0004868063,0.0007333727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007931624,"about_ca_system_score_gemma":0.00017033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007163706,"about_ca_topic_score_gemma":0.00001758618,"domain_scores_codex":[0.9975337,0.00003469202,0.0004342074,0.001144547,0.0003120833,0.0005407134],"domain_scores_gemma":[0.9982451,0.0002116561,0.0001593669,0.0008064134,0.0002443947,0.0003330888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007310512,0.00002691801,0.00007783677,0.00004977236,0.00006603364,0.0001040281,0.0002082123,0.000001946628,0.00008985683,0.9913373,0.006543984,0.001486772],"study_design_scores_gemma":[0.0004040084,0.0003136175,0.0001879562,0.0004330848,0.0001398407,0.00006015011,0.00001945237,0.001010208,0.0000924923,0.6337013,0.3628461,0.0007918134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001451497,0.009130131,0.1687689,0.003644287,0.002133351,0.0009631534,0.0005285555,0.0008500475,0.8138365],"genre_scores_gemma":[0.3663948,0.0003985647,0.002454856,0.0005193833,0.0005807247,0.00007870162,0.0001070103,0.00005750228,0.6294085],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3662497,"threshold_uncertainty_score":0.9998469,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jacob Garber","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03499427584012624,"gpt":0.3030185039617747,"spread":0.2680242281216485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00120699,0.0004848391,0.0006670824,0.0002709161,0.0004437545,0.0003165502,0.001679098,0.0004016361,0.0001541378],"category_scores_gemma":[0.0008203533,0.000348291,0.0003113179,0.0004524062,0.0001424338,0.0002126587,0.0005970481,0.0009286003,0.0002481008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008997612,"about_ca_system_score_gemma":0.0002713808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009775197,"about_ca_topic_score_gemma":0.0000883914,"domain_scores_codex":[0.9969649,0.0001892158,0.0005838287,0.001031964,0.0005181998,0.0007118945],"domain_scores_gemma":[0.9970424,0.0007391293,0.0002183597,0.001499333,0.0003480758,0.0001527549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004785516,0.00003925357,0.00004312797,0.00001148196,0.00001572342,0.0002114174,0.0001693723,0.0001409886,0.00001232433,0.9971204,0.0008601553,0.001370977],"study_design_scores_gemma":[0.0003064765,0.0001422013,0.0003292773,0.0001151974,0.00002935928,0.00006624009,0.00004905608,0.0001265501,0.00001336145,0.8996948,0.09863423,0.000493256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00004456645,0.002222996,0.7514216,0.01765188,0.0006239933,0.0009755684,0.0002262849,0.0002438039,0.2265893],"genre_scores_gemma":[0.8079264,0.0007530047,0.03285927,0.01846649,0.000974413,0.0004660784,0.0004854007,0.0001091236,0.1379599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8078818,"threshold_uncertainty_score":0.9998969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903867130","doi":"10.1007/978-3-319-97879-6_14","title":"Guttman Algebras and a Model Checking Procedure for Guttman Scales","year":2018,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Guttman scale; Class (philosophy); Mathematics; Duality (order theory); Point (geometry); Computer science; Statistics; Discrete mathematics; Artificial intelligence","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Günther Gediga","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04448151556307631,"gpt":0.3092164785215029,"spread":0.2647349629584265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005975609,0.0005176822,0.0006118303,0.0003179064,0.0006929321,0.0005185432,0.0008213306,0.0004936678,0.00002086092],"category_scores_gemma":[0.0002780924,0.0004848398,0.0001917381,0.0001135292,0.0001635858,0.0002610258,0.0004374488,0.0003484618,0.00007279507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003294614,"about_ca_system_score_gemma":0.0002554279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002846332,"about_ca_topic_score_gemma":0.00002482546,"domain_scores_codex":[0.9974571,0.00001921162,0.000485606,0.001062766,0.0003199741,0.0006553691],"domain_scores_gemma":[0.9979326,0.0001380281,0.000242745,0.000679652,0.0006764579,0.000330503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001445666,0.00001374691,0.000003833206,0.00005436361,0.00005073148,0.000004358078,0.0002646237,0.0002052478,0.0001386704,0.9905932,0.007249956,0.001406823],"study_design_scores_gemma":[0.0003924264,0.0002375712,0.000005674332,0.0004925228,0.00007818198,0.00003074549,0.000009485701,0.1936845,0.0001004689,0.7942067,0.01006901,0.0006927495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00006499221,0.0005600151,0.9716262,0.003628889,0.000226217,0.0008850086,0.0004536599,0.0003807982,0.02217429],"genre_scores_gemma":[0.6290474,0.0002406718,0.1998055,0.003196092,0.001547193,0.0004699449,0.0002530434,0.0001852127,0.165255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7718206,"threshold_uncertainty_score":0.9997603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3165859977","doi":"10.1007/978-3-030-71430-7_18","title":"Reflections on Proof Complexity and Counting Principles","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Key (lock); Graph; Mathematical proof; Focus (optics); Upper and lower bounds; Discrete mathematics; Theoretical computer science; Computer science; Mathematics","authors":[{"name":"Noah Fleming","is_ca":true},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1268991817977339,"gpt":0.3452532194782565,"spread":0.2183540376805226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056455,0.0003943042,0.0005689209,0.0002822927,0.0008929421,0.0006450489,0.0004755127,0.0003187517,0.00005052406],"category_scores_gemma":[0.000268131,0.0003537173,0.0001625094,0.0001992026,0.0001361756,0.000143279,0.0004631352,0.0004898502,0.00009124108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004457156,"about_ca_system_score_gemma":0.0001743852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000116244,"about_ca_topic_score_gemma":0.0000912007,"domain_scores_codex":[0.9976954,0.00007058441,0.0004728839,0.0008696757,0.0003928453,0.0004985417],"domain_scores_gemma":[0.9981927,0.0001966711,0.0002931114,0.0007276226,0.0003693367,0.0002205309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004915198,0.00002630226,0.0000212486,0.00003076837,0.0000597835,0.00004449578,0.0001356109,0.00002186877,0.0000434168,0.9982194,0.0003898651,0.001002353],"study_design_scores_gemma":[0.0003227938,0.0002778533,0.00006049763,0.0001311472,0.00005112033,0.0001006119,0.00003375569,0.0004724162,0.0001001383,0.3741526,0.6237309,0.0005661685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000005706962,0.0006508916,0.5522597,0.001857701,0.0007113356,0.0006537935,0.00007038542,0.0002976521,0.4434928],"genre_scores_gemma":[0.6054808,0.0001464727,0.01071737,0.001210733,0.001004377,0.0001769771,0.000240229,0.00008020295,0.3809429],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.6240668,"threshold_uncertainty_score":0.9998915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388996076","doi":"10.1007/978-3-031-29415-0_7","title":"Fine’s Semantics for Relevance Logic and Its Relevance","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Soundness; Relevance (law); Semantics (computer science); Interpretation (philosophy); Completeness (order theory); Kripke semantics; Computer science; Well-founded semantics; Property (philosophy); Abstract interpretation; Operational semantics; Programming language; Epistemology; Mathematics; Multimodal logic; Description logic; Denotational semantics; Philosophy","authors":[{"name":"Katalin Bimbó","is_ca":true},{"name":"J. Michael Dunn","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04438197430523182,"gpt":0.3009576135765785,"spread":0.2565756392713466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008035239,0.0006246247,0.0008599284,0.0003570538,0.0007211887,0.0003391878,0.001018382,0.0005522651,0.00002330741],"category_scores_gemma":[0.003400718,0.0005657787,0.0002821181,0.0002893989,0.0001027739,0.0002535757,0.0006707964,0.0005053801,0.0006227824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004801138,"about_ca_system_score_gemma":0.0002015284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001946627,"about_ca_topic_score_gemma":0.00006350617,"domain_scores_codex":[0.9968074,0.00004139925,0.0006016344,0.001263219,0.0003873165,0.0008990319],"domain_scores_gemma":[0.9960503,0.001542654,0.0003777616,0.0008289176,0.00087052,0.0003298663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001694868,0.00001562851,0.000006377226,0.0000893775,0.00005621283,0.00005102631,0.0001085241,0.00005016751,0.00007889407,0.9879462,0.0102248,0.001355905],"study_design_scores_gemma":[0.0007587547,0.000397516,0.00002949197,0.0005240855,0.0001048728,0.00004927686,0.000006531423,0.005972166,0.0001143345,0.6674384,0.32368,0.0009245934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00001394827,0.005490336,0.8940468,0.009333738,0.002319067,0.001954349,0.0011714,0.00115708,0.08451328],"genre_scores_gemma":[0.05468741,0.003111743,0.01592848,0.0009930781,0.001190638,0.0003478155,0.0002311927,0.0001738544,0.9233358],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8781183,"threshold_uncertainty_score":0.9996794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385444120","doi":"10.1007/978-3-031-24117-8_30","title":"Structure in Machine Learning","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing","authors":[{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0258621124583004,"gpt":0.2797602304098291,"spread":0.2538981179515287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008630411,0.0005913121,0.0008320326,0.0009455767,0.0003606416,0.0003480849,0.001420345,0.0005342918,0.000204814],"category_scores_gemma":[0.0008861801,0.0005690535,0.0002489329,0.0006222473,0.00008449114,0.0001878456,0.001371244,0.001463297,0.0005082139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144842,"about_ca_system_score_gemma":0.0002044936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004896473,"about_ca_topic_score_gemma":0.0003484852,"domain_scores_codex":[0.9965464,0.0001182793,0.0006867379,0.001232374,0.0006046541,0.0008115457],"domain_scores_gemma":[0.9975851,0.0005880875,0.0002528468,0.000977725,0.000332541,0.0002636996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008612454,0.00001824474,0.0002463341,0.00002316166,0.00004298044,0.0002341551,0.0002058844,0.004990309,0.00005093056,0.9876122,0.0006157707,0.005951393],"study_design_scores_gemma":[0.0008771774,0.0003354938,0.0007048777,0.0003198971,0.00004335489,0.00007150984,0.00001222972,0.05034834,0.0000351919,0.8486156,0.0973094,0.001326944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00006341773,0.0009357635,0.9011403,0.007537748,0.002764057,0.001630582,0.001370845,0.00216688,0.08239044],"genre_scores_gemma":[0.3632578,0.0004027513,0.04113862,0.001464029,0.001606632,0.0001497089,0.001146006,0.0003561869,0.5904783],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8600016,"threshold_uncertainty_score":0.9996761,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Allen Hazen","is_ca":true},{"name":"Francis Jeffry Pelletier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06715081971613869,"gpt":0.3464413418978577,"spread":0.2792905221817191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007458993,0.0008320995,0.00117277,0.0007213875,0.001062998,0.0006410335,0.001541859,0.0006316505,0.0006193671],"category_scores_gemma":[0.001118806,0.0008183398,0.0005144876,0.0004849827,0.000130695,0.0004775834,0.001133529,0.0008959986,0.001320101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144613,"about_ca_system_score_gemma":0.0004496182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004681695,"about_ca_topic_score_gemma":0.00001272287,"domain_scores_codex":[0.995227,0.0001388176,0.0008644507,0.001720167,0.0008487007,0.001200853],"domain_scores_gemma":[0.9960712,0.0006041994,0.0004180741,0.001362169,0.0008278931,0.0007164312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001411208,0.0000371334,0.000002862423,0.00001823683,0.0001079913,0.0003000879,0.00009840503,0.001398402,0.0004075297,0.9904379,0.00552283,0.001654562],"study_design_scores_gemma":[0.0005870546,0.0002239537,0.0000493443,0.0005220913,0.0000862978,0.00006668781,0.00004177649,0.0005563438,0.0002005291,0.7448621,0.2516002,0.001203584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00001774668,0.002291004,0.8932208,0.02289708,0.001291662,0.001095122,0.002344564,0.0007008751,0.07614119],"genre_scores_gemma":[0.1135158,0.001444567,0.0852052,0.02465768,0.003458305,0.0006403194,0.002913309,0.0002990369,0.7678658],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8080155,"threshold_uncertainty_score":0.9994575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}