{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005615021,0.0005341007,0.0006965489,0.001346449,0.003209992,0.00709707,0.001429715,0.002518944,0.004943159],"category_scores_gemma":[0.007986914,0.0003849631,0.0009924108,0.00127891,0.01364307,0.01072408,0.004009389,0.005330054,0.0007874431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00480358,"about_ca_system_score_gemma":0.002804507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00287738,"about_ca_topic_score_gemma":0.00179908,"domain_scores_codex":[0.9966066,0.00172448,0.0001736186,0.0004790572,0.0007255661,0.0002908251],"domain_scores_gemma":[0.9965886,0.001924791,0.0002009094,0.0004461673,0.0005739128,0.000265654],"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.000002397463,0.000001594534,0.00001199666,0.0000059797,0.00000162648,0.00002049627,0.00009479694,0.0001305763,0.00002193293,0.9983892,0.0008378476,0.0004816142],"study_design_scores_gemma":[0.000004038656,0.000001557922,0.00001047449,0.000006589245,0.000001527557,0.00002604179,0.00003246961,0.0005786397,0.00003569761,0.9933031,0.005996617,0.000003161328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02789458,0.01411833,0.333205,0.06638391,0.002165456,0.000122897,0.0005563181,0.0005204605,0.555033],"genre_scores_gemma":[0.8662081,0.004568478,0.06706569,0.01122353,0.001742947,0.000291804,0.0002844046,0.0002088285,0.04840617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00709707,"threshold_uncertainty_score":0.03485262,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246062,0.0006099642,0.001100082,0.003252443,0.002145508,0.003521517,0.001330998,0.0008718004,0.003181736],"category_scores_gemma":[0.005543662,0.0005924344,0.001101966,0.001808595,0.005466658,0.006526694,0.004062215,0.001798187,0.0002106624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002324834,"about_ca_system_score_gemma":0.0004971109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001858687,"about_ca_topic_score_gemma":0.001211307,"domain_scores_codex":[0.9984528,0.0002312681,0.0001096594,0.0004156751,0.0004736394,0.0003170556],"domain_scores_gemma":[0.9968867,0.001277974,0.000515977,0.000421219,0.0003773007,0.0005208523],"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.0001121161,0.0000288604,0.004072445,0.0000569742,0.00003287417,0.0001948725,0.0009716422,0.002574375,0.004468429,0.9826291,0.0001523534,0.004705961],"study_design_scores_gemma":[0.00006475929,0.0001372045,0.007366008,0.00004186321,0.00007768722,0.0006509654,0.001277362,0.01356382,0.008167319,0.9644803,0.00409762,0.00007507311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9211227,0.0004128897,0.0612934,0.000351771,0.00001796106,0.00003904156,0.0001944805,0.000130016,0.01643775],"genre_scores_gemma":[0.9930282,0.0002375114,0.00458389,0.00003000497,0.00003567255,0.0000322505,0.0001299251,0.00001629813,0.001906267],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003521517,"threshold_uncertainty_score":0.01686794,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005586245,0.0004100703,0.0005628606,0.00188978,0.003056279,0.004486065,0.001513306,0.001865208,0.007784889],"category_scores_gemma":[0.01386833,0.0005003022,0.0009006016,0.001055241,0.01266679,0.00737277,0.003351068,0.004392464,0.003408174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003796792,"about_ca_system_score_gemma":0.003156229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003897228,"about_ca_topic_score_gemma":0.002773178,"domain_scores_codex":[0.9969844,0.001277574,0.0001522143,0.0006543301,0.0007527811,0.0001785849],"domain_scores_gemma":[0.9945043,0.003299488,0.0001371733,0.001000556,0.0008757139,0.0001827057],"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.000009117955,0.0000032083,0.00003051642,0.00001390002,0.000002067907,0.00001560683,0.0001370397,0.0002427707,0.00005361399,0.9916652,0.003829183,0.003997811],"study_design_scores_gemma":[0.00001621491,0.000009171063,0.00003651932,0.0000289883,0.000005355743,0.00003935718,0.00002863795,0.001722371,0.0003420929,0.9253725,0.0723854,0.00001337599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01149492,0.004854762,0.5430581,0.04125757,0.00190036,0.0001817696,0.0007653577,0.002551284,0.3939359],"genre_scores_gemma":[0.4921263,0.004887782,0.385984,0.006824241,0.001712103,0.0004594495,0.0006226643,0.0008849232,0.1064987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007784889,"threshold_uncertainty_score":0.02954328,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005390879,0.001111762,0.001006075,0.002582562,0.002360336,0.007829623,0.002252214,0.00210866,0.008325564],"category_scores_gemma":[0.01276297,0.001085327,0.002545049,0.002592656,0.007087531,0.01353116,0.004465384,0.004541677,0.001389998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003890249,"about_ca_system_score_gemma":0.002728852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004853367,"about_ca_topic_score_gemma":0.005752627,"domain_scores_codex":[0.9945077,0.002164205,0.0003563306,0.0007974508,0.001651573,0.0005226574],"domain_scores_gemma":[0.9945354,0.002697493,0.0003909454,0.0009713779,0.001003183,0.0004014495],"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.000001949398,0.000002522276,0.00002303032,0.00000719694,0.000002552604,0.00001055101,0.00004231624,0.001013902,0.00001562272,0.9979685,0.0002021959,0.0007096325],"study_design_scores_gemma":[0.000003698049,0.00000201639,0.00001066681,0.000007300348,0.000003011067,0.0000155526,0.00002077943,0.007879025,0.00003825839,0.9898633,0.002152287,0.000004205247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01154437,0.001161647,0.9363325,0.00402391,0.0002687614,0.0001238503,0.0004735651,0.0005070026,0.04556432],"genre_scores_gemma":[0.7074967,0.002423171,0.2599693,0.002050131,0.001011566,0.000827914,0.001312398,0.0003081254,0.02460071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008325564,"threshold_uncertainty_score":0.02851003,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008919235,0.0003444908,0.0005059024,0.001396753,0.002030874,0.002553943,0.0005324708,0.0004734917,0.004763687],"category_scores_gemma":[0.002816448,0.0003361638,0.001380303,0.0007277122,0.004145462,0.004247157,0.002148134,0.002254641,0.0005817869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596022,"about_ca_system_score_gemma":0.0006393172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002270271,"about_ca_topic_score_gemma":0.001453578,"domain_scores_codex":[0.9987547,0.0002135039,0.00009633329,0.0003300286,0.0003687005,0.0002366959],"domain_scores_gemma":[0.9979328,0.0009006881,0.0002041249,0.0005178445,0.0002747068,0.000169823],"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.00005772872,0.00003277166,0.001401852,0.00006640139,0.0000206938,0.0002932445,0.0008449123,0.00157102,0.00119332,0.9829208,0.001392242,0.01020495],"study_design_scores_gemma":[0.00002563831,0.00004198845,0.001353519,0.00003337111,0.00003418726,0.0004053649,0.0005269921,0.003710771,0.003741361,0.9742279,0.01587542,0.0000234383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7478407,0.001593012,0.1101184,0.002035661,0.0002159178,0.0001425438,0.000834483,0.0006984718,0.1365208],"genre_scores_gemma":[0.966228,0.0004306935,0.0158801,0.0002112421,0.0001386565,0.00005177461,0.0006906333,0.00008345521,0.01628548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004763687,"threshold_uncertainty_score":0.01593614,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006931307,0.0005783496,0.0004323109,0.0007030847,0.0009704118,0.001794472,0.0006327616,0.0003903946,0.003322055],"category_scores_gemma":[0.0007939806,0.0002403885,0.0006012084,0.0003473994,0.003098518,0.003181027,0.00229388,0.0009317816,0.0003503858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008502375,"about_ca_system_score_gemma":0.0003540547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007645794,"about_ca_topic_score_gemma":0.0009935962,"domain_scores_codex":[0.9994641,0.0001469673,0.00003435952,0.0001403552,0.00009826595,0.0001159255],"domain_scores_gemma":[0.9995475,0.0001449575,0.0001066292,0.00004616677,0.00004197371,0.0001127227],"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.0001482534,0.00004763593,0.0008559162,0.0000685414,0.00001180079,0.0003523515,0.001566147,0.0009200425,0.01083349,0.9797863,0.0003890556,0.005020365],"study_design_scores_gemma":[0.0001545796,0.0002367044,0.001419723,0.00004771522,0.00002941691,0.0005980759,0.002134406,0.007309115,0.0139561,0.9561853,0.01789472,0.00003403987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7946281,0.0005988104,0.1392761,0.0009709231,0.00007690832,0.000142066,0.0002934942,0.0004810485,0.06353261],"genre_scores_gemma":[0.9634677,0.000146264,0.02797689,0.0001452937,0.00006438473,0.0001099234,0.0003297701,0.0000415531,0.007718219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003322055,"threshold_uncertainty_score":0.01111341,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688259,0.0006182566,0.0006227304,0.001247999,0.001122648,0.00307513,0.001391718,0.0007502922,0.005477459],"category_scores_gemma":[0.01223748,0.0005784334,0.0006269478,0.0008438826,0.004216441,0.005477609,0.004656071,0.002015429,0.0004288811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001843309,"about_ca_system_score_gemma":0.0006065288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008057926,"about_ca_topic_score_gemma":0.0009510525,"domain_scores_codex":[0.9983469,0.0003523174,0.00008113947,0.0003114832,0.0005051128,0.0004030142],"domain_scores_gemma":[0.9933677,0.004060675,0.0004478415,0.001123728,0.0003659453,0.0006340517],"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.0003210295,0.00004580175,0.001868087,0.0001098668,0.00001904802,0.00008985466,0.0004788269,0.0299543,0.006456364,0.9488292,0.0009354528,0.01089223],"study_design_scores_gemma":[0.00004648778,0.00009241938,0.0008013902,0.00004656739,0.00001895212,0.0001374303,0.0002244445,0.1280915,0.0103943,0.8542915,0.005806495,0.00004848023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7417749,0.0006048427,0.2214602,0.0008190322,0.00009395996,0.00005479539,0.0002534557,0.0007383293,0.03420033],"genre_scores_gemma":[0.9734744,0.0001110833,0.02425401,0.00008048012,0.00002279454,0.00004156085,0.00009203318,0.00008591584,0.001837795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005477459,"threshold_uncertainty_score":0.0183239,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00169077,0.0005000143,0.0005408778,0.001360641,0.001481734,0.00361965,0.00109854,0.001022187,0.003765156],"category_scores_gemma":[0.00306685,0.0003183156,0.001467556,0.001303935,0.006590717,0.008238085,0.003009493,0.001837469,0.0002675517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002406398,"about_ca_system_score_gemma":0.001301979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001950017,"about_ca_topic_score_gemma":0.001892332,"domain_scores_codex":[0.9984535,0.0006108002,0.00009394604,0.000229764,0.000434817,0.0001771762],"domain_scores_gemma":[0.9984817,0.0007421964,0.0002174067,0.000246903,0.0001822696,0.0001294983],"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.000002736298,0.000003799329,0.00005581955,0.000005703359,0.000002465851,0.00002467252,0.0001138337,0.001046102,0.0001346373,0.9980584,0.00003942436,0.0005124554],"study_design_scores_gemma":[0.00000668647,0.00001111006,0.00006316213,0.000008939383,0.000006737846,0.00004101671,0.0001927964,0.01024175,0.0004179212,0.9869199,0.002083269,0.00000670387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3608923,0.001030074,0.5419447,0.002078423,0.0001026649,0.0001163477,0.0002369803,0.0004046966,0.09319378],"genre_scores_gemma":[0.9499409,0.0003194337,0.04493375,0.0001000607,0.00006181305,0.0001139761,0.0001561096,0.00004364298,0.004330395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003765156,"threshold_uncertainty_score":0.01745975,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113546,0.0003105454,0.0003823788,0.0007631679,0.002266967,0.002510166,0.001111085,0.001161777,0.008041088],"category_scores_gemma":[0.003103746,0.000269227,0.0006888873,0.0006215003,0.006521133,0.00537846,0.002534006,0.002360131,0.0007756097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002084698,"about_ca_system_score_gemma":0.001955767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00437861,"about_ca_topic_score_gemma":0.00346522,"domain_scores_codex":[0.9982843,0.0004807276,0.0001096027,0.0004610156,0.0004242721,0.0002401357],"domain_scores_gemma":[0.9982538,0.0005744169,0.0002359537,0.000268832,0.0005012418,0.0001657235],"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.000007713695,0.000003770657,0.0001099725,0.00001291613,0.000001477907,0.00003716962,0.0003382443,0.0001215833,0.0004745745,0.9968779,0.0003413878,0.00167327],"study_design_scores_gemma":[0.00002448847,0.00006060746,0.0003196633,0.00001963669,0.00001047075,0.0001351865,0.0004191851,0.004189561,0.001862493,0.9624847,0.03045327,0.00002071755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1975882,0.0008914372,0.4643742,0.008135553,0.0004538575,0.0002310795,0.0003748217,0.0008699935,0.3270809],"genre_scores_gemma":[0.9252226,0.0003134922,0.05010827,0.0009671972,0.0002150271,0.00007814527,0.0001514159,0.00007342721,0.02287032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008041088,"threshold_uncertainty_score":0.02690011,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119372,0.0004913833,0.0005991973,0.002509922,0.00210304,0.004841773,0.0009658258,0.00116098,0.004052752],"category_scores_gemma":[0.004668762,0.0003546642,0.001191139,0.001462778,0.005367452,0.01085769,0.002935489,0.002157486,0.0004029663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00195234,"about_ca_system_score_gemma":0.000805035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001482938,"about_ca_topic_score_gemma":0.001131315,"domain_scores_codex":[0.9982835,0.0002115868,0.0001453076,0.0004135574,0.0004219118,0.0005241606],"domain_scores_gemma":[0.9964457,0.001262321,0.0006440949,0.000695319,0.0003711432,0.0005815126],"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.00006485617,0.00002930032,0.004228706,0.00002178977,0.000007862974,0.0001024697,0.0004272987,0.001534173,0.001200081,0.9883683,0.0002615674,0.003753498],"study_design_scores_gemma":[0.00002277137,0.00007304761,0.003120549,0.00003118276,0.00002702968,0.0002690011,0.001054906,0.01751162,0.003142675,0.9695658,0.005142172,0.00003927327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8405735,0.0002448254,0.1339917,0.0006195686,0.00003152974,0.00005733153,0.0003443431,0.0002376566,0.02389946],"genre_scores_gemma":[0.9834172,0.0001034127,0.01270168,0.00007364294,0.00002692911,0.00005067258,0.0004483492,0.00002471024,0.003153371],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004841773,"threshold_uncertainty_score":0.01416522,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009568161,0.000252301,0.0005325112,0.002217234,0.0025207,0.002088543,0.0004624616,0.0005086794,0.004024423],"category_scores_gemma":[0.001563543,0.0003470474,0.0009139355,0.0009598717,0.002485099,0.003570894,0.003531351,0.001195933,0.0003578591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008999681,"about_ca_system_score_gemma":0.0004767383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001250838,"about_ca_topic_score_gemma":0.00163546,"domain_scores_codex":[0.9991585,0.0001706706,0.00005043858,0.0001542845,0.0002523445,0.0002137604],"domain_scores_gemma":[0.9989852,0.0002612409,0.0001179302,0.0001408793,0.0001711813,0.0003236174],"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.0000225245,0.00001979709,0.0006411363,0.00001526888,0.000004090769,0.0002300143,0.0006428846,0.000316086,0.00116445,0.9943225,0.0001883872,0.002432798],"study_design_scores_gemma":[0.00003383796,0.00006067821,0.0020627,0.00002856775,0.00002781264,0.0005965093,0.0007186374,0.01003866,0.001824677,0.9701977,0.01439058,0.00001950047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7250692,0.0006126149,0.1650852,0.0005916117,0.0001927914,0.0000935788,0.0001748971,0.0002900301,0.1078902],"genre_scores_gemma":[0.9678214,0.0001850244,0.02368876,0.00009773664,0.00007895368,0.00005762207,0.0001126386,0.00003813085,0.007919753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004024423,"threshold_uncertainty_score":0.01346302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}