{"meta":{"query_hash":"a893618bd9ea","filters":{"venue":"The Review of Symbolic Logic"},"cohort_total":18,"direct_labels_cover":0,"predictions_cover":18,"exported":18,"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/a893618bd9ea","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Review+of+Symbolic+Logic"},"results":[{"id":"W2011932408","doi":"10.1017/s1755020308080131","title":"MATHEMATICAL METHODS IN PHILOSOPHY EDITORS’ INTRODUCTION","year":2008,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Calgary; University of Toronto","funders":"","keywords":"Philosophy of mathematics; Epistemology; Philosophy of logic; Philosophy of computer science; Mathematical practice; Mathematical logic; Dedekind cut; Philosophical logic; Foundations of mathematics; Philosophy; Philosophy of language; Modal logic; Computer science; Mathematics; Modal; Western philosophy; Pure mathematics; Algorithm; Metaphysics","score_opus":0.04543032424849617,"score_gpt":0.3364406164002181,"score_spread":0.2910102921517219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011932408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011756442,0.3410607,0.4675445,0.048176378,0.006800525,0.0020382653,0.0000015371957,0.00038843765,0.13281403],"genre_scores_gemma":[0.11731782,0.39084837,0.44998333,0.0075997896,0.03268987,0.00035705004,0.000008887746,0.00006812129,0.0011267752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982508,0.00052711996,0.00048118713,0.00027950873,0.00023439455,0.00022702484],"domain_scores_gemma":[0.9986281,0.0002510462,0.00018817022,0.0007937944,0.000087642584,0.000051287727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020154493,0.00015108733,0.00051989965,0.00006950946,0.00007920881,0.000009921507,0.0009771498,0.00005694742,0.00009295994],"category_scores_gemma":[0.00056320877,0.00008284463,0.00014959864,0.0006804715,0.00017474467,0.00015281819,0.00022416898,0.00019879566,0.00017588958],"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.000002327253,0.00022873396,0.000059336206,0.0026687498,0.000021295724,0.000009990773,0.0011585706,0.000003166997,0.00020029694,0.93872684,0.024690956,0.032229725],"study_design_scores_gemma":[0.00042227225,0.00021728853,0.0013482268,0.0031600518,0.000058787715,0.0006986446,0.000020855006,0.001558652,0.0012917063,0.85418016,0.13656297,0.00048039196],"about_ca_topic_score_codex":0.0000036538281,"about_ca_topic_score_gemma":1.4938712e-7,"teacher_disagreement_score":0.13168725,"about_ca_system_score_codex":0.000035178356,"about_ca_system_score_gemma":0.000055577617,"threshold_uncertainty_score":0.33783057},"labels":[],"label_agreement":null},{"id":"W2024618947","doi":"10.1017/s1755020309090145","title":"RELEVANCE LOGICS AND RELATION ALGEBRAS","year":2009,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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 Alberta","funders":"","keywords":"Soundness; Relevance (law); Relation (database); Mathematics; Completeness (order theory); Semantics (computer science); Fragment (logic); Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Algorithm; Programming language; Data mining","score_opus":0.018160400362870248,"score_gpt":0.26656634320640077,"score_spread":0.24840594284353051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024618947","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006392378,0.82627,0.04797911,0.016533585,0.00029233706,0.0008841691,0.0000011354675,0.00024360158,0.10140369],"genre_scores_gemma":[0.702321,0.28799522,0.004869755,0.004406856,0.00009215696,0.000008331831,0.0000016228291,0.000004883814,0.00030014926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891835,0.00015060784,0.00030977727,0.00024605962,0.00018240948,0.00019280706],"domain_scores_gemma":[0.99888796,0.00016886125,0.00021857556,0.0005887169,0.00008448905,0.000051418276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045098,0.00013517351,0.0003244416,0.000028313301,0.00010309203,0.000026910473,0.0006655969,0.00005152675,0.000014823722],"category_scores_gemma":[0.00036127443,0.000074108044,0.00008055115,0.00037502495,0.00008513744,0.000184053,0.00011348011,0.00013538974,0.00006006842],"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.000001057528,0.00002794719,0.00009235702,0.0003690478,0.000005298849,0.0000025819518,0.00023051996,0.0000013778763,0.00007900404,0.86357754,0.0007217639,0.13489152],"study_design_scores_gemma":[0.00046235544,0.00055635435,0.051022176,0.0039290953,0.00009534344,0.00030962756,0.00001894283,0.002402883,0.0003447619,0.89095086,0.049384166,0.00052344234],"about_ca_topic_score_codex":0.000002363036,"about_ca_topic_score_gemma":3.6964835e-7,"teacher_disagreement_score":0.69592863,"about_ca_system_score_codex":0.000017021659,"about_ca_system_score_gemma":0.000031348212,"threshold_uncertainty_score":0.30220383},"labels":[],"label_agreement":null},{"id":"W2142696533","doi":"10.1017/s1755020313000087","title":"STRONG COMPLETENESS OF S4 FOR ANY DENSE-IN-ITSELF METRIC SPACE","year":2013,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"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 Toronto","funders":"","keywords":"Completeness (order theory); Real line; Metric space; Mathematics; Space (punctuation); Metric (unit); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.033617575872152174,"score_gpt":0.2871383618909682,"score_spread":0.253520786018816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142696533","genre_codex":"review","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.04546193,0.7175482,0.18362252,0.0065272055,0.00087030017,0.00668136,0.000015918095,0.00020041544,0.039072182],"genre_scores_gemma":[0.9698887,0.022492547,0.0067311735,0.00048007898,0.00006734139,0.0001426638,0.0000021931862,0.000011950085,0.00018337845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998327,0.00021227603,0.0005626407,0.0002882985,0.00024297519,0.00036678987],"domain_scores_gemma":[0.99791425,0.00052369887,0.00040113783,0.00079928746,0.00029494127,0.00006669361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176759,0.0001874291,0.0007731751,0.00013131867,0.00006103583,0.000025470994,0.001492255,0.000052368956,0.000060944836],"category_scores_gemma":[0.00038340362,0.000106990075,0.00022523337,0.0010956321,0.000112317495,0.00016847112,0.00025487953,0.00010600471,0.00006513482],"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.00000462354,0.0002651254,0.0019349549,0.009649805,0.00007292467,0.0000024530375,0.00075142813,0.000028518803,0.0005521053,0.9116104,0.00298882,0.07213881],"study_design_scores_gemma":[0.008148315,0.0035017047,0.32081538,0.04151319,0.0010814682,0.00042203264,0.0010056943,0.063241586,0.0120476065,0.45889804,0.08490536,0.00441963],"about_ca_topic_score_codex":0.00010187847,"about_ca_topic_score_gemma":0.0000066909374,"teacher_disagreement_score":0.92442673,"about_ca_system_score_codex":0.00003476791,"about_ca_system_score_gemma":0.00007710767,"threshold_uncertainty_score":0.4362929},"labels":[],"label_agreement":null},{"id":"W2161181571","doi":"10.1017/s175502031300018x","title":"STRUCTURAL EQUATIONS AND BEYOND","year":2013,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":33,"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 Toronto","funders":"","keywords":"Counterfactual thinking; Causation; Element (criminal law); Modalities; Causal model; Similarity (geometry); Counterfactual conditional; Ranking (information retrieval); Modality (human–computer interaction); Normality; Mathematical economics; Mathematics; Computer science; Epistemology; Artificial intelligence; Philosophy; Image (mathematics); Statistics; Sociology; Law","score_opus":0.03580201131816115,"score_gpt":0.2812095219799628,"score_spread":0.24540751066180164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161181571","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.020421559,0.31178206,0.58737737,0.058720607,0.00029814016,0.0012508063,0.0000036592266,0.00018460877,0.01996116],"genre_scores_gemma":[0.9741349,0.015554939,0.006391094,0.0037952848,0.000032480984,0.000024053765,8.6034936e-7,0.0000027222836,0.00006363332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994101,0.00006792733,0.00018392182,0.00011862043,0.00010994492,0.00010949662],"domain_scores_gemma":[0.999365,0.00008992665,0.00007792645,0.0003559562,0.00007360718,0.000037629667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024039418,0.0000691873,0.00015920456,0.000015716809,0.00006619098,0.0000359245,0.0004686758,0.0000178958,0.00006531302],"category_scores_gemma":[0.00006062403,0.000036459336,0.000034026987,0.0001579876,0.00006948005,0.00015214513,0.00012489676,0.00006811687,0.000059518865],"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":[9.0930634e-8,0.000005006902,0.000018418394,0.00047802887,0.0000075401667,1.9785368e-7,0.00021877766,0.0000056037275,0.00014915854,0.82378906,0.0007754864,0.17455266],"study_design_scores_gemma":[0.00013630895,0.00009208485,0.0038673552,0.0016750948,0.000042901036,0.000054601445,0.000032851298,0.08754799,0.00013551449,0.905439,0.0006966999,0.00027955446],"about_ca_topic_score_codex":0.000031451138,"about_ca_topic_score_gemma":3.027206e-7,"teacher_disagreement_score":0.95371336,"about_ca_system_score_codex":0.0000041462386,"about_ca_system_score_gemma":0.00002230538,"threshold_uncertainty_score":0.14867686},"labels":[],"label_agreement":null},{"id":"W2171830434","doi":"10.1017/s1755020309990311","title":"PASCH’S PHILOSOPHY OF MATHEMATICS","year":2010,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Empiricism; Epistemology; Philosophy of mathematics; Philosophy; Mathematics; Calculus (dental); Medicine","score_opus":0.058508983103409254,"score_gpt":0.3173999444220414,"score_spread":0.25889096131863215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171830434","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.2751939,0.07171641,0.0029412373,0.0068901014,0.0014148018,0.004897974,0.00008096047,0.00037797165,0.63648665],"genre_scores_gemma":[0.8762112,0.0298848,0.08920231,0.0017911841,0.00058763917,0.00014006191,0.00000834309,0.00015503292,0.0020194135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982233,0.00013686826,0.0009392392,0.00013923313,0.00037265278,0.00018871049],"domain_scores_gemma":[0.9968245,0.0009578852,0.00082399184,0.0011759435,0.00015967239,0.000058017995],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025296574,0.0002095407,0.0008882617,0.00005294233,0.000074597236,0.000003530757,0.00075052347,0.000091626825,0.0010415623],"category_scores_gemma":[0.0015954647,0.00011962813,0.00031932566,0.00022129816,0.00044515345,0.000048620946,0.00009555649,0.0003168924,0.00009997931],"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.0000020891111,0.00029782756,0.0000030622757,0.026759714,0.0000462229,0.000001069234,0.0007591804,7.1844816e-8,0.0012875485,0.968571,0.0012345213,0.0010377059],"study_design_scores_gemma":[0.00014205696,0.000048151716,0.000007252013,0.0047857044,0.00021794713,0.00004682932,0.00007475824,0.000011505154,0.0011419184,0.98649514,0.0068918034,0.00013694215],"about_ca_topic_score_codex":0.00000154609,"about_ca_topic_score_gemma":0.000001245923,"teacher_disagreement_score":0.63446724,"about_ca_system_score_codex":0.00000935238,"about_ca_system_score_gemma":0.000049009348,"threshold_uncertainty_score":0.9998716},"labels":[],"label_agreement":null},{"id":"W2331073395","doi":"10.1017/s1755020314000021","title":"QUANTIFIED MODAL LOGIC ON THE RATIONAL LINE","year":2014,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Modal logic; Mathematics; Multimodal logic; Linear subspace; Normal modal logic; Class (philosophy); Real line; Line (geometry); Topological space; S5; Dynamic logic (digital electronics); Topology (electrical circuits); Modal; Pure mathematics; Discrete mathematics; Computer science; Theoretical computer science; Artificial intelligence; Combinatorics; Physics; Description logic","score_opus":0.04627299118960957,"score_gpt":0.28825335169868405,"score_spread":0.24198036050907448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331073395","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.009402801,0.16638283,0.2959356,0.14057754,0.0021573466,0.0033241988,0.00001090695,0.00055214163,0.38165662],"genre_scores_gemma":[0.9654227,0.016680792,0.0011066182,0.015579477,0.0004059499,0.00006433621,0.000005578342,0.000010725912,0.0007238278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809915,0.0005651357,0.0004039461,0.00030320926,0.0003679482,0.0002606353],"domain_scores_gemma":[0.997661,0.00078606757,0.00026902108,0.0010838371,0.00014638781,0.000053694752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024223907,0.00019241955,0.0004067207,0.0000337188,0.00021330589,0.000049567763,0.0017921859,0.00005293975,0.00015099406],"category_scores_gemma":[0.0007379641,0.00007938755,0.0002035461,0.0003959245,0.00016604795,0.00008198831,0.00024450547,0.00020981782,0.00054971466],"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.0000020669843,0.00005583369,0.000010839029,0.00024524037,0.000012222181,6.010263e-7,0.00011208332,0.000021154654,0.00007532251,0.9855184,0.00261683,0.011329409],"study_design_scores_gemma":[0.00075233076,0.0009380959,0.0040614954,0.004407081,0.0001337743,0.00010791925,0.00003730239,0.042284977,0.0017416409,0.83472013,0.11000963,0.0008056223],"about_ca_topic_score_codex":0.000007551049,"about_ca_topic_score_gemma":0.0000019215952,"teacher_disagreement_score":0.9560199,"about_ca_system_score_codex":0.000018794213,"about_ca_system_score_gemma":0.0000635509,"threshold_uncertainty_score":0.7065653},"labels":[],"label_agreement":null},{"id":"W2331774924","doi":"10.1017/s1755020312000147","title":"CATEGORICAL FOUNDATIONS OF MATHEMATICS OR HOW TO PROVIDE FOUNDATIONS FOR<i>ABSTRACT</i>MATHEMATICS","year":2012,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Argument (complex analysis); Context (archaeology); Categorical variable; Epistemology; Mathematics; Philosophy; Biology; Statistics","score_opus":0.15164102425893064,"score_gpt":0.3798600361578378,"score_spread":0.22821901189890717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331774924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05538504,0.03512101,0.77574223,0.025572568,0.0021972477,0.0322544,0.00047149239,0.0008069079,0.07244908],"genre_scores_gemma":[0.37371275,0.0064648665,0.60840005,0.001376726,0.0007628814,0.0017318295,0.000061601175,0.00025332058,0.007235972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972617,0.00013085484,0.0013908271,0.00020348541,0.0005272452,0.00048589945],"domain_scores_gemma":[0.9928603,0.0041363547,0.0012001509,0.0011944588,0.00041936853,0.00018934858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003660414,0.0003545599,0.0012246516,0.00012339935,0.00025380356,0.000024156896,0.00079368363,0.000116526826,0.00042375783],"category_scores_gemma":[0.007752966,0.00020778182,0.00042211573,0.00052998256,0.0002674227,0.00023411271,0.00013125397,0.00019126249,0.00009322554],"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.000009519004,0.0012366397,0.0000033409372,0.03717081,0.00013014613,4.132962e-7,0.005281094,0.0000013485123,0.00035150436,0.9471277,0.0068980996,0.0017893858],"study_design_scores_gemma":[0.00046630492,0.00025630704,0.000017426079,0.0061976626,0.0012822425,0.0001239099,0.0022027155,0.00010541501,0.00094371435,0.9119144,0.07597096,0.00051890576],"about_ca_topic_score_codex":0.0000030481983,"about_ca_topic_score_gemma":0.0000066866805,"teacher_disagreement_score":0.3183277,"about_ca_system_score_codex":0.000097337965,"about_ca_system_score_gemma":0.0001792556,"threshold_uncertainty_score":0.92815846},"labels":[],"label_agreement":null},{"id":"W2483635500","doi":"10.1017/s1755020316000204","title":"ADDENDA ET CORRIGENDA TO “THE ARITHMETIC OF THE EVEN AND THE ODD”","year":2016,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Arithmetic; Irrational number; Mathematics; Integer (computer science); Axiom; Square root; Square (algebra); Arithmetic function; Discrete mathematics; Computer science; Geometry","score_opus":0.048611727877596204,"score_gpt":0.31716237459320207,"score_spread":0.26855064671560586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483635500","genre_codex":"review","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.14354722,0.39473182,0.011527412,0.2887882,0.0025192024,0.01854897,0.0003164459,0.0002436534,0.13977708],"genre_scores_gemma":[0.92054015,0.05332813,0.0016715509,0.011694308,0.00023579947,0.0002663741,9.3015956e-7,0.000078001394,0.012184746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760616,0.0011035813,0.00060353,0.00014642999,0.00035306855,0.00018725394],"domain_scores_gemma":[0.9955008,0.0026460714,0.00049575587,0.0012195106,0.000095900716,0.000041984942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053412225,0.0001838488,0.0006199231,0.000021271779,0.00018398056,0.000007598535,0.0010416158,0.000042963104,0.00029557713],"category_scores_gemma":[0.0026466092,0.000050129664,0.0002443926,0.00021718943,0.0007511722,0.00003229826,0.00026005597,0.00015549608,0.00008704899],"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.000020612077,0.00006043097,0.00000635212,0.0029098142,0.000077336845,4.7178835e-7,0.0032918178,3.544762e-7,0.00010872824,0.97194976,0.011461261,0.010113037],"study_design_scores_gemma":[0.0005489239,0.00006676024,0.00011941372,0.00843574,0.00047820807,0.000080241225,0.00023947924,0.0000075292996,0.0003504094,0.8723018,0.11721234,0.00015913625],"about_ca_topic_score_codex":0.0000066410453,"about_ca_topic_score_gemma":0.000010960774,"teacher_disagreement_score":0.7769929,"about_ca_system_score_codex":0.00002187887,"about_ca_system_score_gemma":0.000059326136,"threshold_uncertainty_score":0.32363623},"labels":[],"label_agreement":null},{"id":"W2893109491","doi":"10.1017/s1755020318000229","title":"COMPLETENESS OF SECOND-ORDER PROPOSITIONAL S4 AND H IN TOPOLOGICAL SEMANTICS","year":2018,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Propositional variable; Axiom; Intermediate logic; Intuitionistic logic; Well-formed formula; Modal logic; Propositional calculus; Mathematics; S5; Autoepistemic logic; Zeroth-order logic; Semantics (computer science); Discrete mathematics; Dynamic logic (digital electronics); T-norm fuzzy logics; Normal modal logic; Modal; Multimodal logic; Computer science; Theoretical computer science; Description logic; Artificial intelligence; Programming language; Fuzzy logic","score_opus":0.025659756564900844,"score_gpt":0.2890374436040479,"score_spread":0.26337768703914705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893109491","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.5710834,0.27828705,0.038176823,0.014384015,0.0008388015,0.0027029908,0.000022689946,0.00016284133,0.094341375],"genre_scores_gemma":[0.98789716,0.00732458,0.003509941,0.0010895927,0.00007098736,0.0000117600675,0.0000016632014,0.0000035340606,0.00009077069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988766,0.00019577645,0.00037552087,0.00020664246,0.00016459514,0.00018089115],"domain_scores_gemma":[0.9990752,0.00014537443,0.00018155893,0.0003638234,0.00019791396,0.000036144225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007736663,0.000115622075,0.0004394136,0.000040203853,0.000059946356,0.000011931644,0.0006258109,0.00004833571,0.00016495911],"category_scores_gemma":[0.00011997271,0.0000616914,0.000059088976,0.00038414332,0.0004922644,0.000075554206,0.0003015518,0.00009702515,0.000019846646],"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.000009533384,0.00022015699,0.0029891822,0.0037478686,0.00002801676,0.0000068250274,0.00090236537,9.001876e-7,0.0008091387,0.9798916,0.00044971448,0.010944715],"study_design_scores_gemma":[0.0020858392,0.0019533362,0.3455562,0.01337345,0.00016415681,0.00086968456,0.00016934391,0.0063445307,0.0051319324,0.6060305,0.017111527,0.0012094409],"about_ca_topic_score_codex":0.0000077757595,"about_ca_topic_score_gemma":0.000011134164,"teacher_disagreement_score":0.41681376,"about_ca_system_score_codex":0.000013981853,"about_ca_system_score_gemma":0.00007902194,"threshold_uncertainty_score":0.2515702},"labels":[],"label_agreement":null},{"id":"W2899830276","doi":"10.1017/s1755020317000302","title":"TWO SYLLOGISMS IN THE<i>MOZI</i>: CHINESE LOGIC AND LANGUAGE","year":2018,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Syntax, Semantics, Linguistic Variation","field":"Arts and Humanities","cited_by":2,"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 Toronto","funders":"","keywords":"Plural; Syllogism; Argument (complex analysis); Linguistics; Ambiguity; Distributive property; Philosophy; Mohism; Predicate (mathematical logic); Epistemology; Mathematics; Computer science; Pure mathematics","score_opus":0.031904687238672985,"score_gpt":0.3020528265774806,"score_spread":0.27014813933880766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899830276","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.4346327,0.16289222,0.00006454531,0.08592635,0.0016563418,0.0024742605,0.000045009667,0.00014431127,0.31216428],"genre_scores_gemma":[0.98435676,0.008267626,0.00008407998,0.0058501344,0.0011920817,0.000023440885,0.000007362225,0.000010293889,0.00020821756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883384,0.00025388424,0.0003770578,0.00016066199,0.00019065931,0.00018387218],"domain_scores_gemma":[0.9989737,0.00028641286,0.00020795743,0.00041815164,0.00009398285,0.000019742642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013865285,0.00015246232,0.0003593623,0.000044643497,0.00014467322,0.000046608264,0.00037214006,0.00002498033,0.00058962347],"category_scores_gemma":[0.00072095083,0.000068613175,0.000069817324,0.00009178834,0.0004647432,0.000046338257,0.000072952374,0.00012347472,0.000106134474],"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.0000044057692,0.00005207866,0.00027880675,0.000983328,0.000018626532,0.0000057800858,0.040747408,2.4732702e-7,0.000043453845,0.95292485,0.00016370325,0.00477732],"study_design_scores_gemma":[0.000857752,0.00034120696,0.011237126,0.0043797623,0.0003195788,0.00008978346,0.013042206,0.00014376924,0.000027540345,0.953141,0.015921813,0.0004984887],"about_ca_topic_score_codex":0.00093866076,"about_ca_topic_score_gemma":0.00074644276,"teacher_disagreement_score":0.5497241,"about_ca_system_score_codex":0.000010853304,"about_ca_system_score_gemma":0.000016210362,"threshold_uncertainty_score":0.6455963},"labels":[],"label_agreement":null},{"id":"W2914643333","doi":"10.1017/s1755020319000054","title":"BUNDER’S PARADOX","year":2019,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Toronto","funders":"","keywords":"Prima facie; Class (philosophy); Resolution (logic); Logical consequence; Consistency (knowledge bases); Calculus (dental); Mathematics; Non-classical logic; Mathematical economics; Computer science; Discrete mathematics; Philosophy; Epistemology; Programming language","score_opus":0.016844996660568608,"score_gpt":0.26312019735235864,"score_spread":0.24627520069179004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914643333","genre_codex":"review","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.0064693796,0.56398654,0.015631929,0.00790266,0.0011183958,0.0015399297,0.0000018953372,0.0002728735,0.4030764],"genre_scores_gemma":[0.8682072,0.12098592,0.0018379265,0.0062291604,0.00014952476,0.00003503981,0.0000021719416,0.000013622554,0.0025394247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987046,0.00017734547,0.00032617274,0.0002723724,0.0002499743,0.00026950307],"domain_scores_gemma":[0.9983503,0.00016465649,0.00020553646,0.0011391218,0.00008236542,0.000057971803],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090893876,0.00015338497,0.00045580603,0.00003112818,0.000058659265,0.000028305585,0.0016892311,0.0000439351,0.0002499292],"category_scores_gemma":[0.000093624745,0.00007919376,0.00019125857,0.0004116829,0.00007070492,0.00013330647,0.00031917804,0.00013329253,0.0017936241],"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.0000011512875,0.00006300748,0.0004030899,0.0022826733,0.000025449392,0.000002540204,0.00032571665,0.000002202442,0.000093923154,0.9558403,0.004033731,0.03692622],"study_design_scores_gemma":[0.0014723256,0.00087807165,0.018399708,0.015602483,0.0002289618,0.00047162457,0.0001177705,0.0035256832,0.0014439852,0.42098448,0.5352708,0.0016040833],"about_ca_topic_score_codex":0.000010827884,"about_ca_topic_score_gemma":7.563671e-7,"teacher_disagreement_score":0.86173785,"about_ca_system_score_codex":0.000021344797,"about_ca_system_score_gemma":0.000069873335,"threshold_uncertainty_score":0.9989836},"labels":[],"label_agreement":null},{"id":"W2935729958","doi":"10.1017/s1755020319000170","title":"QUANTIFIED INTUITIONISTIC LOGIC OVER METRIZABLE SPACES","year":2019,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Metrization theorem; Mathematics; Separable space; Countable set; Cardinality (data modeling); Constant (computer programming); Space (punctuation); Domain (mathematical analysis); Zero (linguistics); Real line; Zero-dimensional space; Discrete mathematics; Pure mathematics; Topological space; Topological vector space; Mathematical analysis; Computer science","score_opus":0.025079249016283587,"score_gpt":0.2841647421312685,"score_spread":0.2590854931149849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935729958","genre_codex":"review","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.013393399,0.56367654,0.06132075,0.0065013063,0.002432382,0.002985413,0.000011731363,0.0005297772,0.34914872],"genre_scores_gemma":[0.9247501,0.066554524,0.0021727926,0.003667964,0.00013833556,0.000044853077,0.000007720226,0.000017195522,0.0026465338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980617,0.0002922801,0.00047054823,0.00041939583,0.00037801845,0.0003780277],"domain_scores_gemma":[0.99779004,0.00038296837,0.00036345635,0.0012297593,0.00015584326,0.000077959274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014367491,0.00023320744,0.0006790199,0.000088815206,0.00013018363,0.000102347,0.0016789421,0.00007402162,0.00068255555],"category_scores_gemma":[0.00036513654,0.00012735196,0.0002422741,0.0009971041,0.00013326334,0.00022075749,0.00040250443,0.00019198412,0.0016145022],"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.0000024661642,0.000079919846,0.00025258094,0.002342472,0.000034814926,0.0000034410227,0.00015787198,0.0000068805484,0.00026691065,0.98858696,0.002829048,0.005436608],"study_design_scores_gemma":[0.0021423916,0.0014216466,0.0129045965,0.016505409,0.0005154486,0.00030241892,0.0001786945,0.00978043,0.002624213,0.73217374,0.21924892,0.0022020661],"about_ca_topic_score_codex":0.00003981483,"about_ca_topic_score_gemma":0.000002134177,"teacher_disagreement_score":0.9113567,"about_ca_system_score_codex":0.00004139241,"about_ca_system_score_gemma":0.00009747753,"threshold_uncertainty_score":0.99916285},"labels":[],"label_agreement":null},{"id":"W2997587333","doi":"10.1017/s1755020320000015","title":"CUT ELIMINATION AND NORMALIZATION FOR GENERALIZED SINGLE AND MULTI-CONCLUSION SEQUENT AND NATURAL DEDUCTION CALCULI","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":22,"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 Calgary","funders":"","keywords":"Natural deduction; Sequent; Sequent calculus; Cut-elimination theorem; Mathematics; Curry–Howard correspondence; Normalization (sociology); Calculus (dental); Mathematical proof; Discrete mathematics; Proof calculus","score_opus":0.04934596361689004,"score_gpt":0.29148811381295714,"score_spread":0.2421421501960671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997587333","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.03787073,0.3374748,0.60744953,0.013982298,0.00043102485,0.0025566334,0.000002205368,0.00012414134,0.00010861978],"genre_scores_gemma":[0.96806747,0.02586516,0.004695439,0.0012199389,0.000083741645,0.000031575728,0.000009861261,0.0000052825485,0.00002152243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992208,0.00011373532,0.00023700103,0.00021156568,0.000109291665,0.00010764327],"domain_scores_gemma":[0.9995174,0.00003885938,0.0001754053,0.00012270367,0.0000975601,0.000048103542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040455753,0.000100480946,0.00022836888,0.000021335713,0.00012791768,0.000045795576,0.00013053154,0.000035502886,0.0000011678421],"category_scores_gemma":[0.00011105682,0.00006042947,0.00003452251,0.00014257307,0.00006512229,0.0001731432,0.00013430606,0.000043020584,8.156588e-7],"study_design_candidate":"simulation_or_modeling","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.000024103152,0.000092932154,0.00026632642,0.013833342,0.000054937824,0.0000022497736,0.006336958,0.0000151312,0.015643511,0.4640324,0.00035719198,0.4993409],"study_design_scores_gemma":[0.010400211,0.0037394804,0.010213186,0.0037325963,0.001234312,0.0011711564,0.000989275,0.7746158,0.029654387,0.056112647,0.10557321,0.002563687],"about_ca_topic_score_codex":0.000025026995,"about_ca_topic_score_gemma":0.000003568965,"teacher_disagreement_score":0.93019676,"about_ca_system_score_codex":0.000015752563,"about_ca_system_score_gemma":0.000013834446,"threshold_uncertainty_score":0.24642423},"labels":[],"label_agreement":null},{"id":"W3040569033","doi":"10.1017/s1755020319000522","title":"KNOWLEDGE, JUSTIFICATION, AND ADEQUATE REASONS","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Epistemology, Ethics, and Metaphysics","field":"Arts and Humanities","cited_by":5,"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 Saskatchewan","funders":"Agence Nationale de la Recherche","keywords":"Internalism and externalism; Externalism; Axiom; Epistemology; Argument (complex analysis); Possession (linguistics); Axiomatic system; Philosophy; Mathematics; Linguistics","score_opus":0.15314799005203852,"score_gpt":0.3214384787004625,"score_spread":0.16829048864842397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040569033","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025809456,0.69128114,0.00006268574,0.056811266,0.00036774328,0.0005933043,0.00002684269,0.00007304038,0.24820302],"genre_scores_gemma":[0.70562637,0.27310857,0.00007182923,0.014493232,0.0012138883,0.000059451886,0.000019850957,0.00002376054,0.0053830794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992236,0.00017655204,0.00026971515,0.00014171837,0.000075730175,0.00011271287],"domain_scores_gemma":[0.9992466,0.00016515866,0.00015585845,0.00023440819,0.00014441909,0.000053563253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048201118,0.000099594006,0.00032305188,0.000011390096,0.00014760479,0.00001635613,0.00019756643,0.00002650586,0.0003887697],"category_scores_gemma":[0.00020937431,0.00005718777,0.00008150539,0.000051887277,0.00055529526,0.000044124878,0.000048456895,0.0001452588,0.00018906039],"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.0000016113268,0.000022087368,0.000008051634,0.003826077,0.000029036548,3.2337283e-7,0.017011262,6.31288e-8,0.00001221337,0.95995927,0.009264932,0.009865092],"study_design_scores_gemma":[0.000108968605,0.00007502933,0.0002480037,0.0015080281,0.00030847147,0.0000044139592,0.0018055172,0.000013936581,0.00002666373,0.024456048,0.97129774,0.00014717208],"about_ca_topic_score_codex":0.000020307327,"about_ca_topic_score_gemma":0.000010573751,"teacher_disagreement_score":0.9620328,"about_ca_system_score_codex":0.0000039654506,"about_ca_system_score_gemma":0.00003185608,"threshold_uncertainty_score":0.42567557},"labels":[],"label_agreement":null},{"id":"W3043284895","doi":"10.1017/s1755020321000216","title":"QUANTIFIED MODAL RELEVANT LOGICS","year":2021,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"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 Alberta","funders":"","keywords":"Modal; Normal modal logic; Semantics (computer science); Converse; Accessibility relation; Modal logic; Kripke semantics; Computer science; S5; Algorithm; Calculus (dental); Mathematics; Theoretical computer science; Pure mathematics; Description logic; Multimodal logic; Programming language; Medicine; Geometry; Chemistry","score_opus":0.04842376448480241,"score_gpt":0.29308514291040044,"score_spread":0.24466137842559804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043284895","genre_codex":"review","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.0009835624,0.67650354,0.24971446,0.013598072,0.0016479731,0.001170038,0.0000025212223,0.00034672473,0.056033123],"genre_scores_gemma":[0.87898815,0.112071745,0.0034851595,0.0040849154,0.00018943433,0.0000448473,0.000007921638,0.000014153358,0.0011136761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980379,0.00038882205,0.00053565064,0.00035826847,0.00037016728,0.00030922907],"domain_scores_gemma":[0.9979909,0.00015736652,0.00028624389,0.0012726923,0.00022565141,0.00006715522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013288504,0.00017276952,0.00054146,0.000027409511,0.00011002299,0.0000610827,0.0012111516,0.00006608152,0.000064176646],"category_scores_gemma":[0.0002860626,0.00009392593,0.00023418215,0.0006239942,0.0001003522,0.00010767944,0.00037317394,0.0001678475,0.00024002168],"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":[7.82458e-7,0.000058791335,0.000037447677,0.0017794666,0.000025568694,0.00003108676,0.00016732574,0.0000028140737,0.00022676628,0.9635051,0.001118512,0.03304633],"study_design_scores_gemma":[0.00064451905,0.00031543523,0.0012494059,0.0021338721,0.00018523207,0.0009689304,0.00017407465,0.0019696536,0.003938611,0.6131833,0.3743523,0.00088463345],"about_ca_topic_score_codex":0.000025381674,"about_ca_topic_score_gemma":0.0000032807454,"teacher_disagreement_score":0.8780046,"about_ca_system_score_codex":0.000021715856,"about_ca_system_score_gemma":0.00013863863,"threshold_uncertainty_score":0.38301885},"labels":[],"label_agreement":null},{"id":"W3043920080","doi":"10.1017/s1755020320000180","title":"CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D","year":2020,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"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 Calgary","funders":"","keywords":"Modal; Completeness (order theory); Mathematical proof; Accessibility relation; Interpretation (philosophy); Normal modal logic; Modular design; Mathematics; Algebra over a field; Relation (database); Calculus (dental); Pure mathematics; Modal logic; Computer science; Discrete mathematics; Mathematical analysis; Data mining; Geometry; Programming language","score_opus":0.08285298046001914,"score_gpt":0.2929221384889657,"score_spread":0.21006915802894655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043920080","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.0005301028,0.097913295,0.88108015,0.016263729,0.00025661426,0.0031027615,0.000020144136,0.00011548045,0.00071774167],"genre_scores_gemma":[0.94943386,0.017521454,0.020371055,0.011568867,0.00042974923,0.00056694454,0.000020367379,0.000028669003,0.000059043196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998586,0.00011010759,0.00043067316,0.0003700323,0.00020477753,0.0002983894],"domain_scores_gemma":[0.99861604,0.00017990897,0.00024016756,0.00068858283,0.0001659606,0.00010932297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023762,0.00019149946,0.000618481,0.000019238467,0.00014135995,0.000047214307,0.0013650515,0.000057676258,0.000003933817],"category_scores_gemma":[0.00030438026,0.00010900338,0.00022146491,0.00021232873,0.00012632985,0.000093008915,0.00034622074,0.00007586338,0.000006973634],"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.000008044585,0.00003436063,0.000020702175,0.007507795,0.00004754638,0.000002133042,0.00038818957,0.000023476394,0.0002537909,0.96950185,0.0013936041,0.020818492],"study_design_scores_gemma":[0.002532613,0.0016930735,0.00026176433,0.0008028841,0.00035658636,0.00014646514,0.0001947929,0.06976685,0.00067173387,0.5309229,0.3917128,0.0009375284],"about_ca_topic_score_codex":0.000021540494,"about_ca_topic_score_gemma":0.0000015685945,"teacher_disagreement_score":0.94890374,"about_ca_system_score_codex":0.000017743498,"about_ca_system_score_gemma":0.000048803315,"threshold_uncertainty_score":0.4445029},"labels":[],"label_agreement":null},{"id":"W4392052380","doi":"10.1017/s1755020324000029","title":"CONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS","year":2024,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Advanced Algebra and Logic","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":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Computer science; Epistemology; Philosophy","score_opus":0.0198412161129098,"score_gpt":0.3032918123619987,"score_spread":0.2834505962490889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392052380","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00395214,0.899111,0.089687,0.002403606,0.0002120694,0.00035074333,0.0000066584334,0.00008860614,0.0041881893],"genre_scores_gemma":[0.88359505,0.11323348,0.0018110152,0.0011859062,0.00004197368,0.000014494002,0.00000113344,0.000005786253,0.00011118682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998954,0.000110374356,0.00034465193,0.00024150193,0.00018948622,0.00016000953],"domain_scores_gemma":[0.9990608,0.00027611072,0.00012091017,0.00045103175,0.000049829894,0.00004133032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004106115,0.0001249366,0.00038275958,0.000024615969,0.000038145125,0.000016239337,0.0006324598,0.000027911716,0.000048385864],"category_scores_gemma":[0.00008065023,0.00006744998,0.00009325927,0.00040198173,0.00050967536,0.00016681323,0.00018679799,0.00010914228,0.00001965907],"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":[6.1752957e-7,0.000008418692,0.000016085603,0.0015306867,0.0000128187585,0.0000040399677,0.000388783,0.0000017035408,0.00013596234,0.95953393,0.00028027638,0.03808668],"study_design_scores_gemma":[0.00047333233,0.0005158185,0.0017178799,0.02414237,0.0001801958,0.0002487122,0.0003384796,0.002154213,0.0032146908,0.80678856,0.15950161,0.0007241575],"about_ca_topic_score_codex":0.0000025738193,"about_ca_topic_score_gemma":3.7120927e-7,"teacher_disagreement_score":0.8796429,"about_ca_system_score_codex":0.000009421572,"about_ca_system_score_gemma":0.00004591996,"threshold_uncertainty_score":0.27505302},"labels":[],"label_agreement":null},{"id":"W4411634444","doi":"10.1017/s1755020325100713","title":"FAILURE OF BETH’S THEOREM IN RELEVANCE LOGICS","year":2025,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Toronto","funders":"","keywords":"Relevance (law); Mathematics; Calculus (dental); Mathematical economics; Discrete mathematics; Political science; Medicine; Law","score_opus":0.012887776347992444,"score_gpt":0.2777501249042412,"score_spread":0.2648623485562488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411634444","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065009375,0.73405296,0.042596754,0.014296282,0.00057857606,0.001537677,0.0000052586697,0.00015050001,0.20028107],"genre_scores_gemma":[0.8510509,0.14150874,0.0043420163,0.0024645575,0.000041134022,0.0000357807,0.0000015911809,0.000007077194,0.0005481848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838144,0.00032163397,0.00056556193,0.00027955853,0.0002008917,0.0002509385],"domain_scores_gemma":[0.99809027,0.0004588108,0.00029224504,0.0009845592,0.00014468451,0.00002941179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576326,0.00016642151,0.0006286648,0.00008500393,0.000045685505,0.000012806207,0.0018203002,0.000073779265,0.000029264294],"category_scores_gemma":[0.0006741518,0.0000913289,0.0001706333,0.0011676594,0.00020304736,0.00010185257,0.00040383323,0.00020992533,0.00002710478],"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.0000019260249,0.00006151669,0.0003306719,0.0024716696,0.000013567297,0.0000022994038,0.0003068226,0.0000059944855,0.00009538325,0.95171285,0.0011387137,0.04385856],"study_design_scores_gemma":[0.000682843,0.00020328927,0.008833257,0.020318195,0.00009725146,0.0000290849,0.00012365094,0.0009919254,0.002886404,0.9091682,0.056214612,0.00045130518],"about_ca_topic_score_codex":0.000016384744,"about_ca_topic_score_gemma":0.0000121219555,"teacher_disagreement_score":0.84454995,"about_ca_system_score_codex":0.00003282222,"about_ca_system_score_gemma":0.00012657365,"threshold_uncertainty_score":0.37242845},"labels":[],"label_agreement":null}]}