{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":11,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"33cb59e9ead4","filters":{"venue":"Notre Dame Journal of Formal Logic"}},"results":[{"id":"W2890251009","doi":"10.1215/00294527-2018-0011","title":"Second-Order Logic of Paradox","year":2018,"lang":"fr","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Interpretation (philosophy); Order (exchange); Epistemology; Metaphysics; Appeal; Higher-order logic; Term logic; Computer science; Philosophy of logic; Philosophy; Computational logic; Mathematics; Artificial intelligence; Description logic; Programming language; Law","authors":[{"name":"Allen Hazen","is_ca":true},{"name":"Francis Jeffry Pelletier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03852876044959015,"gpt":0.2838133854384775,"spread":0.2452846249888873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001644949,0.0004271524,0.0009008477,0.0002747863,0.0002785024,0.000188957,0.001800142,0.0003973149,0.003171707],"category_scores_gemma":[0.0004155709,0.0003202995,0.0005264838,0.0008462078,0.000796056,0.002251765,0.0004803445,0.0008019113,0.0005430636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210118,"about_ca_system_score_gemma":0.0005958104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002495364,"about_ca_topic_score_gemma":0.00007075148,"domain_scores_codex":[0.9962721,0.00027349,0.001415331,0.0003546267,0.0006846855,0.0009997254],"domain_scores_gemma":[0.9950312,0.0002531614,0.001771473,0.0005755693,0.001968213,0.0004003281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005550796,0.002112957,0.005548345,0.0005876127,0.0005581252,0.001023595,0.01166578,0.0002974674,0.002333894,0.7304137,0.05003804,0.1948654],"study_design_scores_gemma":[0.007999984,0.02723907,0.04503154,0.001588349,0.0006188581,0.01252408,0.0009441817,0.02629279,0.01529281,0.2096418,0.6505161,0.002310463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.276581,0.0463369,0.3422227,0.006538459,0.0212767,0.0005363056,0.00007010181,0.00009708205,0.3063407],"genre_scores_gemma":[0.9544749,0.0005808792,0.03277339,0.001196657,0.002349767,0.000001573753,0.000002254889,0.0000218917,0.008598638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6778939,"threshold_uncertainty_score":0.9999249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117551059","doi":"10.1215/00294527-2010-037","title":"Mildness and the Density of Rational Points on Certain Transcendental Curves","year":2010,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Fields Institute for Research in Mathematical Sciences","keywords":"Pfaffian; Mathematics; Transcendental number; Pure mathematics; Mathematical analysis","authors":[{"name":"G. O. Jones","is_ca":false},{"name":"D. J. Miller","is_ca":false},{"name":"M. E. M. Thomas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02493476396990081,"gpt":0.3059543421228231,"spread":0.2810195781529223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733532,0.00009086305,0.0002617094,0.00004074373,0.0001020403,0.000004823195,0.0001507519,0.00007962226,0.000130953],"category_scores_gemma":[0.0004345685,0.00005016077,0.0001154749,0.00003667612,0.0003820485,0.0001841875,0.0000183886,0.0004705857,0.00000188443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006870234,"about_ca_system_score_gemma":0.00002869454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001234396,"about_ca_topic_score_gemma":0.00001974071,"domain_scores_codex":[0.9991704,0.000111869,0.0003446498,0.00005797344,0.0001936461,0.0001214466],"domain_scores_gemma":[0.9987379,0.0006908445,0.0003229447,0.0001025514,0.0001026951,0.00004303231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002320845,0.0002508514,0.002331221,0.0001166669,0.00009043852,0.00003065749,0.001107033,0.00001508636,0.003170724,0.9887029,0.0004393233,0.001424261],"study_design_scores_gemma":[0.003423844,0.000346866,0.0119691,0.0001219219,0.0001088045,0.0009288058,0.0004637582,0.000087065,0.006898063,0.9754053,0.0001282224,0.0001183002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9943337,0.000121375,0.002690371,0.001595107,0.0002450056,0.00009359629,0.00001121674,0.000004374507,0.000905239],"genre_scores_gemma":[0.9969048,0.00006948603,0.002398639,0.0004799123,0.00008153077,7.545846e-7,0.000001658269,0.000004781852,0.00005843293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01329764,"threshold_uncertainty_score":0.2045497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014988898","doi":"10.1215/00294527-2009-013","title":"George Boole's Deductive System","year":2009,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Universitatea din București; University of Waterloo; University of South Carolina","keywords":"Rotation formalisms in three dimensions; George (robot); Computer science; Principal (computer security); Algebra over a field; Mathematics; Programming language; Artificial intelligence; Pure mathematics","authors":[{"name":"Frank Markham Brown","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01094312846161898,"gpt":0.2307062826099928,"spread":0.2197631541483738,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004719144,0.0001179027,0.0002210865,0.0001317222,0.0001067789,0.0001040212,0.0006164691,0.00005070596,0.000006487114],"category_scores_gemma":[0.00003676472,0.00008567877,0.0001422929,0.0002184527,0.00001864526,0.001406764,0.00006615515,0.0002084888,0.00003506155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001268898,"about_ca_system_score_gemma":0.000111476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003691619,"about_ca_topic_score_gemma":5.213961e-7,"domain_scores_codex":[0.9987677,0.00004835196,0.0004107179,0.0001192905,0.0003817056,0.0002721717],"domain_scores_gemma":[0.9990447,0.00004025719,0.0003997781,0.0001516181,0.0002355765,0.0001280979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001310061,0.0002624193,0.0001322269,0.00003266081,0.00006443865,0.0004268736,0.001459682,0.002677216,0.003403825,0.464454,0.004439863,0.5225158],"study_design_scores_gemma":[0.01234789,0.01892372,0.2570206,0.001526933,0.0003339236,0.02607162,0.002219664,0.2629508,0.0334662,0.3362446,0.04537638,0.003517633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3377219,0.0004952197,0.6467631,0.003239439,0.00146667,0.0001159042,0.000002562609,0.0001066357,0.01008855],"genre_scores_gemma":[0.9863564,0.000006232096,0.0127458,0.0004678646,0.0003547537,3.493216e-7,4.796069e-7,0.000002514423,0.00006558472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6486346,"threshold_uncertainty_score":0.3493879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037742565","doi":"10.1305/ndjfl/1091030851","title":"Probabilistic Canonical Models for Partial Logics","year":2003,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Victoria","funders":"","keywords":"Soundness; Completeness (order theory); Probabilistic logic; Predicate (mathematical logic); Gödel's completeness theorem; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Programming language; Statistics","authors":[{"name":"François Lepage","is_ca":true},{"name":"Charles G. Morgan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04454526761879116,"gpt":0.272349074745686,"spread":0.2278038071268949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201152,0.0002141711,0.0004125256,0.00009140209,0.0001928423,0.0001480755,0.0009153884,0.0001561112,0.00002966542],"category_scores_gemma":[0.0006164173,0.000145763,0.0003224358,0.0002216745,0.00008528798,0.001135743,0.0001056878,0.0003303186,0.00001624945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001104183,"about_ca_system_score_gemma":0.0004772259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002565935,"about_ca_topic_score_gemma":0.000008132528,"domain_scores_codex":[0.9980034,0.0001141082,0.0006638981,0.0002437415,0.0003618521,0.0006130324],"domain_scores_gemma":[0.9982517,0.0002549522,0.000460814,0.0003149387,0.0004598939,0.0002576916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006573964,0.0002568628,0.0001682565,0.00003373722,0.00003335877,0.0000555878,0.0003876847,0.01019537,0.00007918527,0.9822504,0.0014475,0.005026351],"study_design_scores_gemma":[0.003716565,0.004051243,0.0004563293,0.0000844158,0.0001275339,0.002005407,0.00009491965,0.2443394,0.001520422,0.6972896,0.04552572,0.0007884256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01826977,0.0006656983,0.9621891,0.000313065,0.001082339,0.0002738724,0.000005823074,0.00004798807,0.01715232],"genre_scores_gemma":[0.9436081,0.00003674512,0.05554583,0.0003307079,0.0002532996,0.00001020281,0.000001417379,0.000009826703,0.0002038829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9253383,"threshold_uncertainty_score":0.5944043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064601069","doi":"10.1305/ndjfl/1099080210","title":"Linear Reducts of the Complex Field","year":2004,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Reduct; Rough set; Field (mathematics); Mathematics; Cover (algebra); Set (abstract data type); Algorithm; Discrete mathematics; Computer science; Data mining; Pure mathematics; Engineering","authors":[{"name":"James Loveys","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05923324648026579,"gpt":0.3129708601089101,"spread":0.2537376136286443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005738228,0.0001014942,0.0002646027,0.00005587037,0.0000799269,0.000007270552,0.0003928271,0.00008335875,0.0003147436],"category_scores_gemma":[0.0006298554,0.00005776916,0.000220189,0.0001919275,0.00008009034,0.000185869,0.00008122305,0.0003386789,0.00001069923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002648892,"about_ca_system_score_gemma":0.00006927333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003976021,"about_ca_topic_score_gemma":0.000001636997,"domain_scores_codex":[0.998912,0.0000514637,0.0005030111,0.00005493359,0.0002944414,0.0001840965],"domain_scores_gemma":[0.9987736,0.0002297786,0.0005716701,0.0002139845,0.0001552127,0.00005580182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001129455,0.001618205,0.002618541,0.0006068408,0.0005122165,0.0001460504,0.005254564,0.001416898,0.02621499,0.939088,0.0124232,0.008971024],"study_design_scores_gemma":[0.0014466,0.0007024602,0.004992689,0.0002161171,0.0001123928,0.0007498122,0.0006200792,0.00001515611,0.0509319,0.938388,0.001669698,0.0001550559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890599,0.00008414066,0.002519638,0.001541107,0.0003111433,0.00006998971,0.000004569644,0.000007930931,0.006401627],"genre_scores_gemma":[0.9915447,0.00001053572,0.007677801,0.0003863347,0.0001963766,3.03041e-7,4.501882e-7,0.000007236977,0.0001762116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0247169,"threshold_uncertainty_score":0.3446222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981909162","doi":"10.1215/00294527-2143889","title":"Lattices in Locally Definable Subgroups of 〈Rn,+〉","year":2013,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lattice (music); Combinatorics; Complete lattice; Pure mathematics; Discrete mathematics; Physics; Condensed matter physics","authors":[{"name":"Pantelis E. Eleftheriou","is_ca":true},{"name":"Ya’acov Peterzil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03305867257580116,"gpt":0.2996571829116664,"spread":0.2665985103358653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006731949,0.0001216046,0.0004045798,0.0001422365,0.00004067471,0.000009168339,0.0002672081,0.0001353881,0.0005338998],"category_scores_gemma":[0.000363902,0.00008679043,0.0001151422,0.0001297381,0.0001321873,0.0007266683,0.00005391351,0.0003709851,0.00003538182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003405529,"about_ca_system_score_gemma":0.00004663055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001366474,"about_ca_topic_score_gemma":0.00002288253,"domain_scores_codex":[0.9986878,0.00008268304,0.0006841134,0.00007395547,0.0001771393,0.0002943008],"domain_scores_gemma":[0.9985861,0.0004229225,0.0005993359,0.000146455,0.0001807316,0.00006445219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006896207,0.00101072,0.02050764,0.000452168,0.000143906,0.0002526025,0.00221595,0.001075267,0.003483809,0.9549185,0.001838521,0.01341127],"study_design_scores_gemma":[0.001061594,0.0005875538,0.007361317,0.0001109787,0.00003635495,0.0002164972,0.0008500627,0.0001784311,0.001584927,0.9875445,0.0003344258,0.0001333245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9842643,0.0004430057,0.00691141,0.0002484881,0.0001284331,0.0001105056,0.000002497249,0.000009088012,0.007882272],"genre_scores_gemma":[0.9789966,0.00006542463,0.02045166,0.0001542236,0.00005020204,0.000002367007,7.461406e-7,0.000009628642,0.0002691404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03262601,"threshold_uncertainty_score":0.5845827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2240279767","doi":"10.1215/00294527-3328401","title":"Controlling Effective Packing Dimension of Δ20 Degrees","year":2015,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Chicago","keywords":"Dimension (graph theory); Limit (mathematics); Packing dimension; Mathematics; Packing problems; Argument (complex analysis); Combinatorics; Mathematical optimization; Mathematical analysis; Minkowski–Bouligand dimension","authors":[{"name":"Jonathan Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03118595055639971,"gpt":0.2699876248191398,"spread":0.2388016742627401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002187938,0.0002097313,0.0006014405,0.0002103457,0.00008309507,0.00008304805,0.000898165,0.0001048038,0.000005986177],"category_scores_gemma":[0.0005423332,0.0001484326,0.0002628845,0.0003673248,0.00009130598,0.001286624,0.0003988032,0.0003850395,0.000009548654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001498221,"about_ca_system_score_gemma":0.0001482623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001995055,"about_ca_topic_score_gemma":0.000005318868,"domain_scores_codex":[0.9976327,0.0002435235,0.0007760475,0.0002187732,0.0007351801,0.0003937396],"domain_scores_gemma":[0.9970622,0.0005257256,0.0008911278,0.0003465736,0.0009379519,0.000236422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001372222,0.001649285,0.04499776,0.0002297279,0.0005188797,0.00088252,0.01176834,0.2063574,0.01519786,0.02781203,0.0009183902,0.6882956],"study_design_scores_gemma":[0.01182989,0.01274348,0.06911286,0.0006085255,0.0002081106,0.002340326,0.0008311297,0.8070346,0.02008051,0.0726865,0.001365797,0.001158328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4458218,0.0008628597,0.5512267,0.0002716763,0.0009361231,0.0002066792,0.000002146006,0.00003852547,0.0006335439],"genre_scores_gemma":[0.9247158,0.00001080772,0.07495385,0.0001043697,0.0001994796,0.000001646367,5.472798e-7,0.000007278269,0.000006255912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6871373,"threshold_uncertainty_score":0.6052904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144930856","doi":"10.1215/00294527-1731344","title":"Complementation in Representable Theories of Region-Based Space","year":2013,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Closure (psychology); Mereology; Mathematics; Class (philosophy); Topological space; Algebraic number; Space (punctuation); Pure mathematics; Identity (music); Complementation; Topology (electrical circuits); Computer science; Combinatorics; Physics; Epistemology","authors":[{"name":"Torsten Hahmann","is_ca":true},{"name":"Michael Grüninger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01871847657607837,"gpt":0.2585181402292027,"spread":0.2397996636531243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002673921,0.00006244066,0.0001401872,0.0001742722,0.00003723753,0.00005063892,0.0002172335,0.0000283273,0.0001715863],"category_scores_gemma":[0.00005772496,0.00004957732,0.0000556174,0.000254198,0.00004183697,0.001250277,0.0000334422,0.0001011526,0.000005415527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003798985,"about_ca_system_score_gemma":0.0000706077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008110653,"about_ca_topic_score_gemma":0.00002233674,"domain_scores_codex":[0.9991333,0.00006307728,0.0004005719,0.00007189254,0.0002046936,0.0001264813],"domain_scores_gemma":[0.9990976,0.00008500529,0.0004297238,0.0001317858,0.0002151888,0.00004063711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001699109,0.0003922285,0.2890023,0.00009209567,0.00005385678,0.00005714628,0.002969901,0.1347301,0.004363967,0.4209509,0.004532014,0.1426855],"study_design_scores_gemma":[0.005068009,0.001157872,0.4993863,0.0002391981,0.00002603168,0.0002805331,0.002132235,0.4050103,0.01356684,0.07160331,0.001084467,0.0004449615],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07983442,0.00003492837,0.9146788,0.002505665,0.0002125511,0.0001274034,0.000001041548,0.00001190076,0.002593261],"genre_scores_gemma":[0.9568805,0.00001323526,0.04286526,0.0001797926,0.00001729926,0.000001634718,0.000001722907,0.000001983292,0.00003854547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8770461,"threshold_uncertainty_score":0.2021704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010716453","doi":"10.1305/ndjfl/1117755151","title":"A Deontic Counterpart of Lewis's S1","year":2005,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Deontic logic; Soundness; Normal modal logic; Modal logic; Modal; Completeness (order theory); Schema (genetic algorithms); Philosophy; Epistemology; Accessibility relation; Calculus (dental); Computer science; Mathematics; Linguistics","authors":[{"name":"R. E. Jennings","is_ca":true},{"name":"Kam Sing Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01209097252174723,"gpt":0.2493068335905838,"spread":0.2372158610688366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000348915,0.0001428408,0.0003343037,0.0001394693,0.00006501612,0.00004295104,0.0009102991,0.00006624107,0.00007944222],"category_scores_gemma":[0.00006254762,0.0001011375,0.0001907898,0.0002409026,0.0000651013,0.001824677,0.0001336092,0.0002632006,0.00006979991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000542949,"about_ca_system_score_gemma":0.00008667563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001695545,"about_ca_topic_score_gemma":0.000005261907,"domain_scores_codex":[0.9984784,0.00003815083,0.0006209019,0.0001271741,0.0004002904,0.000335059],"domain_scores_gemma":[0.9987093,0.00007462821,0.000601923,0.0002661556,0.0002280756,0.0001198936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004223234,0.001399935,0.007281313,0.0001570618,0.0002616061,0.0005820093,0.003672181,0.02147819,0.01525407,0.3342556,0.009028858,0.6062068],"study_design_scores_gemma":[0.01752485,0.01754977,0.0702679,0.001344141,0.0004621626,0.01525637,0.001053082,0.1511909,0.07494953,0.2499995,0.3966924,0.003709409],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3198997,0.001333578,0.6718304,0.001579248,0.0005440997,0.0001007031,0.000004183389,0.00004101328,0.004667096],"genre_scores_gemma":[0.9434767,0.00006957119,0.05545556,0.0006907922,0.0001989511,7.814834e-7,6.560879e-7,0.000005074435,0.0001018894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.623577,"threshold_uncertainty_score":0.4124266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405119112","doi":"10.1215/00294527-2024-0017","title":"Classifying Invariants for E1: A Tail of a Generic Real","year":2024,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Computer science; Programming language","authors":[{"name":"Assaf Shani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1103165339793116,"gpt":0.3721510824641157,"spread":0.2618345484848041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008059345,0.0001302584,0.0003797041,0.0001504114,0.00007301463,0.00001544791,0.0002088894,0.0001426674,0.0001043389],"category_scores_gemma":[0.0003655569,0.00009180656,0.0002415452,0.0001379766,0.0000962354,0.0004035301,0.00004581144,0.0003052249,0.000005997734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004816104,"about_ca_system_score_gemma":0.0001200263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001282795,"about_ca_topic_score_gemma":0.000004208722,"domain_scores_codex":[0.9987991,0.00005781169,0.0006185248,0.00009895721,0.00016169,0.0002639367],"domain_scores_gemma":[0.998683,0.0006105315,0.0003799814,0.0001273244,0.0001326598,0.00006654154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008663773,0.0002060255,0.0002036035,0.0008781247,0.0003393463,0.0002767456,0.001855093,0.0002027368,0.009559567,0.958407,0.004069939,0.02313538],"study_design_scores_gemma":[0.0009485576,0.0009563568,0.0002220464,0.0002791815,0.0002093839,0.0006926646,0.000624759,0.001872431,0.002364289,0.9878512,0.003805909,0.00017319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6826497,0.002022773,0.3032928,0.0006826753,0.001384036,0.0003281925,0.00007245526,0.00006795173,0.009499468],"genre_scores_gemma":[0.9443002,0.0001920123,0.0545969,0.0001127147,0.0003030822,0.000004998684,0.00000293103,0.00002112042,0.0004659748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2616506,"threshold_uncertainty_score":0.3743763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605592859","doi":"10.1215/00294527-3882335","title":"Club-Isomorphisms of Aronszajn Trees in the Extension with a Suslin Tree","year":2017,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Shizuoka University","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Tree (set theory); Computer science; Programming language","authors":[{"name":"Teruyuki Yorioka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07248249006765904,"gpt":0.3311863567716262,"spread":0.2587038667039672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576229,0.000162697,0.0005247868,0.0001010635,0.0001394155,0.00006888193,0.0006959147,0.00009491412,0.00006203121],"category_scores_gemma":[0.0008209448,0.00007801892,0.0001748187,0.00006881105,0.0001776221,0.0003753044,0.00007483917,0.0003693357,0.000003829341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002305171,"about_ca_system_score_gemma":0.00004481166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001351134,"about_ca_topic_score_gemma":0.0001877254,"domain_scores_codex":[0.9983417,0.00007443734,0.0007348596,0.00009427321,0.0004956494,0.000259043],"domain_scores_gemma":[0.9973714,0.0005216405,0.001338636,0.0005277614,0.0001756632,0.00006493567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002567271,0.004714973,0.01256182,0.0007572318,0.0003592534,0.001847952,0.008119359,0.0003577534,0.008063034,0.9171708,0.003219535,0.04026097],"study_design_scores_gemma":[0.004835387,0.003510204,0.09343664,0.001322297,0.0003193396,0.001502938,0.002327626,0.01164541,0.0006934439,0.8793823,0.0005492307,0.0004751772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9833188,0.0000784019,0.006523721,0.001260984,0.00006528941,0.0002035793,0.00001003539,0.000005136787,0.008534076],"genre_scores_gemma":[0.9885337,0.00004449341,0.01115255,0.00009368627,0.00006441094,0.000002425189,0.000001043205,0.00001253331,0.00009511199],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08087482,"threshold_uncertainty_score":0.3181519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}