{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559084,0.000650252,0.0004735459,0.001343694,0.00160242,0.002749887,0.0009752928,0.001039186,0.01648546],"category_scores_gemma":[0.001687575,0.0004855576,0.0005922198,0.001523372,0.002263022,0.006126305,0.002015415,0.003155638,0.005746431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001518222,"about_ca_system_score_gemma":0.0007567252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006754559,"about_ca_topic_score_gemma":0.0007313699,"domain_scores_codex":[0.9995572,0.0001066293,0.00002114905,0.00007761858,0.0001694239,0.00006800038],"domain_scores_gemma":[0.9995201,0.0002352321,0.0000296731,0.00007752945,0.0001001257,0.00003745509],"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.000004637698,0.000003689619,0.000008881264,0.00001583365,0.000001073228,0.00001206373,0.00009403383,0.00006943512,0.0001675896,0.9933176,0.002474915,0.003830314],"study_design_scores_gemma":[0.000003858059,0.000004170546,0.00003001625,0.0000302256,0.000004712715,0.00009774406,0.00006305831,0.0005172022,0.0004628715,0.9424686,0.05630969,0.000007839172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01434922,0.004113608,0.08154298,0.002762113,0.001018054,0.00002381754,0.0001132567,0.0003560217,0.895721],"genre_scores_gemma":[0.3275567,0.00526313,0.03055942,0.001450656,0.00110813,0.00009183311,0.0002524153,0.0007108902,0.6330069],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01648546,"threshold_uncertainty_score":0.05514932,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948645,0.001002215,0.0009412989,0.002359442,0.002085619,0.004740536,0.001061351,0.001611411,0.008770429],"category_scores_gemma":[0.007645827,0.000715424,0.0009922925,0.002352005,0.006576011,0.007693885,0.00309914,0.005534424,0.004291756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003897658,"about_ca_system_score_gemma":0.002357499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00166323,"about_ca_topic_score_gemma":0.00137571,"domain_scores_codex":[0.9979029,0.0006811673,0.0001172895,0.0004480172,0.0007308649,0.0001197849],"domain_scores_gemma":[0.9973323,0.001928572,0.0000718947,0.0002047923,0.0003616577,0.0001007286],"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.00001734958,0.00001358593,0.00007121892,0.0001542093,0.000009992684,0.00004314096,0.0003689047,0.0004809839,0.0002427861,0.9426963,0.02949995,0.02640168],"study_design_scores_gemma":[0.000007591508,0.000006412915,0.00009605342,0.0001258078,0.000009314786,0.00008810231,0.00005283026,0.0006797104,0.0003323872,0.7839653,0.2146201,0.00001620345],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00653763,0.1070174,0.244076,0.06074031,0.01202928,0.000120452,0.0006604964,0.0009838984,0.5678346],"genre_scores_gemma":[0.3368197,0.07687925,0.1300424,0.0159587,0.01808148,0.0004281739,0.00117628,0.00100111,0.4196129],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.008770429,"threshold_uncertainty_score":0.02934003,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002370803,0.001033538,0.001194924,0.001560598,0.001390573,0.004828,0.002169212,0.00125175,0.01888205],"category_scores_gemma":[0.007440811,0.0006769332,0.00162854,0.001777937,0.005420634,0.009731994,0.004784111,0.005275725,0.004357493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0021453,"about_ca_system_score_gemma":0.0009520081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006397695,"about_ca_topic_score_gemma":0.0007750168,"domain_scores_codex":[0.9976214,0.0007385119,0.0001706511,0.0005982668,0.0007372428,0.0001339689],"domain_scores_gemma":[0.9979989,0.001083498,0.00007576439,0.0004803367,0.0003045903,0.00005693588],"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.00001077542,0.000008808674,0.00003718329,0.00007563677,0.000008443787,0.00001217575,0.00008256573,0.0008781967,0.0002761467,0.9687848,0.004267865,0.02555755],"study_design_scores_gemma":[0.000003664039,0.000003817552,0.00001733587,0.00001835132,0.000004067396,0.00002109811,0.00001535611,0.002327046,0.0002861206,0.986164,0.01113485,0.000004365702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005790523,0.004381742,0.7936578,0.003328135,0.0006902191,0.00007170619,0.0003326751,0.0007221517,0.191025],"genre_scores_gemma":[0.3034104,0.007285035,0.4903129,0.002864416,0.002426796,0.0006458715,0.001610053,0.002050284,0.1893943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01888205,"threshold_uncertainty_score":0.0631668,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006418188,0.0003839288,0.0004079669,0.0009519255,0.001795336,0.003847175,0.0008766876,0.0009602879,0.01523156],"category_scores_gemma":[0.001953637,0.0002800326,0.0003922739,0.001504161,0.00467401,0.004843382,0.001474244,0.002851668,0.003665122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0026316,"about_ca_system_score_gemma":0.001347068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002213929,"about_ca_topic_score_gemma":0.00294901,"domain_scores_codex":[0.9993373,0.0001911659,0.00001642303,0.0001011631,0.0002850601,0.00006884246],"domain_scores_gemma":[0.9993615,0.0003415191,0.00002412709,0.000106403,0.0001146842,0.00005176011],"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.00000249642,0.000003266576,0.00003419344,0.00001248438,8.040758e-7,0.000006335001,0.0001032671,0.00009211244,0.00005194113,0.9817222,0.009603602,0.008367344],"study_design_scores_gemma":[0.000001329278,0.000001943377,0.00006279622,0.00001609601,9.806203e-7,0.00002235271,0.00004259196,0.000276762,0.00004466831,0.9053892,0.09413893,0.000002285826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003951411,0.02309903,0.05590771,0.009706892,0.00135231,0.00001472974,0.0001972747,0.0003214779,0.9054492],"genre_scores_gemma":[0.2561216,0.02025173,0.03300293,0.003705732,0.004225146,0.0001147694,0.0005217073,0.0003587632,0.6816977],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01523156,"threshold_uncertainty_score":0.05095458,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187373,0.0004527004,0.001969528,0.0004287243,0.001415895,0.002139527,0.002377793,0.002672679,0.01959685],"category_scores_gemma":[0.009797393,0.0007624247,0.0008164828,0.0006945891,0.003454001,0.005480457,0.002957535,0.003263853,0.0008080274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310867,"about_ca_system_score_gemma":0.001253929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004044974,"about_ca_topic_score_gemma":0.003939617,"domain_scores_codex":[0.9992846,0.0004245766,0.00001754534,0.00007248687,0.0001173745,0.00008359548],"domain_scores_gemma":[0.9951338,0.004057259,0.00009089155,0.0003543161,0.0001458293,0.0002178723],"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.00008190868,0.00003628978,0.0001641275,0.00004773205,0.00002199513,0.00005637119,0.0001575201,0.129752,0.0003789034,0.8638051,0.002486499,0.003011652],"study_design_scores_gemma":[0.0000356922,0.00001157871,0.00004366574,0.00001397194,0.000006367554,0.000007337228,0.00003538689,0.5111864,0.0001983192,0.4872388,0.001208329,0.00001413289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.354106,0.002204455,0.4540347,0.01131082,0.001443006,0.0001424563,0.0008709432,0.001156065,0.1747317],"genre_scores_gemma":[0.9232489,0.0004551359,0.05424379,0.0009998467,0.0002100592,0.0002044634,0.0002053208,0.000564548,0.01986787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01959685,"threshold_uncertainty_score":0.06555796,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003259395,0.0006864821,0.001182106,0.0009902805,0.002163489,0.00674169,0.002298897,0.002463697,0.004460918],"category_scores_gemma":[0.009974049,0.0007712928,0.0008273346,0.001746021,0.01734115,0.01627807,0.003849929,0.006894383,0.00063385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179338,"about_ca_system_score_gemma":0.001219394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008008544,"about_ca_topic_score_gemma":0.0008908521,"domain_scores_codex":[0.9978532,0.001031599,0.00009447122,0.0002752597,0.0006187788,0.0001266606],"domain_scores_gemma":[0.995338,0.003360675,0.0001506921,0.0007947555,0.0002339054,0.0001220742],"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.000003073904,0.000003823602,0.00001145126,0.00001469385,0.000002327459,0.000009201951,0.0001017093,0.0003248455,0.00006117845,0.9967685,0.0006561775,0.002043104],"study_design_scores_gemma":[0.000001025762,0.000001063345,0.000005655131,0.000004768219,7.759475e-7,0.000005229618,0.00001474953,0.0007684306,0.00003285766,0.997977,0.001186619,0.000001935562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03477256,0.0215463,0.6352077,0.03720733,0.002103954,0.00008832889,0.0002553276,0.0005999122,0.2682186],"genre_scores_gemma":[0.8596071,0.009252842,0.1036612,0.002757346,0.001948582,0.0001514282,0.0001440216,0.00028076,0.02219673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00674169,"threshold_uncertainty_score":0.01723748,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000354735,0.0005486395,0.000464627,0.001367328,0.001077121,0.003018843,0.0006310795,0.0005985863,0.02866107],"category_scores_gemma":[0.00101143,0.000312533,0.0003812514,0.001208421,0.001739465,0.004455227,0.001894315,0.002401372,0.00670199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001301477,"about_ca_system_score_gemma":0.000661799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000856032,"about_ca_topic_score_gemma":0.001128249,"domain_scores_codex":[0.9996081,0.00005689834,0.0000127328,0.00008101497,0.000203816,0.00003743781],"domain_scores_gemma":[0.999724,0.00008325194,0.00001422172,0.00006650685,0.00008469072,0.00002734928],"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.000005428759,0.000005726791,0.00002828099,0.00003360774,0.00000191222,0.00001242433,0.0001101695,0.00009958498,0.0002632299,0.9614397,0.01589843,0.02210164],"study_design_scores_gemma":[0.00000236082,0.000005940916,0.0001197647,0.00003660059,0.000003356003,0.0001274638,0.00006497649,0.0003898458,0.0003139978,0.7102001,0.2887308,0.00000475247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004344836,0.009745666,0.0377494,0.001545932,0.000814581,0.00001656198,0.0002642183,0.0003595137,0.9451591],"genre_scores_gemma":[0.1475852,0.01030535,0.02425594,0.001315399,0.001262949,0.00007173896,0.001064037,0.0004702284,0.8136691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02866107,"threshold_uncertainty_score":0.09588087,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005185288,0.0005513658,0.0003889029,0.001287938,0.001372426,0.003792335,0.000520856,0.0006475748,0.01535719],"category_scores_gemma":[0.001157802,0.000328444,0.0003239506,0.001127039,0.00345302,0.004559285,0.001401173,0.002262326,0.003756279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00208141,"about_ca_system_score_gemma":0.0007485147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001412266,"about_ca_topic_score_gemma":0.001535417,"domain_scores_codex":[0.9996401,0.0001224552,0.00001141198,0.00006183874,0.0001286747,0.00003547424],"domain_scores_gemma":[0.9997361,0.0001094946,0.00001564499,0.00005503875,0.00005406189,0.00002965796],"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.000001950764,0.000002400627,0.0000164745,0.00001069736,8.377162e-7,0.000004732223,0.0001116126,0.00004956309,0.0000543681,0.9874055,0.007376644,0.004965273],"study_design_scores_gemma":[0.000001973781,0.000002958993,0.00009195101,0.00001842582,0.000001686666,0.00004242377,0.00006410509,0.0001862726,0.00007028404,0.8211493,0.178368,0.000002694037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003321051,0.01679989,0.01898735,0.002713976,0.001090762,0.00001427659,0.0001366922,0.0001843227,0.9567516],"genre_scores_gemma":[0.1941866,0.0157939,0.0174344,0.001493894,0.003404787,0.00007049193,0.0003280214,0.0002793913,0.7670086],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01535719,"threshold_uncertainty_score":0.05137491,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007348974,0.0004272755,0.0005076997,0.001030075,0.00135689,0.002888864,0.0007382238,0.001177692,0.01109516],"category_scores_gemma":[0.002792548,0.0003483142,0.0004645258,0.001438881,0.004994319,0.008173745,0.001610362,0.002568605,0.001645775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001316401,"about_ca_system_score_gemma":0.0006539844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001156085,"about_ca_topic_score_gemma":0.001351251,"domain_scores_codex":[0.999438,0.0001828432,0.00003115556,0.0001176506,0.0001780248,0.00005243218],"domain_scores_gemma":[0.9990402,0.0006976242,0.00004462737,0.0001102935,0.00007621272,0.00003101222],"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.000007425868,0.000004370153,0.00003149177,0.00003815114,0.000001587439,0.00001686107,0.0001319713,0.000139444,0.00009754015,0.9856221,0.003525241,0.01038385],"study_design_scores_gemma":[0.000002032539,0.000002236621,0.00003932911,0.00001563142,0.000001664654,0.00003541833,0.00002690322,0.0003200156,0.00009531047,0.9808972,0.01856206,0.000002158318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02116087,0.05062615,0.2252435,0.01005934,0.001125671,0.00004106289,0.000274701,0.0004668563,0.691002],"genre_scores_gemma":[0.6533126,0.02493904,0.08080497,0.001856618,0.003118508,0.0001399539,0.0005235306,0.0003112647,0.2349935],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01109516,"threshold_uncertainty_score":0.037117,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005666013,0.0005503451,0.0006396978,0.001112011,0.00138326,0.002959192,0.0007091745,0.0008371694,0.01162218],"category_scores_gemma":[0.001362509,0.0004958776,0.0004872518,0.001331597,0.004392846,0.005809154,0.001178024,0.0037567,0.002600091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002450684,"about_ca_system_score_gemma":0.000729143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001934033,"about_ca_topic_score_gemma":0.002173277,"domain_scores_codex":[0.999567,0.0001071796,0.00001710559,0.00009385817,0.0001703872,0.00004442862],"domain_scores_gemma":[0.9996035,0.0002503931,0.0000170009,0.0000501025,0.0000555857,0.00002354428],"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.000004247764,0.000003935357,0.00001084053,0.00002102893,0.000001300464,0.000007319166,0.00005933919,0.0001412185,0.00009181311,0.9894135,0.004545712,0.005699676],"study_design_scores_gemma":[0.000003218872,0.000002993494,0.00005665658,0.00002142822,0.000002453457,0.00003123173,0.00002172796,0.0004247672,0.0001348077,0.9513546,0.04794215,0.000003997456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.006452012,0.0155958,0.05342993,0.004702205,0.001076398,0.00002968903,0.0002147756,0.0001783783,0.9183208],"genre_scores_gemma":[0.3978927,0.02029933,0.04392488,0.003001698,0.003510711,0.000122915,0.0006037191,0.0003537899,0.5302902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01162218,"threshold_uncertainty_score":0.03888011,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00395462,0.001236043,0.00140059,0.00221253,0.003223393,0.003518583,0.003438331,0.002178113,0.01438924],"category_scores_gemma":[0.0185942,0.001178154,0.004189206,0.002416387,0.004412069,0.01160567,0.004061474,0.00586429,0.001863857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002876888,"about_ca_system_score_gemma":0.002423864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005392999,"about_ca_topic_score_gemma":0.004988663,"domain_scores_codex":[0.996886,0.001195275,0.0002273223,0.0006167017,0.0008199717,0.0002547245],"domain_scores_gemma":[0.994876,0.00304101,0.0002458901,0.0009868394,0.0006985111,0.0001517702],"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.00001457061,0.000009710247,0.000066627,0.00002301744,0.00001086445,0.00002811238,0.00008418763,0.003479427,0.0002608018,0.9877815,0.0008560381,0.007385156],"study_design_scores_gemma":[0.000005018509,0.000005462919,0.00003267506,0.00001252551,0.00001019912,0.00001110574,0.00001987306,0.02588234,0.0004201991,0.9717283,0.001860056,0.00001218326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00917788,0.000255497,0.9712995,0.0006841355,0.0001455062,0.0001130367,0.0002288667,0.001025821,0.01706961],"genre_scores_gemma":[0.3451293,0.0004123128,0.6385031,0.0005479582,0.0002682006,0.0004264397,0.0005119048,0.0007486576,0.01345217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01438924,"threshold_uncertainty_score":0.04813683,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005446231,0.000897194,0.001189845,0.002400211,0.00257235,0.00781897,0.003198665,0.00301022,0.02119985],"category_scores_gemma":[0.02230497,0.0008010257,0.0008125865,0.003002322,0.01635776,0.035417,0.003523723,0.01305044,0.003100602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00660302,"about_ca_system_score_gemma":0.002097124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003033465,"about_ca_topic_score_gemma":0.002685168,"domain_scores_codex":[0.9961479,0.001486637,0.0001386358,0.000482712,0.001457562,0.0002866675],"domain_scores_gemma":[0.966654,0.02876296,0.0004967485,0.001631922,0.002002714,0.0004515625],"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.000004229071,0.000006196065,0.00001689049,0.00002435942,0.00000133032,0.000005947338,0.00005200827,0.0001996417,0.00001640543,0.9847136,0.01108568,0.003873598],"study_design_scores_gemma":[0.000003226288,0.000001110628,0.00002193888,0.00002766878,0.000001086514,0.00001246263,0.00002807078,0.0003196742,0.000042327,0.9698307,0.02970869,0.000002963905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00692273,0.04428345,0.1454955,0.2182417,0.00632946,0.00003903636,0.0003484486,0.0004448034,0.5778948],"genre_scores_gemma":[0.425755,0.05536559,0.1125593,0.03965481,0.03065342,0.0003716627,0.0006134146,0.001785015,0.3332418],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02119985,"threshold_uncertainty_score":0.07092059,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002997019,0.000870564,0.001106229,0.00408362,0.003435365,0.005488431,0.001662603,0.003450297,0.01112239],"category_scores_gemma":[0.008442305,0.001019866,0.001698547,0.003305272,0.008214412,0.01744766,0.002916769,0.005648735,0.00238819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003783602,"about_ca_system_score_gemma":0.001355329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003162048,"about_ca_topic_score_gemma":0.002418218,"domain_scores_codex":[0.997281,0.000733964,0.0002169877,0.00073813,0.0008382212,0.0001917347],"domain_scores_gemma":[0.9980277,0.001084427,0.00007629597,0.0003590671,0.0003864359,0.00006601934],"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.00000603128,0.000005371817,0.0000206807,0.00003286867,0.00000349879,0.00001807386,0.0001588379,0.0001872858,0.0001064964,0.9874092,0.004380641,0.007670884],"study_design_scores_gemma":[0.000004909321,0.000003586184,0.00003323741,0.00002115364,0.000004985025,0.00006173224,0.00002444708,0.0005123318,0.0001403304,0.9618465,0.03733937,0.000007540606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.007139379,0.01271054,0.5225898,0.01825916,0.001464977,0.0001500112,0.000564406,0.0007617073,0.43636],"genre_scores_gemma":[0.5841439,0.007896658,0.2367643,0.007892822,0.003796607,0.0005117166,0.0008914305,0.0007852055,0.1573174],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01112239,"threshold_uncertainty_score":0.03720808,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322603,0.0006324415,0.0006108874,0.001108718,0.0009293841,0.002417114,0.0007055484,0.0008063625,0.01261555],"category_scores_gemma":[0.002005029,0.0004030252,0.0003323105,0.001757688,0.002812068,0.003348466,0.001103352,0.002605213,0.004519132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362109,"about_ca_system_score_gemma":0.0009249974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00109506,"about_ca_topic_score_gemma":0.001723571,"domain_scores_codex":[0.999684,0.00009243827,0.00001050871,0.00006816614,0.000125791,0.0000190649],"domain_scores_gemma":[0.9994214,0.0003742932,0.00002337117,0.00008547313,0.00006714136,0.00002836661],"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.0000101365,0.00001796285,0.0001294586,0.0001486423,0.00001107637,0.00002218039,0.0001349043,0.001848447,0.0002523028,0.8526277,0.0507846,0.09401263],"study_design_scores_gemma":[0.000003174221,0.000006930525,0.0001030447,0.00006046643,0.000003696339,0.00003269946,0.00002072953,0.002186821,0.0001553176,0.8979958,0.09942669,0.000004560132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.006312494,0.1602148,0.2796607,0.0190595,0.004585404,0.00007161982,0.0005528999,0.0007902497,0.5287522],"genre_scores_gemma":[0.2444612,0.09525166,0.1692179,0.00514266,0.01216919,0.0002934703,0.001258333,0.0006266676,0.4715789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01261555,"threshold_uncertainty_score":0.04220325,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003425094,0.0009077088,0.0008094276,0.001229495,0.001890912,0.004194362,0.002125339,0.001623729,0.01189301],"category_scores_gemma":[0.006017538,0.0007652456,0.001353295,0.002255529,0.00729363,0.01963459,0.002412689,0.007119598,0.002321416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002034604,"about_ca_system_score_gemma":0.00089146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001847288,"about_ca_topic_score_gemma":0.00193101,"domain_scores_codex":[0.9986113,0.0005593659,0.00009775327,0.000264224,0.000365006,0.00010229],"domain_scores_gemma":[0.9964823,0.002509759,0.0000595257,0.0005343358,0.0003067339,0.0001074058],"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.000006757106,0.000009361293,0.0000328773,0.00004456706,0.000003730853,0.00002415603,0.0001175416,0.0005192527,0.0001253086,0.9809717,0.002782949,0.01536175],"study_design_scores_gemma":[0.000002762241,0.000002810711,0.00002316118,0.00001919309,0.000004712296,0.00003802665,0.00002205714,0.00158484,0.0001951639,0.9867269,0.01137349,0.000006973593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0186933,0.01102925,0.6836862,0.01595143,0.002490737,0.00006510552,0.0003114304,0.001264511,0.2665081],"genre_scores_gemma":[0.4377339,0.01471736,0.4161492,0.006693984,0.00435179,0.0002034712,0.0005777196,0.001095937,0.1184767],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01189301,"threshold_uncertainty_score":0.03978604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}