{"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0143492175,0.0041136076,0.081542976,0.002762113,0.0010180544,0.000023817543,0.00011325673,0.00035602174,0.895721],"genre_scores_gemma":[0.32755667,0.0052631297,0.030559419,0.0014506557,0.0011081303,0.00009183311,0.00025241528,0.00071089016,0.6330069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995572,0.00010662932,0.000021149051,0.000077618584,0.00016942386,0.00006800038],"domain_scores_gemma":[0.99952006,0.00023523207,0.000029673103,0.00007752945,0.00010012571,0.000037455087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559084,0.000650252,0.0004735459,0.001343694,0.0016024199,0.0027498873,0.00097529276,0.0010391858,0.01648546],"category_scores_gemma":[0.0016875748,0.00048555763,0.0005922198,0.0015233721,0.0022630221,0.006126305,0.002015415,0.0031556378,0.005746431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046376977,0.0000036896188,0.000008881264,0.000015833652,0.0000010732283,0.000012063726,0.00009403383,0.00006943512,0.00016758962,0.9933176,0.0024749145,0.0038303141],"study_design_scores_gemma":[0.000003858059,0.0000041705457,0.000030016254,0.000030225601,0.000004712715,0.000097744065,0.00006305831,0.0005172022,0.00046287154,0.94246864,0.056309685,0.000007839172],"about_ca_topic_score_codex":0.0006754559,"about_ca_topic_score_gemma":0.0007313699,"teacher_disagreement_score":0.01648546,"about_ca_system_score_codex":0.0015182218,"about_ca_system_score_gemma":0.0007567252,"threshold_uncertainty_score":0.055149317},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00653763,0.10701738,0.24407604,0.060740307,0.012029283,0.00012045201,0.0006604964,0.0009838984,0.5678346],"genre_scores_gemma":[0.33681974,0.07687925,0.13004237,0.015958698,0.018081482,0.00042817392,0.0011762802,0.0010011101,0.41961294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790287,0.0006811673,0.00011728947,0.00044801718,0.00073086494,0.00011978487],"domain_scores_gemma":[0.99733233,0.0019285724,0.0000718947,0.00020479232,0.0003616577,0.00010072856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019486451,0.0010022154,0.0009412989,0.0023594417,0.002085619,0.004740536,0.0010613514,0.001611411,0.008770429],"category_scores_gemma":[0.0076458273,0.000715424,0.0009922925,0.002352005,0.006576011,0.0076938854,0.00309914,0.0055344244,0.004291756],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017349576,0.000013585928,0.00007121892,0.00015420934,0.000009992684,0.000043140964,0.00036890467,0.00048098387,0.00024278612,0.9426963,0.029499946,0.026401684],"study_design_scores_gemma":[0.0000075915077,0.000006412915,0.000096053416,0.00012580778,0.0000093147855,0.00008810231,0.000052830263,0.0006797104,0.0003323872,0.78396535,0.21462014,0.00001620345],"about_ca_topic_score_codex":0.0016632299,"about_ca_topic_score_gemma":0.0013757102,"teacher_disagreement_score":0.008770429,"about_ca_system_score_codex":0.0038976579,"about_ca_system_score_gemma":0.0023574985,"threshold_uncertainty_score":0.029340029},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00917788,0.00025549703,0.9712995,0.00068413554,0.0001455062,0.00011303669,0.00022886667,0.0010258207,0.01706961],"genre_scores_gemma":[0.34512934,0.00041231283,0.63850313,0.0005479582,0.00026820062,0.00042643966,0.0005119048,0.0007486576,0.013452172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688596,0.0011952748,0.00022732234,0.00061670167,0.00081997167,0.00025472447],"domain_scores_gemma":[0.99487597,0.0030410103,0.0002458901,0.0009868394,0.00069851114,0.00015177017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00395462,0.0012360428,0.0014005897,0.0022125305,0.0032233926,0.0035185833,0.0034383312,0.0021781134,0.014389238],"category_scores_gemma":[0.018594198,0.0011781545,0.0041892063,0.0024163865,0.004412069,0.0116056735,0.004061474,0.00586429,0.0018638568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014570608,0.000009710247,0.000066627,0.00002301744,0.000010864449,0.00002811238,0.00008418763,0.0034794267,0.00026080178,0.9877815,0.00085603807,0.007385156],"study_design_scores_gemma":[0.0000050185095,0.0000054629195,0.000032675056,0.000012525515,0.00001019912,0.000011105735,0.000019873063,0.025882343,0.00042019913,0.9717283,0.0018600561,0.000012183255],"about_ca_topic_score_codex":0.005392999,"about_ca_topic_score_gemma":0.0049886634,"teacher_disagreement_score":0.014389238,"about_ca_system_score_codex":0.0028768883,"about_ca_system_score_gemma":0.0024238636,"threshold_uncertainty_score":0.04813683},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043448363,0.009745666,0.0377494,0.0015459321,0.000814581,0.000016561982,0.00026421828,0.00035951368,0.94515914],"genre_scores_gemma":[0.14758515,0.010305348,0.024255939,0.0013153986,0.0012629488,0.000071738956,0.0010640371,0.00047022844,0.81366915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996081,0.000056898338,0.000012732802,0.00008101497,0.00020381597,0.000037437814],"domain_scores_gemma":[0.999724,0.00008325194,0.000014221716,0.00006650685,0.00008469072,0.000027349282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000354735,0.0005486395,0.000464627,0.0013673283,0.0010771208,0.0030188432,0.0006310795,0.00059858634,0.028661067],"category_scores_gemma":[0.00101143,0.00031253297,0.00038125136,0.0012084213,0.0017394652,0.004455227,0.0018943145,0.0024013722,0.00670199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054287593,0.000005726791,0.00002828099,0.000033607736,0.0000019122201,0.000012424326,0.000110169465,0.00009958498,0.00026322986,0.96143967,0.015898427,0.022101635],"study_design_scores_gemma":[0.0000023608197,0.000005940916,0.000119764736,0.00003660059,0.0000033560032,0.00012746385,0.00006497649,0.00038984578,0.0003139978,0.71020013,0.28873077,0.00000475247],"about_ca_topic_score_codex":0.00085603195,"about_ca_topic_score_gemma":0.0011282488,"teacher_disagreement_score":0.028661067,"about_ca_system_score_codex":0.0013014773,"about_ca_system_score_gemma":0.000661799,"threshold_uncertainty_score":0.095880866},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003951411,0.02309903,0.055907708,0.009706892,0.0013523096,0.0000147297405,0.0001972747,0.00032147794,0.90544915],"genre_scores_gemma":[0.25612158,0.020251729,0.033002928,0.0037057316,0.004225146,0.00011476937,0.0005217073,0.00035876324,0.68169767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933726,0.00019116595,0.00001642303,0.0001011631,0.00028506006,0.000068842455],"domain_scores_gemma":[0.99936146,0.00034151907,0.00002412709,0.00010640296,0.00011468425,0.000051760115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006418188,0.00038392883,0.0004079669,0.0009519255,0.0017953363,0.0038471753,0.00087668764,0.00096028787,0.015231561],"category_scores_gemma":[0.0019536372,0.00028003257,0.00039227394,0.0015041606,0.0046740095,0.004843382,0.001474244,0.0028516676,0.0036651222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024964197,0.0000032665757,0.000034193436,0.000012484385,8.040758e-7,0.000006335001,0.00010326714,0.00009211244,0.000051941133,0.9817222,0.009603602,0.008367344],"study_design_scores_gemma":[0.000001329278,0.0000019433771,0.00006279622,0.000016096012,9.806203e-7,0.000022352706,0.00004259196,0.000276762,0.00004466831,0.90538925,0.09413893,0.0000022858255],"about_ca_topic_score_codex":0.0022139286,"about_ca_topic_score_gemma":0.00294901,"teacher_disagreement_score":0.015231561,"about_ca_system_score_codex":0.0026316,"about_ca_system_score_gemma":0.0013470678,"threshold_uncertainty_score":0.05095458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005790523,0.0043817423,0.79365784,0.0033281348,0.00069021905,0.00007170619,0.00033267512,0.00072215166,0.191025],"genre_scores_gemma":[0.30341044,0.007285035,0.49031287,0.0028644158,0.0024267961,0.0006458715,0.0016100527,0.0020502843,0.18939425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762136,0.0007385119,0.00017065114,0.0005982668,0.0007372428,0.00013396886],"domain_scores_gemma":[0.9979989,0.0010834982,0.000075764394,0.00048033672,0.00030459033,0.000056935878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023708032,0.0010335384,0.001194924,0.0015605978,0.0013905732,0.0048280004,0.0021692119,0.00125175,0.018882055],"category_scores_gemma":[0.007440811,0.0006769332,0.0016285403,0.0017779372,0.0054206336,0.009731994,0.0047841114,0.0052757254,0.004357493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010775417,0.000008808674,0.000037183294,0.000075636766,0.000008443787,0.000012175751,0.00008256573,0.00087819673,0.00027614666,0.9687848,0.004267865,0.02555755],"study_design_scores_gemma":[0.0000036640395,0.000003817552,0.000017335871,0.000018351324,0.0000040673963,0.000021098105,0.000015356107,0.002327046,0.0002861206,0.98616403,0.011134845,0.000004365702],"about_ca_topic_score_codex":0.00063976954,"about_ca_topic_score_gemma":0.00077501684,"teacher_disagreement_score":0.018882055,"about_ca_system_score_codex":0.0021453,"about_ca_system_score_gemma":0.00095200806,"threshold_uncertainty_score":0.0631668},"labels":[],"label_agreement":null},{"id":"W3032865349","doi":"10.1007/978-3-030-71430-7_5","title":"Beth Definability in the Logic KR","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Surjective function; Class (philosophy); Property (philosophy); Counterexample; Pure mathematics; Algebraic number; Epimorphism; Algebra over a field; Discrete mathematics; Computer science; Philosophy; Epistemology; Artificial intelligence","score_opus":0.03499427584012624,"score_gpt":0.3030185039617747,"score_spread":0.2680242281216485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032865349","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006452012,0.015595803,0.05342993,0.004702205,0.0010763983,0.000029689034,0.00021477559,0.0001783783,0.9183208],"genre_scores_gemma":[0.3978927,0.02029933,0.043924876,0.0030016976,0.0035107108,0.00012291504,0.00060371915,0.00035378995,0.5302902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999567,0.00010717958,0.000017105594,0.00009385817,0.0001703872,0.000044428616],"domain_scores_gemma":[0.99960345,0.0002503931,0.000017000895,0.000050102502,0.000055585704,0.000023544279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005666013,0.0005503451,0.0006396978,0.0011120108,0.0013832597,0.0029591925,0.0007091745,0.00083716935,0.011622181],"category_scores_gemma":[0.001362509,0.0004958776,0.00048725182,0.0013315971,0.0043928456,0.0058091544,0.0011780239,0.0037567,0.0026000908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004247764,0.0000039353567,0.00001084053,0.00002102893,0.0000013004636,0.0000073191663,0.00005933919,0.00014121854,0.00009181311,0.9894135,0.004545712,0.0056996755],"study_design_scores_gemma":[0.000003218872,0.0000029934938,0.00005665658,0.000021428215,0.0000024534568,0.00003123173,0.000021727956,0.00042476717,0.00013480772,0.95135456,0.04794215,0.000003997456],"about_ca_topic_score_codex":0.0019340328,"about_ca_topic_score_gemma":0.0021732769,"teacher_disagreement_score":0.011622181,"about_ca_system_score_codex":0.0024506839,"about_ca_system_score_gemma":0.000729143,"threshold_uncertainty_score":0.03888011},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033210514,0.01679989,0.018987346,0.002713976,0.0010907616,0.000014276595,0.00013669224,0.00018432266,0.95675164],"genre_scores_gemma":[0.19418657,0.015793901,0.017434398,0.0014938941,0.0034047873,0.00007049193,0.00032802136,0.00027939133,0.7670086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996401,0.0001224552,0.000011411984,0.00006183874,0.00012867473,0.00003547424],"domain_scores_gemma":[0.99973613,0.00010949459,0.00001564499,0.000055038752,0.00005406189,0.000029657956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005185288,0.0005513658,0.0003889029,0.0012879377,0.0013724262,0.003792335,0.000520856,0.0006475748,0.015357192],"category_scores_gemma":[0.0011578017,0.00032844397,0.00032395063,0.0011270392,0.0034530198,0.004559285,0.0014011726,0.0022623257,0.0037562794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019507638,0.0000024006274,0.0000164745,0.000010697356,8.3771624e-7,0.0000047322233,0.00011161261,0.000049563092,0.0000543681,0.9874055,0.0073766443,0.0049652727],"study_design_scores_gemma":[0.0000019737813,0.0000029589926,0.000091951006,0.00001842582,0.0000016866665,0.000042423766,0.000064105094,0.00018627265,0.00007028404,0.8211493,0.17836802,0.0000026940368],"about_ca_topic_score_codex":0.0014122664,"about_ca_topic_score_gemma":0.0015354172,"teacher_disagreement_score":0.015357192,"about_ca_system_score_codex":0.0020814103,"about_ca_system_score_gemma":0.00074851466,"threshold_uncertainty_score":0.051374912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35410598,0.0022044554,0.45403466,0.011310819,0.0014430063,0.00014245628,0.0008709432,0.0011560653,0.17473166],"genre_scores_gemma":[0.9232489,0.0004551359,0.05424379,0.0009998467,0.0002100592,0.00020446339,0.00020532082,0.000564548,0.01986787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928457,0.00042457657,0.000017545339,0.00007248687,0.0001173745,0.00008359548],"domain_scores_gemma":[0.9951338,0.0040572593,0.00009089155,0.00035431606,0.00014582931,0.00021787226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018737295,0.00045270042,0.0019695284,0.0004287243,0.001415895,0.0021395271,0.0023777934,0.0026726793,0.01959685],"category_scores_gemma":[0.009797393,0.00076242466,0.0008164828,0.0006945891,0.0034540014,0.005480457,0.0029575345,0.003263853,0.0008080274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008190868,0.00003628978,0.00016412753,0.00004773205,0.000021995127,0.000056371187,0.00015752006,0.12975203,0.00037890338,0.86380506,0.0024864986,0.0030116518],"study_design_scores_gemma":[0.0000356922,0.000011578713,0.00004366574,0.000013971935,0.0000063675543,0.0000073372275,0.000035386893,0.51118636,0.00019831923,0.4872388,0.0012083295,0.000014132886],"about_ca_topic_score_codex":0.0040449738,"about_ca_topic_score_gemma":0.003939617,"teacher_disagreement_score":0.01959685,"about_ca_system_score_codex":0.0013108673,"about_ca_system_score_gemma":0.0012539285,"threshold_uncertainty_score":0.06555796},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00692273,0.044283453,0.14549549,0.21824172,0.00632946,0.00003903636,0.00034844864,0.00044480342,0.5778948],"genre_scores_gemma":[0.425755,0.055365592,0.11255928,0.039654806,0.030653419,0.00037166267,0.00061341457,0.0017850149,0.3332418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961479,0.0014866372,0.00013863576,0.00048271197,0.0014575624,0.0002866675],"domain_scores_gemma":[0.966654,0.028762957,0.0004967485,0.0016319224,0.0020027137,0.00045156255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054462315,0.00089719397,0.0011898448,0.0024002106,0.0025723504,0.00781897,0.0031986649,0.0030102204,0.02119985],"category_scores_gemma":[0.022304969,0.0008010257,0.0008125865,0.0030023216,0.016357757,0.035417,0.0035237232,0.013050441,0.0031006017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004229071,0.0000061960654,0.000016890492,0.000024359424,0.00000133032,0.000005947338,0.00005200827,0.00019964165,0.000016405427,0.9847136,0.011085684,0.0038735976],"study_design_scores_gemma":[0.000003226288,0.0000011106283,0.000021938884,0.00002766878,0.0000010865139,0.0000124626295,0.000028070777,0.0003196742,0.000042326996,0.9698307,0.029708685,0.000002963905],"about_ca_topic_score_codex":0.0030334655,"about_ca_topic_score_gemma":0.0026851683,"teacher_disagreement_score":0.02119985,"about_ca_system_score_codex":0.0066030202,"about_ca_system_score_gemma":0.002097124,"threshold_uncertainty_score":0.07092059},"labels":[],"label_agreement":null},{"id":"W3203856738","doi":"10.1007/978-3-030-71430-7_21","title":"Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics","year":2021,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"USable; T-norm fuzzy logics; Monoidal t-norm logic; Computer science; Mathematics; Epistemology; Calculus (dental); Artificial intelligence; Philosophy; World Wide Web; Medicine","score_opus":0.06715081971613869,"score_gpt":0.34644134189785775,"score_spread":0.27929052218171907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203856738","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018693296,0.011029253,0.6836862,0.015951429,0.0024907375,0.000065105516,0.00031143037,0.0012645113,0.26650807],"genre_scores_gemma":[0.4377339,0.014717365,0.4161492,0.0066939844,0.0043517896,0.0002034712,0.00057771965,0.0010959371,0.11847673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.0005593659,0.00009775327,0.00026422396,0.00036500604,0.00010229],"domain_scores_gemma":[0.99648225,0.0025097588,0.000059525704,0.00053433585,0.00030673385,0.000107405824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034250943,0.0009077088,0.00080942764,0.0012294948,0.0018909122,0.0041943616,0.0021253393,0.001623729,0.0118930135],"category_scores_gemma":[0.006017538,0.0007652456,0.0013532947,0.0022555292,0.00729363,0.019634593,0.0024126894,0.007119598,0.0023214158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067571063,0.000009361293,0.000032877302,0.00004456706,0.0000037308528,0.000024156026,0.000117541575,0.0005192527,0.00012530864,0.9809717,0.0027829495,0.015361748],"study_design_scores_gemma":[0.0000027622411,0.0000028107106,0.000023161181,0.000019193092,0.0000047122962,0.000038026647,0.000022057136,0.0015848398,0.00019516388,0.9867269,0.011373489,0.0000069735934],"about_ca_topic_score_codex":0.0018472878,"about_ca_topic_score_gemma":0.0019310098,"teacher_disagreement_score":0.0118930135,"about_ca_system_score_codex":0.002034604,"about_ca_system_score_gemma":0.00089146005,"threshold_uncertainty_score":0.03978604},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063124937,0.16021483,0.27966073,0.019059503,0.004585404,0.00007161982,0.0005528999,0.00079024973,0.5287522],"genre_scores_gemma":[0.24446118,0.095251665,0.1692179,0.00514266,0.012169192,0.00029347028,0.0012583329,0.0006266676,0.47157893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999684,0.00009243827,0.000010508711,0.00006816614,0.00012579099,0.000019064895],"domain_scores_gemma":[0.99942136,0.00037429325,0.000023371173,0.000085473126,0.00006714136,0.000028366609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322603,0.0006324415,0.0006108874,0.0011087175,0.0009293841,0.002417114,0.00070554845,0.0008063625,0.012615549],"category_scores_gemma":[0.002005029,0.00040302525,0.00033231048,0.0017576881,0.0028120684,0.0033484655,0.0011033524,0.0026052126,0.0045191315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101365,0.000017962846,0.00012945861,0.00014864233,0.000011076366,0.000022180393,0.0001349043,0.0018484471,0.0002523028,0.8526277,0.050784603,0.094012626],"study_design_scores_gemma":[0.0000031742209,0.0000069305247,0.000103044695,0.000060466435,0.0000036963393,0.000032699456,0.000020729534,0.002186821,0.00015531755,0.89799577,0.099426694,0.0000045601323],"about_ca_topic_score_codex":0.0010950597,"about_ca_topic_score_gemma":0.0017235711,"teacher_disagreement_score":0.012615549,"about_ca_system_score_codex":0.0013621093,"about_ca_system_score_gemma":0.00092499744,"threshold_uncertainty_score":0.042203248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034772564,0.021546297,0.63520765,0.037207328,0.0021039539,0.00008832889,0.00025532764,0.0005999122,0.26821864],"genre_scores_gemma":[0.8596071,0.009252842,0.10366118,0.0027573463,0.0019485817,0.00015142818,0.0001440216,0.00028075997,0.022196729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978532,0.0010315991,0.000094471216,0.00027525972,0.0006187788,0.00012666058],"domain_scores_gemma":[0.99533796,0.003360675,0.00015069208,0.0007947555,0.00023390539,0.00012207421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032593948,0.0006864821,0.0011821064,0.0009902805,0.0021634889,0.0067416904,0.0022988971,0.0024636972,0.004460918],"category_scores_gemma":[0.009974049,0.00077129283,0.0008273346,0.0017460214,0.017341146,0.016278071,0.0038499285,0.006894383,0.00063385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003073904,0.000003823602,0.000011451259,0.000014693852,0.0000023274586,0.000009201951,0.000101709295,0.00032484552,0.00006117845,0.9967685,0.0006561775,0.0020431038],"study_design_scores_gemma":[0.000001025762,0.0000010633453,0.0000056551307,0.0000047682192,7.7594746e-7,0.0000052296177,0.000014749527,0.0007684306,0.000032857657,0.99797696,0.0011866189,0.0000019355623],"about_ca_topic_score_codex":0.00080085435,"about_ca_topic_score_gemma":0.0008908521,"teacher_disagreement_score":0.0067416904,"about_ca_system_score_codex":0.0017933795,"about_ca_system_score_gemma":0.0012193943,"threshold_uncertainty_score":0.017237484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007139379,0.012710538,0.5225898,0.018259162,0.0014649774,0.00015001123,0.00056440604,0.00076170726,0.43636003],"genre_scores_gemma":[0.5841439,0.007896658,0.23676427,0.007892822,0.0037966075,0.0005117166,0.00089143054,0.00078520546,0.15731737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728096,0.00073396397,0.00021698767,0.00073813,0.00083822117,0.00019173471],"domain_scores_gemma":[0.99802774,0.0010844268,0.00007629597,0.00035906708,0.00038643592,0.00006601934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029970193,0.00087056396,0.0011062293,0.0040836204,0.0034353652,0.005488431,0.0016626029,0.003450297,0.011122386],"category_scores_gemma":[0.008442305,0.0010198662,0.0016985469,0.0033052722,0.008214412,0.017447658,0.0029167691,0.0056487345,0.0023881895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060312805,0.000005371817,0.000020680704,0.00003286867,0.0000034987897,0.000018073863,0.00015883787,0.00018728583,0.000106496416,0.98740923,0.0043806406,0.0076708836],"study_design_scores_gemma":[0.0000049093214,0.0000035861844,0.000033237415,0.000021153637,0.0000049850246,0.000061732244,0.000024447085,0.0005123318,0.00014033045,0.96184653,0.03733937,0.0000075406056],"about_ca_topic_score_codex":0.0031620476,"about_ca_topic_score_gemma":0.0024182184,"teacher_disagreement_score":0.011122386,"about_ca_system_score_codex":0.0037836023,"about_ca_system_score_gemma":0.0013553287,"threshold_uncertainty_score":0.03720808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021160875,0.050626155,0.22524348,0.010059345,0.0011256707,0.000041062893,0.00027470101,0.00046685635,0.69100195],"genre_scores_gemma":[0.65331256,0.02493904,0.080804974,0.0018566183,0.0031185083,0.0001399539,0.00052353065,0.00031126474,0.23499355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.00018284319,0.000031155556,0.00011765063,0.00017802484,0.00005243218],"domain_scores_gemma":[0.9990402,0.00069762423,0.000044627366,0.000110293484,0.00007621272,0.000031012216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073489745,0.0004272755,0.00050769973,0.0010300748,0.0013568896,0.002888864,0.0007382238,0.0011776917,0.011095158],"category_scores_gemma":[0.0027925477,0.00034831424,0.00046452577,0.0014388813,0.004994319,0.008173745,0.001610362,0.0025686047,0.0016457747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007425868,0.0000043701534,0.000031491767,0.00003815114,0.0000015874388,0.00001686107,0.0001319713,0.000139444,0.00009754015,0.9856221,0.003525241,0.010383848],"study_design_scores_gemma":[0.0000020325394,0.0000022366207,0.00003932911,0.00001563142,0.0000016646536,0.00003541833,0.000026903223,0.00032001562,0.00009531047,0.98089725,0.01856206,0.0000021583182],"about_ca_topic_score_codex":0.0011560847,"about_ca_topic_score_gemma":0.0013512508,"teacher_disagreement_score":0.011095158,"about_ca_system_score_codex":0.0013164011,"about_ca_system_score_gemma":0.00065398443,"threshold_uncertainty_score":0.037117004},"labels":[],"label_agreement":null}]}