{"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":"commentary","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.03128698,0.12574646,0.079172105,0.5100406,0.003870947,0.00006962045,0.0003297577,0.000109340486,0.24937426],"genre_scores_gemma":[0.8398728,0.045385066,0.03717064,0.03436817,0.0058747134,0.00020302049,0.00011707934,0.00015070032,0.036857903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778926,0.0013494916,0.0000917404,0.00029329193,0.0003489215,0.00012734575],"domain_scores_gemma":[0.98789805,0.010526299,0.00038857132,0.00039954975,0.00056864996,0.00021879922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048722816,0.0005634102,0.00083212386,0.0012890005,0.0049824114,0.0068107727,0.001792836,0.007960255,0.007274228],"category_scores_gemma":[0.018210465,0.0006238858,0.00061581185,0.0025455977,0.017263256,0.017778726,0.002567946,0.006685767,0.00070580066],"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.000025496549,0.000012816925,0.00009362716,0.000056570665,0.000013005769,0.00006279551,0.0008488251,0.00044957714,0.000053552063,0.97784525,0.017110523,0.0034278715],"study_design_scores_gemma":[0.000017255956,0.0000023397758,0.00007558917,0.00003546109,0.000006669674,0.000019765568,0.00033806905,0.00040197035,0.000047616286,0.98577857,0.013269692,0.0000070468373],"about_ca_topic_score_codex":0.009006854,"about_ca_topic_score_gemma":0.012492393,"teacher_disagreement_score":0.009006854,"about_ca_system_score_codex":0.0026820211,"about_ca_system_score_gemma":0.002527643,"threshold_uncertainty_score":0.025767386},"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":"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.034564435,0.0049208165,0.8465782,0.0048986645,0.0007535519,0.00019573684,0.00039772666,0.0012165852,0.10647428],"genre_scores_gemma":[0.67723846,0.00725218,0.25757465,0.0023785047,0.0029047048,0.0005559506,0.0010259182,0.0013991692,0.04967052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937033,0.002233031,0.0004371481,0.0010765708,0.0018981876,0.00065179676],"domain_scores_gemma":[0.9838451,0.01139333,0.00067001116,0.0015408619,0.0019325025,0.0006181593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007015844,0.001064015,0.0025260672,0.004477787,0.005050901,0.00804748,0.00330314,0.0035980137,0.017330099],"category_scores_gemma":[0.01988252,0.0014993687,0.0033459952,0.005931677,0.0049938685,0.023953728,0.007132452,0.009652004,0.0029660463],"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.00003321977,0.000040528146,0.00012583427,0.00007295742,0.000016965736,0.000072215,0.0002288165,0.0007072136,0.00033522892,0.99067795,0.0014474447,0.0062416946],"study_design_scores_gemma":[0.000025520878,0.000012765594,0.000111951624,0.000018628396,0.000030200932,0.00006082288,0.000059734586,0.0049410383,0.0006852635,0.9890153,0.005021905,0.000016894834],"about_ca_topic_score_codex":0.0017393064,"about_ca_topic_score_gemma":0.0010615729,"teacher_disagreement_score":0.017330099,"about_ca_system_score_codex":0.003943891,"about_ca_system_score_gemma":0.0025167954,"threshold_uncertainty_score":0.057974994},"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":"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.17750554,0.0046297666,0.53877324,0.016040891,0.00038717486,0.00018542816,0.00056631863,0.00067235396,0.2612393],"genre_scores_gemma":[0.94415927,0.0014213214,0.044775058,0.0003991975,0.00026149894,0.00011037812,0.0003218178,0.000072396295,0.008478992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99542063,0.0019912624,0.0004261378,0.00072554935,0.00077794597,0.0006584333],"domain_scores_gemma":[0.99014753,0.0073874705,0.0004098125,0.0010119103,0.0004530431,0.0005902187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005652686,0.0009459452,0.001425222,0.0024832792,0.0035978802,0.010255695,0.002523483,0.0031387394,0.008535618],"category_scores_gemma":[0.011998529,0.000987481,0.002636734,0.0023400323,0.014962475,0.031434044,0.0054758172,0.007215521,0.0007990165],"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.000013617509,0.000013545958,0.00013572138,0.000019667832,0.000009898156,0.00005013131,0.0005233359,0.00070465804,0.000058789363,0.9961345,0.0002026312,0.002133477],"study_design_scores_gemma":[0.000006730367,0.0000028369311,0.00005640225,0.000005968117,0.000009516372,0.000022925262,0.000079695266,0.0012674776,0.000057163837,0.99761814,0.00086605304,0.0000070727706],"about_ca_topic_score_codex":0.0054113483,"about_ca_topic_score_gemma":0.002691613,"teacher_disagreement_score":0.010255695,"about_ca_system_score_codex":0.0022510847,"about_ca_system_score_gemma":0.0018716573,"threshold_uncertainty_score":0.02989459},"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":"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.06167876,0.0042713443,0.8261126,0.0066896197,0.00066526234,0.00014738594,0.00079125824,0.0008540806,0.09878966],"genre_scores_gemma":[0.8012026,0.0024918248,0.17539433,0.0013668516,0.0007143893,0.00023110275,0.0004409279,0.00027979305,0.0178781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982658,0.00054484146,0.00016184423,0.0003272107,0.0004859253,0.00021441103],"domain_scores_gemma":[0.9982333,0.000762565,0.00013840669,0.0003075654,0.0003496735,0.00020854527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030032862,0.00095368206,0.0014259341,0.002784651,0.00307711,0.007002317,0.0020693846,0.002207709,0.006172919],"category_scores_gemma":[0.003684641,0.00097368937,0.0023923113,0.0021777549,0.0066183233,0.014037607,0.004031894,0.0054475307,0.0013499884],"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.000007187225,0.000005462879,0.000020619067,0.000015491174,0.0000036853412,0.000019390469,0.000089615736,0.00032422747,0.0001472878,0.99799085,0.00026393693,0.0011122029],"study_design_scores_gemma":[0.00000940974,0.0000054458833,0.00002421234,0.000009869058,0.000004468678,0.000029675453,0.000032480035,0.0012885311,0.000116738316,0.995933,0.0025359462,0.000010161391],"about_ca_topic_score_codex":0.0017766672,"about_ca_topic_score_gemma":0.0014361427,"teacher_disagreement_score":0.007002317,"about_ca_system_score_codex":0.002893934,"about_ca_system_score_gemma":0.0014735066,"threshold_uncertainty_score":0.020997107},"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":"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.070067175,0.008296274,0.24810834,0.10319762,0.0027200736,0.00027683363,0.0009411221,0.001985709,0.5644069],"genre_scores_gemma":[0.57331395,0.0043619014,0.15057912,0.011268253,0.00074026274,0.00033985882,0.0009148838,0.0010795856,0.25740227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988072,0.0005557552,0.000046365458,0.00017975525,0.00023301624,0.00017793657],"domain_scores_gemma":[0.99837106,0.0005912695,0.000044508717,0.0004559614,0.00025063063,0.00028659822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016213886,0.00045959497,0.00057151745,0.0017369111,0.0049859113,0.006163428,0.001519629,0.0025235587,0.02133842],"category_scores_gemma":[0.0046898928,0.0005178603,0.0010928775,0.0016227708,0.01376259,0.008475929,0.003844797,0.0043697967,0.0033044524],"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.000033309396,0.000018193687,0.00020915628,0.000025025936,0.000008852709,0.00008625739,0.0018114662,0.00039634173,0.00037310613,0.9796642,0.008077513,0.009296438],"study_design_scores_gemma":[0.00002069164,0.000017238806,0.0002359642,0.00004416966,0.0000103004395,0.000115713854,0.0014174558,0.0007431705,0.00026732407,0.8791009,0.117999494,0.000027621167],"about_ca_topic_score_codex":0.006030683,"about_ca_topic_score_gemma":0.007039829,"teacher_disagreement_score":0.02133842,"about_ca_system_score_codex":0.0024474033,"about_ca_system_score_gemma":0.001461272,"threshold_uncertainty_score":0.07138419},"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":"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.17917927,0.011088988,0.715662,0.030142576,0.00051968603,0.00014043617,0.0003768273,0.0007158909,0.06217432],"genre_scores_gemma":[0.9265168,0.0014679767,0.068113,0.00068304903,0.0003296476,0.00004936636,0.0002735913,0.00010359891,0.0024629524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918184,0.00466218,0.00055175816,0.0010784264,0.0014270731,0.00046210238],"domain_scores_gemma":[0.9566405,0.03485827,0.0023022369,0.003728246,0.0019180616,0.0005527274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013269915,0.0007869795,0.0013516247,0.003014941,0.0026894724,0.007643653,0.004618985,0.0042216354,0.008022711],"category_scores_gemma":[0.05523615,0.0013414167,0.0029850677,0.0017942565,0.0111444285,0.024000116,0.0058340314,0.0064248503,0.0006432965],"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.00008016674,0.000040657415,0.00052858103,0.00015070233,0.00006072247,0.00021254849,0.0017375493,0.0021648705,0.0006553732,0.97451764,0.0015995502,0.018251548],"study_design_scores_gemma":[0.000014249688,0.0000039108318,0.0001081143,0.000013382131,0.000009306539,0.000042498647,0.00012805617,0.0022427787,0.00012530755,0.9964737,0.0008310217,0.000007639553],"about_ca_topic_score_codex":0.0019500036,"about_ca_topic_score_gemma":0.0013052082,"teacher_disagreement_score":0.013269915,"about_ca_system_score_codex":0.0019311163,"about_ca_system_score_gemma":0.0015966402,"threshold_uncertainty_score":0.07017887},"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":"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.14224572,0.00602067,0.5012046,0.013429876,0.00097304716,0.00013340863,0.0016361967,0.00087082665,0.3334857],"genre_scores_gemma":[0.8643344,0.0032399122,0.091198616,0.002384723,0.0014675203,0.0002653212,0.0016492695,0.00047048036,0.034989677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978886,0.00065800996,0.0001243044,0.0004655535,0.00061017997,0.00025339503],"domain_scores_gemma":[0.9938153,0.0038399324,0.00020234191,0.0007605579,0.0010052078,0.00037664833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004308639,0.00089176116,0.0014330352,0.002928352,0.0028266136,0.0043807784,0.0014246671,0.0016684596,0.007047413],"category_scores_gemma":[0.005066484,0.0011662991,0.0020963158,0.0018889101,0.0058434,0.01881251,0.0053267577,0.008733471,0.0011413646],"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.000026589045,0.000026439278,0.00013506958,0.000046672572,0.000013231387,0.00002072458,0.00013385637,0.00024540347,0.00025682797,0.99369437,0.0015520224,0.0038488135],"study_design_scores_gemma":[0.00001712072,0.0000055593964,0.00008504408,0.000008672594,0.000008674273,0.00003536429,0.000030565112,0.0010037936,0.00025256842,0.99608094,0.0024656502,0.000006018954],"about_ca_topic_score_codex":0.00094134506,"about_ca_topic_score_gemma":0.0010068916,"teacher_disagreement_score":0.007047413,"about_ca_system_score_codex":0.001634047,"about_ca_system_score_gemma":0.0012242886,"threshold_uncertainty_score":0.023575962},"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":"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.016505873,0.0073075015,0.7202633,0.023644656,0.00062698487,0.00005659695,0.0005326909,0.00060069835,0.23046167],"genre_scores_gemma":[0.78787917,0.004695557,0.16106036,0.0044156066,0.0019511159,0.0002958069,0.0008770013,0.0002821939,0.03854321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804085,0.00089678966,0.000117018535,0.0004371185,0.0003474039,0.00016079465],"domain_scores_gemma":[0.9966348,0.0018078546,0.00019850257,0.0006162088,0.000552522,0.0001901134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003122654,0.0007297251,0.00094722013,0.0032969085,0.0033393707,0.006886105,0.0018793178,0.0024392202,0.012284142],"category_scores_gemma":[0.0060068974,0.0007682102,0.001619689,0.002584357,0.014306262,0.020139767,0.004142892,0.005079941,0.0020308518],"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.0000019341846,0.0000022358586,0.000024299858,0.000007809601,0.0000019419065,0.000008820462,0.000068239155,0.000080358,0.000029468267,0.9980413,0.0006441779,0.0010894206],"study_design_scores_gemma":[0.000005063258,0.0000024196943,0.000028685667,0.000007823445,0.000003303692,0.000021094515,0.000043583394,0.00044354063,0.000041109997,0.99433434,0.0050665042,0.0000026430444],"about_ca_topic_score_codex":0.001987852,"about_ca_topic_score_gemma":0.0013728301,"teacher_disagreement_score":0.012284142,"about_ca_system_score_codex":0.0028909168,"about_ca_system_score_gemma":0.0015289176,"threshold_uncertainty_score":0.041094482},"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":"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.15652008,0.00025140384,0.8342321,0.0010129937,0.000045284352,0.00019888229,0.0003264876,0.001946203,0.0054666563],"genre_scores_gemma":[0.8372851,0.00022864057,0.15876509,0.00016798907,0.000058355323,0.00021437457,0.00058101607,0.00015266344,0.00254668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901231,0.002766004,0.0006806112,0.0017011922,0.0033633274,0.0013658217],"domain_scores_gemma":[0.9720091,0.020034982,0.0023443573,0.0024269351,0.0023679328,0.0008166345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009139575,0.0011001686,0.0010816086,0.002250607,0.0017574498,0.0039743343,0.0030914124,0.0016035577,0.0032361231],"category_scores_gemma":[0.0374341,0.000993422,0.0031432572,0.0012509986,0.0060404236,0.009147213,0.004672834,0.004026777,0.0004459203],"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.00046269223,0.00019731502,0.004120662,0.00026329316,0.00019753721,0.0016037452,0.0031037112,0.14229977,0.010373061,0.8089967,0.0007087696,0.0276728],"study_design_scores_gemma":[0.000109851,0.000105033,0.00040240728,0.00006487004,0.000095918425,0.00012584285,0.00023175542,0.46848714,0.009198273,0.5188406,0.0022765324,0.0000617423],"about_ca_topic_score_codex":0.013647038,"about_ca_topic_score_gemma":0.0076332497,"teacher_disagreement_score":0.013647038,"about_ca_system_score_codex":0.003643123,"about_ca_system_score_gemma":0.0044345083,"threshold_uncertainty_score":0.048335314},"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":"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.25317633,0.0044432976,0.51655585,0.003540866,0.0012064517,0.00011897193,0.0013049594,0.0014751815,0.21817817],"genre_scores_gemma":[0.91344446,0.0012870338,0.041496247,0.0004481866,0.00074452965,0.00009496542,0.00089654967,0.00020212297,0.04138593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911934,0.0002315402,0.00006739766,0.00014251277,0.0002568162,0.00018240232],"domain_scores_gemma":[0.99908507,0.0002318783,0.00013199697,0.00015516511,0.00020733566,0.00018855439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013269129,0.0006509415,0.0009329119,0.0018342851,0.0017648233,0.0051880884,0.0013848565,0.0010078643,0.010736235],"category_scores_gemma":[0.002077128,0.00050343515,0.0011151263,0.0018463219,0.0019403951,0.0074465256,0.0018950531,0.0026150816,0.0014611747],"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.00001534592,0.0000076485485,0.000039411007,0.000011836715,0.000004053789,0.000013755339,0.0001071715,0.0001760074,0.00025934403,0.9967673,0.00040513003,0.0021930488],"study_design_scores_gemma":[0.000011505309,0.000008120899,0.00006462088,0.000009437332,0.0000069913253,0.00003489221,0.000069201385,0.0015330971,0.00021895555,0.99408925,0.003945854,0.000008147352],"about_ca_topic_score_codex":0.0012622578,"about_ca_topic_score_gemma":0.0014445914,"teacher_disagreement_score":0.010736235,"about_ca_system_score_codex":0.0016178131,"about_ca_system_score_gemma":0.0006827078,"threshold_uncertainty_score":0.03591627},"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":"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.17366076,0.044774767,0.24723029,0.018702572,0.0023520943,0.00009190765,0.001322179,0.00055645243,0.5113091],"genre_scores_gemma":[0.9002643,0.009526243,0.021478217,0.001187704,0.0023546917,0.000105229155,0.0009780583,0.00012897127,0.06397657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999238,0.00025160203,0.000051003863,0.00017593925,0.00018244624,0.000101005375],"domain_scores_gemma":[0.99935204,0.00025751104,0.000083939056,0.00008328107,0.00012898417,0.00009420886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011693637,0.00097194227,0.0012056137,0.0025286411,0.0028505547,0.0053503993,0.0010839909,0.0017904209,0.010903624],"category_scores_gemma":[0.0018930321,0.00068414037,0.0009958361,0.0032219007,0.004163076,0.011256411,0.0018474102,0.003623751,0.0013525602],"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.0000057072234,0.000004258904,0.000028397311,0.000007993583,0.0000032489145,0.000008912818,0.00007202401,0.00007404247,0.00006130118,0.99804246,0.0005088203,0.0011827594],"study_design_scores_gemma":[0.0000041802004,0.000002541549,0.000037349004,0.0000047388344,0.0000041986227,0.000011684996,0.000030130095,0.00019864939,0.000027676815,0.9963708,0.0033052834,0.0000029478213],"about_ca_topic_score_codex":0.0027036178,"about_ca_topic_score_gemma":0.0020530908,"teacher_disagreement_score":0.010903624,"about_ca_system_score_codex":0.0024597873,"about_ca_system_score_gemma":0.00080185133,"threshold_uncertainty_score":0.036476254},"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":"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.055904772,0.0062501184,0.4575361,0.062223427,0.0011352922,0.00017378831,0.0006957349,0.0004059103,0.41567487],"genre_scores_gemma":[0.9066115,0.0019057919,0.048866693,0.0032878343,0.00069089554,0.00020226177,0.00040642897,0.0001028529,0.03792567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535275,0.0019499649,0.00019013067,0.0011186872,0.0010298961,0.00035859062],"domain_scores_gemma":[0.9868025,0.007479594,0.00068097253,0.0023710069,0.0021954263,0.00047045792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059394613,0.00071663526,0.0009639316,0.0019632482,0.0025017443,0.004474092,0.0016822497,0.0030476437,0.013711708],"category_scores_gemma":[0.028997842,0.0005136291,0.0014076353,0.0012969942,0.008611471,0.010052567,0.003097084,0.008009921,0.0018472845],"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.000029470435,0.000016375383,0.00017510225,0.000020528973,0.000018175611,0.000036024834,0.00024017163,0.00032922975,0.00007228301,0.9919836,0.0013203344,0.0057588057],"study_design_scores_gemma":[0.000010842315,0.0000050686176,0.000095583186,0.0000076023175,0.0000088203315,0.000037370777,0.000043068998,0.0011275418,0.000079099606,0.9958645,0.002716434,0.000003985482],"about_ca_topic_score_codex":0.0025326768,"about_ca_topic_score_gemma":0.0019315787,"teacher_disagreement_score":0.013711708,"about_ca_system_score_codex":0.0040614796,"about_ca_system_score_gemma":0.0015623738,"threshold_uncertainty_score":0.045870304},"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":"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.2299704,0.034369174,0.39232776,0.039050583,0.0025527766,0.00012351738,0.0007267074,0.0005597306,0.30031934],"genre_scores_gemma":[0.9516027,0.0061371387,0.020537378,0.0029203244,0.0025041231,0.00010882265,0.00032355642,0.00017757501,0.01568848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970078,0.0010352365,0.0002175365,0.00082376617,0.00049321743,0.00042246707],"domain_scores_gemma":[0.9907224,0.006361348,0.0004833527,0.0011353276,0.00080728286,0.0004903345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006512366,0.0011307881,0.0020508333,0.00447993,0.0038531192,0.004126805,0.0020645692,0.0025511915,0.008668369],"category_scores_gemma":[0.010221069,0.0012748429,0.0024240434,0.005949225,0.01934192,0.038497437,0.0074793175,0.0077641727,0.0008903472],"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.0000096821395,0.000005847294,0.00007176847,0.000021195043,0.0000056963754,0.00001549202,0.00015796963,0.00009090286,0.000080195794,0.9977865,0.00032734193,0.0014274681],"study_design_scores_gemma":[0.0000037248315,0.000003894442,0.000064353815,0.000007769103,0.000005659554,0.000015694917,0.00003189256,0.00013837666,0.000043466018,0.9984023,0.0012787032,0.000004122065],"about_ca_topic_score_codex":0.0018296246,"about_ca_topic_score_gemma":0.0010103846,"teacher_disagreement_score":0.008668369,"about_ca_system_score_codex":0.003315368,"about_ca_system_score_gemma":0.0009085992,"threshold_uncertainty_score":0.034441054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5555204,0.007832703,0.16190952,0.0070307646,0.0007929885,0.00007576172,0.00045497634,0.00021329985,0.26616955],"genre_scores_gemma":[0.96006703,0.001464763,0.013082129,0.0004014484,0.000513985,0.000056917997,0.00021145707,0.000036211142,0.024165956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.00023320234,0.000054342487,0.00012879664,0.0002185504,0.00011091693],"domain_scores_gemma":[0.99886984,0.00042405364,0.00014426047,0.000106013715,0.00019803777,0.00025777298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00173166,0.000562225,0.0008360389,0.0020851386,0.0019533285,0.0044680936,0.00067650306,0.0008028934,0.0058205226],"category_scores_gemma":[0.0019102904,0.00040338194,0.00085148774,0.0010220469,0.004285434,0.008462515,0.002637622,0.0035765078,0.0004743677],"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.000007812925,0.000007807168,0.00005743481,0.000008713413,0.0000025148343,0.000010759691,0.000086444226,0.0000549256,0.00012877988,0.998787,0.00017999555,0.00066783855],"study_design_scores_gemma":[0.00001329485,0.000007265113,0.00009314255,0.0000056231374,0.0000044083085,0.00003072919,0.000078507604,0.0004924967,0.00014585037,0.9974982,0.00162595,0.000004546348],"about_ca_topic_score_codex":0.0006484295,"about_ca_topic_score_gemma":0.0006694551,"teacher_disagreement_score":0.0058205226,"about_ca_system_score_codex":0.0016519333,"about_ca_system_score_gemma":0.0005999071,"threshold_uncertainty_score":0.019471526},"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":"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.30314946,0.04105149,0.25140628,0.033386793,0.00092770543,0.000054444095,0.0006093084,0.00041329494,0.36900118],"genre_scores_gemma":[0.9540058,0.007448572,0.019817047,0.0007719884,0.0010488775,0.000060783474,0.00021324647,0.0000709169,0.016562779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984493,0.0005311447,0.000095041454,0.0002696769,0.0004984657,0.00015621165],"domain_scores_gemma":[0.99384767,0.004797566,0.00033022263,0.00047060495,0.00032574762,0.00022822409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031320981,0.0007053145,0.0011727593,0.0026284433,0.0025044864,0.0067412565,0.0015090089,0.0019818859,0.0050983764],"category_scores_gemma":[0.007947222,0.00067131495,0.0009061672,0.0026529082,0.0075690877,0.016997488,0.0023667216,0.004985235,0.0004620864],"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.000008214294,0.0000073564365,0.00012323621,0.000016325219,0.0000043390933,0.000019336285,0.00007869671,0.0003592922,0.00006263463,0.99647766,0.0005154706,0.002327391],"study_design_scores_gemma":[0.0000027757173,8.390734e-7,0.00005997474,0.000004280096,0.0000023575658,0.000009480292,0.00001004102,0.0004482792,0.00002278413,0.99872214,0.00071457814,0.0000023713276],"about_ca_topic_score_codex":0.0015449323,"about_ca_topic_score_gemma":0.0011218378,"teacher_disagreement_score":0.0067412565,"about_ca_system_score_codex":0.0029940528,"about_ca_system_score_gemma":0.000853103,"threshold_uncertainty_score":0.02172345},"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":"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.11196703,0.019470025,0.61289036,0.048005637,0.002168098,0.00016270445,0.000697123,0.00071814796,0.20392086],"genre_scores_gemma":[0.7950282,0.0071077035,0.15734263,0.0063218274,0.0014341171,0.00017412203,0.00073722284,0.0005676307,0.031286597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671894,0.0013739883,0.00019758589,0.00061939546,0.00083478075,0.00025522616],"domain_scores_gemma":[0.99588543,0.0020585894,0.0001587273,0.0011629557,0.0005188876,0.00021534787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037037057,0.0006348402,0.0013727439,0.0021720787,0.0024391972,0.0062852926,0.0020066518,0.0020635289,0.0042061745],"category_scores_gemma":[0.010686975,0.0008985085,0.0017802886,0.0024253952,0.012031847,0.017692372,0.005431055,0.0064814766,0.0011566306],"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.00001357953,0.000009745392,0.000097358374,0.000025093039,0.000008607686,0.000012354755,0.00021742047,0.00017013593,0.00008490607,0.9953819,0.000841097,0.003137812],"study_design_scores_gemma":[0.00000615296,0.0000037446648,0.00011386239,0.000008532637,0.000008960593,0.000023426086,0.000050101204,0.00050327164,0.00010444078,0.9952799,0.0038910166,0.00000661834],"about_ca_topic_score_codex":0.0025486422,"about_ca_topic_score_gemma":0.002602835,"teacher_disagreement_score":0.0062852926,"about_ca_system_score_codex":0.002722471,"about_ca_system_score_gemma":0.001875043,"threshold_uncertainty_score":0.01975298},"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":"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.065871805,0.007228128,0.6937968,0.015875388,0.0038209711,0.000112806076,0.00060709193,0.00079755427,0.21188949],"genre_scores_gemma":[0.76052517,0.008275992,0.13912499,0.00551226,0.0067449827,0.00035005942,0.00075987726,0.00072397303,0.07798274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882346,0.00026182237,0.00006980455,0.0003413004,0.00035180445,0.00015180599],"domain_scores_gemma":[0.99656576,0.0022592072,0.00011040605,0.00041371802,0.00041063683,0.00024025213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015829215,0.00096941524,0.0015276268,0.0036152694,0.0030704367,0.0033512788,0.0016285039,0.0019146512,0.010912667],"category_scores_gemma":[0.006268019,0.00085843547,0.003162652,0.0032453355,0.004936856,0.012500525,0.0077085453,0.005253456,0.0011003719],"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.00002058407,0.000014130221,0.00018080922,0.00006274162,0.000018732539,0.000084253465,0.00024512692,0.00057228626,0.0006121167,0.9866297,0.0024004015,0.0091591645],"study_design_scores_gemma":[0.000008931071,0.000013577785,0.00020300444,0.000014006985,0.000022448214,0.00013345022,0.000051717994,0.0025907974,0.00041881693,0.98552275,0.011011488,0.000009011752],"about_ca_topic_score_codex":0.0015845523,"about_ca_topic_score_gemma":0.001161015,"teacher_disagreement_score":0.010912667,"about_ca_system_score_codex":0.0020337657,"about_ca_system_score_gemma":0.0006900221,"threshold_uncertainty_score":0.036506474},"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":"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.18573448,0.0104764905,0.28696516,0.031758685,0.0004849517,0.00014536965,0.0008924374,0.0007516786,0.4827908],"genre_scores_gemma":[0.9611249,0.001535241,0.024009708,0.0008080244,0.00028116952,0.00007076623,0.00023376534,0.00023370938,0.011702694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622935,0.0012579359,0.00026142847,0.0012184969,0.0006893643,0.00034335916],"domain_scores_gemma":[0.97098273,0.01962363,0.0011360649,0.005703911,0.0020489413,0.00050474465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062574428,0.00038744972,0.0009717252,0.0019988006,0.0022174772,0.0072700046,0.0021777018,0.002407246,0.011316181],"category_scores_gemma":[0.021258686,0.0010594614,0.0010883093,0.0017320367,0.010558093,0.017741408,0.0032001277,0.0039032414,0.0011231852],"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.000023915189,0.000014465854,0.00036485094,0.00003291197,0.000010986973,0.000087435255,0.00044984405,0.00039126351,0.00019220363,0.9930228,0.00067455985,0.0047347476],"study_design_scores_gemma":[0.0000107629885,0.0000038019111,0.00034180022,0.000016967797,0.000009492671,0.00007087859,0.00008562825,0.0013573887,0.00022048788,0.9923453,0.0055296463,0.0000079911],"about_ca_topic_score_codex":0.0034448549,"about_ca_topic_score_gemma":0.0028109618,"teacher_disagreement_score":0.011316181,"about_ca_system_score_codex":0.0040379665,"about_ca_system_score_gemma":0.0017723916,"threshold_uncertainty_score":0.0378564},"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":"commentary","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.023947636,0.010416768,0.11561096,0.45319596,0.013590031,0.00006492666,0.0012465087,0.0008459812,0.38108122],"genre_scores_gemma":[0.6803157,0.009879201,0.06884359,0.095747575,0.039472092,0.00037607102,0.0010973152,0.00061699795,0.1036515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659556,0.00108805,0.00021485625,0.00085684913,0.00095533434,0.000289372],"domain_scores_gemma":[0.9838778,0.011963791,0.0004900597,0.0013318524,0.0018764278,0.00046001276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008138843,0.000983865,0.0012446423,0.0020157497,0.0035675874,0.0033647188,0.002572765,0.003929957,0.030979339],"category_scores_gemma":[0.018164188,0.00051584136,0.0016540397,0.0013818344,0.008906685,0.013502036,0.0037558044,0.0059485137,0.004351372],"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.00006548904,0.000024637257,0.00020883692,0.00007442653,0.000022818835,0.00013929141,0.0002500855,0.00031678777,0.0001914459,0.9707126,0.023271661,0.004721887],"study_design_scores_gemma":[0.000021182872,0.000010818906,0.00031512417,0.000025413314,0.000010850875,0.000060807473,0.00006430062,0.00038738802,0.00013809426,0.97686315,0.022089604,0.000013302583],"about_ca_topic_score_codex":0.0024936374,"about_ca_topic_score_gemma":0.0015655085,"teacher_disagreement_score":0.030979339,"about_ca_system_score_codex":0.002136829,"about_ca_system_score_gemma":0.00075444486,"threshold_uncertainty_score":0.103636205},"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":"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.23495394,0.0031939005,0.53005797,0.015061802,0.00083168177,0.00030920815,0.0028737402,0.0025414622,0.21017633],"genre_scores_gemma":[0.86914575,0.0012181493,0.08785669,0.0020427522,0.0007283866,0.00020614301,0.003718403,0.00029890062,0.034784812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641585,0.0008849505,0.0003216107,0.00078469294,0.0011163872,0.00047640214],"domain_scores_gemma":[0.991013,0.006756329,0.00035203918,0.0007089477,0.00084364874,0.00032606494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039606146,0.0006753915,0.0010047901,0.0018338672,0.0034441492,0.0069835423,0.0031079282,0.0022795615,0.009542574],"category_scores_gemma":[0.010089344,0.0011910099,0.003921376,0.0018245599,0.0048483885,0.0126562705,0.003537851,0.006721123,0.00096163567],"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.00007376903,0.0000664014,0.00049326185,0.000094327464,0.000036842768,0.00013659746,0.00040571927,0.0018650551,0.0006736097,0.98559433,0.0029051178,0.007654974],"study_design_scores_gemma":[0.000051639025,0.000015647302,0.0002259821,0.000026977386,0.00005211049,0.00009976814,0.000107254054,0.013951057,0.0014397108,0.9782653,0.0057480754,0.000016517482],"about_ca_topic_score_codex":0.005959975,"about_ca_topic_score_gemma":0.005590818,"teacher_disagreement_score":0.009542574,"about_ca_system_score_codex":0.00371712,"about_ca_system_score_gemma":0.0025271622,"threshold_uncertainty_score":0.031923115},"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":"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.05955892,0.0044006575,0.77099717,0.008650854,0.0013465245,0.00020163447,0.00047355666,0.0008603903,0.15351035],"genre_scores_gemma":[0.79736537,0.0015766083,0.17400512,0.0015383804,0.00071353617,0.00022629135,0.0005181106,0.0003128168,0.02374367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965953,0.001529647,0.0001822157,0.00033493366,0.00082998886,0.0005278335],"domain_scores_gemma":[0.99353987,0.0042184643,0.00028009445,0.00084281503,0.0006719104,0.0004468842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045725685,0.0010918565,0.0013363098,0.002593032,0.0029540872,0.006976961,0.0032752,0.0030907157,0.009175087],"category_scores_gemma":[0.009333911,0.0009801997,0.0024903836,0.0021213666,0.008924989,0.013786837,0.0047788857,0.0067654215,0.001063097],"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.000016738042,0.00001226862,0.000030920055,0.00001855443,0.000004373481,0.000022442833,0.00014822997,0.00027268656,0.00011979807,0.9977302,0.00035701608,0.0012666908],"study_design_scores_gemma":[0.000023421708,0.00000831663,0.000043045686,0.000014024166,0.000007264992,0.000025747522,0.000053185056,0.0017413548,0.00019030322,0.99557614,0.0023089133,0.000008404351],"about_ca_topic_score_codex":0.0016697048,"about_ca_topic_score_gemma":0.0016425726,"teacher_disagreement_score":0.009175087,"about_ca_system_score_codex":0.0029958312,"about_ca_system_score_gemma":0.001629806,"threshold_uncertainty_score":0.03069377},"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":"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.07667619,0.0038843935,0.82628506,0.008144674,0.00085391727,0.00007047236,0.0012615602,0.0006051272,0.08221859],"genre_scores_gemma":[0.7710561,0.002292253,0.20387615,0.0013654266,0.0012667085,0.00013923194,0.001058789,0.00016049723,0.018784834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985078,0.00041840516,0.00012617107,0.0003463455,0.00044766994,0.00015360826],"domain_scores_gemma":[0.9970952,0.0015610367,0.00017527588,0.0005181896,0.00038375743,0.00026646417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022825892,0.00064510887,0.0012476745,0.0022802653,0.002474082,0.006249282,0.0019551308,0.0021828888,0.0074623628],"category_scores_gemma":[0.00373632,0.0007200763,0.0022917052,0.003015712,0.0047753537,0.011867074,0.0031354947,0.0043727993,0.0011058763],"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.000011436665,0.000006599066,0.00008118171,0.000019640242,0.0000065863283,0.000021839385,0.00005433778,0.00035560018,0.00018912017,0.9960224,0.00060668495,0.002624493],"study_design_scores_gemma":[0.000016739019,0.000012029258,0.000055664863,0.00001492242,0.00001430181,0.00007477222,0.000041625663,0.003262065,0.00017372964,0.9917755,0.004550471,0.000008123538],"about_ca_topic_score_codex":0.0007950072,"about_ca_topic_score_gemma":0.0008858796,"teacher_disagreement_score":0.0074623628,"about_ca_system_score_codex":0.0017339133,"about_ca_system_score_gemma":0.0011883859,"threshold_uncertainty_score":0.024964035},"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":"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.16893965,0.019828716,0.63592774,0.026638767,0.0007071495,0.000100661695,0.0005435327,0.0005302766,0.14678349],"genre_scores_gemma":[0.9387885,0.0040099607,0.04819149,0.00070193707,0.0008174127,0.00008978679,0.00043291674,0.0000890449,0.006879063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953394,0.0023015994,0.0003132773,0.0006445109,0.0010471217,0.00035417743],"domain_scores_gemma":[0.9834816,0.013602144,0.00052005623,0.0010333917,0.0009949259,0.0003679257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061801695,0.00066590443,0.001074984,0.002344477,0.0027731708,0.007678926,0.0020044327,0.0021729285,0.0055135605],"category_scores_gemma":[0.014842111,0.0012383608,0.0012879916,0.0027124987,0.0113689685,0.022721482,0.0032442345,0.007753057,0.00052493624],"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.000014355599,0.000015222692,0.00017483949,0.00003375273,0.000007843448,0.00003543185,0.00027707755,0.00053877855,0.000056393437,0.99579805,0.00047493857,0.0025734135],"study_design_scores_gemma":[0.0000048114066,0.0000024888323,0.00004859849,0.000007582699,0.0000048426264,0.0000160457,0.000040488427,0.0011905757,0.000028849094,0.99771297,0.00093952724,0.0000032100709],"about_ca_topic_score_codex":0.002391715,"about_ca_topic_score_gemma":0.0014667651,"teacher_disagreement_score":0.007678926,"about_ca_system_score_codex":0.0029422308,"about_ca_system_score_gemma":0.0011969153,"threshold_uncertainty_score":0.032684267},"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":"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.2748363,0.0026521555,0.58278,0.004187263,0.0011156885,0.00028151658,0.0013165753,0.0010152697,0.13181518],"genre_scores_gemma":[0.79935604,0.0014378427,0.16681263,0.00069622154,0.0014601073,0.00044013452,0.001621047,0.00041928692,0.027756672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932903,0.0022605087,0.0006333212,0.0009029587,0.0022023018,0.000710479],"domain_scores_gemma":[0.9895601,0.0053580883,0.0008810175,0.00076191925,0.0015675146,0.0018713794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055281557,0.0012746559,0.0016720393,0.0033889168,0.0044144094,0.0098694265,0.0017515928,0.0014943214,0.0072210836],"category_scores_gemma":[0.00813459,0.0016548188,0.0026203005,0.0028114268,0.007722183,0.011967107,0.0044374163,0.004718902,0.0015514628],"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.00008597266,0.000040164552,0.00016449446,0.000033179414,0.0000111105,0.00006407245,0.00039144314,0.00034911896,0.0011594666,0.9946154,0.0006502924,0.0024353135],"study_design_scores_gemma":[0.000052347772,0.000022055456,0.00013441705,0.000011612869,0.000007775157,0.00007918031,0.00017878735,0.0023737599,0.00076398754,0.9936147,0.0027452938,0.000016161603],"about_ca_topic_score_codex":0.0016737554,"about_ca_topic_score_gemma":0.0016146201,"teacher_disagreement_score":0.0098694265,"about_ca_system_score_codex":0.002505493,"about_ca_system_score_gemma":0.0021414703,"threshold_uncertainty_score":0.029236019},"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":"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.3019122,0.0010513057,0.6463995,0.0014960365,0.0001870927,0.00012922644,0.0007901059,0.0007920829,0.047242466],"genre_scores_gemma":[0.9007405,0.00056233065,0.08600013,0.00022544799,0.00015217203,0.00011764349,0.0010615749,0.00022897076,0.010911184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747497,0.0007808014,0.00021555298,0.0005082165,0.00064975885,0.00037073303],"domain_scores_gemma":[0.99346817,0.0031891183,0.00079945213,0.0010940563,0.0009845272,0.00046466844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003333252,0.00057050545,0.0009130529,0.0028920386,0.0018767464,0.006623639,0.001950824,0.0017896848,0.011847465],"category_scores_gemma":[0.013932285,0.0007673209,0.0012704591,0.0032221288,0.0028516203,0.016426183,0.0034345181,0.0019139288,0.0009694392],"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.00011126382,0.000032008364,0.00032177358,0.000032493237,0.000012876332,0.00004136766,0.00024274501,0.0012890622,0.0006346157,0.9876381,0.00052348233,0.009120218],"study_design_scores_gemma":[0.000021913616,0.000030338597,0.0001716281,0.00001435552,0.000023478353,0.000047074383,0.00017938575,0.0072546895,0.0010907558,0.98844844,0.0027056814,0.000012325857],"about_ca_topic_score_codex":0.0022975106,"about_ca_topic_score_gemma":0.0019386986,"teacher_disagreement_score":0.011847465,"about_ca_system_score_codex":0.0022329818,"about_ca_system_score_gemma":0.0010785337,"threshold_uncertainty_score":0.03963375},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014366226,0.117946856,0.016876712,0.05712335,0.6355832,0.0002527636,0.001042577,0.00066218636,0.16907574],"genre_scores_gemma":[0.015433487,0.080127575,0.0065243538,0.0139581645,0.66837144,0.00032274416,0.0021168834,0.0011384955,0.2120068],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99638295,0.0007601976,0.00035212666,0.0006408295,0.0015768087,0.00028703883],"domain_scores_gemma":[0.9939023,0.0028914798,0.00032348512,0.0006223107,0.001491038,0.00076944847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031549986,0.0016256426,0.0018156593,0.0029026056,0.0021593948,0.0082008885,0.0020353876,0.0035198694,0.08914344],"category_scores_gemma":[0.007736248,0.00063204503,0.0019487954,0.002143599,0.001882116,0.006243661,0.0029689725,0.0062156166,0.021549834],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000036687565,0.000055995337,0.0001584361,0.00070807594,0.00004699554,0.00018692171,0.00016502061,0.00036688492,0.00039766118,0.044931658,0.9122027,0.040742975],"study_design_scores_gemma":[0.000009565188,0.000024510688,0.0002196861,0.0002673966,0.000014016779,0.00020618713,0.000042128147,0.00030052767,0.00009147483,0.017702192,0.9811133,0.000009058021],"about_ca_topic_score_codex":0.00095274847,"about_ca_topic_score_gemma":0.0011311544,"teacher_disagreement_score":0.08914344,"about_ca_system_score_codex":0.0033083807,"about_ca_system_score_gemma":0.0029295692,"threshold_uncertainty_score":0.2982145},"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":"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.16203426,0.0010649555,0.72637,0.0022495666,0.00020436793,0.00018203087,0.0010060876,0.00083466794,0.10605406],"genre_scores_gemma":[0.9021135,0.000701936,0.070809275,0.0007036941,0.00017509467,0.00033770985,0.00092496985,0.00016745122,0.024066443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767333,0.0006532133,0.00015341051,0.0004896451,0.0006741674,0.0003561475],"domain_scores_gemma":[0.99791914,0.00090103666,0.00014341118,0.00027757324,0.0004309721,0.00032775218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002117745,0.0006138828,0.00060812524,0.0016071857,0.0014622152,0.0032891522,0.0012481011,0.0013386842,0.007296455],"category_scores_gemma":[0.0034755275,0.0003663703,0.0012903117,0.001329032,0.004076657,0.009263404,0.0024294725,0.0025196462,0.0006933817],"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.000006037518,0.000008903365,0.00009853928,0.000011865035,0.0000033947956,0.00002887638,0.00022473115,0.0005526133,0.00018775344,0.9958568,0.00029384103,0.002726652],"study_design_scores_gemma":[0.0000064837886,0.000014050334,0.00024305166,0.000009736151,0.000005398043,0.00004678918,0.00008922861,0.0053235996,0.00021695015,0.9889443,0.005090842,0.000009655844],"about_ca_topic_score_codex":0.004605194,"about_ca_topic_score_gemma":0.0022040682,"teacher_disagreement_score":0.007296455,"about_ca_system_score_codex":0.002648748,"about_ca_system_score_gemma":0.0012464586,"threshold_uncertainty_score":0.024409056},"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":"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.12515031,0.0040178816,0.77025604,0.002569989,0.00033497214,0.00008241979,0.00072287663,0.0005705392,0.096294954],"genre_scores_gemma":[0.84867734,0.0021564586,0.1266613,0.00043080395,0.0005250342,0.00016637381,0.0008838372,0.0002444273,0.020254409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985909,0.00047915304,0.00010278633,0.0002860845,0.00037564026,0.00016538615],"domain_scores_gemma":[0.9971209,0.0014578715,0.0003140413,0.000335344,0.00046063718,0.00031117813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024180894,0.00084354565,0.0010428593,0.0032795942,0.0019353125,0.006169802,0.0014630145,0.00131813,0.010982343],"category_scores_gemma":[0.0042405343,0.00070169044,0.0014773513,0.0028806634,0.003670972,0.013464234,0.002856101,0.0027356655,0.0009609533],"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.000017567774,0.000008140586,0.00004759785,0.00001422622,0.000005493381,0.0000147777855,0.00008407968,0.0002851571,0.000118081945,0.9970409,0.00026417602,0.002099796],"study_design_scores_gemma":[0.000010150545,0.000009260818,0.000055748882,0.000007446501,0.000010099868,0.00002038479,0.000051754865,0.0020959124,0.00018901088,0.99544686,0.002097677,0.0000056663125],"about_ca_topic_score_codex":0.0015207828,"about_ca_topic_score_gemma":0.0017285855,"teacher_disagreement_score":0.010982343,"about_ca_system_score_codex":0.0023683063,"about_ca_system_score_gemma":0.00079306454,"threshold_uncertainty_score":0.036739588},"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":"review","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.007145574,0.51696956,0.053478744,0.22532304,0.0041906927,0.000052633986,0.00057022966,0.00034570528,0.19192383],"genre_scores_gemma":[0.57477826,0.18358347,0.043942284,0.040827554,0.012854631,0.00023102385,0.00040132966,0.0005422636,0.14283915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984086,0.00085161,0.000080112746,0.00023964532,0.00034351187,0.000076539094],"domain_scores_gemma":[0.99784505,0.0014476051,0.0001141625,0.0001809526,0.00033802175,0.000074074225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034828698,0.00069734256,0.0008771151,0.0021978836,0.0033757621,0.0066841864,0.0010830763,0.0048839524,0.004684005],"category_scores_gemma":[0.0081381,0.0008195146,0.0005727242,0.002315006,0.011234657,0.014244337,0.0018711907,0.007793402,0.0015632072],"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.000021076861,0.0000099038825,0.00005849042,0.000052019674,0.000007671199,0.00001648194,0.00054173137,0.00013578849,0.00006567667,0.9674521,0.026276197,0.0053628185],"study_design_scores_gemma":[0.000015272744,0.000004752557,0.00011447755,0.00007614468,0.0000051354427,0.00003126173,0.0002230861,0.00014117175,0.000072834744,0.9451433,0.05416316,0.000009543667],"about_ca_topic_score_codex":0.0053901197,"about_ca_topic_score_gemma":0.0066585,"teacher_disagreement_score":0.0066841864,"about_ca_system_score_codex":0.003658892,"about_ca_system_score_gemma":0.0017427853,"threshold_uncertainty_score":0.026547253},"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":"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.37636498,0.0005067161,0.54310346,0.0030797096,0.00040703279,0.00024753538,0.0010630491,0.0013935955,0.073833995],"genre_scores_gemma":[0.9419135,0.0001378306,0.051695526,0.0005154936,0.00019303375,0.00007043244,0.00039397553,0.000069806796,0.005010466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974952,0.00055555906,0.00017231156,0.00051721703,0.0007466964,0.0005131783],"domain_scores_gemma":[0.9959472,0.0014782326,0.0003845469,0.0012277263,0.0005904959,0.0003717969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033061474,0.00047677802,0.0008617489,0.0009568836,0.0015511387,0.004737347,0.002004384,0.001374606,0.0036178452],"category_scores_gemma":[0.0039933077,0.0005297874,0.0015922323,0.0013678219,0.0055393893,0.008340206,0.0027166437,0.0034662243,0.00032646907],"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.00007305637,0.00004079588,0.00028450295,0.000041270552,0.000023773255,0.00025979226,0.00018628768,0.0051353704,0.0020322166,0.98929495,0.0005566702,0.0020712414],"study_design_scores_gemma":[0.00016732134,0.0000895335,0.0004946332,0.000020351472,0.00007548967,0.00027908882,0.00014259778,0.04649161,0.004803111,0.9353398,0.012039563,0.000056931098],"about_ca_topic_score_codex":0.0034846228,"about_ca_topic_score_gemma":0.0028997327,"teacher_disagreement_score":0.004737347,"about_ca_system_score_codex":0.0023294452,"about_ca_system_score_gemma":0.0017162054,"threshold_uncertainty_score":0.017484784},"labels":[],"label_agreement":null}]}