{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7946281,0.00059881044,0.1392761,0.00097092305,0.00007690832,0.00014206604,0.00029349423,0.00048104848,0.06353261],"genre_scores_gemma":[0.9634677,0.00014626399,0.027976885,0.00014529373,0.00006438473,0.000109923414,0.0003297701,0.0000415531,0.007718219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994641,0.0001469673,0.00003435952,0.00014035519,0.000098265955,0.00011592546],"domain_scores_gemma":[0.99954754,0.00014495749,0.0001066292,0.000046166773,0.00004197371,0.00011272271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006931307,0.00057834963,0.00043231095,0.00070308475,0.0009704118,0.0017944716,0.0006327616,0.00039039465,0.0033220553],"category_scores_gemma":[0.0007939806,0.00024038854,0.0006012084,0.00034739944,0.0030985181,0.0031810272,0.0022938803,0.0009317816,0.00035038582],"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.00014825344,0.00004763593,0.0008559162,0.0000685414,0.000011800787,0.00035235146,0.001566147,0.0009200425,0.010833486,0.9797863,0.00038905555,0.0050203647],"study_design_scores_gemma":[0.00015457961,0.00023670436,0.001419723,0.000047715217,0.000029416911,0.00059807586,0.0021344055,0.0073091155,0.0139561,0.95618534,0.017894719,0.000034039866],"about_ca_topic_score_codex":0.0007645794,"about_ca_topic_score_gemma":0.0009935962,"teacher_disagreement_score":0.0033220553,"about_ca_system_score_codex":0.0008502375,"about_ca_system_score_gemma":0.00035405473,"threshold_uncertainty_score":0.011113405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19758822,0.00089143723,0.4643742,0.008135553,0.0004538575,0.00023107945,0.0003748217,0.0008699935,0.32708094],"genre_scores_gemma":[0.9252226,0.00031349223,0.050108265,0.00096719724,0.00021502712,0.00007814527,0.0001514159,0.00007342721,0.022870317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982843,0.00048072755,0.00010960274,0.00046101565,0.00042427215,0.0002401357],"domain_scores_gemma":[0.99825376,0.0005744169,0.00023595367,0.00026883202,0.0005012418,0.00016572354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113546,0.00031054538,0.00038237884,0.0007631679,0.0022669672,0.0025101665,0.0011110853,0.0011617773,0.008041088],"category_scores_gemma":[0.0031037456,0.00026922696,0.0006888873,0.0006215003,0.0065211332,0.00537846,0.0025340058,0.0023601311,0.00077560975],"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.000007713695,0.0000037706575,0.00010997251,0.000012916134,0.0000014779067,0.000037169615,0.0003382443,0.00012158333,0.00047457454,0.9968779,0.00034138781,0.0016732696],"study_design_scores_gemma":[0.000024488469,0.00006060746,0.00031966332,0.000019636695,0.000010470746,0.00013518652,0.00041918512,0.004189561,0.0018624933,0.9624847,0.030453272,0.000020717553],"about_ca_topic_score_codex":0.00437861,"about_ca_topic_score_gemma":0.0034652196,"teacher_disagreement_score":0.008041088,"about_ca_system_score_codex":0.002084698,"about_ca_system_score_gemma":0.0019557674,"threshold_uncertainty_score":0.026900113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114949215,0.0048547625,0.5430581,0.041257568,0.0019003601,0.00018176959,0.00076535775,0.002551284,0.39393586],"genre_scores_gemma":[0.49212626,0.004887782,0.38598397,0.0068242415,0.0017121033,0.0004594495,0.0006226643,0.0008849232,0.106498726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969844,0.0012775742,0.0001522143,0.00065433007,0.00075278105,0.00017858492],"domain_scores_gemma":[0.99450433,0.0032994882,0.00013717327,0.0010005559,0.0008757139,0.00018270565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055862446,0.00041007026,0.00056286063,0.0018897796,0.0030562792,0.004486065,0.0015133057,0.0018652084,0.007784889],"category_scores_gemma":[0.01386833,0.00050030224,0.0009006016,0.0010552407,0.012666786,0.00737277,0.0033510684,0.0043924637,0.0034081745],"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.000009117955,0.0000032083003,0.000030516416,0.000013900025,0.0000020679072,0.00001560683,0.00013703966,0.0002427707,0.000053613985,0.9916652,0.0038291826,0.0039978107],"study_design_scores_gemma":[0.000016214906,0.000009171063,0.000036519323,0.000028988296,0.0000053557433,0.000039357175,0.00002863795,0.0017223705,0.00034209288,0.9253725,0.0723854,0.0000133759895],"about_ca_topic_score_codex":0.0038972283,"about_ca_topic_score_gemma":0.0027731776,"teacher_disagreement_score":0.007784889,"about_ca_system_score_codex":0.0037967924,"about_ca_system_score_gemma":0.003156229,"threshold_uncertainty_score":0.02954328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011544367,0.0011616467,0.9363325,0.0040239096,0.0002687614,0.00012385026,0.00047356507,0.0005070026,0.045564324],"genre_scores_gemma":[0.7074967,0.0024231712,0.25996926,0.002050131,0.0010115664,0.000827914,0.0013123979,0.00030812543,0.024600714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99450773,0.0021642048,0.00035633062,0.0007974508,0.0016515733,0.0005226574],"domain_scores_gemma":[0.99453545,0.0026974934,0.00039094538,0.00097137794,0.0010031833,0.00040144954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005390879,0.0011117619,0.0010060746,0.002582562,0.0023603365,0.007829623,0.0022522137,0.00210866,0.008325564],"category_scores_gemma":[0.012762972,0.0010853269,0.0025450494,0.0025926558,0.0070875306,0.013531157,0.004465384,0.004541677,0.0013899985],"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.0000019493984,0.000002522276,0.00002303032,0.0000071969403,0.0000025526042,0.00001055101,0.000042316242,0.0010139016,0.000015622722,0.9979685,0.00020219586,0.00070963247],"study_design_scores_gemma":[0.000003698049,0.0000020163895,0.000010666812,0.000007300348,0.0000030110666,0.000015552598,0.00002077943,0.007879025,0.000038258386,0.9898633,0.002152287,0.000004205247],"about_ca_topic_score_codex":0.004853367,"about_ca_topic_score_gemma":0.0057526273,"teacher_disagreement_score":0.008325564,"about_ca_system_score_codex":0.0038902487,"about_ca_system_score_gemma":0.0027288522,"threshold_uncertainty_score":0.028510034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7478407,0.0015930115,0.1101184,0.0020356611,0.00021591781,0.00014254375,0.00083448295,0.0006984718,0.13652079],"genre_scores_gemma":[0.966228,0.00043069347,0.015880099,0.00021124209,0.00013865648,0.00005177461,0.0006906333,0.00008345521,0.016285483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875474,0.00021350392,0.00009633329,0.00033002856,0.0003687005,0.00023669587],"domain_scores_gemma":[0.9979328,0.0009006881,0.0002041249,0.0005178445,0.0002747068,0.00016982302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008919235,0.00034449078,0.0005059024,0.0013967528,0.002030874,0.0025539426,0.0005324708,0.00047349173,0.0047636875],"category_scores_gemma":[0.0028164485,0.0003361638,0.0013803028,0.00072771223,0.004145462,0.0042471574,0.0021481344,0.0022546407,0.00058178685],"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.00005772872,0.00003277166,0.0014018518,0.00006640139,0.000020693797,0.00029324446,0.00084491225,0.0015710203,0.0011933201,0.9829208,0.0013922418,0.010204946],"study_design_scores_gemma":[0.000025638306,0.000041988453,0.0013535187,0.000033371114,0.00003418726,0.00040536493,0.0005269921,0.003710771,0.0037413607,0.9742279,0.015875418,0.000023438304],"about_ca_topic_score_codex":0.002270271,"about_ca_topic_score_gemma":0.0014535784,"teacher_disagreement_score":0.0047636875,"about_ca_system_score_codex":0.0015960223,"about_ca_system_score_gemma":0.0006393172,"threshold_uncertainty_score":0.015936136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92112267,0.0004128897,0.0612934,0.00035177098,0.000017961058,0.00003904156,0.0001944805,0.00013001596,0.016437754],"genre_scores_gemma":[0.9930282,0.00023751137,0.0045838896,0.00003000497,0.00003567255,0.000032250497,0.00012992512,0.000016298132,0.0019062675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984528,0.00023126815,0.0001096594,0.00041567514,0.00047363937,0.00031705562],"domain_scores_gemma":[0.9968867,0.0012779735,0.00051597704,0.00042121898,0.00037730075,0.0005208523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460622,0.0006099642,0.0011000816,0.0032524434,0.0021455083,0.0035215174,0.001330998,0.0008718004,0.0031817365],"category_scores_gemma":[0.0055436622,0.0005924344,0.0011019664,0.0018085946,0.0054666577,0.0065266937,0.004062215,0.0017981867,0.0002106624],"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.000112116075,0.000028860402,0.004072445,0.000056974204,0.00003287417,0.0001948725,0.0009716422,0.002574375,0.0044684294,0.98262906,0.00015235343,0.004705961],"study_design_scores_gemma":[0.00006475929,0.00013720451,0.0073660077,0.00004186321,0.00007768722,0.0006509654,0.0012773623,0.013563817,0.008167319,0.9644803,0.0040976196,0.000075073105],"about_ca_topic_score_codex":0.0018586869,"about_ca_topic_score_gemma":0.001211307,"teacher_disagreement_score":0.0035215174,"about_ca_system_score_codex":0.0023248342,"about_ca_system_score_gemma":0.0004971109,"threshold_uncertainty_score":0.016867936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36089233,0.0010300739,0.54194474,0.0020784226,0.00010266486,0.00011634773,0.00023698025,0.00040469665,0.09319378],"genre_scores_gemma":[0.9499409,0.00031943366,0.044933755,0.00010006074,0.00006181305,0.000113976144,0.00015610964,0.000043642984,0.0043303953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984535,0.0006108002,0.000093946044,0.00022976396,0.000434817,0.00017717622],"domain_scores_gemma":[0.9984817,0.0007421964,0.00021740666,0.000246903,0.00018226958,0.00012949832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016907696,0.0005000143,0.00054087775,0.0013606411,0.0014817338,0.0036196504,0.0010985396,0.0010221871,0.0037651563],"category_scores_gemma":[0.0030668497,0.0003183156,0.0014675565,0.0013039346,0.0065907175,0.008238085,0.0030094932,0.0018374686,0.0002675517],"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.0000027362978,0.0000037993286,0.000055819546,0.000005703359,0.0000024658511,0.000024672523,0.00011383365,0.0010461021,0.00013463735,0.9980584,0.000039424358,0.0005124554],"study_design_scores_gemma":[0.0000066864704,0.000011110059,0.00006316213,0.000008939383,0.0000067378455,0.00004101671,0.00019279636,0.010241752,0.00041792117,0.9869199,0.0020832694,0.0000067038695],"about_ca_topic_score_codex":0.0019500166,"about_ca_topic_score_gemma":0.001892332,"teacher_disagreement_score":0.0037651563,"about_ca_system_score_codex":0.0024063978,"about_ca_system_score_gemma":0.0013019788,"threshold_uncertainty_score":0.01745975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7417749,0.0006048427,0.22146018,0.0008190322,0.000093959956,0.000054795386,0.00025345566,0.00073832925,0.034200326],"genre_scores_gemma":[0.9734744,0.00011108331,0.024254013,0.00008048012,0.000022794542,0.00004156085,0.00009203318,0.00008591584,0.0018377948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.00035231738,0.00008113947,0.0003114832,0.0005051128,0.00040301422],"domain_scores_gemma":[0.99336773,0.0040606754,0.00044784148,0.001123728,0.00036594534,0.0006340517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016882594,0.00061825657,0.00062273035,0.0012479989,0.0011226481,0.0030751303,0.0013917178,0.0007502922,0.0054774587],"category_scores_gemma":[0.012237482,0.00057843345,0.0006269478,0.00084388256,0.004216441,0.005477609,0.0046560713,0.0020154293,0.0004288811],"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.00032102954,0.000045801753,0.001868087,0.00010986683,0.000019048017,0.00008985466,0.00047882693,0.029954296,0.006456364,0.9488292,0.0009354528,0.010892227],"study_design_scores_gemma":[0.000046487785,0.00009241938,0.0008013902,0.000046567387,0.000018952116,0.00013743027,0.00022444455,0.1280915,0.010394301,0.8542915,0.0058064945,0.000048480226],"about_ca_topic_score_codex":0.0008057926,"about_ca_topic_score_gemma":0.00095105247,"teacher_disagreement_score":0.0054774587,"about_ca_system_score_codex":0.0018433093,"about_ca_system_score_gemma":0.0006065288,"threshold_uncertainty_score":0.018323898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72506917,0.00061261485,0.16508521,0.00059161166,0.00019279143,0.000093578805,0.0001748971,0.0002900301,0.10789022],"genre_scores_gemma":[0.96782136,0.0001850244,0.023688756,0.000097736636,0.00007895368,0.000057622066,0.00011263856,0.000038130853,0.007919753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.00017067057,0.000050438575,0.0001542845,0.00025234447,0.00021376039],"domain_scores_gemma":[0.99898523,0.00026124093,0.00011793022,0.00014087935,0.00017118131,0.00032361742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009568161,0.00025230096,0.0005325112,0.0022172343,0.0025207,0.0020885435,0.00046246164,0.0005086794,0.004024423],"category_scores_gemma":[0.0015635429,0.0003470474,0.00091393554,0.0009598717,0.002485099,0.0035708942,0.003531351,0.001195933,0.00035785913],"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.000022524498,0.000019797093,0.0006411363,0.000015268884,0.000004090769,0.00023001427,0.0006428846,0.000316086,0.0011644501,0.99432254,0.00018838716,0.002432798],"study_design_scores_gemma":[0.000033837958,0.000060678212,0.0020627002,0.000028567747,0.000027812639,0.00059650926,0.00071863737,0.010038658,0.0018246771,0.97019774,0.014390579,0.00001950047],"about_ca_topic_score_codex":0.0012508377,"about_ca_topic_score_gemma":0.0016354596,"teacher_disagreement_score":0.004024423,"about_ca_system_score_codex":0.0008999681,"about_ca_system_score_gemma":0.0004767383,"threshold_uncertainty_score":0.01346302},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027894584,0.014118331,0.333205,0.066383906,0.0021654563,0.00012289704,0.00055631815,0.0005204605,0.55503297],"genre_scores_gemma":[0.86620814,0.0045684776,0.067065686,0.011223534,0.0017429473,0.000291804,0.0002844046,0.0002088285,0.04840617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966066,0.0017244803,0.00017361855,0.00047905723,0.00072556606,0.00029082515],"domain_scores_gemma":[0.9965886,0.0019247906,0.00020090939,0.00044616734,0.0005739128,0.00026565403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005615021,0.00053410075,0.0006965489,0.0013464489,0.003209992,0.00709707,0.0014297154,0.002518944,0.004943159],"category_scores_gemma":[0.007986914,0.0003849631,0.0009924108,0.0012789097,0.0136430655,0.0107240835,0.004009389,0.0053300536,0.0007874431],"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.0000023974628,0.0000015945343,0.000011996657,0.0000059797003,0.0000016264798,0.000020496273,0.00009479694,0.00013057634,0.00002193293,0.99838924,0.0008378476,0.0004816142],"study_design_scores_gemma":[0.0000040386562,0.0000015579216,0.000010474489,0.0000065892455,0.000001527557,0.000026041791,0.000032469612,0.00057863974,0.000035697605,0.9933031,0.0059966166,0.0000031613283],"about_ca_topic_score_codex":0.0028773795,"about_ca_topic_score_gemma":0.0017990798,"teacher_disagreement_score":0.00709707,"about_ca_system_score_codex":0.00480358,"about_ca_system_score_gemma":0.0028045068,"threshold_uncertainty_score":0.034852624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84057355,0.00024482538,0.13399169,0.00061956863,0.00003152974,0.000057331526,0.00034434313,0.00023765658,0.023899464],"genre_scores_gemma":[0.9834172,0.000103412705,0.012701683,0.00007364294,0.000026929107,0.000050672585,0.00044834916,0.000024710242,0.003153371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982835,0.00021158684,0.00014530755,0.0004135574,0.00042191183,0.0005241606],"domain_scores_gemma":[0.9964457,0.0012623207,0.0006440949,0.00069531903,0.0003711432,0.0005815126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119372,0.0004913833,0.00059919734,0.0025099218,0.0021030398,0.0048417733,0.0009658258,0.0011609796,0.0040527517],"category_scores_gemma":[0.004668762,0.0003546642,0.0011911388,0.0014627784,0.005367452,0.010857689,0.002935489,0.0021574856,0.00040296628],"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.00006485617,0.000029300316,0.004228706,0.000021789767,0.000007862974,0.00010246975,0.00042729868,0.0015341731,0.0012000813,0.98836833,0.00026156736,0.003753498],"study_design_scores_gemma":[0.000022771366,0.00007304761,0.0031205495,0.000031182764,0.000027029679,0.00026900115,0.0010549059,0.017511617,0.0031426752,0.9695658,0.005142172,0.00003927327],"about_ca_topic_score_codex":0.0014829378,"about_ca_topic_score_gemma":0.001131315,"teacher_disagreement_score":0.0048417733,"about_ca_system_score_codex":0.0019523398,"about_ca_system_score_gemma":0.000805035,"threshold_uncertainty_score":0.014165223},"labels":[],"label_agreement":null}]}