{"meta":{"query_hash":"536bb405ee9e","filters":{"venue":"Outstanding contributions to logic"},"cohort_total":15,"direct_labels_cover":0,"predictions_cover":15,"exported":15,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/536bb405ee9e","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Congruence (geometry); Distributive property; Mathematics; Pure mathematics; Variety (cybernetics); Modular design; Computer science","score_opus":0.019521090365918998,"score_gpt":0.27545286914429107,"score_spread":0.2559317787783721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298489343","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011185642,0.00065494265,0.82770747,0.0021992812,0.0008308223,0.0006594522,0.0002741953,0.0010151729,0.16654679],"genre_scores_gemma":[0.30511573,0.00084752997,0.042543005,0.0027590357,0.001945573,0.00014749268,0.00038642017,0.00014827607,0.64610696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980407,0.000031986947,0.00035531988,0.0008084829,0.00028772734,0.0004758302],"domain_scores_gemma":[0.9984991,0.00014551374,0.00021906878,0.00059746485,0.00028465426,0.00025422958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028391808,0.00040596892,0.00047048563,0.00032442986,0.0004188193,0.00025484271,0.0005245411,0.00035254384,0.00022450912],"category_scores_gemma":[0.00019897961,0.0003544943,0.00012146303,0.00014658923,0.0001363053,0.00027070596,0.0004074257,0.0003155033,0.00056428113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010225129,0.000010678591,0.0000110113215,0.000009301469,0.00003267295,0.00002848222,0.00011987763,0.0000054131688,0.00030083559,0.99273676,0.0032884087,0.0034463396],"study_design_scores_gemma":[0.00044156107,0.00032779085,0.00018781633,0.00022192641,0.000052568732,0.00006150773,0.0000051696697,0.0008389625,0.00014608102,0.81389654,0.1831172,0.0007028667],"about_ca_topic_score_codex":0.0000024292194,"about_ca_topic_score_gemma":0.000011771226,"teacher_disagreement_score":0.7851645,"about_ca_system_score_codex":0.00041646254,"about_ca_system_score_gemma":0.0000532773,"threshold_uncertainty_score":0.9998907},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02551498888633602,"score_gpt":0.2981960977255037,"score_spread":0.2726811088391677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794051391","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033869463,0.0011655091,0.6930529,0.007057488,0.0021973262,0.0015228151,0.0022575047,0.00095689984,0.29175568],"genre_scores_gemma":[0.17063451,0.00040371448,0.024034383,0.0060540107,0.0036988007,0.00046457193,0.000469283,0.00021123371,0.7940295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99415886,0.0001548602,0.001068763,0.0019866535,0.0008729701,0.0017578779],"domain_scores_gemma":[0.9927308,0.00069623796,0.0005327257,0.0022122331,0.0027391368,0.0010888574],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013764813,0.0010817075,0.0013788086,0.00081134925,0.0013941388,0.00089573313,0.0026423486,0.0010608619,0.00072908564],"category_scores_gemma":[0.0031806007,0.0009927242,0.00061632565,0.0007238133,0.00030373587,0.0004526596,0.0014622542,0.0010848156,0.011314858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003479665,0.000060821025,0.000028073493,0.000014797741,0.00012330478,0.00012134803,0.00038232215,0.000024943207,0.00012644326,0.9349323,0.06345542,0.0006954711],"study_design_scores_gemma":[0.000775319,0.0007847021,0.00013818286,0.0003594166,0.000129298,0.00006584064,0.000013386387,0.00021251773,0.00016623073,0.36317942,0.63290405,0.0012716154],"about_ca_topic_score_codex":0.00003851492,"about_ca_topic_score_gemma":0.00014873127,"teacher_disagreement_score":0.6690185,"about_ca_system_score_codex":0.0025673807,"about_ca_system_score_gemma":0.00063919957,"threshold_uncertainty_score":0.9999059},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044481515563076314,"score_gpt":0.30921647852150286,"score_spread":0.2647349629584265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903867130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006499221,0.0005600151,0.97162616,0.0036288886,0.00022621702,0.0008850086,0.00045365992,0.00038079818,0.022174288],"genre_scores_gemma":[0.6290474,0.00024067181,0.19980551,0.0031960916,0.001547193,0.0004699449,0.00025304337,0.00018521272,0.16525497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974571,0.000019211622,0.000485606,0.0010627656,0.00031997406,0.00065536913],"domain_scores_gemma":[0.9979326,0.00013802812,0.00024274504,0.000679652,0.0006764579,0.00033050304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005975609,0.00051768223,0.0006118303,0.00031790644,0.00069293205,0.00051854324,0.0008213306,0.00049366785,0.000020860924],"category_scores_gemma":[0.0002780924,0.00048483984,0.00019173812,0.000113529226,0.00016358576,0.00026102582,0.00043744885,0.00034846176,0.00007279507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014456656,0.000013746913,0.000003833206,0.000054363612,0.00005073148,0.000004358078,0.00026462367,0.00020524782,0.00013867044,0.9905932,0.0072499565,0.001406823],"study_design_scores_gemma":[0.00039242645,0.00023757119,0.0000056743324,0.0004925228,0.000078181976,0.00003074549,0.0000094857005,0.19368449,0.00010046888,0.7942067,0.010069008,0.0006927495],"about_ca_topic_score_codex":0.0000028463317,"about_ca_topic_score_gemma":0.00002482546,"teacher_disagreement_score":0.7718206,"about_ca_system_score_codex":0.0003294614,"about_ca_system_score_gemma":0.00025542793,"threshold_uncertainty_score":0.9997603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05309027762294337,"score_gpt":0.29183112016063556,"score_spread":0.23874084253769218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949602603","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018354992,0.00027780436,0.58967346,0.0029181496,0.002798096,0.00080773124,0.0001649081,0.0014500464,0.40190798],"genre_scores_gemma":[0.22336462,0.00009868356,0.0006349232,0.0005483572,0.00070663815,0.000048520764,0.00023821183,0.00007935785,0.77428067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974618,0.00005419119,0.00050894794,0.0007702269,0.0005047513,0.00070009707],"domain_scores_gemma":[0.997754,0.00022826277,0.0002855509,0.0009670208,0.00042213209,0.00034307924],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006900809,0.00048481973,0.0006927524,0.00047504058,0.000530687,0.0005483281,0.0010898784,0.00042146115,0.00008259682],"category_scores_gemma":[0.0002681809,0.00042036627,0.0003024462,0.00031452137,0.000121839206,0.00021668196,0.00039402532,0.0004547302,0.0047423183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044869344,0.000010596146,0.000042401567,0.000020560949,0.00008421142,0.00012291412,0.00020451112,0.00003950507,0.000011407704,0.96813875,0.03087521,0.00044543037],"study_design_scores_gemma":[0.00027446952,0.00015560967,0.0000334187,0.000033894466,0.00004636833,0.00003014052,0.000025768682,0.0003021309,0.000021118123,0.531452,0.4670856,0.00053946546],"about_ca_topic_score_codex":0.00009151571,"about_ca_topic_score_gemma":0.00015271072,"teacher_disagreement_score":0.5890385,"about_ca_system_score_codex":0.0007063458,"about_ca_system_score_gemma":0.00024652656,"threshold_uncertainty_score":0.9998248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029112581938468954,"score_gpt":0.2776253606016518,"score_spread":0.2485127786631829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000371917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010746329,0.0016527892,0.62056214,0.00062657887,0.00093071203,0.00033104818,0.000034357345,0.00014614676,0.37571514],"genre_scores_gemma":[0.7989821,0.00013045865,0.0013461709,0.00020262027,0.00039037652,0.000029763023,0.000104157276,0.000034473334,0.19877991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977201,0.00012362088,0.0005368465,0.0006895163,0.00048001442,0.0004498793],"domain_scores_gemma":[0.99758995,0.0003057819,0.00034943526,0.00090183207,0.0006325492,0.0002204289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092077936,0.0003477521,0.00069975975,0.00028611347,0.00023724897,0.00016505938,0.000802378,0.0004332317,0.00018246443],"category_scores_gemma":[0.00041976213,0.00029396516,0.00031758,0.0002421317,0.000092852075,0.00011383061,0.00043947375,0.00038970637,0.00023857619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008707221,0.000031042393,0.000004526407,0.000030043744,0.000067752364,0.00012367392,0.00012240358,0.000006528726,0.00007709876,0.9953065,0.0013552295,0.002866526],"study_design_scores_gemma":[0.00021974604,0.00019836111,0.0000068897757,0.000047247835,0.00004534553,0.000057834997,0.00001757938,0.000042539275,0.00023938999,0.8051395,0.19367014,0.00031547275],"about_ca_topic_score_codex":0.00001268241,"about_ca_topic_score_gemma":0.000011604874,"teacher_disagreement_score":0.798981,"about_ca_system_score_codex":0.00055392383,"about_ca_system_score_gemma":0.000310326,"threshold_uncertainty_score":0.99995124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05648843169031397,"score_gpt":0.29788884426290685,"score_spread":0.24140041257259287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027886768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009708962,0.00018399033,0.69083387,0.0032734834,0.0015195434,0.0010707377,0.00006812437,0.00075036625,0.30229017],"genre_scores_gemma":[0.6109488,0.00009719079,0.0023148875,0.0005647713,0.0006245946,0.00021094778,0.00025309727,0.00006813338,0.38491756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975015,0.000051410152,0.00060721004,0.0007599879,0.00045709684,0.0006227821],"domain_scores_gemma":[0.9984257,0.0002594421,0.00023253776,0.0006440272,0.00023495413,0.00020332162],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010002641,0.0003749463,0.0005724677,0.00056862115,0.00022734416,0.0003013237,0.00080373307,0.0005286948,0.000062080166],"category_scores_gemma":[0.00037381696,0.00032375567,0.00021516986,0.00033225358,0.000059638744,0.00018796642,0.00038135579,0.0004256005,0.0017184201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060668963,0.000017507717,0.000047509555,0.000015326681,0.000021472979,0.00013851891,0.0001964258,0.000022888273,0.000008625823,0.9946063,0.0025213591,0.0023979633],"study_design_scores_gemma":[0.00043291564,0.00020204108,0.00016885893,0.000056621127,0.000019551004,0.000030045585,0.000019760015,0.0007387966,0.000010536432,0.8328276,0.16499715,0.00049609866],"about_ca_topic_score_codex":0.000028643426,"about_ca_topic_score_gemma":0.00012254535,"teacher_disagreement_score":0.688519,"about_ca_system_score_codex":0.00088089367,"about_ca_system_score_gemma":0.00013827652,"threshold_uncertainty_score":0.99992144},"labels":[],"label_agreement":null},{"id":"W3032865349","doi":"10.1007/978-3-030-71430-7_5","title":"Beth Definability in the Logic KR","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Surjective function; Class (philosophy); Property (philosophy); Counterexample; Pure mathematics; Algebraic number; Epimorphism; Algebra over a field; Discrete mathematics; Computer science; Philosophy; Epistemology; Artificial intelligence","score_opus":0.03499427584012624,"score_gpt":0.3030185039617747,"score_spread":0.2680242281216485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032865349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044566452,0.0022229955,0.7514216,0.01765188,0.00062399334,0.00097556843,0.00022628492,0.00024380388,0.22658934],"genre_scores_gemma":[0.80792636,0.00075300474,0.032859266,0.018466491,0.000974413,0.0004660784,0.00048540067,0.000109123575,0.13795985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969649,0.00018921579,0.00058382866,0.001031964,0.00051819975,0.0007118945],"domain_scores_gemma":[0.99704236,0.00073912926,0.00021835967,0.0014993327,0.00034807585,0.0001527549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012069901,0.00048483908,0.0006670824,0.0002709161,0.00044375448,0.00031655023,0.0016790985,0.00040163615,0.00015413783],"category_scores_gemma":[0.0008203533,0.00034829098,0.00031131794,0.00045240624,0.0001424338,0.0002126587,0.0005970481,0.00092860026,0.00024810078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004785516,0.000039253573,0.00004312797,0.0000114819595,0.000015723423,0.00021141735,0.00016937229,0.00014098863,0.0000123243335,0.9971204,0.00086015527,0.0013709768],"study_design_scores_gemma":[0.00030647646,0.00014220126,0.00032927733,0.000115197414,0.000029359284,0.00006624009,0.000049056078,0.00012655013,0.000013361454,0.8996948,0.09863423,0.000493256],"about_ca_topic_score_codex":0.000009775197,"about_ca_topic_score_gemma":0.0000883914,"teacher_disagreement_score":0.8078818,"about_ca_system_score_codex":0.00089976116,"about_ca_system_score_gemma":0.0002713808,"threshold_uncertainty_score":0.9998969},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Homomorphism; Morphism; Mathematics; Pure mathematics; Epimorphism; Algebra over a field","score_opus":0.08019171290917283,"score_gpt":0.3874239778124438,"score_spread":0.307232264903271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139098693","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005244512,0.0021375224,0.2500878,0.0031291114,0.0006446196,0.0022603178,0.004135337,0.00038575643,0.73669505],"genre_scores_gemma":[0.073162615,0.0002474559,0.02290835,0.0002102148,0.00040025567,0.000101633785,0.00023610728,0.00021459404,0.90251875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976575,0.000042138578,0.00064281636,0.0005160727,0.00064312876,0.00049834925],"domain_scores_gemma":[0.9969384,0.0006568182,0.00026535132,0.0007978145,0.0011076578,0.00023395638],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005360698,0.00038287955,0.00090736087,0.00034807806,0.00019425892,0.000053782325,0.00037809036,0.00039785533,0.0019838219],"category_scores_gemma":[0.0024645878,0.00036604982,0.00030159956,0.00016666611,0.00014728564,0.00007202492,0.00036740612,0.00061933295,0.00019381581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001935768,0.000030000116,0.000008288687,0.000084339095,0.00012340581,0.00008532024,0.000055909844,0.000013518071,0.0011791578,0.9944181,0.0038083368,0.00017426927],"study_design_scores_gemma":[0.0005361748,0.00015640432,0.0000052811606,0.00074542954,0.00014820292,0.00003056962,0.0000438589,0.000018301504,0.0026744932,0.9257001,0.06942733,0.0005138332],"about_ca_topic_score_codex":0.0000031023135,"about_ca_topic_score_gemma":0.000014698749,"teacher_disagreement_score":0.22717945,"about_ca_system_score_codex":0.00088087417,"about_ca_system_score_gemma":0.00026022032,"threshold_uncertainty_score":0.9998791},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04624961978499363,"score_gpt":0.3143831604006192,"score_spread":0.26813354061562555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157573770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020613538,0.00020236729,0.546254,0.0055170334,0.00024718553,0.0030884845,0.014545521,0.00017597705,0.42790812],"genre_scores_gemma":[0.98011667,0.0000055166424,0.0000524004,0.00015390228,0.00022068624,0.00004377127,0.000578493,0.000041940424,0.01878664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822044,0.000118290365,0.0006386519,0.00039110033,0.0002761625,0.00035533894],"domain_scores_gemma":[0.9975696,0.0012046767,0.00034262854,0.0006130841,0.00019402118,0.00007599861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176275,0.00028901533,0.00046424082,0.00022454772,0.00038813127,0.00007824202,0.0003968115,0.00015453267,0.0002489127],"category_scores_gemma":[0.00011054972,0.00024046702,0.00024949608,0.00025704067,0.000119011354,0.000044316843,0.0001350754,0.0004894262,0.00012258148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011480039,0.00003817674,0.00004126322,0.000009176744,0.000059803377,0.0000014104384,0.0004443786,0.00048790476,0.00012951552,0.99755365,0.0008988798,0.00032438603],"study_design_scores_gemma":[0.00031093427,0.000034901746,0.000043746768,0.00022987163,0.000115584444,3.9374567e-7,0.0007120797,0.0007205548,0.00006464674,0.95750755,0.039995663,0.0002640958],"about_ca_topic_score_codex":0.000033261025,"about_ca_topic_score_gemma":0.000025058158,"teacher_disagreement_score":0.9780553,"about_ca_system_score_codex":0.00014756816,"about_ca_system_score_gemma":0.00009079046,"threshold_uncertainty_score":0.98059607},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1268991817977339,"score_gpt":0.3452532194782565,"score_spread":0.21835403768052258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165859977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057069624,0.00065089157,0.55225974,0.0018577008,0.0007113356,0.0006537935,0.000070385424,0.0002976521,0.4434928],"genre_scores_gemma":[0.6054808,0.00014647271,0.010717367,0.0012107332,0.0010043775,0.00017697712,0.00024022895,0.000080202946,0.38094285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769545,0.00007058441,0.0004728839,0.0008696757,0.0003928453,0.0004985417],"domain_scores_gemma":[0.9981927,0.00019667113,0.0002931114,0.0007276226,0.00036933672,0.0002205309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056455005,0.00039430422,0.00056892086,0.0002822927,0.00089294213,0.0006450489,0.00047551273,0.0003187517,0.00005052406],"category_scores_gemma":[0.000268131,0.00035371733,0.00016250944,0.00019920264,0.00013617561,0.00014327902,0.00046313516,0.0004898502,0.000091241076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004915198,0.000026302256,0.000021248601,0.000030768373,0.000059783495,0.000044495784,0.00013561094,0.00002186877,0.0000434168,0.9982194,0.00038986513,0.001002353],"study_design_scores_gemma":[0.00032279384,0.0002778533,0.000060497627,0.00013114723,0.000051120325,0.00010061189,0.000033755692,0.00047241617,0.000100138306,0.3741526,0.6237309,0.0005661685],"about_ca_topic_score_codex":0.000011624404,"about_ca_topic_score_gemma":0.0000912007,"teacher_disagreement_score":0.62406677,"about_ca_system_score_codex":0.00044571565,"about_ca_system_score_gemma":0.00017438523,"threshold_uncertainty_score":0.99989146},"labels":[],"label_agreement":null},{"id":"W3203856738","doi":"10.1007/978-3-030-71430-7_21","title":"Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"USable; T-norm fuzzy logics; Monoidal t-norm logic; Computer science; Mathematics; Epistemology; Calculus (dental); Artificial intelligence; Philosophy; World Wide Web; Medicine","score_opus":0.06715081971613869,"score_gpt":0.34644134189785775,"score_spread":0.27929052218171907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203856738","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001774668,0.0022910037,0.8932208,0.022897076,0.0012916618,0.0010951224,0.0023445636,0.0007008751,0.07614119],"genre_scores_gemma":[0.113515794,0.0014445669,0.085205205,0.02465768,0.0034583048,0.0006403194,0.002913309,0.00029903694,0.7678658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522704,0.00013881763,0.0008644507,0.0017201673,0.0008487007,0.0012008526],"domain_scores_gemma":[0.9960712,0.0006041994,0.0004180741,0.0013621686,0.00082789315,0.0007164312],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074589934,0.00083209947,0.0011727702,0.0007213875,0.0010629975,0.0006410335,0.0015418585,0.0006316505,0.00061936706],"category_scores_gemma":[0.001118806,0.0008183398,0.0005144876,0.0004849827,0.00013069496,0.00047758335,0.0011335294,0.0008959986,0.0013201014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001411208,0.000037133395,0.000002862423,0.000018236831,0.000107991276,0.0003000879,0.00009840503,0.0013984017,0.0004075297,0.99043787,0.00552283,0.0016545621],"study_design_scores_gemma":[0.0005870546,0.00022395366,0.0000493443,0.0005220913,0.000086297805,0.00006668781,0.00004177649,0.00055634376,0.00020052906,0.7448621,0.25160024,0.001203584],"about_ca_topic_score_codex":0.0000046816954,"about_ca_topic_score_gemma":0.000012722875,"teacher_disagreement_score":0.8080155,"about_ca_system_score_codex":0.0014461305,"about_ca_system_score_gemma":0.0004496182,"threshold_uncertainty_score":0.9994575},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing","score_opus":0.025862112458300404,"score_gpt":0.27976023040982906,"score_spread":0.25389811795152867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385444120","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063417734,0.0009357635,0.9011403,0.007537748,0.0027640571,0.001630582,0.0013708452,0.0021668796,0.082390435],"genre_scores_gemma":[0.36325777,0.00040275126,0.04113862,0.0014640287,0.0016066324,0.00014970888,0.0011460057,0.00035618694,0.5904783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965464,0.00011827934,0.00068673794,0.0012323739,0.0006046541,0.0008115457],"domain_scores_gemma":[0.9975851,0.0005880875,0.0002528468,0.000977725,0.00033254098,0.0002636996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086304115,0.00059131207,0.00083203265,0.0009455767,0.00036064157,0.00034808487,0.0014203452,0.00053429184,0.00020481402],"category_scores_gemma":[0.00088618015,0.00056905346,0.00024893295,0.00062224735,0.00008449114,0.00018784555,0.0013712437,0.0014632967,0.0005082139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008612454,0.000018244738,0.00024633412,0.000023161663,0.000042980442,0.00023415507,0.00020588435,0.004990309,0.000050930557,0.98761225,0.0006157707,0.0059513934],"study_design_scores_gemma":[0.0008771774,0.0003354938,0.0007048777,0.0003198971,0.00004335489,0.00007150984,0.000012229716,0.05034834,0.000035191897,0.8486156,0.097309396,0.0013269435],"about_ca_topic_score_codex":0.00004896473,"about_ca_topic_score_gemma":0.00034848516,"teacher_disagreement_score":0.8600016,"about_ca_system_score_codex":0.0014484205,"about_ca_system_score_gemma":0.00020449364,"threshold_uncertainty_score":0.9996761},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10555806707246979,"score_gpt":0.32801872083017863,"score_spread":0.22246065375770885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385444777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003874116,0.00018436636,0.97776055,0.014161672,0.0004743009,0.00070763845,0.0005568649,0.000477223,0.0056386404],"genre_scores_gemma":[0.9693474,0.00002319941,0.011869495,0.0017371764,0.00017936365,0.00013313683,0.0004190014,0.00004574171,0.016245443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99608576,0.0001493106,0.0008916411,0.001100645,0.0010306706,0.0007419833],"domain_scores_gemma":[0.9972296,0.0007527434,0.00031392934,0.0006871148,0.00066446053,0.00035214916],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002773672,0.0004495249,0.0008670546,0.0016791027,0.00033905692,0.00039844296,0.0010365432,0.0003182131,0.0000560802],"category_scores_gemma":[0.0026985782,0.00040383777,0.00028983562,0.0022728676,0.000065211636,0.00016564739,0.0005147916,0.00044299176,0.0009883237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002851661,0.00006217874,0.00026797503,0.000017613645,0.00009099939,0.000101623766,0.00007005452,0.006348816,0.000017283975,0.97468084,0.0043549533,0.013959114],"study_design_scores_gemma":[0.0023375822,0.00064764835,0.0065645883,0.0016326836,0.0002727794,0.0000071644827,0.00007040579,0.027069785,0.000060933686,0.9033792,0.055431765,0.0025254316],"about_ca_topic_score_codex":0.00008505104,"about_ca_topic_score_gemma":0.00019701025,"teacher_disagreement_score":0.9693087,"about_ca_system_score_codex":0.0011410431,"about_ca_system_score_gemma":0.00016773105,"threshold_uncertainty_score":0.99984133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044381974305231824,"score_gpt":0.30095761357657846,"score_spread":0.25657563927134663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388996076","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013948267,0.0054903356,0.8940468,0.009333738,0.0023190673,0.0019543492,0.0011713998,0.0011570803,0.08451328],"genre_scores_gemma":[0.054687414,0.0031117434,0.015928475,0.0009930781,0.0011906377,0.0003478155,0.00023119265,0.00017385438,0.9233358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968074,0.00004139925,0.00060163444,0.0012632186,0.0003873165,0.00089903193],"domain_scores_gemma":[0.9960503,0.0015426537,0.00037776158,0.0008289176,0.00087052,0.00032986634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008035239,0.00062462466,0.0008599284,0.0003570538,0.00072118867,0.0003391878,0.0010183824,0.00055226515,0.000023307408],"category_scores_gemma":[0.0034007179,0.0005657787,0.00028211813,0.00028939891,0.00010277391,0.00025357565,0.00067079643,0.0005053801,0.0006227824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016948681,0.00001562851,0.0000063772263,0.0000893775,0.00005621283,0.000051026313,0.0001085241,0.000050167513,0.000078894074,0.98794615,0.010224799,0.0013559046],"study_design_scores_gemma":[0.00075875473,0.00039751598,0.000029491966,0.00052408554,0.0001048728,0.00004927686,0.0000065314234,0.0059721656,0.00011433451,0.6674384,0.32367998,0.00092459336],"about_ca_topic_score_codex":0.0000019466265,"about_ca_topic_score_gemma":0.000063506166,"teacher_disagreement_score":0.87811834,"about_ca_system_score_codex":0.00048011384,"about_ca_system_score_gemma":0.00020152838,"threshold_uncertainty_score":0.9996794},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Logical consequence; Binary number; Textual entailment; Computer science; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.02701303931922408,"score_gpt":0.3029527247962412,"score_spread":0.2759396854770171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403078881","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014514965,0.0091301305,0.16876888,0.003644287,0.0021333513,0.00096315343,0.0005285555,0.00085004745,0.81383646],"genre_scores_gemma":[0.36639482,0.00039856468,0.0024548564,0.0005193833,0.0005807247,0.00007870162,0.00010701026,0.000057502275,0.6294085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753374,0.000034692024,0.00043420738,0.0011445465,0.00031208328,0.0005407134],"domain_scores_gemma":[0.99824506,0.0002116561,0.00015936693,0.00080641336,0.00024439473,0.0003330888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006102301,0.00047408688,0.00055043626,0.0003715485,0.00043477796,0.00069703243,0.0008270335,0.00036612505,0.00017505122],"category_scores_gemma":[0.00019336023,0.0003983407,0.00022119505,0.0001978131,0.00013535687,0.00028045112,0.0012869821,0.0004868063,0.0007333727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007310512,0.000026918013,0.00007783677,0.000049772356,0.000066033645,0.0001040281,0.00020821227,0.0000019466281,0.000089856825,0.9913373,0.006543984,0.0014867717],"study_design_scores_gemma":[0.0004040084,0.00031361752,0.00018795616,0.00043308476,0.00013984072,0.000060150105,0.000019452369,0.0010102078,0.0000924923,0.63370126,0.3628461,0.0007918134],"about_ca_topic_score_codex":0.0000071637064,"about_ca_topic_score_gemma":0.000017586175,"teacher_disagreement_score":0.36624965,"about_ca_system_score_codex":0.00079316244,"about_ca_system_score_gemma":0.00017032998,"threshold_uncertainty_score":0.9998469},"labels":[],"label_agreement":null}]}