{"meta":{"query_hash":"49dbef81ff3f","filters":{"venue":"Studia Logica"},"cohort_total":30,"direct_labels_cover":0,"predictions_cover":30,"exported":30,"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/49dbef81ff3f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Studia+Logica"},"results":[{"id":"W119121478","doi":"10.1007/s11225-007-9035-z","title":"John Woods, Paradox and Paraconsistency: Conflict Resolution in the Abstract Sciences","year":2007,"lang":"en","type":"article","venue":"Studia Logica","topic":"Philosophy and History of Science","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Paraconsistent logic; Computational linguistics; Resolution (logic); Epistemology; Philosophy; Computer science; Linguistics; Artificial intelligence","score_opus":0.14163548252509434,"score_gpt":0.29093566472619725,"score_spread":0.14930018220110292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119121478","genre_codex":"other","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.20860709,0.002139851,0.0000021422984,0.0020204901,0.00020943482,0.00013000052,0.000004179943,0.000021138703,0.78686565],"genre_scores_gemma":[0.99858075,0.00011072861,0.00004185433,0.0008382813,0.00021138263,0.0000061022247,5.711295e-7,0.0000016587064,0.00020865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991468,0.000028782404,0.00016745662,0.0002085399,0.00021599176,0.0002323991],"domain_scores_gemma":[0.9995905,0.00019801453,0.000062174935,0.00009600321,0.000022162016,0.000031127616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013874986,0.00008363808,0.00010423856,0.0000764178,0.0010562339,0.00010314716,0.00021626518,0.00002322971,0.00012284605],"category_scores_gemma":[0.0000448389,0.00005019595,0.000027163731,0.0000739457,0.0019290618,0.0001818178,0.000026685624,0.0001222184,0.000030215777],"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.000014190145,0.00007296035,0.000633841,0.000005041808,0.0000035924927,0.000021595532,0.029440882,0.0000019090755,0.000040103503,0.96682334,0.0016925698,0.0012499752],"study_design_scores_gemma":[0.00026519469,0.00033615387,0.18972255,0.000024798388,0.000011951864,0.000011198963,0.016934497,0.0000073375763,0.0000070948427,0.04735002,0.74510837,0.00022083125],"about_ca_topic_score_codex":0.00016507103,"about_ca_topic_score_gemma":0.0015159099,"teacher_disagreement_score":0.9194733,"about_ca_system_score_codex":0.000015672838,"about_ca_system_score_gemma":0.00003083651,"threshold_uncertainty_score":0.81238043},"labels":[],"label_agreement":null},{"id":"W1495228235","doi":"10.1023/a:1020572931854","title":"Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus","year":2002,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Semantics (computer science); Computer science; Proof theory; Computational linguistics; Kripke semantics; Calculus (dental); Relational calculus; Relational theory; Algebra over a field; Mathematics; Programming language; Theoretical computer science; Relational database; Natural language processing; Relational model; Description logic; Pure mathematics; Mathematical proof; Information retrieval; Multimodal logic","score_opus":0.04126314672621861,"score_gpt":0.25483443490395774,"score_spread":0.21357128817773913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495228235","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.0001750756,0.00039984344,0.973522,0.0026322508,0.00036328583,0.002051742,0.0000062715376,0.00012907662,0.020720452],"genre_scores_gemma":[0.99086875,0.0000037898324,0.0033912023,0.0001752512,0.0002022366,0.0010812167,0.000005240156,0.000006319048,0.004266022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986075,0.000082582206,0.00024636308,0.00044906224,0.00034698227,0.00026747072],"domain_scores_gemma":[0.99879867,0.00025056416,0.00014679703,0.00053214864,0.00019991922,0.000071912575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909194,0.00012694015,0.00014905787,0.000038979957,0.00034026674,0.0001277934,0.0005942817,0.000051860105,0.000002287613],"category_scores_gemma":[0.00012729326,0.00006858861,0.000037651993,0.00044726254,0.00004362071,0.0001203512,0.00010710951,0.000082597355,0.00022737354],"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.000072668576,0.00010257546,0.0003531754,0.000021033236,0.00003078803,0.000006033716,0.002353562,0.0022041188,0.000019697565,0.95527685,0.029931309,0.009628207],"study_design_scores_gemma":[0.0010244236,0.0010730966,0.0034409321,0.000012580228,0.00001836419,0.000049894912,0.0002696874,0.08239961,0.000036532965,0.0027023887,0.9086257,0.0003467646],"about_ca_topic_score_codex":0.00004075169,"about_ca_topic_score_gemma":0.00005379829,"teacher_disagreement_score":0.9906936,"about_ca_system_score_codex":0.00004704276,"about_ca_system_score_gemma":0.000033024513,"threshold_uncertainty_score":0.29225028},"labels":[],"label_agreement":null},{"id":"W1511767298","doi":"10.1023/a:1026761331498","title":"Ability and Knowing How in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":66,"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; York University","funders":"","keywords":"Executable; Computer science; Plan (archaeology); Frame (networking); Artificial intelligence; Programming language; Software engineering","score_opus":0.021415281865026514,"score_gpt":0.2447857400587642,"score_spread":0.2233704581937377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511767298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7841108,0.00143707,0.010353386,0.0056479634,0.00016887112,0.00043451777,8.541193e-7,0.00012147114,0.19772506],"genre_scores_gemma":[0.99872506,0.00007520053,0.0006913873,0.00023707986,0.000053964748,0.000019901021,5.0623663e-7,0.0000016121418,0.00019526592],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991608,0.00015542729,0.00008769003,0.00027624413,0.00013190483,0.000187926],"domain_scores_gemma":[0.99948615,0.00016809792,0.000021657199,0.00027123754,0.000023540197,0.000029319675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556235,0.00008510598,0.00010956177,0.000021099264,0.00016643957,0.000121781144,0.00036195427,0.00003822634,0.000025123725],"category_scores_gemma":[0.000099764344,0.00004945413,0.000029960825,0.00026530618,0.00005909933,0.00017477947,0.00008824633,0.00010314443,0.00003532463],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145735985,0.0004494778,0.03907232,0.000024312354,0.000022937891,0.000069257476,0.043666717,0.000047023488,0.00025050784,0.19612569,0.0027696579,0.7174875],"study_design_scores_gemma":[0.00057929143,0.00018715276,0.9497229,0.000011911645,0.000008346117,0.000017301332,0.00056364515,0.004593274,0.000041909483,0.019626634,0.02440249,0.000245156],"about_ca_topic_score_codex":0.000028015302,"about_ca_topic_score_gemma":0.00009289142,"teacher_disagreement_score":0.91065055,"about_ca_system_score_codex":0.000023015777,"about_ca_system_score_gemma":0.000023444683,"threshold_uncertainty_score":0.2016681},"labels":[],"label_agreement":null},{"id":"W1529894088","doi":"10.1023/a:1012495106338","title":"A Kripke Semantics for the Logic of Gelfand Quantales","year":2001,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Gödel's completeness theorem; Soundness; Completeness (order theory); Discrete mathematics; Axiom; Kripke semantics; Intermediate logic; Algebra over a field; Pure mathematics; Calculus (dental); Computer science; Description logic; Programming language","score_opus":0.048895351071703536,"score_gpt":0.298588028206924,"score_spread":0.24969267713522045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529894088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021959981,0.0024965424,0.9645724,0.0036156918,0.0003488593,0.0005041253,0.000005299824,0.00011011515,0.006386985],"genre_scores_gemma":[0.9801644,0.00053683587,0.018547058,0.00045866793,0.000071216695,0.000040261337,8.5070985e-7,0.000004468829,0.00017624692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991246,0.000028253196,0.00018864976,0.0002514903,0.00014958231,0.00025742204],"domain_scores_gemma":[0.998883,0.0004937537,0.00010749914,0.0004055217,0.00007627627,0.00003391691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019571972,0.00011868534,0.0001938141,0.000028907985,0.00022535615,0.000028430108,0.00072915974,0.000039855116,0.000011525452],"category_scores_gemma":[0.00010147199,0.000064336506,0.00009845145,0.00027347755,0.00012745068,0.000099694276,0.00021360198,0.00006966283,0.000013131102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018563984,0.00012629267,0.002019058,0.000015258071,0.00004157899,0.00001626881,0.0004502837,0.00024257903,0.00042216323,0.9839071,0.0008046273,0.01193624],"study_design_scores_gemma":[0.0018738835,0.0015793137,0.05944368,0.00003857953,0.00008899763,0.000114714414,0.0013013287,0.010650952,0.0011296297,0.8136019,0.109464705,0.0007123187],"about_ca_topic_score_codex":0.000003864252,"about_ca_topic_score_gemma":0.000015245248,"teacher_disagreement_score":0.9582044,"about_ca_system_score_codex":0.000009763323,"about_ca_system_score_gemma":0.000025371352,"threshold_uncertainty_score":0.26235667},"labels":[],"label_agreement":null},{"id":"W1560057404","doi":"10.1023/a:1020564714107","title":"A Tale of Four Grammars","year":2002,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Categorial grammar; Computational linguistics; Calculus (dental); Mathematics; Computer science; Combinatory categorial grammar; Linguistics; Rule-based machine translation; Algebra over a field; Programming language; Artificial intelligence; Pure mathematics; Generative grammar; Philosophy; Phrase structure rules; Tree-adjoining grammar; Mildly context-sensitive grammar formalism","score_opus":0.05057923601685719,"score_gpt":0.24299020193033688,"score_spread":0.1924109659134797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560057404","genre_codex":"other","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.011506132,0.003970752,0.47763637,0.0014790258,0.0019766642,0.0009176317,0.000002384782,0.00068623066,0.5018248],"genre_scores_gemma":[0.9942443,0.00004690675,0.004276336,0.00008623461,0.00006784037,0.00002039849,3.3631534e-7,0.0000042068555,0.0012534694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990048,0.000053948464,0.00019954756,0.00026512577,0.00022224139,0.00025433794],"domain_scores_gemma":[0.99931467,0.0000525633,0.000106429725,0.00040284597,0.00006338551,0.000060095143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018720434,0.000105422194,0.00020252165,0.000045972676,0.0000868462,0.000043138643,0.0005831604,0.000050117145,0.00006656303],"category_scores_gemma":[0.000047617865,0.000076494,0.000087120025,0.00031743612,0.000064714994,0.00010634479,0.00020576185,0.00007100809,0.00023562959],"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.0000019471734,0.00023300048,0.005208686,0.000028205415,0.00004955423,0.000070367445,0.0014888457,0.000006849184,0.00017341031,0.93161404,0.009392315,0.051732786],"study_design_scores_gemma":[0.0027066448,0.0024990784,0.02807372,0.000019549827,0.000057728794,0.00019987673,0.0006171583,0.0049877465,0.0010135866,0.2886423,0.6697616,0.0014210201],"about_ca_topic_score_codex":0.000037768667,"about_ca_topic_score_gemma":0.000011828568,"teacher_disagreement_score":0.98273814,"about_ca_system_score_codex":0.00001323151,"about_ca_system_score_gemma":0.000011171559,"threshold_uncertainty_score":0.3119335},"labels":[],"label_agreement":null},{"id":"W1592170291","doi":"10.1023/a:1010503321412","title":"Plausible Reasoning and the Resolution of Quantifier Scope Ambiguities","year":2001,"lang":"en","type":"article","venue":"Studia Logica","topic":"Categorization, perception, and language","field":"Psychology","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"","keywords":"Scope (computer science); Commonsense reasoning; Computer science; Commonsense knowledge; Quantifier (linguistics); Computational linguistics; Simple (philosophy); Preference; Artificial intelligence; Phenomenon; Epistemology; Knowledge representation and reasoning; Mathematics; Programming language; Philosophy","score_opus":0.031454282392493225,"score_gpt":0.30959527741932924,"score_spread":0.27814099502683604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592170291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75820255,0.003830609,0.00072790566,0.00034329793,0.00030979907,0.0002335549,0.000006655951,0.000045948134,0.23629971],"genre_scores_gemma":[0.9926768,0.0009072145,0.0001026519,0.000115291776,0.00015385184,0.000024449093,0.000009811275,0.0000071047198,0.0060028536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992669,0.0001421394,0.00017213084,0.0001691546,0.000099719015,0.0001499208],"domain_scores_gemma":[0.999578,0.00010036235,0.000077834746,0.00016984549,0.000053032683,0.000020954694],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004026108,0.00007871079,0.00015490322,0.000041584804,0.00019640426,0.000017764298,0.000078846795,0.000056690376,0.0016583201],"category_scores_gemma":[0.000072881776,0.000050251467,0.000035764668,0.00017037154,0.0002944178,0.000042102532,0.000034795416,0.000070313276,0.000045548662],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067155587,0.0001553789,0.061958026,0.000021069625,0.00012655309,0.000011139488,0.040548656,0.00002728268,0.0006369511,0.87456197,0.01794428,0.0033371316],"study_design_scores_gemma":[0.0026566465,0.00016517685,0.93281025,0.000032872533,0.00008121478,0.00005022428,0.022368312,0.000044904595,0.000033594213,0.0028988176,0.038659178,0.0001988073],"about_ca_topic_score_codex":0.0011401635,"about_ca_topic_score_gemma":0.0004658925,"teacher_disagreement_score":0.87166315,"about_ca_system_score_codex":0.0000097654765,"about_ca_system_score_gemma":0.000014494972,"threshold_uncertainty_score":0.9992543},"labels":[],"label_agreement":null},{"id":"W1607885199","doi":"10.1023/a:1005238330484","title":"Completeness Theorems via the Double Dual Functor","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agencia Nacional de Promoción Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Universidad de Chile; Pontificia Universidad Católica de Chile; Université de Montréal","keywords":"Łukasiewicz logic; Propositional calculus; Mathematics; Completeness (order theory); Calculus (dental); Distributive property; Functor; Monoidal t-norm logic; Propositional variable; Algebra over a field; Zeroth-order logic; Many-valued logic; Discrete mathematics; Pure mathematics; Computer science; Intermediate logic; Substructural logic; Artificial intelligence","score_opus":0.027078596386552512,"score_gpt":0.24369137655492515,"score_spread":0.21661278016837263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607885199","genre_codex":"other","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.17818168,0.0020537868,0.3446078,0.009626714,0.0016989309,0.0012305283,0.000010163234,0.0011850721,0.46140534],"genre_scores_gemma":[0.99531144,0.00004330077,0.0019060905,0.0014591047,0.000185318,0.00004239479,0.000001954638,0.0000066174985,0.0010437685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987491,0.0000746684,0.0001732935,0.00038399373,0.0002444407,0.00037452902],"domain_scores_gemma":[0.9990643,0.00015435333,0.00004828583,0.0006265721,0.00004085157,0.000065600434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020668971,0.0001673167,0.000187719,0.000019461268,0.00045918245,0.00009286169,0.0009056379,0.00004106,0.0006248831],"category_scores_gemma":[0.000007782217,0.00008760867,0.000079196776,0.0003525504,0.00016497092,0.00018955402,0.0002278586,0.00015037796,0.000752884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047465,0.00013648474,0.00032741498,0.0000036456993,0.000038171318,0.000053980366,0.0008825215,0.0004717933,0.00035950373,0.89586264,0.0019753315,0.09984107],"study_design_scores_gemma":[0.0023717736,0.00062597863,0.063652895,0.000013794319,0.000029594174,0.00013003229,0.00023321727,0.0023601626,0.00044494434,0.52682954,0.40237424,0.00093381613],"about_ca_topic_score_codex":0.000012985397,"about_ca_topic_score_gemma":0.000008542876,"teacher_disagreement_score":0.8171298,"about_ca_system_score_codex":0.00001745452,"about_ca_system_score_gemma":0.000026376312,"threshold_uncertainty_score":0.96770525},"labels":[],"label_agreement":null},{"id":"W1743668334","doi":"10.1007/s11225-015-9625-0","title":"A Logical Theory of Localization","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Robot; Domain (mathematical analysis); Task (project management); Logical conjunction; Theoretical computer science; Mathematics; Programming language; Machine learning; Engineering","score_opus":0.056637439952223326,"score_gpt":0.2683891055608521,"score_spread":0.2117516656086288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1743668334","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.003297626,0.0008300939,0.7437097,0.00014362416,0.00031806703,0.00012550967,8.400201e-7,0.00014282332,0.25143173],"genre_scores_gemma":[0.9953346,0.000024122275,0.0039925403,0.00020537226,0.000073458104,0.0000099632925,0.000001404528,0.0000035214482,0.00035501292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896264,0.0001678636,0.00018000227,0.00026595543,0.00022437857,0.00019913392],"domain_scores_gemma":[0.99917245,0.000119296805,0.00008750274,0.00032261392,0.00018890544,0.00010922808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030982,0.000106205305,0.00019670672,0.000043086526,0.000063841864,0.000028915276,0.0005560572,0.00006779793,0.000029487896],"category_scores_gemma":[0.00039270578,0.00006988784,0.000057934558,0.0003486799,0.00011162216,0.000121176454,0.00033386832,0.00007023384,0.00012494413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011728607,0.00014735498,0.0031441362,0.000004968848,0.000013988438,0.00001157021,0.0016403436,0.000065189924,0.000025695568,0.9850127,0.0036861359,0.006236167],"study_design_scores_gemma":[0.0016774419,0.0014006223,0.023135979,0.000030283178,0.000032206346,0.000032575997,0.0008794865,0.006103671,0.0009221794,0.9121795,0.053046715,0.0005593243],"about_ca_topic_score_codex":0.000004192261,"about_ca_topic_score_gemma":0.000003150282,"teacher_disagreement_score":0.992037,"about_ca_system_score_codex":0.000026911195,"about_ca_system_score_gemma":0.00009369069,"threshold_uncertainty_score":0.28499436},"labels":[],"label_agreement":null},{"id":"W1763963671","doi":"10.1007/s11225-015-9626-z","title":"Progression and Verification of Situation Calculus Agents with Bounded Beliefs","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Provincia autonoma di Bolzano - Alto Adige; European Commission","keywords":"Decidability; Situation calculus; Bounded function; Action (physics); Domain (mathematical analysis); Action theory (sociology); Computer science; Mathematics; Calculus (dental); Theoretical computer science; Artificial intelligence; Epistemology","score_opus":0.04576077388929656,"score_gpt":0.290040312828687,"score_spread":0.24427953893939042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763963671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6065632,0.002266648,0.27112752,0.0009849812,0.00051381177,0.0010807707,0.0000028777797,0.00031206012,0.11714815],"genre_scores_gemma":[0.98997855,0.000029783567,0.009817426,0.000030270605,0.000031794483,0.000020986261,0.0000035720457,0.0000031234738,0.00008450721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999201,0.000055714474,0.00012152165,0.00024838152,0.00024141792,0.00013196655],"domain_scores_gemma":[0.9993798,0.000024542895,0.0001149134,0.00022709297,0.00017249864,0.00008113422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025621546,0.00008708964,0.00012687995,0.000035264922,0.000094007635,0.000044592565,0.00020034263,0.000041845917,0.000002749927],"category_scores_gemma":[0.000075681535,0.000055782974,0.000014899162,0.00021599316,0.00007787514,0.00017086732,0.00012802545,0.00004689818,0.000013754674],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002410417,0.0017256092,0.08038244,0.00013500026,0.00017657151,0.00005708075,0.05293955,0.000058762656,0.0032487332,0.63042367,0.009486035,0.22112553],"study_design_scores_gemma":[0.005722639,0.0047684796,0.9154153,0.00019795485,0.00008170098,0.00005298244,0.00112524,0.017501226,0.007552416,0.029829916,0.016814686,0.00093747204],"about_ca_topic_score_codex":0.000011364173,"about_ca_topic_score_gemma":0.000014689878,"teacher_disagreement_score":0.8350328,"about_ca_system_score_codex":0.00002934156,"about_ca_system_score_gemma":0.0000841962,"threshold_uncertainty_score":0.22747636},"labels":[],"label_agreement":null},{"id":"W1964472717","doi":"10.1007/s11225-005-2805-6","title":"Representations of monadic MV -algebras","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subalgebra; Mathematics; Finitely-generated abelian group; Algebra over a field; Pure mathematics; Characterization (materials science); Discrete mathematics; Physics","score_opus":0.022406497267481205,"score_gpt":0.2806372452550117,"score_spread":0.2582307479875305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964472717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14756829,0.0026380874,0.5622276,0.008349626,0.00049346377,0.00054195756,0.000008096589,0.0005367156,0.2776362],"genre_scores_gemma":[0.95366275,0.000048100253,0.045454152,0.0003577976,0.00007588112,0.000016500764,0.0000011266562,0.0000033380181,0.00038033005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911773,0.00003587085,0.00019790046,0.00027671843,0.00017433793,0.00019744392],"domain_scores_gemma":[0.99927044,0.00009990958,0.000085189306,0.00042850693,0.000056977166,0.00005899418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090018795,0.00008944515,0.00014568216,0.000056453693,0.00010709709,0.000017027809,0.000518484,0.000031291278,0.00007003408],"category_scores_gemma":[0.00006738936,0.00007068959,0.000060333114,0.00036711062,0.00007218263,0.00024710677,0.00020774997,0.000077027864,0.00012621525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027335727,0.00013887329,0.0022105905,0.000004662068,0.000018470448,0.000010408018,0.0007367485,0.0006427734,0.0008478049,0.95770496,0.0018388317,0.03584317],"study_design_scores_gemma":[0.001706017,0.0006342376,0.32583264,0.00002407112,0.000042691972,0.000048525704,0.00060565205,0.0036552148,0.009329366,0.5824766,0.07472108,0.00092390034],"about_ca_topic_score_codex":0.0000072513217,"about_ca_topic_score_gemma":0.000013112842,"teacher_disagreement_score":0.80609447,"about_ca_system_score_codex":0.00001738227,"about_ca_system_score_gemma":0.000035519137,"threshold_uncertainty_score":0.2882638},"labels":[],"label_agreement":null},{"id":"W1984195282","doi":"10.1007/s11225-005-4649-5","title":"Frames and MV-algebras","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Embedding; Topological space; Algebra over a field; Pure mathematics; Class (philosophy); Generalization; Lattice (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.014600127020419244,"score_gpt":0.2458044305026107,"score_spread":0.23120430348219145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984195282","genre_codex":"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.30513942,0.010418434,0.48586133,0.019916004,0.00064644223,0.00053774595,0.0000037048826,0.0012123091,0.17626463],"genre_scores_gemma":[0.94423866,0.00016021615,0.05349673,0.0016729069,0.00012700385,0.000010929631,3.347649e-7,0.000003590162,0.00028964173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991768,0.000025566645,0.00011314884,0.0003224755,0.00012371286,0.00023831525],"domain_scores_gemma":[0.9995122,0.00008239953,0.0000378383,0.0002677772,0.000023494958,0.00007630352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008478612,0.000111947964,0.00013605002,0.000033443368,0.00015469031,0.000060435515,0.00034985246,0.000042715612,0.000039592942],"category_scores_gemma":[0.000042754786,0.00008151354,0.000029629344,0.00016867903,0.00006854241,0.00026955528,0.00030142805,0.00010458123,0.00015070415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021809615,0.00006039378,0.0017998453,0.0000032978467,0.000013090572,0.00001686388,0.0005796122,0.000030762447,0.00016041714,0.8742778,0.002501574,0.12055421],"study_design_scores_gemma":[0.0010518462,0.00050262315,0.14450562,0.000017842498,0.000016498809,0.00007029118,0.00024204058,0.0016748604,0.001009048,0.4746072,0.3754374,0.0008647201],"about_ca_topic_score_codex":0.0000014752943,"about_ca_topic_score_gemma":0.000005064942,"teacher_disagreement_score":0.63909924,"about_ca_system_score_codex":0.000012769035,"about_ca_system_score_gemma":0.000016567452,"threshold_uncertainty_score":0.3324026},"labels":[],"label_agreement":null},{"id":"W1998008572","doi":"10.1007/s11225-005-0496-7","title":"Gricean Belief Change","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Computational linguistics; Linguistics; Natural language processing; Computer science; Mathematics; Philosophy","score_opus":0.0446859907884477,"score_gpt":0.2604042263466005,"score_spread":0.21571823555815278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998008572","genre_codex":"other","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.018918138,0.0061898786,0.02103132,0.008603462,0.0014060145,0.0005919414,0.0000041549197,0.0010830874,0.942172],"genre_scores_gemma":[0.98779106,0.00018562398,0.008068799,0.0015242159,0.00096735195,0.000047405065,0.000001086359,0.0000064859682,0.0014079977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987951,0.00004897921,0.00014930399,0.00040765846,0.00019834217,0.0004006487],"domain_scores_gemma":[0.99925107,0.00006519215,0.00006270265,0.00044001636,0.00006517272,0.00011582234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021686382,0.0001577045,0.00018376487,0.000055339468,0.00022422694,0.000080661106,0.0008379434,0.00006372157,0.00009067196],"category_scores_gemma":[0.00004511646,0.000113731905,0.0000797285,0.0003371974,0.000046332472,0.0003087454,0.00046515296,0.00012613338,0.001417095],"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.0000057122343,0.0005800689,0.007072048,0.000013817347,0.000055380842,0.00006257439,0.008172947,0.0000072987555,0.00011333008,0.6840823,0.040105186,0.2597293],"study_design_scores_gemma":[0.0007132934,0.00038744637,0.12189291,0.000015484367,0.000015942545,0.0000276444,0.00009037204,0.0011417251,0.0002324389,0.0063220044,0.8685946,0.0005661249],"about_ca_topic_score_codex":0.000013830916,"about_ca_topic_score_gemma":0.0000535722,"teacher_disagreement_score":0.9688729,"about_ca_system_score_codex":0.00004508591,"about_ca_system_score_gemma":0.000030522704,"threshold_uncertainty_score":0.99936044},"labels":[],"label_agreement":null},{"id":"W1999417206","doi":"10.1007/s11225-005-0291-5","title":"On relative universality and Q-universality","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Universality (dynamical systems); Mathematics; Computational linguistics; Discrete mathematics; Linguistics; Philosophy; Physics; Quantum mechanics","score_opus":0.016570444681276147,"score_gpt":0.2384107521854373,"score_spread":0.22184030750416117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999417206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23328622,0.00022996157,0.60096633,0.004800484,0.00027236485,0.00031563104,0.00000583691,0.00041578492,0.15970738],"genre_scores_gemma":[0.98987305,0.000040360013,0.009483968,0.00046302113,0.000015687508,0.0000019314223,6.3079824e-7,0.0000025878442,0.00011873966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991452,0.00005709833,0.00008594055,0.00038045784,0.00013769332,0.00019357115],"domain_scores_gemma":[0.9994222,0.00012360267,0.00005214863,0.000288309,0.000034321896,0.00007941909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001138224,0.0001161504,0.00013860929,0.000035948535,0.00021382187,0.000024893941,0.00028727474,0.00004628686,0.000009989325],"category_scores_gemma":[0.00005928313,0.00009073133,0.000036114645,0.00024007511,0.0001293746,0.00034312057,0.00023653201,0.00014532708,0.00004735388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007295447,0.00005078353,0.00021299253,0.0000015772908,0.000011179048,0.000041982938,0.00060438487,0.00014928781,0.000020537429,0.99747914,0.00003842121,0.0013824444],"study_design_scores_gemma":[0.000759378,0.00034046045,0.047905505,0.000009799644,0.0000062116947,0.000004821864,0.00020075477,0.000032047195,0.00008165022,0.9487878,0.0016856737,0.00018588855],"about_ca_topic_score_codex":0.000018953233,"about_ca_topic_score_gemma":0.000009141576,"teacher_disagreement_score":0.75658685,"about_ca_system_score_codex":0.00008515699,"about_ca_system_score_gemma":0.000042857642,"threshold_uncertainty_score":0.36999163},"labels":[],"label_agreement":null},{"id":"W2013296559","doi":"10.1007/s11225-011-9349-8","title":"Discrete Dualities for Double Stone Algebras","year":2011,"lang":"en","type":"article","venue":"Studia Logica","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Class (philosophy); Algebra over a field; Mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.14315343094194719,"score_gpt":0.32259912529956125,"score_spread":0.17944569435761407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013296559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7407462,0.00059276377,0.005257761,0.00046141163,0.000702967,0.0013479261,0.000059826434,0.00045939724,0.25037175],"genre_scores_gemma":[0.9763028,0.000054380904,0.016864508,0.0001570166,0.00028507892,0.00023336134,0.00000789269,0.00003871488,0.0060562687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987725,0.00002888114,0.00030161097,0.0003148862,0.00017826118,0.00040385875],"domain_scores_gemma":[0.99914205,0.00021152342,0.00012441732,0.00036364,0.00007729859,0.00008106979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031598925,0.0002092884,0.00035563298,0.000047272595,0.00022451459,0.00002968718,0.00024116127,0.00007858416,0.0003598873],"category_scores_gemma":[0.00014013273,0.00015571741,0.00014994878,0.00008092939,0.0001366896,0.000113898364,0.00012028576,0.00009741329,0.00008704544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000963415,0.00015459504,0.0005389049,0.000092491304,0.00010954598,0.000006078082,0.0049717287,1.0561581e-7,0.000090199486,0.9796243,0.014029419,0.0002863259],"study_design_scores_gemma":[0.0013976783,0.00028523622,0.0033117598,0.000031925767,0.00009775767,0.000005270112,0.0026844363,0.000002516273,0.0037384485,0.97393084,0.014136711,0.0003774512],"about_ca_topic_score_codex":0.00004928411,"about_ca_topic_score_gemma":0.000057199355,"teacher_disagreement_score":0.24431548,"about_ca_system_score_codex":0.000023658109,"about_ca_system_score_gemma":0.00003157198,"threshold_uncertainty_score":0.6349972},"labels":[],"label_agreement":null},{"id":"W2031927644","doi":"10.1007/s11225-006-6610-7","title":"The Epsilon Calculus and Herbrand Complexity","year":2006,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sequent calculus; Mathematics; Calculus (dental); Natural deduction; Cut-elimination theorem; Operator (biology); Discrete mathematics; Algebra over a field; Pure mathematics; Proof calculus; Mathematical proof","score_opus":0.03679857917696052,"score_gpt":0.2540852957107809,"score_spread":0.2172867165338204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031927644","genre_codex":"other","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.046884682,0.01675142,0.42907327,0.00780057,0.0024697827,0.0015379774,0.0000030922959,0.0009381126,0.49454108],"genre_scores_gemma":[0.997824,0.00003811323,0.0012175458,0.00009546053,0.00009765064,0.00001957008,8.6594054e-7,0.000003405739,0.00070335163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990271,0.00008515724,0.0001595606,0.00027395948,0.00017463254,0.00027964372],"domain_scores_gemma":[0.9994204,0.000112753645,0.00006362917,0.00031452617,0.000042569667,0.00004611246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000345824,0.00011077024,0.00014385817,0.000014510154,0.0005858126,0.00024309296,0.0004033566,0.000039910534,0.0000034801699],"category_scores_gemma":[0.000021121943,0.000060527473,0.000041090218,0.00015634396,0.0002045184,0.00008149619,0.00024258863,0.00008271155,0.000042939053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027739095,0.000032783428,0.0032709008,0.0000048271527,0.000009661326,0.000012104888,0.00014072531,0.0000019610995,0.00002147333,0.98612845,0.0026748641,0.007699491],"study_design_scores_gemma":[0.0008000223,0.00027591104,0.15277183,0.0000027111,0.000012128011,0.000049838058,0.00014685787,0.0012843005,0.00008622347,0.4246717,0.4195467,0.00035176348],"about_ca_topic_score_codex":0.00039327808,"about_ca_topic_score_gemma":0.00041547298,"teacher_disagreement_score":0.95093936,"about_ca_system_score_codex":0.00001596427,"about_ca_system_score_gemma":0.000019288798,"threshold_uncertainty_score":0.45056564},"labels":[],"label_agreement":null},{"id":"W2034981868","doi":"10.1007/s11225-014-9564-1","title":"Gentzen and Jaśkowski Natural Deduction: Fundamentally Similar but Importantly Different","year":2014,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Natural deduction; Normalization (sociology); Mathematics; Sequent calculus; Epistemology; Calculus (dental); Semantics (computer science); Meaning (existential); Linguistics; Philosophy; Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Programming language; Sociology","score_opus":0.018759870375595816,"score_gpt":0.235310530650576,"score_spread":0.21655066027498018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034981868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7133363,0.009542588,0.18217054,0.0054711094,0.010924446,0.0019790125,0.000005599617,0.0014359009,0.075134516],"genre_scores_gemma":[0.99735796,0.00008149506,0.0012295668,0.00034376915,0.0003215202,0.00003092773,0.0000039171205,0.000008085819,0.00062276266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984723,0.00009712432,0.000254486,0.0005203194,0.00028709194,0.00036872315],"domain_scores_gemma":[0.99923444,0.00005903196,0.00012432011,0.00039782154,0.00005403221,0.0001303621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002493958,0.00021796877,0.0002778674,0.00004836494,0.00029322595,0.00022063397,0.0004527221,0.00006771255,0.000021940394],"category_scores_gemma":[0.000034643435,0.00014732542,0.00007759784,0.00013756761,0.00009730302,0.00017371205,0.00038209886,0.00015062504,0.00004717488],"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.000023444049,0.00036231778,0.04864333,0.000076141936,0.00021082535,0.00006732275,0.0019547835,0.0000048487545,0.0019180398,0.8704874,0.0050752917,0.07117625],"study_design_scores_gemma":[0.0038136248,0.0027864869,0.44698274,0.000026161475,0.00013629018,0.0005382152,0.0015698966,0.0037036038,0.001963785,0.1545049,0.3816086,0.002365683],"about_ca_topic_score_codex":0.000034537756,"about_ca_topic_score_gemma":0.000036664096,"teacher_disagreement_score":0.7159825,"about_ca_system_score_codex":0.000039365532,"about_ca_system_score_gemma":0.0000226487,"threshold_uncertainty_score":0.60077566},"labels":[],"label_agreement":null},{"id":"W2043257491","doi":"10.1007/s11225-005-5057-6","title":"An application of a Theorem of Ash to finite covers","year":2004,"lang":"en","type":"article","venue":"Studia Logica","topic":"semigroups and automata theory","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":"Carleton University","funders":"","keywords":"Mathematics; Semigroup; Inverse semigroup; Unary operation; Pure mathematics; Special classes of semigroups; Group (periodic table); Structured program theorem; Cancellative semigroup; Krohn–Rhodes theory; Subalgebra; Discrete mathematics; Algebra over a field","score_opus":0.011128717335233984,"score_gpt":0.25238099070918846,"score_spread":0.24125227337395447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043257491","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.22642353,0.00004619307,0.7664732,0.00030232768,0.00005336184,0.00019516678,0.0000073389733,0.000068869034,0.006430048],"genre_scores_gemma":[0.9832416,0.0000062857425,0.016457569,0.00025741494,0.000014815451,0.000013510398,0.0000013281539,0.0000026572727,0.000004819461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999403,0.000026417129,0.00014127791,0.0001898376,0.00013447991,0.00010498061],"domain_scores_gemma":[0.99932516,0.00006987057,0.00008071484,0.00043372178,0.00004871062,0.000041803058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021737222,0.00006204668,0.00012842701,0.00004346441,0.000031293497,0.00000990414,0.0005337832,0.000024706036,0.0000051297475],"category_scores_gemma":[0.000031055035,0.000048530783,0.000034011708,0.00030161283,0.000048611706,0.00009203005,0.00011871408,0.000029747194,0.000020887472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008821563,0.00015597399,0.00032902873,0.000006146962,0.000010188746,0.0000011931343,0.0015208502,0.0029917418,0.018683119,0.96017283,0.000036063677,0.016084043],"study_design_scores_gemma":[0.0016995643,0.0022829631,0.08471957,0.00007141485,0.000026516216,0.0000057923594,0.0011070739,0.0043075737,0.091820136,0.8096621,0.0037337285,0.0005635691],"about_ca_topic_score_codex":0.000028519928,"about_ca_topic_score_gemma":0.0000042836123,"teacher_disagreement_score":0.75681806,"about_ca_system_score_codex":0.000013476377,"about_ca_system_score_gemma":0.000030576346,"threshold_uncertainty_score":0.19790278},"labels":[],"label_agreement":null},{"id":"W2049702075","doi":"10.1007/s11225-008-9100-2","title":"Resource-origins of Nonmonotonicity","year":2008,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Defeasible estate; Computer science; Inference; Context (archaeology); Non-monotonic logic; Theoretical computer science; Deductive reasoning; Artificial intelligence; Resource (disambiguation); Cognitive science","score_opus":0.03141366693341228,"score_gpt":0.24261159096300994,"score_spread":0.21119792402959767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049702075","genre_codex":"other","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.3758178,0.0009644335,0.036525507,0.00039042486,0.00037216564,0.00027774507,0.0000038285602,0.0002993854,0.5853487],"genre_scores_gemma":[0.99323076,0.0001159682,0.005912983,0.00013922804,0.0000846857,0.000011347211,7.705365e-7,0.000004654285,0.0004995983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988591,0.00006621506,0.00020880978,0.00034861147,0.00022334304,0.0002938879],"domain_scores_gemma":[0.9990834,0.000121818564,0.000107248576,0.00052018743,0.00008186763,0.00008548904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020035465,0.00013499577,0.00026374919,0.000055608576,0.0002226053,0.000014472586,0.00081787666,0.0000640888,0.000031374282],"category_scores_gemma":[0.00009320719,0.00009978775,0.00010992143,0.00037094543,0.00015795509,0.00010865046,0.00038209136,0.00012536223,0.00013545564],"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.000016829687,0.0005287162,0.038316127,0.000017499138,0.0000647459,0.00013483469,0.0059326505,0.000041353844,0.0005427844,0.9368741,0.012554698,0.004975664],"study_design_scores_gemma":[0.0013842558,0.0008920002,0.32316825,0.000026918011,0.000022513474,0.000118607546,0.00017181052,0.0013039239,0.0054365834,0.009703919,0.6570536,0.0007176564],"about_ca_topic_score_codex":0.00004617057,"about_ca_topic_score_gemma":0.000011360518,"teacher_disagreement_score":0.92717016,"about_ca_system_score_codex":0.00006459748,"about_ca_system_score_gemma":0.00010376575,"threshold_uncertainty_score":0.40692264},"labels":[],"label_agreement":null},{"id":"W2075300940","doi":"10.1007/s11225-013-9519-y","title":"Remarks on the Scott–Lindenbaum Theorem","year":2013,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Generalization; Subject (documents); Order (exchange); Inference; Logical consequence; Epistemology; Computer science; Mathematical logic; Rule of inference; Mathematics; Mathematical economics; Calculus (dental); Algebra over a field; Philosophy; Artificial intelligence; Algorithm; Pure mathematics","score_opus":0.02004094291187576,"score_gpt":0.2323315146845149,"score_spread":0.21229057177263916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075300940","genre_codex":"other","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.021280576,0.0004263779,0.011487806,0.007681669,0.00079669536,0.00056385226,8.3928893e-7,0.00027973895,0.95748246],"genre_scores_gemma":[0.994293,0.000049931023,0.0012434128,0.0019010149,0.00022092686,0.00008316088,5.789919e-7,0.000007723673,0.0022002817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985086,0.0001817819,0.0001800565,0.0004359914,0.0002811639,0.0004124623],"domain_scores_gemma":[0.9983538,0.0005024847,0.00008741673,0.0008494098,0.00011514893,0.000091786926],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005110636,0.00019064907,0.00018863795,0.00003940869,0.0003976969,0.00023772239,0.0014522626,0.00007920203,0.00042298163],"category_scores_gemma":[0.0002872585,0.00009322726,0.0001068874,0.0003095368,0.00013812917,0.00016247429,0.00050715724,0.00025376043,0.003394043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025316356,0.00008802205,0.00068529503,0.000002259856,0.000022119866,0.000007851581,0.00085845194,0.000002875692,0.0000750372,0.94138324,0.04820098,0.008671332],"study_design_scores_gemma":[0.001079676,0.0012364624,0.1664489,0.00008804709,0.000029078228,0.000035880115,0.0009840756,0.0030477145,0.0013711379,0.7172443,0.10726737,0.0011673034],"about_ca_topic_score_codex":0.000020885196,"about_ca_topic_score_gemma":0.000011241309,"teacher_disagreement_score":0.9730124,"about_ca_system_score_codex":0.00003240875,"about_ca_system_score_gemma":0.000052806347,"threshold_uncertainty_score":0.9973819},"labels":[],"label_agreement":null},{"id":"W2080872423","doi":"10.1007/s11225-013-9492-5","title":"Decidability of an Xstit Logic","year":2013,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Decidability; Undecidable problem; Mathematics; Completeness (order theory); Fragment (logic); Discrete mathematics; Closure (psychology); Intermediate logic; Zeroth-order logic; Mathematical proof; Dynamic logic (digital electronics); Computer science; Algorithm; Description logic; Programming language; Multimodal logic","score_opus":0.023146463325487702,"score_gpt":0.2570697660865448,"score_spread":0.2339233027610571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080872423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54695266,0.00059573376,0.05541431,0.00060037157,0.0006745365,0.000796745,0.0000031296365,0.00040554238,0.39455697],"genre_scores_gemma":[0.9789577,0.00001488421,0.020516315,0.0001849155,0.00006773774,0.00004763019,0.0000010857628,0.0000039307206,0.00020580844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99866366,0.00011973006,0.0002459978,0.00044993125,0.00020659115,0.00031405652],"domain_scores_gemma":[0.9986471,0.0001541092,0.000105757914,0.00073728006,0.00022138127,0.00013436793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032644783,0.00014797067,0.00026775792,0.00004357074,0.00012344551,0.00006815492,0.001023894,0.00007777053,0.0002887405],"category_scores_gemma":[0.00025456477,0.00010008554,0.00008512771,0.00032335368,0.00014374577,0.00036344212,0.00041871954,0.00010545336,0.00043120462],"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.000009903263,0.0013796177,0.04459504,0.000043223386,0.000057227848,0.000023137243,0.002393513,0.00003627557,0.0019312376,0.8886303,0.0046887374,0.056211818],"study_design_scores_gemma":[0.0005689414,0.0010073748,0.7052867,0.000011299617,0.0000133754365,0.000012302883,0.00017913953,0.0025555638,0.001286344,0.28460875,0.004044729,0.00042547443],"about_ca_topic_score_codex":0.0000985493,"about_ca_topic_score_gemma":0.000032223117,"teacher_disagreement_score":0.6606917,"about_ca_system_score_codex":0.00003005708,"about_ca_system_score_gemma":0.00006912304,"threshold_uncertainty_score":0.55424064},"labels":[],"label_agreement":null},{"id":"W2095441824","doi":"10.1007/s11225-010-9294-y","title":"On the Proof-Theory of two Formalisations of Modal First-Order Logic","year":2010,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Sequent; Sequent calculus; Mathematical proof; Cut-elimination theorem; Normal modal logic; Modal logic; Proof theory; Calculus (dental); Mathematics; Proof calculus; Modal; Natural deduction; Predicate logic; Structural proof theory; Dynamic logic (digital electronics); Predicate (mathematical logic); Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Programming language; Description logic","score_opus":0.02698497281611857,"score_gpt":0.2651746369767692,"score_spread":0.23818966416065063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095441824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21439053,0.00011403151,0.7103682,0.0035624965,0.0005435132,0.0007331757,0.000009639626,0.00009963352,0.07017879],"genre_scores_gemma":[0.9854467,0.000005266126,0.014021862,0.0003607696,0.000033106742,0.000044472814,6.816848e-7,0.0000037913276,0.00008336062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991165,0.00006374408,0.00021447925,0.00021023353,0.00020000032,0.00019506595],"domain_scores_gemma":[0.9984867,0.0006509419,0.00015527656,0.0005486913,0.0001261202,0.000032243417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037472678,0.00011293921,0.00016864925,0.000044349603,0.0001988095,0.00001234102,0.0007470601,0.000042021544,0.00010331159],"category_scores_gemma":[0.0003252776,0.000061448816,0.00007108658,0.00034313902,0.00021384483,0.00013115029,0.0002327555,0.00019589101,0.000015292931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063250545,0.00011398725,0.00015819102,0.000004866707,0.000012183761,0.0000011449567,0.0005940538,0.00040811906,0.0006660335,0.99613774,0.000104688515,0.0017926963],"study_design_scores_gemma":[0.00025305242,0.0002605705,0.0033120045,0.0000063883667,0.0000070173396,0.0000028477832,0.00008534313,0.0009784477,0.0020701715,0.9924185,0.00050498225,0.00010063194],"about_ca_topic_score_codex":0.0000037676134,"about_ca_topic_score_gemma":0.000029499477,"teacher_disagreement_score":0.7710562,"about_ca_system_score_codex":0.000006278495,"about_ca_system_score_gemma":0.00004356485,"threshold_uncertainty_score":0.250581},"labels":[],"label_agreement":null},{"id":"W2120203109","doi":"10.1023/a:1026744827863","title":"A Set Theory with Support for Partial Functions","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computational linguistics; Mathematics; Linguistics; Philosophy","score_opus":0.03266808631290268,"score_gpt":0.25891541105010185,"score_spread":0.22624732473719916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120203109","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.0029675672,0.00013560384,0.837765,0.0004468295,0.0004858696,0.0008146385,0.000007803194,0.0004296033,0.15694708],"genre_scores_gemma":[0.9886197,0.0000065175827,0.001763056,0.00025974173,0.00018940342,0.00024483705,0.000008412341,0.0000067445735,0.008901576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989923,0.00006085422,0.00014121717,0.00034127774,0.00014851222,0.00031582575],"domain_scores_gemma":[0.9993916,0.00008966162,0.000045065986,0.0003469067,0.00005313552,0.00007361099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034542018,0.00012100614,0.0001600314,0.000025374045,0.0002665677,0.00009192157,0.0003364263,0.0000454542,0.00031745507],"category_scores_gemma":[0.000015146747,0.000075452546,0.000067406545,0.00019069132,0.00006650278,0.00012737844,0.0000474596,0.00006317673,0.00036011473],"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.00009361216,0.00014869458,0.0014780877,0.000015254943,0.00010575511,0.000030923544,0.0021640803,0.000044091765,0.000010972882,0.91289955,0.014430713,0.06857828],"study_design_scores_gemma":[0.0008375739,0.0015087497,0.001714181,0.000001781363,0.00003206329,0.000043382468,0.00030521982,0.00018532937,0.000042722877,0.03644136,0.95861316,0.00027449822],"about_ca_topic_score_codex":0.000010694918,"about_ca_topic_score_gemma":0.000017018261,"teacher_disagreement_score":0.98565215,"about_ca_system_score_codex":0.000014468344,"about_ca_system_score_gemma":0.00007523828,"threshold_uncertainty_score":0.46286666},"labels":[],"label_agreement":null},{"id":"W2140743943","doi":"10.1007/s11225-012-9395-x","title":"Actuality in Propositional Modal Logic","year":2012,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Modal logic; Normal modal logic; Zeroth-order logic; Propositional variable; Modal μ-calculus; Intermediate logic; Kripke semantics; Mathematics; Modal; Operator (biology); Kripke structure; S5; Well-formed formula; Intuitionistic logic; Dynamic logic (digital electronics); Accessibility relation; Mathematical proof; Calculus (dental); Multimodal logic; Discrete mathematics; Propositional calculus; Computer science; Algorithm; Model checking; Theoretical computer science; Description logic; Physics","score_opus":0.03603683727267915,"score_gpt":0.2830724367028787,"score_spread":0.24703559943019954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140743943","genre_codex":"other","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.27817586,0.0027560715,0.106916785,0.0027646252,0.0018999026,0.0008449342,0.000009534797,0.00058167434,0.6060506],"genre_scores_gemma":[0.9920362,0.000018186522,0.007027506,0.0004142502,0.00022883857,0.000040657942,0.0000030492083,0.00000376533,0.00022754949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99865323,0.00013417806,0.00018453223,0.00030489312,0.00022665845,0.0004965062],"domain_scores_gemma":[0.99936116,0.00011059765,0.000058662736,0.00029562088,0.00005296763,0.00012099528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051252055,0.00014577033,0.00019123656,0.00005813535,0.00013678377,0.000049462014,0.00052739,0.00007861669,0.000095601805],"category_scores_gemma":[0.00010483825,0.00010311467,0.0000657596,0.00032012566,0.00007438779,0.00037921726,0.00037970187,0.00016568106,0.0003865603],"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.0000072866987,0.0006007858,0.06284819,0.000008156733,0.000013297717,0.000014999483,0.0020938257,0.0000076003817,0.00013323693,0.930357,0.0011167701,0.0027988774],"study_design_scores_gemma":[0.00057532685,0.00017249925,0.9193905,0.000010744138,0.0000063281263,0.00002897673,0.000111832356,0.00035912788,0.00023658997,0.07294692,0.0057929424,0.00036820563],"about_ca_topic_score_codex":0.000016009442,"about_ca_topic_score_gemma":0.000015404845,"teacher_disagreement_score":0.8574101,"about_ca_system_score_codex":0.000082091574,"about_ca_system_score_gemma":0.00006985756,"threshold_uncertainty_score":0.49685797},"labels":[],"label_agreement":null},{"id":"W2243033668","doi":"10.1007/s11225-015-9641-0","title":"Congruence Lattices of Semilattices with Operators","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Semilattice; Mathematics; Congruence lattice problem; Congruence (geometry); Lattice (music); Pure mathematics; Duality (order theory); Distributive lattice; Algebraic number; Algebraic structure; Complete lattice; Discrete mathematics; Combinatorics; Algebra over a field; Distributive property; Mathematical analysis; Physics","score_opus":0.03580985468260145,"score_gpt":0.26926242970924275,"score_spread":0.2334525750266413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243033668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096556,0.002358505,0.08889605,0.0013000285,0.00048058282,0.0004192455,0.000004997683,0.00034259862,0.09654239],"genre_scores_gemma":[0.9676793,0.000023388482,0.031912718,0.00024161428,0.000026762724,0.00001064254,4.3779906e-7,0.0000037673537,0.0001013486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904907,0.00004439097,0.00015180833,0.0002884692,0.00025816253,0.00020811452],"domain_scores_gemma":[0.9991778,0.00009456029,0.00010719214,0.00033851064,0.00017102686,0.0001109216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800518,0.00011957153,0.00020345145,0.000035841018,0.00006502962,0.00003802506,0.000645956,0.00003133965,0.000008624025],"category_scores_gemma":[0.00006787114,0.00007293294,0.000022373359,0.00037508254,0.00013957518,0.00040326538,0.00020658333,0.00007680723,0.000029233583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061526865,0.00033453468,0.075290374,0.00004575003,0.00012355405,0.00017238416,0.0057531423,0.0017474989,0.0009473893,0.9059897,0.0015966401,0.007937511],"study_design_scores_gemma":[0.014226158,0.019186841,0.3567812,0.00062187115,0.00032806132,0.00038338007,0.017214984,0.0095501905,0.03574576,0.40597078,0.13381837,0.006172395],"about_ca_topic_score_codex":0.000013567434,"about_ca_topic_score_gemma":0.000017047314,"teacher_disagreement_score":0.5000189,"about_ca_system_score_codex":0.000014245782,"about_ca_system_score_gemma":0.00010914268,"threshold_uncertainty_score":0.2974119},"labels":[],"label_agreement":null},{"id":"W2287742635","doi":"10.1007/s11225-015-9648-6","title":"Matching Topological and Frame Products of Modal Logics","year":2016,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Cartesian product; Product (mathematics); Combinatorics; Physics; Topology (electrical circuits); Mathematics; Geometry","score_opus":0.02234388495915967,"score_gpt":0.2438347671193651,"score_spread":0.22149088216020543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287742635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7757457,0.0017868638,0.15990473,0.0052146264,0.0007118815,0.00041494667,0.0000064465517,0.00034177868,0.055873036],"genre_scores_gemma":[0.98443097,0.00018814436,0.014796083,0.00014498769,0.000119342854,0.000010978015,2.6170142e-7,0.00000452252,0.00030473564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864936,0.000091675916,0.00022176224,0.0005104615,0.00019462752,0.00033212063],"domain_scores_gemma":[0.99903184,0.0002477869,0.000112678936,0.00040459115,0.000117630174,0.00008548516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422115,0.0001657543,0.00029529157,0.000044803353,0.00013176251,0.000038502738,0.00056718563,0.00010380692,0.000028621826],"category_scores_gemma":[0.00029571226,0.0000843366,0.000049889888,0.00020893732,0.00024571313,0.00018478282,0.0006813188,0.00010685471,0.00004108832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010821239,0.0001509026,0.0076267556,0.000019729818,0.000024009087,0.000024125893,0.0012265776,0.0000016329944,0.0051025925,0.9719244,0.00041765327,0.0134708],"study_design_scores_gemma":[0.0013358342,0.0013253592,0.17042778,0.00008207392,0.000026418997,0.000085907595,0.00029817846,0.00009554333,0.0055335453,0.81091934,0.00913546,0.0007345313],"about_ca_topic_score_codex":0.000010751821,"about_ca_topic_score_gemma":0.0000043840537,"teacher_disagreement_score":0.20868525,"about_ca_system_score_codex":0.000020955722,"about_ca_system_score_gemma":0.000051381372,"threshold_uncertainty_score":0.34391466},"labels":[],"label_agreement":null},{"id":"W2332702779","doi":"10.1007/s11225-016-9659-y","title":"Special Issue on Logical Aspects of Multi-Agent Systems","year":2016,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computational linguistics; Theoretical computer science; Artificial intelligence; Programming language; Natural language processing; Cognitive science; Psychology","score_opus":0.041621150993247646,"score_gpt":0.2700030614398125,"score_spread":0.22838191044656486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332702779","genre_codex":"other","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.0067403833,0.00064394606,0.038335834,0.0008796541,0.0059946496,0.00061975984,0.000011688355,0.00029213424,0.94648194],"genre_scores_gemma":[0.99182737,0.000095841,0.0009953884,0.00009796443,0.0042077797,0.00002532326,4.6168384e-7,0.0000076232623,0.002742228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982219,0.00015174158,0.0003101709,0.0005531438,0.00035935393,0.00040373136],"domain_scores_gemma":[0.9987564,0.0002656255,0.00015938432,0.000556127,0.00012465386,0.00013781522],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031312185,0.00021585965,0.00039100365,0.000072585935,0.00012650403,0.00004974334,0.000877584,0.00010860772,0.00020916738],"category_scores_gemma":[0.00025065185,0.00011166918,0.00012664704,0.0002409765,0.00013053004,0.00010451777,0.00038203833,0.00009980414,0.001395181],"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.000027306834,0.0008149287,0.0016507391,0.000024512943,0.00006330389,0.00014125613,0.0008444805,0.000017196233,0.0008225885,0.9293838,0.035600647,0.030609246],"study_design_scores_gemma":[0.0039505786,0.0032254157,0.08877646,0.00026536186,0.000037284524,0.000046879395,0.00024870445,0.00051421253,0.0032075078,0.008721446,0.8899131,0.0010930923],"about_ca_topic_score_codex":0.000011254628,"about_ca_topic_score_gemma":0.000011598975,"teacher_disagreement_score":0.985087,"about_ca_system_score_codex":0.00008171877,"about_ca_system_score_gemma":0.00006507023,"threshold_uncertainty_score":0.9993824},"labels":[],"label_agreement":null},{"id":"W2562611489","doi":"10.1007/s11225-017-9767-3","title":"The Category of Node-and-Choice Preforms for Extensive-Form Games","year":2017,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Subcategory; Morphism; Mathematics; Tree (set theory); Node (physics); Functor; Combinatorics; Set (abstract data type); Discrete mathematics; Operator (biology); Computer science; Physics","score_opus":0.043542723027795265,"score_gpt":0.28794878925783285,"score_spread":0.24440606623003758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562611489","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.081195444,0.016725926,0.5397075,0.014210341,0.008703645,0.007194842,0.000018082901,0.0007857141,0.33145854],"genre_scores_gemma":[0.9976196,0.00013636316,0.0010491698,0.00008299946,0.00011336885,0.000094868185,5.5145733e-7,0.000005221019,0.00089781947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990556,0.000020949914,0.00020221934,0.0002756834,0.00015978364,0.0002857153],"domain_scores_gemma":[0.99843013,0.00024125313,0.0002804396,0.0008092975,0.00018678435,0.000052076546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046547616,0.000120212695,0.00021217015,0.000018324225,0.00094329607,0.00023516588,0.0010591658,0.000054821285,0.0000010087218],"category_scores_gemma":[0.00036036115,0.000058703965,0.00008081604,0.000038414335,0.00023676272,0.00021995221,0.00044737148,0.00006868027,0.00000917574],"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.000014942829,0.00005457168,0.009821053,0.00005763913,0.00008017083,0.0000035173537,0.0014735122,9.67905e-7,0.00013844491,0.8659835,0.001815122,0.12055656],"study_design_scores_gemma":[0.0014098696,0.00087078643,0.36436707,0.000012515337,0.00004225593,0.000020899104,0.0007305236,0.0009376256,0.00087824056,0.3034314,0.32682434,0.00047449628],"about_ca_topic_score_codex":0.00018012623,"about_ca_topic_score_gemma":0.000103701976,"teacher_disagreement_score":0.9164242,"about_ca_system_score_codex":0.00001331455,"about_ca_system_score_gemma":0.00004384277,"threshold_uncertainty_score":0.7255166},"labels":[],"label_agreement":null},{"id":"W2773658508","doi":"10.1007/s11225-017-9775-3","title":"Topological-Frame Products of Modal Logics","year":2017,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Star product; Product (mathematics); Mathematics; Product topology; Combinatorics; Discrete mathematics; Topology (electrical circuits); Geometry","score_opus":0.04643960969552468,"score_gpt":0.28818951012914185,"score_spread":0.24174990043361716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773658508","genre_codex":"other","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.17051373,0.0017649146,0.038889863,0.0071142083,0.0026154334,0.0008112223,0.000009975189,0.00050409423,0.77777654],"genre_scores_gemma":[0.9845346,0.00012529136,0.013792898,0.00015649456,0.00022561658,0.000019635456,9.949371e-7,0.000005778017,0.0011386423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983013,0.0000803973,0.00027415593,0.0006228257,0.00028105176,0.0004402246],"domain_scores_gemma":[0.9975863,0.00010752591,0.0003367341,0.0016098566,0.00025799923,0.000101593396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044469006,0.00021340013,0.0004039144,0.000044586388,0.0005942712,0.00017350924,0.0025118866,0.00013866342,0.00004563164],"category_scores_gemma":[0.0013305345,0.00014128382,0.00011165793,0.00015032366,0.00043906327,0.00029378996,0.0014288427,0.0002040481,0.00013606189],"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.00001288399,0.00039056462,0.013708916,0.000028703758,0.000043950102,0.000059028036,0.0008165285,0.000010092965,0.0009819922,0.97149754,0.0029753188,0.009474489],"study_design_scores_gemma":[0.0016557398,0.0018943148,0.5907181,0.000055381613,0.000051237446,0.000055855562,0.00019738621,0.0010039685,0.008149086,0.3458782,0.049171396,0.001169338],"about_ca_topic_score_codex":0.000030171615,"about_ca_topic_score_gemma":0.000010426388,"teacher_disagreement_score":0.81402093,"about_ca_system_score_codex":0.00002657375,"about_ca_system_score_gemma":0.00010263551,"threshold_uncertainty_score":0.5761387},"labels":[],"label_agreement":null},{"id":"W4235403575","doi":"10.1023/a:1015158532251","title":"Bernard Linsky, Russell's Metaphysical Logic","year":2002,"lang":"en","type":"article","venue":"Studia Logica","topic":"Phenomenology and Existential Philosophy","field":"Psychology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computational linguistics; Computer science; Linguistics; Mathematics; Natural language processing; Philosophy","score_opus":0.09650533790692871,"score_gpt":0.31146926187942786,"score_spread":0.21496392397249914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235403575","genre_codex":"other","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.05454529,0.0024749888,0.00007759665,0.0065920753,0.0012741344,0.00022385086,0.000014424803,0.00023019272,0.93456745],"genre_scores_gemma":[0.99221456,0.00013210681,0.00017514784,0.0020479816,0.0007618504,0.00007012491,0.000006948109,0.00001913846,0.0045721475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983759,0.0001695129,0.00026046607,0.0005218256,0.00015631721,0.00051596545],"domain_scores_gemma":[0.99914986,0.00011165792,0.000091941554,0.0004899852,0.000036348196,0.00012020567],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012277148,0.0002347428,0.00038690423,0.00007176059,0.00023145789,0.000016995229,0.00037693512,0.0001891031,0.00873725],"category_scores_gemma":[0.00003158618,0.00018577804,0.00019783434,0.00024853976,0.0002908498,0.00005721909,0.00013437658,0.0003655179,0.016704865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007030708,0.0018273911,0.0014011237,0.0000073198667,0.0007767034,0.00031909335,0.0021179628,0.00000575384,0.0002765889,0.914694,0.07262372,0.0058800085],"study_design_scores_gemma":[0.0030714988,0.002115795,0.048064206,0.00001169884,0.00041510613,0.00009037762,0.00076287374,0.000021793421,0.000058251037,0.5607235,0.38348305,0.0011818506],"about_ca_topic_score_codex":0.000014987212,"about_ca_topic_score_gemma":0.0000027103854,"teacher_disagreement_score":0.9376693,"about_ca_system_score_codex":0.000022016606,"about_ca_system_score_gemma":0.0000045991314,"threshold_uncertainty_score":0.9921689},"labels":[],"label_agreement":null},{"id":"W4400659579","doi":"10.1007/s11225-024-10124-2","title":"A Version of Predicate Logic with Two Variables That has an Incompleteness Property","year":2024,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"İstanbul Medipol Üniversitesi","keywords":"Predicate logic; Predicate (mathematical logic); Computational linguistics; Property (philosophy); Predicate variable; Computer science; Programming language; Mathematics; Theoretical computer science; Natural language processing; Discrete mathematics; Multimodal logic; Description logic; Zeroth-order logic; Philosophy; Epistemology","score_opus":0.055339915041323066,"score_gpt":0.2630611017842904,"score_spread":0.2077211867429673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400659579","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.09598331,0.0064330604,0.572491,0.0035440484,0.0023012143,0.0018667924,0.000048953407,0.0024596674,0.31487197],"genre_scores_gemma":[0.98881555,0.00006163849,0.010515288,0.00010003157,0.0000930664,0.000036649093,0.0000067062942,0.000010923054,0.00036016648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983599,0.00013786553,0.00018226323,0.00063676375,0.0003465359,0.00033667884],"domain_scores_gemma":[0.99904007,0.00011942745,0.00007844544,0.0005305608,0.000118400494,0.000113109694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043374722,0.00021336567,0.00030776384,0.00009561913,0.00023991725,0.00021854443,0.0009432125,0.00006410058,0.00005633033],"category_scores_gemma":[0.000034703018,0.00010154986,0.00006352753,0.0005615963,0.00023448415,0.00043507208,0.0005112051,0.00015671599,0.0000730188],"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.00027845148,0.0018771541,0.027582344,0.0007580992,0.0005823765,0.0008572734,0.01320274,0.0006375342,0.005051188,0.8857675,0.013720408,0.04968491],"study_design_scores_gemma":[0.009695968,0.018833285,0.12605716,0.002557642,0.0007055493,0.00076995965,0.0023896825,0.17874265,0.011085292,0.23766734,0.4066517,0.0048437538],"about_ca_topic_score_codex":0.0001122699,"about_ca_topic_score_gemma":0.000047085523,"teacher_disagreement_score":0.8928322,"about_ca_system_score_codex":0.00004321928,"about_ca_system_score_gemma":0.00025856687,"threshold_uncertainty_score":0.4141083},"labels":[],"label_agreement":null}]}