{"meta":{"query_hash":"33cb59e9ead4","filters":{"venue":"Notre Dame Journal of Formal Logic"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"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/33cb59e9ead4","api":"https://metacan.xera.ac/api/v1/cohort?venue=Notre+Dame+Journal+of+Formal+Logic"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lattice (music); Combinatorics; Complete lattice; Pure mathematics; Discrete mathematics; Physics; Condensed matter physics","score_opus":0.03305867257580116,"score_gpt":0.29965718291166643,"score_spread":0.2665985103358653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981909162","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.9842643,0.00044300567,0.00691141,0.00024848807,0.00012843305,0.000110505585,0.0000024972494,0.000009088012,0.007882272],"genre_scores_gemma":[0.97899663,0.00006542463,0.020451657,0.00015422361,0.000050202045,0.0000023670075,7.4614064e-7,0.000009628642,0.00026914044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986878,0.000082683044,0.00068411336,0.00007395547,0.00017713926,0.0002943008],"domain_scores_gemma":[0.9985861,0.00042292246,0.00059933594,0.00014645496,0.00018073157,0.000064452186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006731949,0.00012160456,0.0004045798,0.00014223649,0.000040674706,0.000009168339,0.00026720806,0.00013538812,0.00053389976],"category_scores_gemma":[0.000363902,0.00008679043,0.00011514218,0.00012973808,0.00013218726,0.0007266683,0.000053913507,0.00037098507,0.00003538182],"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.00068962073,0.0010107203,0.020507645,0.00045216797,0.00014390597,0.00025260253,0.0022159498,0.0010752665,0.0034838088,0.9549185,0.0018385209,0.0134112695],"study_design_scores_gemma":[0.0010615943,0.0005875538,0.0073613166,0.00011097866,0.000036354948,0.00021649724,0.0008500627,0.00017843112,0.0015849272,0.98754454,0.0003344258,0.00013332453],"about_ca_topic_score_codex":0.00001366474,"about_ca_topic_score_gemma":0.000022882527,"teacher_disagreement_score":0.03262601,"about_ca_system_score_codex":0.000034055294,"about_ca_system_score_gemma":0.000046630546,"threshold_uncertainty_score":0.58458275},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012090972521747225,"score_gpt":0.24930683359058384,"score_spread":0.2372158610688366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010716453","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.3198997,0.0013335781,0.67183036,0.0015792485,0.00054409966,0.000100703146,0.0000041833887,0.00004101328,0.0046670963],"genre_scores_gemma":[0.94347674,0.000069571186,0.05545556,0.0006907922,0.00019895111,7.8148344e-7,6.5608793e-7,0.000005074435,0.00010188941],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984784,0.000038150825,0.00062090193,0.00012717412,0.00040029042,0.00033505895],"domain_scores_gemma":[0.9987093,0.00007462821,0.000601923,0.0002661556,0.00022807562,0.00011989364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034891503,0.00014284084,0.00033430374,0.00013946928,0.000065016124,0.00004295104,0.0009102991,0.00006624107,0.000079442216],"category_scores_gemma":[0.00006254762,0.000101137455,0.00019078975,0.00024090265,0.0000651013,0.0018246768,0.00013360917,0.00026320064,0.000069799906],"study_design_candidate":"design_other","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.00042232336,0.0013999351,0.007281313,0.00015706178,0.00026160612,0.00058200926,0.0036721814,0.021478187,0.015254072,0.33425564,0.009028858,0.60620683],"study_design_scores_gemma":[0.017524848,0.017549774,0.0702679,0.001344141,0.00046216263,0.01525637,0.0010530818,0.1511909,0.07494953,0.24999952,0.39669237,0.0037094087],"about_ca_topic_score_codex":0.0000016955454,"about_ca_topic_score_gemma":0.000005261907,"teacher_disagreement_score":0.623577,"about_ca_system_score_codex":0.0000542949,"about_ca_system_score_gemma":0.00008667563,"threshold_uncertainty_score":0.4124266},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010943128461618984,"score_gpt":0.2307062826099928,"score_spread":0.2197631541483738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014988898","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.33772188,0.0004952197,0.64676315,0.0032394386,0.0014666703,0.00011590416,0.0000025626086,0.0001066357,0.010088553],"genre_scores_gemma":[0.98635644,0.0000062320964,0.012745799,0.00046786462,0.00035475372,3.493216e-7,4.7960685e-7,0.0000025144227,0.00006558472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876773,0.000048351958,0.00041071794,0.00011929054,0.0003817056,0.00027217166],"domain_scores_gemma":[0.99904466,0.000040257193,0.0003997781,0.00015161808,0.00023557649,0.00012809786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047191436,0.00011790271,0.00022108648,0.00013172218,0.00010677887,0.0001040212,0.0006164691,0.000050705963,0.000006487114],"category_scores_gemma":[0.000036764723,0.00008567877,0.00014229288,0.00021845273,0.00001864526,0.0014067639,0.00006615515,0.00020848884,0.00003506155],"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.00013100615,0.00026241926,0.00013222688,0.000032660813,0.00006443865,0.00042687362,0.0014596821,0.0026772164,0.0034038245,0.46445403,0.004439863,0.5225158],"study_design_scores_gemma":[0.012347895,0.01892372,0.2570206,0.0015269333,0.00033392358,0.026071617,0.002219664,0.2629508,0.033466198,0.33624464,0.045376383,0.0035176333],"about_ca_topic_score_codex":0.0000036916188,"about_ca_topic_score_gemma":5.2139615e-7,"teacher_disagreement_score":0.64863455,"about_ca_system_score_codex":0.0001268898,"about_ca_system_score_gemma":0.000111475965,"threshold_uncertainty_score":0.34938785},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04454526761879116,"score_gpt":0.27234907474568604,"score_spread":0.22780380712689488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037742565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018269772,0.00066569826,0.96218914,0.00031306504,0.001082339,0.0002738724,0.0000058230744,0.000047988073,0.01715232],"genre_scores_gemma":[0.9436081,0.000036745125,0.055545833,0.0003307079,0.0002532996,0.000010202807,0.0000014173789,0.000009826703,0.00020388287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800336,0.000114108196,0.0006638981,0.00024374151,0.0003618521,0.0006130324],"domain_scores_gemma":[0.99825174,0.0002549522,0.000460814,0.00031493866,0.0004598939,0.0002576916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012011519,0.00021417109,0.0004125256,0.00009140209,0.00019284234,0.00014807552,0.0009153884,0.00015611119,0.000029665422],"category_scores_gemma":[0.00061641727,0.00014576303,0.0003224358,0.00022167446,0.00008528798,0.0011357431,0.000105687795,0.00033031855,0.000016249449],"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.000065739645,0.0002568628,0.00016825655,0.000033737222,0.00003335877,0.000055587803,0.00038768473,0.010195374,0.000079185265,0.9822504,0.0014475003,0.0050263507],"study_design_scores_gemma":[0.0037165645,0.0040512434,0.00045632926,0.0000844158,0.00012753389,0.0020054067,0.00009491965,0.24433944,0.0015204217,0.6972896,0.045525722,0.00078842556],"about_ca_topic_score_codex":0.0000025659353,"about_ca_topic_score_gemma":0.000008132528,"teacher_disagreement_score":0.9253383,"about_ca_system_score_codex":0.00011041826,"about_ca_system_score_gemma":0.00047722587,"threshold_uncertainty_score":0.59440434},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05923324648026579,"score_gpt":0.31297086010891007,"score_spread":0.2537376136286443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064601069","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.98905987,0.00008414066,0.0025196383,0.0015411073,0.00031114326,0.000069989714,0.0000045696443,0.000007930931,0.006401627],"genre_scores_gemma":[0.9915447,0.000010535716,0.007677801,0.0003863347,0.00019637664,3.0304105e-7,4.5018822e-7,0.000007236977,0.00017621162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891204,0.000051463696,0.0005030111,0.000054933593,0.00029444136,0.00018409653],"domain_scores_gemma":[0.9987736,0.00022977858,0.00057167007,0.00021398447,0.0001552127,0.000055801822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005738228,0.00010149422,0.00026460266,0.000055870372,0.000079926904,0.0000072705516,0.0003928271,0.000083358755,0.00031474364],"category_scores_gemma":[0.00062985544,0.000057769157,0.00022018902,0.00019192754,0.00008009034,0.00018586896,0.00008122305,0.0003386789,0.000010699228],"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.0011294554,0.0016182053,0.0026185405,0.00060684077,0.00051221653,0.00014605043,0.005254564,0.0014168978,0.026214993,0.939088,0.0124232,0.008971024],"study_design_scores_gemma":[0.0014466004,0.0007024602,0.004992689,0.00021611711,0.00011239279,0.00074981217,0.00062007917,0.0000151561135,0.050931897,0.93838805,0.0016696984,0.00015505592],"about_ca_topic_score_codex":0.0000039760207,"about_ca_topic_score_gemma":0.0000016369972,"teacher_disagreement_score":0.024716904,"about_ca_system_score_codex":0.000026488924,"about_ca_system_score_gemma":0.00006927333,"threshold_uncertainty_score":0.34462222},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024934763969900808,"score_gpt":0.3059543421228231,"score_spread":0.2810195781529223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117551059","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.99433374,0.00012137504,0.0026903707,0.0015951071,0.0002450056,0.00009359629,0.0000112167445,0.000004374507,0.000905239],"genre_scores_gemma":[0.9969048,0.00006948603,0.0023986385,0.00047991227,0.00008153077,7.545846e-7,0.000001658269,0.0000047818517,0.00005843293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991704,0.000111868976,0.0003446498,0.000057973444,0.00019364606,0.00012144657],"domain_scores_gemma":[0.99873793,0.0006908445,0.00032294466,0.00010255144,0.000102695136,0.000043032305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733532,0.000090863046,0.00026170939,0.000040743733,0.00010204031,0.000004823195,0.00015075192,0.00007962226,0.00013095303],"category_scores_gemma":[0.00043456847,0.00005016077,0.0001154749,0.00003667612,0.0003820485,0.00018418748,0.000018388602,0.0004705857,0.0000018844303],"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.0023208447,0.0002508514,0.0023312215,0.0001166669,0.00009043852,0.00003065749,0.0011070325,0.000015086362,0.0031707236,0.9887029,0.00043932325,0.0014242607],"study_design_scores_gemma":[0.003423844,0.00034686603,0.011969102,0.00012192192,0.00010880449,0.00092880585,0.0004637582,0.000087065004,0.006898063,0.9754053,0.0001282224,0.00011830022],"about_ca_topic_score_codex":0.0000012343963,"about_ca_topic_score_gemma":0.000019740708,"teacher_disagreement_score":0.013297644,"about_ca_system_score_codex":0.000006870234,"about_ca_system_score_gemma":0.000028694543,"threshold_uncertainty_score":0.20454967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018718476576078367,"score_gpt":0.25851814022920266,"score_spread":0.2397996636531243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144930856","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.07983442,0.00003492837,0.9146788,0.002505665,0.00021255111,0.00012740339,0.0000010415484,0.000011900765,0.0025932612],"genre_scores_gemma":[0.9568805,0.0000132352625,0.042865258,0.00017979255,0.000017299264,0.000001634718,0.0000017229072,0.0000019832921,0.000038545473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991333,0.00006307728,0.00040057185,0.000071892544,0.00020469356,0.00012648132],"domain_scores_gemma":[0.99909765,0.00008500529,0.00042972376,0.00013178581,0.00021518877,0.000040637107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026739214,0.00006244066,0.00014018721,0.00017427217,0.000037237525,0.00005063892,0.00021723352,0.000028327302,0.00017158627],"category_scores_gemma":[0.000057724963,0.000049577324,0.0000556174,0.000254198,0.000041836975,0.0012502766,0.000033442204,0.00010115264,0.0000054155266],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016991091,0.00039222848,0.2890023,0.00009209567,0.000053856777,0.000057146284,0.0029699013,0.1347301,0.004363967,0.42095092,0.004532014,0.14268555],"study_design_scores_gemma":[0.0050680093,0.0011578716,0.49938628,0.00023919805,0.00002603168,0.00028053313,0.0021322349,0.40501028,0.013566837,0.071603306,0.0010844669,0.00044496148],"about_ca_topic_score_codex":0.000081106526,"about_ca_topic_score_gemma":0.000022336739,"teacher_disagreement_score":0.8770461,"about_ca_system_score_codex":0.000037989852,"about_ca_system_score_gemma":0.0000706077,"threshold_uncertainty_score":0.20217045},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031185950556399715,"score_gpt":0.2699876248191398,"score_spread":0.23880167426274007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240279767","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.4458218,0.0008628597,0.5512267,0.00027167625,0.0009361231,0.0002066792,0.000002146006,0.00003852547,0.00063354394],"genre_scores_gemma":[0.92471576,0.000010807724,0.074953854,0.00010436975,0.00019947965,0.0000016463673,5.472798e-7,0.0000072782686,0.0000062559125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763274,0.00024352354,0.0007760475,0.00021877322,0.0007351801,0.00039373958],"domain_scores_gemma":[0.9970622,0.0005257256,0.0008911278,0.00034657356,0.0009379519,0.00023642204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021879382,0.00020973134,0.0006014405,0.00021034572,0.000083095074,0.00008304805,0.00089816505,0.00010480375,0.0000059861773],"category_scores_gemma":[0.00054233323,0.00014843256,0.00026288445,0.00036732483,0.000091305985,0.0012866245,0.00039880318,0.00038503946,0.000009548654],"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.0013722223,0.0016492851,0.044997755,0.00022972787,0.0005188797,0.00088252005,0.01176834,0.20635737,0.015197861,0.027812034,0.0009183902,0.6882956],"study_design_scores_gemma":[0.011829888,0.012743477,0.06911286,0.0006085255,0.0002081106,0.002340326,0.00083112967,0.80703455,0.020080509,0.0726865,0.0013657967,0.0011583283],"about_ca_topic_score_codex":0.000019950547,"about_ca_topic_score_gemma":0.000005318868,"teacher_disagreement_score":0.6871373,"about_ca_system_score_codex":0.00014982208,"about_ca_system_score_gemma":0.00014826229,"threshold_uncertainty_score":0.6052904},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07248249006765904,"score_gpt":0.3311863567716262,"score_spread":0.25870386670396717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605592859","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.9833188,0.0000784019,0.006523721,0.0012609841,0.00006528941,0.00020357933,0.000010035387,0.0000051367874,0.008534076],"genre_scores_gemma":[0.98853374,0.000044493412,0.011152553,0.00009368627,0.00006441094,0.0000024251888,0.0000010432047,0.000012533311,0.000095111995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834174,0.00007443734,0.00073485955,0.000094273215,0.0004956494,0.00025904295],"domain_scores_gemma":[0.9973714,0.0005216405,0.0013386356,0.0005277614,0.00017566315,0.00006493567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015762291,0.00016269698,0.00052478677,0.000101063466,0.00013941547,0.00006888193,0.00069591467,0.000094914125,0.000062031206],"category_scores_gemma":[0.00082094484,0.00007801892,0.00017481872,0.00006881105,0.00017762215,0.0003753044,0.00007483917,0.0003693357,0.0000038293415],"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.0025672708,0.004714973,0.0125618195,0.0007572318,0.00035925343,0.0018479517,0.008119359,0.00035775342,0.008063034,0.9171708,0.0032195353,0.040260974],"study_design_scores_gemma":[0.004835387,0.003510204,0.093436636,0.0013222967,0.00031933963,0.0015029385,0.0023276259,0.011645406,0.0006934439,0.8793823,0.0005492307,0.00047517716],"about_ca_topic_score_codex":0.000013511337,"about_ca_topic_score_gemma":0.00018772543,"teacher_disagreement_score":0.080874816,"about_ca_system_score_codex":0.000023051709,"about_ca_system_score_gemma":0.000044811655,"threshold_uncertainty_score":0.31815192},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038528760449590145,"score_gpt":0.28381338543847745,"score_spread":0.2452846249888873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890251009","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.276581,0.046336904,0.34222272,0.006538459,0.021276698,0.0005363056,0.00007010181,0.00009708205,0.30634072],"genre_scores_gemma":[0.9544749,0.0005808792,0.032773387,0.0011966573,0.0023497671,0.0000015737531,0.0000022548886,0.000021891705,0.008598638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627215,0.00027349003,0.0014153309,0.00035462668,0.0006846855,0.0009997254],"domain_scores_gemma":[0.99503124,0.0002531614,0.0017714734,0.00057556934,0.0019682131,0.00040032814],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016449488,0.00042715235,0.00090084766,0.00027478635,0.00027850238,0.000188957,0.0018001419,0.0003973149,0.0031717073],"category_scores_gemma":[0.00041557095,0.00032029953,0.0005264838,0.00084620784,0.000796056,0.0022517645,0.0004803445,0.00080191134,0.00054306356],"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.0005550796,0.0021129572,0.0055483454,0.00058761274,0.0005581252,0.0010235951,0.011665782,0.0002974674,0.002333894,0.7304137,0.05003804,0.1948654],"study_design_scores_gemma":[0.007999984,0.027239075,0.045031536,0.0015883492,0.00061885815,0.01252408,0.0009441817,0.026292786,0.015292809,0.2096418,0.6505161,0.0023104625],"about_ca_topic_score_codex":0.000024953637,"about_ca_topic_score_gemma":0.00007075148,"teacher_disagreement_score":0.67789394,"about_ca_system_score_codex":0.00012101177,"about_ca_system_score_gemma":0.0005958104,"threshold_uncertainty_score":0.9999249},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Computer science; Programming language","score_opus":0.11031653397931158,"score_gpt":0.37215108246411566,"score_spread":0.2618345484848041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405119112","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.6826497,0.0020227735,0.3032928,0.00068267534,0.0013840359,0.00032819246,0.00007245526,0.000067951725,0.009499468],"genre_scores_gemma":[0.94430023,0.00019201226,0.054596905,0.00011271465,0.0003030822,0.0000049986843,0.0000029310302,0.00002112042,0.00046597476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987991,0.000057811692,0.0006185248,0.00009895721,0.00016169,0.0002639367],"domain_scores_gemma":[0.998683,0.0006105315,0.0003799814,0.00012732438,0.00013265978,0.00006654154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080593454,0.00013025843,0.0003797041,0.00015041145,0.00007301463,0.000015447913,0.00020888937,0.00014266744,0.00010433893],"category_scores_gemma":[0.00036555692,0.00009180656,0.00024154517,0.00013797656,0.000096235395,0.00040353008,0.000045811437,0.00030522488,0.000005997734],"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.00086637726,0.00020602546,0.0002036035,0.00087812473,0.00033934633,0.00027674556,0.0018550933,0.00020273676,0.009559567,0.95840704,0.0040699393,0.023135379],"study_design_scores_gemma":[0.00094855763,0.00095635676,0.00022204642,0.00027918155,0.00020938393,0.00069266465,0.000624759,0.0018724308,0.0023642888,0.9878512,0.003805909,0.00017319],"about_ca_topic_score_codex":0.0000012827949,"about_ca_topic_score_gemma":0.0000042087217,"teacher_disagreement_score":0.26165062,"about_ca_system_score_codex":0.000048161037,"about_ca_system_score_gemma":0.000120026285,"threshold_uncertainty_score":0.37437633},"labels":[],"label_agreement":null}]}