{"meta":{"query_hash":"62857203da34","filters":{"venue":"Journal of Symbolic Logic"},"cohort_total":102,"direct_labels_cover":0,"predictions_cover":102,"exported":102,"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/62857203da34","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Symbolic+Logic"},"results":[{"id":"W1504640313","doi":"10.2178/jsl/1174668397","title":"Bounding homogenous models","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"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":"Degree (music); Decidability; Bounding overwatch; Homogeneous; Mathematics; Peano axioms; Extension (predicate logic); Discrete mathematics; Combinatorics; Computer science; Physics; Artificial intelligence","score_opus":0.031414162483599004,"score_gpt":0.2687297140358942,"score_spread":0.23731555155229517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504640313","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.3918703,0.0006543382,0.5437192,0.0010380138,0.000083066014,0.00020592335,0.0006806332,0.0017233696,0.060025267],"genre_scores_gemma":[0.96324944,0.00021843654,0.02845101,0.00014136476,0.00006954758,0.000071857285,0.0003466507,0.00012993744,0.0073216674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745053,0.00045737013,0.00016602413,0.0007022064,0.0006470706,0.0005767899],"domain_scores_gemma":[0.9937402,0.0028889205,0.00044867152,0.001634989,0.0006710807,0.0006162195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656235,0.0005880749,0.00076913537,0.0012476447,0.001260059,0.0025474837,0.0013222231,0.00058512157,0.0063552335],"category_scores_gemma":[0.005780282,0.0007696966,0.0013328984,0.00084493984,0.003750158,0.007364257,0.00695501,0.002201932,0.00072008726],"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.00014209573,0.00006013196,0.0026047097,0.00013534517,0.0000419545,0.00026624842,0.0009980807,0.01319831,0.008859703,0.9590696,0.0011642758,0.0134594375],"study_design_scores_gemma":[0.000052201238,0.0000855402,0.0015129329,0.000062782514,0.00010937598,0.00031124995,0.00046531178,0.04501451,0.020926446,0.9089303,0.022481687,0.000047600348],"about_ca_topic_score_codex":0.0031001447,"about_ca_topic_score_gemma":0.0024878925,"teacher_disagreement_score":0.0063552335,"about_ca_system_score_codex":0.0018412197,"about_ca_system_score_gemma":0.0010258006,"threshold_uncertainty_score":0.021260321},"labels":[],"label_agreement":null},{"id":"W1563463685","doi":"10.1017/jsl.2014.86","title":"AN ALGEBRA WHOSE SUBALGEBRAS ARE CHARACTERIZED BY DENSITY","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Separable space; Bounded function; Algebra over a field; Operator (biology); Operator algebra; Group (periodic table)","score_opus":0.08715145666248021,"score_gpt":0.3704591595032994,"score_spread":0.2833077028408192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563463685","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.79774314,0.00032470125,0.16645904,0.0006594939,0.00007256228,0.000060751743,0.0001154866,0.0003411989,0.03422366],"genre_scores_gemma":[0.98317105,0.00007533504,0.012981718,0.00011684644,0.000038441496,0.00003168913,0.000064704975,0.000024287216,0.0034959535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992343,0.00018993967,0.000040194605,0.000116992436,0.00028968777,0.0001289252],"domain_scores_gemma":[0.99929917,0.00014702183,0.00007610085,0.000113164584,0.00018267958,0.00018179133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067929464,0.00026869206,0.0005639263,0.000880545,0.0012823329,0.0012443471,0.0006729006,0.0004565293,0.002548875],"category_scores_gemma":[0.0013909572,0.00029862364,0.00054960675,0.0004993351,0.0026032089,0.0027980278,0.0018071781,0.0011463144,0.0003646205],"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.00003175603,0.000020117079,0.00023368455,0.00001904285,0.0000073420374,0.00008218291,0.0003175023,0.0007160499,0.0039347685,0.99280727,0.0002559217,0.0015744762],"study_design_scores_gemma":[0.00002414267,0.000048598493,0.00046329972,0.00000797466,0.000016373837,0.00020683189,0.00028668944,0.018615015,0.005754249,0.97192234,0.0026269904,0.000027578213],"about_ca_topic_score_codex":0.0014575425,"about_ca_topic_score_gemma":0.0012269241,"teacher_disagreement_score":0.002548875,"about_ca_system_score_codex":0.0007427877,"about_ca_system_score_gemma":0.00078460947,"threshold_uncertainty_score":0.008526802},"labels":[],"label_agreement":null},{"id":"W1625990916","doi":"10.2178/jsl.7803120","title":"Failure of Interpolation in Constant Domain Intuitionistic Logic","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interpolation (computer graphics); Constant (computer programming); Intuitionistic logic; Domain (mathematical analysis); Property (philosophy); Algebra over a field","score_opus":0.012990061448293426,"score_gpt":0.23976073363406117,"score_spread":0.22677067218576774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625990916","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.37801534,0.0016986224,0.50482255,0.010244429,0.0005858777,0.00010794593,0.0007226556,0.0025715786,0.101230934],"genre_scores_gemma":[0.981639,0.0002950155,0.015373753,0.00044216993,0.00012009685,0.000027900898,0.00014695669,0.00008513154,0.0018700088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918441,0.0020242792,0.00066109083,0.0012144257,0.0029198367,0.0013362173],"domain_scores_gemma":[0.9720643,0.018569384,0.0012629913,0.004553371,0.0026277187,0.0009222212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009303541,0.00067880476,0.0016368383,0.002129745,0.0028876693,0.004604071,0.004080554,0.003000823,0.0050550844],"category_scores_gemma":[0.025001414,0.0009928845,0.002116229,0.002015483,0.012615852,0.015662672,0.0068029165,0.007232689,0.0007042432],"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.00025458937,0.000043826647,0.001219044,0.00020376456,0.000047220583,0.0004296624,0.0005399236,0.0055450364,0.0014649259,0.982633,0.0014628819,0.0061561326],"study_design_scores_gemma":[0.000045272205,0.000044933815,0.00027346177,0.000046924186,0.00003406269,0.00023908033,0.00017288631,0.016682643,0.0032382244,0.9759913,0.0031867558,0.00004440367],"about_ca_topic_score_codex":0.0028365918,"about_ca_topic_score_gemma":0.0013767823,"teacher_disagreement_score":0.009303541,"about_ca_system_score_codex":0.0029801994,"about_ca_system_score_gemma":0.002052698,"threshold_uncertainty_score":0.049202383},"labels":[],"label_agreement":null},{"id":"W1731243857","doi":"10.1017/jsl.2015.76","title":"THE MODEL COMPANION OF DIFFERENTIAL FIELDS WITH FREE OPERATORS","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Lemma (botany); Mathematics; Differential algebra; Differential (mechanical device); Zero (linguistics); Algebra over a field; Model theory; Operator theory; Pure mathematics; Differential operator; Discrete mathematics; Physics","score_opus":0.02916451065974832,"score_gpt":0.2676404700721348,"score_spread":0.2384759594123865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1731243857","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.6644799,0.00094534847,0.23775737,0.002562741,0.00055135216,0.00010567381,0.00042096424,0.0005205129,0.09265615],"genre_scores_gemma":[0.9830335,0.00018818458,0.008061707,0.0002668451,0.00022413232,0.000031152176,0.00016356794,0.000049226885,0.0079817595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989195,0.00019931675,0.00005114681,0.00026076077,0.00040228126,0.00016701745],"domain_scores_gemma":[0.99840975,0.0004942045,0.00017228347,0.00028714692,0.00032879578,0.00030773744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377383,0.00041086323,0.0009236271,0.0016757646,0.0016639647,0.0029967271,0.00057911006,0.0012701729,0.005691493],"category_scores_gemma":[0.0027259067,0.00035418454,0.0010854836,0.00079843734,0.00334979,0.0073032444,0.0034065407,0.0022024517,0.00060663285],"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.000017828967,0.00001719432,0.00025303304,0.000014664364,0.000004151034,0.00009845588,0.0002664342,0.00029280887,0.0006231009,0.99663794,0.00041250078,0.0013617785],"study_design_scores_gemma":[0.000016314567,0.000047210553,0.00029396018,0.000013322432,0.000008059698,0.00023807187,0.00012339279,0.0054041985,0.00079955335,0.9889904,0.004054096,0.0000115037055],"about_ca_topic_score_codex":0.00069346797,"about_ca_topic_score_gemma":0.00035239357,"teacher_disagreement_score":0.005691493,"about_ca_system_score_codex":0.001650296,"about_ca_system_score_gemma":0.0008686069,"threshold_uncertainty_score":0.019039989},"labels":[],"label_agreement":null},{"id":"W1847150082","doi":"10.1017/jsl.2016.14","title":"FRAÏSSÉ LIMITS OF C*-ALGEBRAS","year":2016,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; York University; University of Toronto","funders":"","keywords":"Homogeneity (statistics); Class (philosophy); Mathematics; Pure mathematics; Ultra high frequency; Algebra over a field; Matrix (chemical analysis); Computer science; Chemistry; Statistics; Telecommunications; Artificial intelligence","score_opus":0.09231600380510294,"score_gpt":0.3797142543628975,"score_spread":0.28739825055779455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847150082","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.86269224,0.000816207,0.06488206,0.00039588803,0.000052364405,0.000037118007,0.00016025752,0.000248377,0.070715524],"genre_scores_gemma":[0.9886863,0.00016048404,0.005650372,0.000044734108,0.00005001633,0.000021646963,0.000056069184,0.000017394754,0.005313011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993625,0.00011609135,0.000031001342,0.00012014739,0.00023414716,0.00013614443],"domain_scores_gemma":[0.99879575,0.00036779308,0.00015731671,0.00014814861,0.00031806622,0.0002129876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013264776,0.0004059728,0.0004569675,0.0022863932,0.0016119934,0.0017896028,0.0004904131,0.0005945001,0.0041680806],"category_scores_gemma":[0.0028282313,0.00022904808,0.0004436266,0.0006794941,0.002283798,0.003910445,0.0010397126,0.0010691773,0.00035225335],"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.00003080012,0.000013836848,0.0003652768,0.000019964911,0.000010006756,0.000107717875,0.00032465783,0.00083532115,0.0024202939,0.9922283,0.0002386225,0.0034051081],"study_design_scores_gemma":[0.000012127054,0.000041584804,0.0010359058,0.00002061147,0.0000115543135,0.00036852376,0.00027540678,0.00879156,0.004398875,0.98125,0.003769807,0.000024045115],"about_ca_topic_score_codex":0.0011848543,"about_ca_topic_score_gemma":0.0008695435,"teacher_disagreement_score":0.0041680806,"about_ca_system_score_codex":0.0010858492,"about_ca_system_score_gemma":0.00033902697,"threshold_uncertainty_score":0.013943672},"labels":[],"label_agreement":null},{"id":"W1953187029","doi":"10.1017/jsl.2015.35","title":"DIFFERENTIAL-ALGEBRAIC JET SPACES PRESERVE INTERNALITY TO THE CONSTANTS","year":2015,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Polynomial and algebraic computation","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":"Agence Nationale de la Recherche","keywords":"Jet (fluid); Differential (mechanical device); Mathematics; Variety (cybernetics); Counterexample; Algebraic number; Pure mathematics; Tangent; Space (punctuation); Differential algebraic geometry; Tangent space; Abstraction; Algebra over a field; Field (mathematics); Differential geometry; Constant (computer programming); Algebraic variety; Real algebraic geometry; Mathematical analysis; Geometry; Discrete mathematics; Differential equation; Computer science; Physics; Differential algebraic equation; Ordinary differential equation","score_opus":0.04827301547641893,"score_gpt":0.2961488694067869,"score_spread":0.24787585393036798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953187029","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.7660704,0.0002775903,0.18087564,0.00067455636,0.00021770097,0.000076829594,0.00024920056,0.0004142828,0.05114386],"genre_scores_gemma":[0.98899055,0.00012184016,0.0072940406,0.00011039331,0.000086419204,0.000021868875,0.0001567562,0.0000630027,0.003155091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982399,0.0002113352,0.00013787799,0.000417583,0.00063913723,0.00035413526],"domain_scores_gemma":[0.99679923,0.00039343827,0.0006022243,0.0009006639,0.00073064625,0.00057371287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019747259,0.00060151133,0.0011574968,0.0019360533,0.0020438023,0.004122163,0.0014912346,0.000948788,0.0038728332],"category_scores_gemma":[0.0042685647,0.0004807651,0.0014657052,0.0016291048,0.005923082,0.007897206,0.0063911327,0.0039615436,0.00037181002],"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.000041782278,0.000022535056,0.0010544697,0.00003952152,0.000022857863,0.000389108,0.0005604098,0.0011873306,0.0036133626,0.98995435,0.00017030163,0.0029439474],"study_design_scores_gemma":[0.00004688138,0.00015112352,0.0033266142,0.000058067,0.000047659407,0.0014109628,0.0008958034,0.008765343,0.007590653,0.9688034,0.008848922,0.00005457751],"about_ca_topic_score_codex":0.0006970197,"about_ca_topic_score_gemma":0.00040175725,"teacher_disagreement_score":0.004122163,"about_ca_system_score_codex":0.0019006305,"about_ca_system_score_gemma":0.0005768479,"threshold_uncertainty_score":0.013790071},"labels":[],"label_agreement":null},{"id":"W195377547","doi":"10.1017/jsl.2015.42","title":"SEPARABLY CLOSED FIELDS AND CONTRACTIVE ORE MODULES","year":2015,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Quantifier elimination; Valuation (finance); Mathematics; Pure mathematics; Group (periodic table); Field (mathematics); Algebra over a field; Discrete mathematics; Chemistry; Business; Accounting","score_opus":0.06938221709197587,"score_gpt":0.3261828666549754,"score_spread":0.25680064956299953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195377547","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.79454374,0.00060699775,0.17553216,0.00085006293,0.00009096656,0.000041581647,0.000103556486,0.00012987333,0.02810112],"genre_scores_gemma":[0.98151773,0.00018282645,0.010710829,0.00008510292,0.00006651415,0.000017951808,0.00006387721,0.000025339272,0.0073298374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999143,0.00015028103,0.000046035995,0.00016275357,0.00035270388,0.00014513226],"domain_scores_gemma":[0.9990594,0.0003397261,0.00017718131,0.00009209788,0.00016432632,0.0001672567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016533746,0.00046538538,0.0004873103,0.00095413055,0.0010598,0.0019803462,0.0006904395,0.00062366825,0.0036099795],"category_scores_gemma":[0.0015766437,0.00032585868,0.00069087883,0.0005151564,0.0034470146,0.006624901,0.0024355575,0.0017897919,0.00035955783],"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.00008804531,0.000039121245,0.0005827056,0.00005100947,0.000020263538,0.0003440968,0.0004250862,0.0010633507,0.0048069595,0.9892747,0.00016768243,0.0031368893],"study_design_scores_gemma":[0.000058076428,0.00007791781,0.0006086384,0.000027606236,0.000027941722,0.00042797785,0.0002782396,0.008015158,0.008787575,0.9773906,0.004278899,0.00002144725],"about_ca_topic_score_codex":0.00036316,"about_ca_topic_score_gemma":0.00032112747,"teacher_disagreement_score":0.0036099795,"about_ca_system_score_codex":0.00089007325,"about_ca_system_score_gemma":0.0005686244,"threshold_uncertainty_score":0.012076616},"labels":[],"label_agreement":null},{"id":"W1966379018","doi":"10.2178/jsl/1190150288","title":"A uniqueness theorem for iterations","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Uniqueness; Countable set; Transitive relation; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.14418527123896488,"score_gpt":0.3401671201379032,"score_spread":0.1959818488989383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966379018","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.15793411,0.0013452517,0.7460555,0.0021998133,0.00047354982,0.00013685111,0.00038887936,0.0008813391,0.0905847],"genre_scores_gemma":[0.90023476,0.0004312834,0.07722407,0.00054655544,0.00037887847,0.00029885187,0.0002931017,0.0004210857,0.020171463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775535,0.00054282456,0.00017027021,0.000768068,0.00043573964,0.0003278181],"domain_scores_gemma":[0.99463093,0.002575941,0.0003492498,0.00067448476,0.0013096012,0.00045975338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026152383,0.00072624144,0.0011252874,0.0020073985,0.0031001137,0.0034604708,0.0012164529,0.0016206931,0.006045897],"category_scores_gemma":[0.008451602,0.0007191827,0.0023082823,0.0008189057,0.00601036,0.0069142915,0.0052726865,0.003430367,0.0011755623],"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.0000310865,0.0000091683005,0.00042971844,0.000039602168,0.000020223606,0.00008227481,0.00029077326,0.0009258565,0.00078060053,0.9923652,0.0006677413,0.004357718],"study_design_scores_gemma":[0.000015974743,0.00002897893,0.00017754709,0.000033495435,0.000017879504,0.00028113244,0.00016421346,0.009467508,0.0022969048,0.98189235,0.005604797,0.00001903325],"about_ca_topic_score_codex":0.00067779276,"about_ca_topic_score_gemma":0.0005452727,"teacher_disagreement_score":0.006045897,"about_ca_system_score_codex":0.0012451978,"about_ca_system_score_gemma":0.0011855203,"threshold_uncertainty_score":0.020225585},"labels":[],"label_agreement":null},{"id":"W1974655024","doi":"10.2178/jsl/1203350778","title":"Stable definability and generic relations","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"University of Waterloo","funders":"","keywords":"Base (topology); Mathematics; Simple (philosophy); Set (abstract data type); Canonical form; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.0500061341841212,"score_gpt":0.3326570201686403,"score_spread":0.2826508859845191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974655024","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.6878577,0.001474752,0.20404154,0.0018069799,0.000174037,0.00010713717,0.00045967748,0.0010712435,0.10300698],"genre_scores_gemma":[0.9869179,0.000115924806,0.010485562,0.0000805886,0.000054420918,0.000026793083,0.00018005368,0.000031882573,0.0021067671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997851,0.0003187281,0.00020225249,0.0005487125,0.00073412224,0.00034517725],"domain_scores_gemma":[0.9977362,0.0007013559,0.00030002714,0.00057085475,0.00045747758,0.00023404586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021716137,0.0004161256,0.0006646718,0.0015972749,0.0018076693,0.0030184602,0.0011075283,0.0010856625,0.003928428],"category_scores_gemma":[0.0031216387,0.0004762062,0.000913106,0.0010841752,0.0061624935,0.005880762,0.0037223434,0.0020155197,0.00038902528],"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.000037669313,0.000017652525,0.0010919506,0.000043326196,0.000012599531,0.00017269484,0.0005935307,0.00048220053,0.003812144,0.9876297,0.00025860412,0.005847799],"study_design_scores_gemma":[0.000023626038,0.00006463458,0.0011927655,0.000035613575,0.00003202547,0.00032706468,0.0004131385,0.004129707,0.006039404,0.980373,0.0073485277,0.000020361556],"about_ca_topic_score_codex":0.0010480977,"about_ca_topic_score_gemma":0.0011556229,"teacher_disagreement_score":0.003928428,"about_ca_system_score_codex":0.0019873676,"about_ca_system_score_gemma":0.0006426377,"threshold_uncertainty_score":0.014419436},"labels":[],"label_agreement":null},{"id":"W1975072530","doi":"10.1017/jsl.2013.6","title":"THE NON-AXIOMATIZABILITY OF O-MINIMALITY","year":2014,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ultraproduct; Predicate (mathematical logic); Mathematics; Discrete mathematics; Field (mathematics); Lambda; Function (biology); Pure mathematics; Computer science; Programming language; Physics","score_opus":0.04777648843684087,"score_gpt":0.36554435307776717,"score_spread":0.3177678646409263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975072530","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7673703,0.00064985175,0.20035368,0.0018876224,0.000092436356,0.00006817396,0.00028462522,0.00052973744,0.028763583],"genre_scores_gemma":[0.97702175,0.00009927841,0.020250162,0.00024813676,0.000049266604,0.00004118943,0.00014476587,0.000047722515,0.00209769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978968,0.0005984651,0.00020091813,0.00053601846,0.00049927866,0.00026855114],"domain_scores_gemma":[0.99264926,0.004287109,0.00064046035,0.0010334371,0.0009016335,0.0004881458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023558033,0.00028663946,0.0005460539,0.0008725205,0.0014937011,0.0021941722,0.0009111666,0.0007409383,0.0020366604],"category_scores_gemma":[0.0061522042,0.00053843524,0.00081394735,0.00042226425,0.0051292717,0.0057430677,0.0028379613,0.0021229207,0.00028382355],"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.00014296346,0.000053255306,0.003031891,0.00012742114,0.000035157234,0.00036681385,0.0010485672,0.0013618564,0.009200074,0.97691613,0.00056326436,0.0071525816],"study_design_scores_gemma":[0.000047990008,0.00013067051,0.0018523338,0.0000652305,0.000053218577,0.00059178774,0.0006477768,0.007675499,0.011749019,0.96986526,0.007281835,0.000039363404],"about_ca_topic_score_codex":0.00057724025,"about_ca_topic_score_gemma":0.000835739,"teacher_disagreement_score":0.0023558033,"about_ca_system_score_codex":0.0011367698,"about_ca_system_score_gemma":0.00082967465,"threshold_uncertainty_score":0.012458801},"labels":[],"label_agreement":null},{"id":"W1984336238","doi":"10.2178/jsl/1264433915","title":"Schnorr triviality and genericity","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"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":"Triviality; Corollary; Turing; Connection (principal bundle); Computer science; Mathematics; Pure mathematics; Programming language","score_opus":0.010843327650220754,"score_gpt":0.24386712989320267,"score_spread":0.23302380224298191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984336238","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.8452503,0.00038920811,0.112596676,0.0013683465,0.0000634368,0.000084905696,0.00023828658,0.00045672336,0.039552078],"genre_scores_gemma":[0.9960743,0.00005162028,0.0027512575,0.000085910775,0.00002923689,0.00001136475,0.00006433101,0.000016545646,0.00091546966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976935,0.0004240142,0.00013773853,0.00050183275,0.0004955164,0.00074746116],"domain_scores_gemma":[0.99083626,0.004023425,0.0011733223,0.0014195663,0.0015344694,0.0010128773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017153699,0.00036527627,0.0007680678,0.001514912,0.0021998775,0.0023276706,0.0010052272,0.00081833935,0.0072506787],"category_scores_gemma":[0.0075460663,0.0004049165,0.0009983925,0.0010153654,0.008676457,0.0057803644,0.004409048,0.002357614,0.00035474618],"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.00019896416,0.000054989938,0.003556775,0.000102938524,0.000034043038,0.00028428473,0.0006123526,0.005055358,0.0048547266,0.9783685,0.00054718985,0.006329895],"study_design_scores_gemma":[0.000030389103,0.00010816555,0.0021820057,0.000029274315,0.000031551153,0.00025156993,0.00040371536,0.01107348,0.0056463517,0.97833496,0.0018568346,0.000051820803],"about_ca_topic_score_codex":0.0013058343,"about_ca_topic_score_gemma":0.0010693601,"teacher_disagreement_score":0.0072506787,"about_ca_system_score_codex":0.0016770327,"about_ca_system_score_gemma":0.0006863683,"threshold_uncertainty_score":0.024255872},"labels":[],"label_agreement":null},{"id":"W1984508128","doi":"10.2178/jsl/1146620159","title":"Morley degree in unidimensional compact complex spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"McMaster University","funders":"","keywords":"Mathematics; Morphism; Degree (music); Dimension (graph theory); Rank (graph theory); Noetherian; Extension (predicate logic); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Computer science","score_opus":0.11296977983110237,"score_gpt":0.35134482038173503,"score_spread":0.23837504055063266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984508128","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.92772007,0.0011585075,0.040812302,0.0007347969,0.0000932348,0.000025820807,0.00021066162,0.00011420163,0.029130405],"genre_scores_gemma":[0.99478734,0.00018188098,0.0028841356,0.000049476104,0.00005380967,0.000011380859,0.000055972094,0.000009375828,0.0019665132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987979,0.00020526272,0.00010009107,0.00023592856,0.0004164651,0.0002442509],"domain_scores_gemma":[0.9977458,0.00066092715,0.00040869546,0.0003291796,0.0003875367,0.0004678483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010938576,0.00030018162,0.000583336,0.0020632432,0.001244087,0.003237797,0.00045698063,0.00039237583,0.0021009073],"category_scores_gemma":[0.0023987736,0.00022755221,0.0005158554,0.001113853,0.0032612588,0.0053572506,0.0026516304,0.0011144307,0.00022148078],"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.000037029327,0.000018548499,0.0012405631,0.00003612404,0.000010550007,0.00009855079,0.00073355593,0.00060701574,0.0017434269,0.99200785,0.00019293521,0.0032738517],"study_design_scores_gemma":[0.000016897222,0.000059588252,0.0034674124,0.000029785959,0.000022669601,0.0002603932,0.0005598041,0.004246098,0.0027584434,0.98102784,0.007510439,0.000040516123],"about_ca_topic_score_codex":0.0009069467,"about_ca_topic_score_gemma":0.0010719943,"teacher_disagreement_score":0.003237797,"about_ca_system_score_codex":0.0012635828,"about_ca_system_score_gemma":0.00043109056,"threshold_uncertainty_score":0.009168029},"labels":[],"label_agreement":null},{"id":"W1987301999","doi":"10.2307/2586526","title":"Pure-projective modules and positive constructibility","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Countable set; Mathematics; Converse; Projective cover; Model theory; Pure mathematics; Algebraic number; Discrete mathematics; Quantifier elimination; Projective test; Algebra over a field; Projective space; Collineation; Mathematical analysis","score_opus":0.02901196460314802,"score_gpt":0.284749259398748,"score_spread":0.2557372947956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987301999","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.5043499,0.0031899228,0.31800908,0.004563211,0.00021302963,0.00006447054,0.00037222359,0.0008975655,0.16834062],"genre_scores_gemma":[0.9849975,0.00042986945,0.0075523704,0.00020504062,0.00014156068,0.000034671823,0.00008029,0.000028084898,0.0065305177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987369,0.0004938533,0.000047965998,0.00019335111,0.0003648259,0.00016305553],"domain_scores_gemma":[0.9983779,0.00069419056,0.00022196118,0.00023511569,0.00028166914,0.00018908552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011995839,0.00048909313,0.00032381198,0.0011766169,0.00085688924,0.0024450074,0.00066621957,0.00057169725,0.0040784962],"category_scores_gemma":[0.0021739544,0.0003292164,0.00047135472,0.0006644071,0.0059604044,0.005370736,0.0025503994,0.0013849627,0.0003891217],"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.000005688726,0.0000057301404,0.00018248467,0.000016377713,0.000004203883,0.000044765016,0.00020955315,0.00025513186,0.00033720714,0.9971187,0.00020384871,0.0016163568],"study_design_scores_gemma":[0.000010514843,0.000020510162,0.00057115784,0.000012728881,0.000010990011,0.00019282047,0.00013228403,0.0021293787,0.0010664057,0.9889286,0.006914712,0.000009856268],"about_ca_topic_score_codex":0.00052820594,"about_ca_topic_score_gemma":0.00039299426,"teacher_disagreement_score":0.0040784962,"about_ca_system_score_codex":0.0008059492,"about_ca_system_score_gemma":0.00044355617,"threshold_uncertainty_score":0.01364398},"labels":[],"label_agreement":null},{"id":"W1991083015","doi":"10.2307/2586561","title":"The real line in elementary submodels of set theory","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cardinality (data modeling); Mathematics; Topological space; Transitive closure; Transitive relation; Simple (philosophy); Closure (psychology); Axiom; Reachability; Real line; Discrete mathematics; Elementary theory; Set (abstract data type); Cardinal number (linguistics); Space (punctuation); Combinatorics; Computer science","score_opus":0.021729688863343078,"score_gpt":0.27613476911184864,"score_spread":0.25440508024850556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991083015","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.10537021,0.012502858,0.56418794,0.0128236655,0.0009016397,0.0001054997,0.0006749943,0.0010057064,0.3024276],"genre_scores_gemma":[0.8852352,0.002565418,0.088212326,0.001108879,0.00093214016,0.00023955018,0.00039757258,0.00024857023,0.021060368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970817,0.0014195442,0.00014544201,0.0005566713,0.00055987743,0.00023674846],"domain_scores_gemma":[0.9973551,0.0012951249,0.00022117326,0.00066503417,0.00027399012,0.00018965552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038821024,0.00056627253,0.0007247733,0.0018012963,0.0022714604,0.0061524375,0.00096213643,0.001136779,0.004084724],"category_scores_gemma":[0.0039636213,0.00047794587,0.0013430939,0.0018436664,0.008816011,0.013029654,0.00266403,0.004226993,0.0008988185],"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.000003979185,0.0000033704623,0.000040494622,0.000009325983,0.0000015684737,0.000011940236,0.00020543832,0.0001749904,0.000104118226,0.9980825,0.00026146154,0.0011009013],"study_design_scores_gemma":[0.0000043147556,0.000010290217,0.00005000373,0.000010623842,0.0000024113406,0.000019480993,0.0000576674,0.0010068341,0.000118302014,0.9905048,0.008211466,0.00000376974],"about_ca_topic_score_codex":0.001609791,"about_ca_topic_score_gemma":0.0013529666,"teacher_disagreement_score":0.0061524375,"about_ca_system_score_codex":0.0034033484,"about_ca_system_score_gemma":0.0010274114,"threshold_uncertainty_score":0.024693131},"labels":[],"label_agreement":null},{"id":"W1993915007","doi":"10.2178/jsl/1191333856","title":"The settling-time reducibility ordering","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","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":"University of Waterloo","funders":"","keywords":"Countable set; Mathematics; Combinatorics; Settling; Enumeration; Sequence (biology); Invariant (physics); Isomorphism (crystallography); Function (biology); Discrete mathematics; Physics; Crystallography; Chemistry; Mathematical physics","score_opus":0.014190568153691853,"score_gpt":0.26542623838567236,"score_spread":0.2512356702319805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993915007","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.5819306,0.000678116,0.320837,0.0011222648,0.00010172322,0.00009671127,0.0006632106,0.00083637587,0.093734115],"genre_scores_gemma":[0.9592978,0.0001448036,0.027133565,0.00011439123,0.00007127963,0.000050710387,0.0004511893,0.0000677305,0.012668588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821246,0.00026508514,0.00016614443,0.00040104688,0.0006877386,0.00026750154],"domain_scores_gemma":[0.9961385,0.0014188188,0.0003412587,0.00072474784,0.0009144057,0.00046224336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077810494,0.00034774904,0.00041174388,0.0011152884,0.0011981912,0.0021061422,0.00054392853,0.00047613584,0.00329177],"category_scores_gemma":[0.0034236622,0.00026813545,0.0007870608,0.0008480715,0.0028365448,0.002509054,0.001351034,0.0014198425,0.00038197348],"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.00010323797,0.00003680154,0.0017130645,0.00005519626,0.000013474667,0.00021130657,0.000518119,0.007093524,0.005683737,0.96538615,0.00087300775,0.018312305],"study_design_scores_gemma":[0.000024743153,0.00011908935,0.0017632733,0.00002885425,0.000026246349,0.00040042071,0.00023631404,0.031836946,0.0085803,0.94085705,0.016093519,0.000033176468],"about_ca_topic_score_codex":0.0031459164,"about_ca_topic_score_gemma":0.003513127,"teacher_disagreement_score":0.00329177,"about_ca_system_score_codex":0.002088192,"about_ca_system_score_gemma":0.0012036385,"threshold_uncertainty_score":0.015150964},"labels":[],"label_agreement":null},{"id":"W2003556994","doi":"10.2178/jsl/1129642120","title":"Elimination of imaginaries in expansions of o-minimal structures by generic sets","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Predicate (mathematical logic); Mathematics; Pure mathematics; Combinatorics; Algebra over a field; Computer science; Programming language","score_opus":0.032330397809530835,"score_gpt":0.3377230769247467,"score_spread":0.30539267911521584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003556994","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.7404161,0.0003524327,0.17259932,0.0010504632,0.000112067304,0.00012198248,0.00023885153,0.0006849587,0.08442376],"genre_scores_gemma":[0.97869736,0.000098376906,0.017762747,0.00015530695,0.000043645327,0.00004081513,0.00017918918,0.00007929148,0.0029431887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987556,0.0002545323,0.000083860476,0.00015041516,0.00036810074,0.00038750627],"domain_scores_gemma":[0.9978041,0.0011334205,0.00021044668,0.00041417324,0.00025162534,0.00018633272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017152865,0.0005218136,0.00085618946,0.0013212186,0.0018696951,0.002890271,0.000914632,0.00094224873,0.0034571243],"category_scores_gemma":[0.002782028,0.0004981791,0.0017462167,0.0007640091,0.004879875,0.004481908,0.004025962,0.00221707,0.00035261642],"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.00016366015,0.00007882707,0.0011734167,0.00008772411,0.000043035132,0.00071786734,0.00090323394,0.0027194384,0.008232655,0.97629833,0.00063671375,0.008945168],"study_design_scores_gemma":[0.00008060113,0.00010382407,0.0011340572,0.000049793012,0.00008235246,0.0005751608,0.0010186785,0.010470985,0.014489439,0.9624566,0.009504155,0.000034390006],"about_ca_topic_score_codex":0.00062867376,"about_ca_topic_score_gemma":0.0009505416,"teacher_disagreement_score":0.0034571243,"about_ca_system_score_codex":0.0010390581,"about_ca_system_score_gemma":0.0005804177,"threshold_uncertainty_score":0.011565268},"labels":[],"label_agreement":null},{"id":"W2006341276","doi":"10.2178/jsl/1203350794","title":"An untyped higher order logic with Y combinator","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatory logic; Curry–Howard correspondence; sort; Type theory; Consistency (knowledge bases); Mathematics; Calculus (dental); Computer science; Programming language; Lambda calculus; Type (biology); Algebra over a field; Discrete mathematics; Arithmetic; Pure mathematics","score_opus":0.0223894031981917,"score_gpt":0.27143734407518133,"score_spread":0.24904794087698962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006341276","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.09526454,0.0010931804,0.86534584,0.002188306,0.0004542531,0.00014185003,0.0004485522,0.0018285025,0.03323496],"genre_scores_gemma":[0.71769726,0.00071664224,0.26062146,0.0013381011,0.000266001,0.00014012898,0.00028219528,0.00029599265,0.018642198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980349,0.00044952097,0.00018179645,0.0002759062,0.00077536935,0.00028249493],"domain_scores_gemma":[0.99813974,0.00075623946,0.00020888676,0.00028008845,0.00045812243,0.00015692519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021036612,0.00044365937,0.0007028486,0.0012981374,0.0013217215,0.004921616,0.0017711804,0.0012955638,0.004156672],"category_scores_gemma":[0.0019987016,0.00064592157,0.0016014439,0.0016141322,0.004397185,0.0063884626,0.0029386338,0.003443593,0.0005726364],"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.00003064962,0.000028935927,0.00018320225,0.000045582816,0.000012423594,0.00021856435,0.0001899862,0.0020369953,0.0019451033,0.9902344,0.0005818856,0.004492327],"study_design_scores_gemma":[0.00011857054,0.000077161065,0.00028402964,0.000057192574,0.00006874258,0.00031403135,0.00016587348,0.034575462,0.008353825,0.9275539,0.028368598,0.00006258414],"about_ca_topic_score_codex":0.006758212,"about_ca_topic_score_gemma":0.0052029616,"teacher_disagreement_score":0.006758212,"about_ca_system_score_codex":0.002854552,"about_ca_system_score_gemma":0.0022784295,"threshold_uncertainty_score":0.020711362},"labels":[],"label_agreement":null},{"id":"W2008731436","doi":"10.2178/jsl/1230396765","title":"Examining Fragments of the Quantified Propositional Calculus","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Axiom; Mathematical proof; Hierarchy; Calculus (dental); Propositional calculus; Propositional variable; Proof complexity; Connection (principal bundle); Propositional formula; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Intermediate logic; Theoretical computer science","score_opus":0.0541860406085994,"score_gpt":0.2498554769199531,"score_spread":0.1956694363113537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008731436","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.34227052,0.0008673486,0.613866,0.0021301326,0.00016735386,0.00027218682,0.0007091032,0.0034045037,0.036312845],"genre_scores_gemma":[0.90135676,0.0002923243,0.0937643,0.000365219,0.00007862026,0.00006915951,0.00041790443,0.00023463104,0.003421141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975719,0.00060759607,0.00011500621,0.00032664725,0.0010288631,0.00035002598],"domain_scores_gemma":[0.9925735,0.004796696,0.00055199134,0.0011122513,0.0007320344,0.00023346095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026910575,0.00054642593,0.000528217,0.0014837013,0.0013446119,0.0030725743,0.001721609,0.0009407668,0.0059698257],"category_scores_gemma":[0.011459297,0.0008349073,0.0011382635,0.0014868807,0.003970416,0.006183577,0.0037588405,0.002134436,0.00047783062],"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.00037449,0.00010907721,0.0025111854,0.00028228926,0.000087591856,0.0020816124,0.002471006,0.027559849,0.013837261,0.9129455,0.0023552086,0.035384998],"study_design_scores_gemma":[0.00008072436,0.0001121014,0.0012612774,0.00011511385,0.00010866142,0.00055144104,0.0006368954,0.11240711,0.014720642,0.85236084,0.017591065,0.00005425949],"about_ca_topic_score_codex":0.007884062,"about_ca_topic_score_gemma":0.0062567485,"teacher_disagreement_score":0.007884062,"about_ca_system_score_codex":0.0024110773,"about_ca_system_score_gemma":0.0013190127,"threshold_uncertainty_score":0.019971073},"labels":[],"label_agreement":null},{"id":"W2009212476","doi":"10.2178/jsl/1294170990","title":"Computability of Fraïssé limits","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Countable set; Limit (mathematics); Mathematics; Computability; Pure mathematics; Quantifier (linguistics); Finitely-generated abelian group; Focus (optics); Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.06807033090625696,"score_gpt":0.25830321598898537,"score_spread":0.1902328850827284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009212476","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.8449244,0.0007292101,0.12702861,0.00087742956,0.000049223585,0.00004301669,0.00017096529,0.0003936935,0.025783384],"genre_scores_gemma":[0.9927341,0.000084227,0.005907548,0.000035523426,0.000039155224,0.000014156761,0.00003545053,0.000013586045,0.0011363681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819535,0.00031994013,0.00011294724,0.00055398355,0.0005280991,0.00028970468],"domain_scores_gemma":[0.9928397,0.004665071,0.0005812029,0.000721003,0.000647517,0.00054548634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020345983,0.00027194346,0.00055543863,0.0021385083,0.0015240221,0.003093919,0.0007033716,0.0008164626,0.002846796],"category_scores_gemma":[0.011475379,0.0003555857,0.00078502344,0.0007703981,0.006055128,0.0071831294,0.002623877,0.0015641549,0.00021462256],"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.000050901694,0.000019174397,0.0020139415,0.000040853178,0.000013014309,0.00015017547,0.0009841457,0.002448678,0.00276512,0.9872843,0.00017115448,0.0040585757],"study_design_scores_gemma":[0.00000942021,0.000028454708,0.00082839874,0.000025730134,0.000014891729,0.00024300485,0.0002873525,0.013501327,0.004414715,0.9781528,0.0024747688,0.000019111914],"about_ca_topic_score_codex":0.000908771,"about_ca_topic_score_gemma":0.00063542556,"teacher_disagreement_score":0.003093919,"about_ca_system_score_codex":0.0017198315,"about_ca_system_score_gemma":0.00046420994,"threshold_uncertainty_score":0.012478292},"labels":[],"label_agreement":null},{"id":"W2014032276","doi":"10.2178/jsl/1268917492","title":"Schnorr trivial sets and truth-table reducibility","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":36,"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":"Table (database); Triviality; Ideal (ethics); Truth table; Mathematics; Computer science; Discrete mathematics; Pure mathematics; Algorithm; Epistemology; Data mining; Philosophy","score_opus":0.014138392930325094,"score_gpt":0.2619920865501573,"score_spread":0.24785369361983223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014032276","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.34287238,0.0013590609,0.56717646,0.0042250664,0.00026472655,0.0001664314,0.00084920047,0.0015108996,0.08157572],"genre_scores_gemma":[0.97767913,0.00015491915,0.017362505,0.00040303572,0.0001459925,0.00006108515,0.00024224086,0.00005572565,0.003895265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950805,0.0011246157,0.00035134185,0.0009788134,0.0016144641,0.00085032434],"domain_scores_gemma":[0.9878898,0.0063676317,0.0010228236,0.0021701842,0.0019027631,0.0006467901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025076903,0.00053105137,0.0009383341,0.0026837077,0.0021505982,0.0040849647,0.0013390502,0.0010008576,0.007094366],"category_scores_gemma":[0.009851954,0.00055799045,0.0013243443,0.0016052466,0.006846439,0.008279577,0.0035569596,0.0037072827,0.00081391784],"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.00009261623,0.000029861654,0.00065034995,0.00006341155,0.000022840373,0.00009267986,0.00040046003,0.003203966,0.0018108306,0.987182,0.0010456247,0.005405308],"study_design_scores_gemma":[0.000010144526,0.0000204227,0.0002719378,0.00001370459,0.000011763985,0.000095681076,0.00016239354,0.0069815665,0.0030111508,0.9874894,0.0019090518,0.000022831846],"about_ca_topic_score_codex":0.0010101608,"about_ca_topic_score_gemma":0.0007524553,"teacher_disagreement_score":0.007094366,"about_ca_system_score_codex":0.0025122329,"about_ca_system_score_gemma":0.0008468239,"threshold_uncertainty_score":0.02373296},"labels":[],"label_agreement":null},{"id":"W2015878287","doi":"10.2178/jsl/1203350790","title":"The complexity of resolution refinements","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University","funders":"","keywords":"Resolution (logic); Computer science; Algorithm; Tree (set theory); Mathematics; Artificial intelligence; Combinatorics","score_opus":0.07207676306605637,"score_gpt":0.2981267113148954,"score_spread":0.226049948248839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015878287","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.28905612,0.0018551608,0.66214675,0.009160824,0.00015934945,0.0006192895,0.0011334429,0.0026866766,0.03318245],"genre_scores_gemma":[0.8465355,0.0012224242,0.14452356,0.000668647,0.0001886324,0.00032679777,0.0011605578,0.00050665636,0.0048672906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97204,0.010285049,0.0021439889,0.0027349743,0.009910698,0.002885428],"domain_scores_gemma":[0.77053875,0.1923123,0.0060827686,0.021869408,0.0073208706,0.0018758941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017349297,0.00071984984,0.0017479964,0.0029680312,0.0027548124,0.006883423,0.0036544465,0.0030234335,0.009565853],"category_scores_gemma":[0.12980299,0.001699228,0.0033448504,0.003532818,0.008007035,0.017248742,0.007613705,0.0069462126,0.0013011142],"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.0004934397,0.00015523717,0.0052517713,0.00049941137,0.00013199092,0.00040453018,0.0016806013,0.054820467,0.00294341,0.8661967,0.0055573834,0.061865076],"study_design_scores_gemma":[0.00009242974,0.000046887413,0.00085838576,0.00008529826,0.00009828225,0.00036779616,0.0005098517,0.16071455,0.004484858,0.82682055,0.0058599324,0.00006110899],"about_ca_topic_score_codex":0.0034794009,"about_ca_topic_score_gemma":0.002021423,"teacher_disagreement_score":0.017349297,"about_ca_system_score_codex":0.0034143154,"about_ca_system_score_gemma":0.0023073568,"threshold_uncertainty_score":0.091753006},"labels":[],"label_agreement":null},{"id":"W2020046292","doi":"10.2178/jsl/1164060461","title":"Every 1-generic computes a properly 1-generic","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","score_opus":0.022602612792350076,"score_gpt":0.22841434701812988,"score_spread":0.2058117342257798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020046292","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.46351236,0.00070390897,0.45815298,0.0017433831,0.0003733923,0.00032290383,0.0011090895,0.0035408204,0.070541084],"genre_scores_gemma":[0.9159885,0.00015877959,0.07601741,0.00032205513,0.0000936302,0.00009285037,0.0005815195,0.00036847714,0.0063768495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740076,0.00048530864,0.00027697725,0.00074281427,0.0006188219,0.0004752812],"domain_scores_gemma":[0.99561226,0.0009894482,0.0007344572,0.0016943396,0.0006460891,0.00032332673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018023624,0.0010089985,0.00087683974,0.0011352515,0.001320355,0.0030814619,0.0013310271,0.0012626029,0.009553883],"category_scores_gemma":[0.0063876733,0.00053270895,0.0018295088,0.0008624882,0.004373028,0.0077919634,0.0048990482,0.0014554177,0.0015711534],"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.0014653814,0.00013993419,0.009817561,0.0007483768,0.0001771456,0.0007497009,0.001093822,0.01944368,0.041262724,0.8636436,0.005056925,0.05640123],"study_design_scores_gemma":[0.000106557665,0.00038079754,0.0035299372,0.00019710916,0.00017351263,0.0011943805,0.00044308804,0.04040508,0.056607038,0.8626285,0.03415898,0.00017489803],"about_ca_topic_score_codex":0.0006082414,"about_ca_topic_score_gemma":0.00087253796,"teacher_disagreement_score":0.009553883,"about_ca_system_score_codex":0.0017877087,"about_ca_system_score_gemma":0.0008143166,"threshold_uncertainty_score":0.031960905},"labels":[],"label_agreement":null},{"id":"W2023468778","doi":"10.2307/2586525","title":"The anatytic conception of truth and the foundations of arithmetic","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Cardinality (data modeling); Simple (philosophy); Axiom; Epistemology; Statement (logic); Operator (biology); Peano axioms; Infinity; Discrete mathematics; Philosophy; Computer science","score_opus":0.020551148357920223,"score_gpt":0.3135710641695807,"score_spread":0.2930199158116605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023468778","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.06200558,0.014645361,0.16314651,0.029777845,0.0009437967,0.000043809076,0.0003847612,0.00032104072,0.7287313],"genre_scores_gemma":[0.95596105,0.0026667288,0.01897334,0.0015319935,0.00088194787,0.00008495156,0.000115854535,0.00006570097,0.019718416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983223,0.0008035947,0.00007048701,0.00025691226,0.00038351363,0.0001631846],"domain_scores_gemma":[0.998372,0.00094442983,0.00015243982,0.0002561234,0.000192468,0.00008254485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019383128,0.00041716103,0.00045703634,0.0017185892,0.0024244252,0.0055517545,0.0009981124,0.0016864263,0.0041323802],"category_scores_gemma":[0.003821558,0.00031346758,0.00068199314,0.0009352161,0.01910698,0.010532083,0.002959581,0.0029648552,0.0007988441],"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.0000016387863,6.81573e-7,0.000012906734,0.000003579022,5.164416e-7,0.0000036405463,0.00009715666,0.00006214031,0.000015190309,0.9992847,0.00012058604,0.00039715524],"study_design_scores_gemma":[0.0000020436398,0.0000020028322,0.000029664248,0.000009056511,8.8150045e-7,0.000008337855,0.000044323617,0.00025483285,0.000022687544,0.99531955,0.004304898,0.0000017918396],"about_ca_topic_score_codex":0.0018460345,"about_ca_topic_score_gemma":0.0012124405,"teacher_disagreement_score":0.0055517545,"about_ca_system_score_codex":0.003880313,"about_ca_system_score_gemma":0.0014541057,"threshold_uncertainty_score":0.028153718},"labels":[],"label_agreement":null},{"id":"W2037065522","doi":"10.2178/jsl/1146620157","title":"Strongly minimal groups in the theory of compact complex spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":8,"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":"Pure mathematics; Mathematics; Algebra over a field","score_opus":0.061570651158995515,"score_gpt":0.32794517579358484,"score_spread":0.2663745246345893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037065522","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.8837486,0.00061029603,0.07658285,0.0014544594,0.00008507894,0.00006115851,0.00015088306,0.00012764361,0.037179064],"genre_scores_gemma":[0.99365294,0.00007063344,0.003988511,0.000050066115,0.00003369114,0.000018286451,0.000041584204,0.00001196472,0.0021323767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940133,0.00018731445,0.000034231347,0.000104706975,0.00016249504,0.00010999957],"domain_scores_gemma":[0.9987789,0.00054048025,0.00016997707,0.00013701405,0.00017629247,0.00019726598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010003085,0.0006578881,0.00050081755,0.0015081614,0.0011829068,0.0031768342,0.0006830631,0.0009473343,0.003161579],"category_scores_gemma":[0.0018867116,0.0002564256,0.00049351255,0.00071424,0.004847583,0.0051449384,0.0024889484,0.0014772395,0.00021182194],"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.000038024154,0.000015254731,0.00041331947,0.00003119316,0.000007469948,0.00017612701,0.0010384531,0.0005781609,0.0020811926,0.9941911,0.00015112139,0.0012785421],"study_design_scores_gemma":[0.000017325461,0.00003481935,0.0005038854,0.000018221719,0.000010317071,0.00012566321,0.0005718082,0.0029574288,0.0011793472,0.9923673,0.0022052194,0.000008671332],"about_ca_topic_score_codex":0.00040063667,"about_ca_topic_score_gemma":0.00046731354,"teacher_disagreement_score":0.0031768342,"about_ca_system_score_codex":0.0010874983,"about_ca_system_score_gemma":0.00035726803,"threshold_uncertainty_score":0.010576546},"labels":[],"label_agreement":null},{"id":"W2045810234","doi":"10.2178/jsl/1333566632","title":"A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":9,"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":"Packing dimension; Hausdorff dimension; Effective dimension; Dimension (graph theory); Mathematics; Dimension function; Minkowski–Bouligand dimension; Combinatorics; Mathematical analysis; Fractal dimension; Fractal","score_opus":0.020407418884620655,"score_gpt":0.268995094939475,"score_spread":0.24858767605485432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045810234","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.69598806,0.00073558633,0.2778104,0.0019755524,0.00032465692,0.000102421225,0.00038050985,0.0019129651,0.020769745],"genre_scores_gemma":[0.886084,0.00007619996,0.11163543,0.00017340343,0.000042965614,0.000058310754,0.0002098892,0.00015472675,0.0015650433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981889,0.000415108,0.0001947703,0.000471437,0.00048360968,0.0002461092],"domain_scores_gemma":[0.98764706,0.0068737785,0.001003949,0.0027304846,0.0010110639,0.0007335667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016073143,0.00083596964,0.00080697244,0.0009506444,0.00091018045,0.002801019,0.0010970441,0.0012353626,0.004989551],"category_scores_gemma":[0.014212688,0.00045300624,0.0009258249,0.00062611717,0.0031065738,0.0066101337,0.0023440833,0.0019418113,0.00060567784],"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.001656586,0.00021538876,0.0096681,0.0007525259,0.00017968228,0.00048551755,0.0009018946,0.06099253,0.05096108,0.78793424,0.005390502,0.08086195],"study_design_scores_gemma":[0.00015869983,0.0005397387,0.002509628,0.00013682165,0.00010530845,0.00075518945,0.0003993581,0.25223097,0.053691667,0.674827,0.014483362,0.00016226602],"about_ca_topic_score_codex":0.00032928484,"about_ca_topic_score_gemma":0.0003586573,"teacher_disagreement_score":0.004989551,"about_ca_system_score_codex":0.0013610111,"about_ca_system_score_gemma":0.00091317086,"threshold_uncertainty_score":0.016691744},"labels":[],"label_agreement":null},{"id":"W2046430714","doi":"10.2178/jsl.7801100","title":"P-ideal dichotomy and weak squares","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ideal (ethics); Uncountable set; Mathematics; Pure mathematics; Epistemology; Philosophy","score_opus":0.027925082784160733,"score_gpt":0.31015008418684115,"score_spread":0.2822250014026804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046430714","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.388127,0.0031000315,0.22983193,0.023032062,0.0011076079,0.0000930295,0.0007090211,0.0010069498,0.3529924],"genre_scores_gemma":[0.9767561,0.0003420142,0.010119321,0.001135249,0.00043478972,0.00004921255,0.00017173313,0.00006403901,0.010927496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972543,0.0006641653,0.00011705394,0.00074562174,0.0008365002,0.00038233562],"domain_scores_gemma":[0.99300647,0.004465985,0.0003164314,0.00069514435,0.0008739918,0.00064203766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003120514,0.00041547493,0.0009965465,0.001501933,0.002748819,0.002357891,0.0011533909,0.0011831406,0.009245535],"category_scores_gemma":[0.008895374,0.00047641486,0.00083045964,0.00078199065,0.0094388705,0.010080337,0.006468201,0.005273789,0.0011584703],"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.00004315852,0.000014874077,0.00028136047,0.000033347456,0.0000055720425,0.00008765472,0.00017433686,0.00044985936,0.0004661496,0.9949411,0.0017010568,0.001801571],"study_design_scores_gemma":[0.000013865702,0.0000135754635,0.00013717795,0.000009673989,0.0000032542791,0.00006706394,0.0001017295,0.0016694228,0.00044572318,0.99459237,0.0029400438,0.0000060298225],"about_ca_topic_score_codex":0.0006847088,"about_ca_topic_score_gemma":0.0005825887,"teacher_disagreement_score":0.009245535,"about_ca_system_score_codex":0.0016239716,"about_ca_system_score_gemma":0.0008392456,"threshold_uncertainty_score":0.030929446},"labels":[],"label_agreement":null},{"id":"W2047577730","doi":"10.2307/2586538","title":"Coordinatisation and canonical bases in simple theories","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McMaster University","funders":"","keywords":"Simple (philosophy); Mathematics; Section (typography); Generalization; Pure mathematics; Categorical variable; Type (biology); Equivalence (formal languages); Canonical form; Algebra over a field; Computer science; Mathematical analysis","score_opus":0.025245975118682523,"score_gpt":0.33024766099047415,"score_spread":0.3050016858717916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047577730","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.3136109,0.0027705075,0.5240588,0.0026498148,0.0004016391,0.00011298841,0.0004144379,0.00063645514,0.15534449],"genre_scores_gemma":[0.94314075,0.0007636121,0.042354394,0.00017031973,0.00023930449,0.00009310989,0.00024823478,0.000066287255,0.012924027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904746,0.0002612161,0.00006618973,0.0001999647,0.00029901284,0.00012606061],"domain_scores_gemma":[0.9990288,0.0003212576,0.00013574134,0.00020118595,0.00018273467,0.00013031728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013015096,0.0003740473,0.00041271883,0.0013144078,0.0016149568,0.001833429,0.00082452537,0.0006750527,0.005690284],"category_scores_gemma":[0.0020594334,0.00027670714,0.0006830163,0.0010454925,0.005555054,0.006204687,0.0026311257,0.0016508579,0.00065449916],"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.000004116698,0.0000032611636,0.00009338321,0.000011404821,0.0000020372331,0.00002055095,0.00022088538,0.00034103316,0.00020449376,0.9970976,0.00014872655,0.0018525681],"study_design_scores_gemma":[0.000005344866,0.000014184958,0.00012752775,0.000007423776,0.0000030668377,0.00003578574,0.00011527446,0.0012265726,0.00040927943,0.9939746,0.004075081,0.0000057491916],"about_ca_topic_score_codex":0.0010694895,"about_ca_topic_score_gemma":0.00094880344,"teacher_disagreement_score":0.005690284,"about_ca_system_score_codex":0.0013940398,"about_ca_system_score_gemma":0.0007317938,"threshold_uncertainty_score":0.019035876},"labels":[],"label_agreement":null},{"id":"W2063169574","doi":"10.2307/2694928","title":"An intensional type theory: motivation and cut-elimination","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"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 British Columbia","funders":"","keywords":"Axiom; Type theory; Type (biology); Mathematics; Completeness (order theory); Interpretation (philosophy); Syntax; Discrete mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.02827150745272364,"score_gpt":0.2724352146138546,"score_spread":0.24416370716113098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063169574","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.042913735,0.0018394851,0.87756026,0.0058295657,0.00032562832,0.00012009933,0.0002828555,0.0003513375,0.070777066],"genre_scores_gemma":[0.6327535,0.0015404145,0.34682205,0.0019959481,0.0009123269,0.00030144182,0.000510545,0.00030937663,0.014854479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959598,0.001497659,0.00025795758,0.0005391904,0.0013839239,0.00036145185],"domain_scores_gemma":[0.9910802,0.005203805,0.0005112312,0.0012975072,0.0015841167,0.0003231427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065995585,0.00051933434,0.0009307651,0.0033327106,0.0019857697,0.004260767,0.0026538696,0.0018477371,0.005958092],"category_scores_gemma":[0.008735419,0.0010078993,0.0018617539,0.0035545283,0.009650997,0.013353823,0.004333783,0.00588826,0.0005665527],"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.000004757275,0.0000049686505,0.00005163286,0.000016659782,0.0000030561057,0.000033630906,0.000094298535,0.00031170508,0.0000823301,0.9973495,0.00037613625,0.0016713062],"study_design_scores_gemma":[0.000011921059,0.0000066411967,0.000056798097,0.000023058305,0.000009224901,0.00009419606,0.0000608005,0.004295578,0.0002979961,0.99081284,0.00432474,0.0000060940138],"about_ca_topic_score_codex":0.0014180209,"about_ca_topic_score_gemma":0.0011118297,"teacher_disagreement_score":0.0065995585,"about_ca_system_score_codex":0.0027150796,"about_ca_system_score_gemma":0.0011794639,"threshold_uncertainty_score":0.034902215},"labels":[],"label_agreement":null},{"id":"W2063729301","doi":"10.2178/jsl/1286198148","title":"Expansions of the real field by open sets: definability versus interpretability","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Open set; Projective test; Bounded function; Borel set; Discrete mathematics; Hausdorff space; Set (abstract data type); Hierarchy; Measure (data warehouse); Field (mathematics); Hausdorff measure; Combinatorics; Pure mathematics; Hausdorff dimension; Computer science; Mathematical analysis","score_opus":0.04491493955108227,"score_gpt":0.3819997416435831,"score_spread":0.3370848020925008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063729301","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.6726167,0.0011863775,0.23332718,0.0019327991,0.000114796836,0.000052722782,0.00016504862,0.0003144337,0.0902899],"genre_scores_gemma":[0.98402965,0.00013653169,0.013079104,0.00008023177,0.00006070992,0.00002646,0.00006380854,0.000029698755,0.002493715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998602,0.0004309151,0.00009428342,0.00026254862,0.0003880361,0.0002222351],"domain_scores_gemma":[0.99611133,0.0024642458,0.00037695337,0.00046276645,0.0003154502,0.00026925566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020178535,0.00031050213,0.00048814903,0.0012887287,0.0008005019,0.003163384,0.0007485357,0.0006878121,0.0031874853],"category_scores_gemma":[0.0047265496,0.0003055321,0.00061727595,0.0005359784,0.007738708,0.006531058,0.0022669479,0.002172632,0.0001690988],"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.000029277644,0.000014494758,0.00025924126,0.0000198093,0.000002249131,0.00007841338,0.000585787,0.0008189199,0.0013740779,0.9945221,0.00006706662,0.0022287103],"study_design_scores_gemma":[0.000022899152,0.00005596023,0.00063273974,0.00003789533,0.000012828465,0.0001720919,0.00049938663,0.008228694,0.0030952343,0.98391783,0.00330706,0.000017451619],"about_ca_topic_score_codex":0.0006480511,"about_ca_topic_score_gemma":0.000621737,"teacher_disagreement_score":0.0031874853,"about_ca_system_score_codex":0.0017867262,"about_ca_system_score_gemma":0.0003692767,"threshold_uncertainty_score":0.012963653},"labels":[],"label_agreement":null},{"id":"W2065498341","doi":"10.2178/jsl/1185803624","title":"Simplicial structures in MV-algebras and logic","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Axiom; Completeness (order theory); Algebraic structure; Intermediate logic; Peano axioms; Łukasiewicz logic; Relation algebra; Interior algebra; Discrete mathematics; Pure mathematics; Subalgebra; Division algebra; Two-element Boolean algebra; Algebra representation; Substructural logic; Computer science; Description logic; Theoretical computer science","score_opus":0.0161204057250458,"score_gpt":0.2802801720625293,"score_spread":0.2641597663374835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065498341","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.07949707,0.05027077,0.5647469,0.016426075,0.0013142477,0.00018472674,0.0007513333,0.000716236,0.2860926],"genre_scores_gemma":[0.7738019,0.014463857,0.17472774,0.0024156966,0.0029629902,0.00029682633,0.00064709166,0.00015007121,0.030533826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.0005732521,0.00008617449,0.00019922855,0.00039808202,0.00014394824],"domain_scores_gemma":[0.9988506,0.0005834747,0.00011763903,0.00013531004,0.00017305542,0.00013997825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022859222,0.00063666643,0.00081588747,0.002229884,0.0019542787,0.0044065057,0.0012201053,0.0015643002,0.005410635],"category_scores_gemma":[0.0023443075,0.00038022132,0.0009487121,0.0023102027,0.005918796,0.007490575,0.0020985373,0.0031895922,0.0008643484],"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.000002116775,0.0000031909997,0.000029717034,0.000012780771,0.0000022772576,0.000018256073,0.000105914136,0.0003091225,0.00008669748,0.9976966,0.00031738187,0.0014159334],"study_design_scores_gemma":[0.0000016885864,0.0000034386178,0.000031652922,0.000008466928,0.0000011827398,0.000012885038,0.00003092346,0.0010670873,0.00003993493,0.9947131,0.0040867305,0.0000028022976],"about_ca_topic_score_codex":0.0026270747,"about_ca_topic_score_gemma":0.0019331485,"teacher_disagreement_score":0.005410635,"about_ca_system_score_codex":0.0031551176,"about_ca_system_score_gemma":0.001067589,"threshold_uncertainty_score":0.022892058},"labels":[],"label_agreement":null},{"id":"W2072020033","doi":"10.2307/2695059","title":"Definability in low simple theories","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Mathematics; Bounded function; Context (archaeology); Model theory; Equivalence relation; Class (philosophy); Equivalence (formal languages); Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Epistemology","score_opus":0.023239949677205756,"score_gpt":0.32321810494544145,"score_spread":0.2999781552682357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072020033","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.33660674,0.008023996,0.30560964,0.005950722,0.0004610846,0.00017707852,0.00080530316,0.0007798866,0.34158558],"genre_scores_gemma":[0.9437295,0.0010343624,0.03414409,0.0006589169,0.00044557176,0.00013312371,0.00059030915,0.000088796216,0.01917523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979982,0.000491344,0.00013815309,0.00037873661,0.00077965733,0.00021399977],"domain_scores_gemma":[0.9975412,0.0013550735,0.00022361157,0.00028511602,0.00039643262,0.0001986062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015325404,0.00042838525,0.0007897591,0.0021534213,0.0020776333,0.0033395293,0.0008162537,0.00076011266,0.0047546537],"category_scores_gemma":[0.0037767442,0.00055599876,0.001136353,0.0012352195,0.0060834554,0.0059392024,0.0034567253,0.0035342756,0.0007492708],"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.0000118673,0.000008262334,0.00027560227,0.00003676839,0.000005622436,0.000037302485,0.00035120948,0.00019999332,0.0004717426,0.99452823,0.00040571575,0.0036675867],"study_design_scores_gemma":[0.000010962496,0.000016610247,0.00024981456,0.000018962606,0.000006577946,0.00005895727,0.000078398385,0.001642627,0.00053881545,0.98878855,0.008582828,0.0000068473046],"about_ca_topic_score_codex":0.0012147889,"about_ca_topic_score_gemma":0.0011332231,"teacher_disagreement_score":0.0047546537,"about_ca_system_score_codex":0.0030440108,"about_ca_system_score_gemma":0.00082017115,"threshold_uncertainty_score":0.022085965},"labels":[],"label_agreement":null},{"id":"W2074194362","doi":"10.1017/jsl.2014.53","title":"ALGEBRAIC GEOMETRY FOR MV-ALGEBRAS","year":2014,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"","keywords":"Mathematics; Real algebraic geometry; Algebra over a field; Function field of an algebraic variety; Polynomial; Algebraic number; Dimension of an algebraic variety; Singular point of an algebraic variety; Algebraic structure; Pure mathematics; Mathematical analysis","score_opus":0.015202689092916234,"score_gpt":0.2576290290568988,"score_spread":0.24242633996398255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074194362","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.47359124,0.0022283925,0.37517798,0.002469092,0.0003634354,0.0000759815,0.0005221157,0.00038235186,0.14518939],"genre_scores_gemma":[0.98295605,0.0003991707,0.01062044,0.00013020236,0.00021795832,0.000024026856,0.0001322834,0.000031835363,0.0054881163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991196,0.0002754456,0.000045473564,0.00015868973,0.00029269795,0.00010818913],"domain_scores_gemma":[0.9992385,0.00016972056,0.00012050494,0.000072625175,0.00025515034,0.00014345994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075199537,0.0004036027,0.0005147284,0.001376121,0.0011450006,0.0021750624,0.0006405718,0.00035604907,0.0044607143],"category_scores_gemma":[0.0015266285,0.00017374879,0.0005943202,0.0008641886,0.0030838386,0.0034484973,0.0019344157,0.0010333034,0.00054046937],"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.000005086891,0.0000019829138,0.00007451977,0.000008909621,0.0000027940102,0.000021139118,0.00006821872,0.00029326504,0.00028793662,0.99816304,0.00013055898,0.0009424132],"study_design_scores_gemma":[0.000006386806,0.000016580023,0.00019792383,0.000008589208,0.000005239313,0.00007438904,0.00011141162,0.0031006932,0.0004492306,0.9922225,0.0037997465,0.0000073011292],"about_ca_topic_score_codex":0.0010893698,"about_ca_topic_score_gemma":0.00046824507,"teacher_disagreement_score":0.0044607143,"about_ca_system_score_codex":0.0012524859,"about_ca_system_score_gemma":0.0004188356,"threshold_uncertainty_score":0.014922619},"labels":[],"label_agreement":null},{"id":"W2081858636","doi":"10.2178/jsl/1140641175","title":"Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":18,"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 British Columbia","funders":"","keywords":"Mathematics; Rank (graph theory); Homogeneous; Tuple; Arithmetic function; Combinatorics; Homogeneity (statistics); Discrete mathematics; Statistics","score_opus":0.010974821138814869,"score_gpt":0.2141956998777218,"score_spread":0.20322087873890693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081858636","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.6826703,0.00055551715,0.26506484,0.0017576315,0.00007107886,0.00008353989,0.0005490109,0.0007340855,0.048514128],"genre_scores_gemma":[0.97241175,0.00012634204,0.022006867,0.00007154812,0.000036013866,0.000028615224,0.00020134295,0.00003496101,0.005082527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996271,0.000060213824,0.000023204359,0.00006529956,0.00013872635,0.000085403124],"domain_scores_gemma":[0.9985214,0.00076760765,0.00015610542,0.00022687983,0.00017902917,0.00014904166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348487,0.00022068062,0.00033468707,0.000732791,0.0009808737,0.0015328185,0.00041139722,0.00039003885,0.0026923493],"category_scores_gemma":[0.002909192,0.00018430858,0.00043260594,0.0009918918,0.0018295305,0.0032024484,0.0010069491,0.0011067279,0.00020790253],"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.00011952313,0.000027602468,0.0013627515,0.00006341436,0.0000059439058,0.00022329712,0.0006417989,0.0060648867,0.0044859773,0.9743871,0.0010782173,0.01153952],"study_design_scores_gemma":[0.000038579732,0.000051809853,0.0020784042,0.000021959357,0.000027876007,0.00024160626,0.0004390148,0.03376128,0.0102628125,0.94324386,0.00979795,0.000034742712],"about_ca_topic_score_codex":0.0028993906,"about_ca_topic_score_gemma":0.004138979,"teacher_disagreement_score":0.0028993906,"about_ca_system_score_codex":0.0013523811,"about_ca_system_score_gemma":0.0007201082,"threshold_uncertainty_score":0.009812295},"labels":[],"label_agreement":null},{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","score_opus":0.02375080234186978,"score_gpt":0.2625584848825566,"score_spread":0.23880768254068685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087012565","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.5140052,0.0006254839,0.29339567,0.012489181,0.00070686045,0.00058240263,0.0013791512,0.0035638113,0.17325228],"genre_scores_gemma":[0.97509116,0.00020017338,0.020699179,0.0009166394,0.00021967769,0.00012386947,0.0003906115,0.00021192104,0.0021467742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366826,0.0016032517,0.00037989902,0.0009338428,0.0019699393,0.0014448777],"domain_scores_gemma":[0.9372201,0.04840246,0.0025821326,0.0040003383,0.005286145,0.002508889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048298435,0.00045606302,0.0006028885,0.0011361138,0.002968576,0.0036502925,0.0018350615,0.001486064,0.008770843],"category_scores_gemma":[0.028663777,0.00073836173,0.0013333757,0.0007513343,0.007456217,0.007864632,0.0041897176,0.005457566,0.00068308495],"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.00064761634,0.00037793093,0.006042557,0.000462007,0.00014358484,0.0027634345,0.0015933192,0.007859513,0.013665409,0.9346552,0.00970693,0.022082586],"study_design_scores_gemma":[0.00020079821,0.00015701377,0.0043341275,0.0000935491,0.00010675739,0.0010297073,0.001050924,0.02379804,0.0250147,0.93485266,0.009283664,0.00007799119],"about_ca_topic_score_codex":0.0024460405,"about_ca_topic_score_gemma":0.002326662,"teacher_disagreement_score":0.008770843,"about_ca_system_score_codex":0.0020189015,"about_ca_system_score_gemma":0.0017571277,"threshold_uncertainty_score":0.0293414},"labels":[],"label_agreement":null},{"id":"W2088093428","doi":"10.2178/jsl/1140641163","title":"The generalised type-theoretic interpretation of constructive set theory","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Florida Agricultural and Mechanical University","keywords":"Type theory; Interpretation (philosophy); Negation; Type (biology); Constructive; Universal set; Mathematics; Intuitionistic logic; Set theory; Set (abstract data type); Computer science; Algebra over a field; Linear logic; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.012200209156815016,"score_gpt":0.24639312955623738,"score_spread":0.23419292039942236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088093428","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.046486706,0.00384313,0.80523336,0.0059070294,0.0012368476,0.000084216146,0.00032665982,0.0007753126,0.13610671],"genre_scores_gemma":[0.85462224,0.00153483,0.12694374,0.0017436143,0.0013481539,0.00015389346,0.00017138512,0.00028723333,0.013194809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99491334,0.0025126142,0.00020994007,0.00050606485,0.0015049089,0.00035302684],"domain_scores_gemma":[0.99604553,0.0018262975,0.00028101946,0.0008281058,0.0008326835,0.00018626651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005443246,0.0006653522,0.0010043766,0.0034734244,0.001518537,0.0071735224,0.0024440866,0.0024156396,0.0057182075],"category_scores_gemma":[0.0067499564,0.0006200475,0.0019494828,0.0023556175,0.013974036,0.008175095,0.0033467172,0.0035297375,0.00080384343],"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.000005499771,0.0000020948341,0.000022843707,0.000019304696,0.000003976708,0.000025583153,0.000106805586,0.0005339628,0.00016137163,0.9975811,0.00020666847,0.0013306915],"study_design_scores_gemma":[0.000009041758,0.000006014551,0.000034968976,0.000023440194,0.000006274168,0.00006584487,0.000038744656,0.0021692566,0.00023877666,0.99122787,0.006171824,0.00000801345],"about_ca_topic_score_codex":0.00085195963,"about_ca_topic_score_gemma":0.00078402134,"teacher_disagreement_score":0.0071735224,"about_ca_system_score_codex":0.003592841,"about_ca_system_score_gemma":0.0011961545,"threshold_uncertainty_score":0.028786957},"labels":[],"label_agreement":null},{"id":"W2088134129","doi":"10.2178/jsl/1268917489","title":"Strongly and co-strongly minimal abelian structures","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algebraic structure; Abelian group; Mathematics; Linear subspace; Subspace topology; Combinatorics; Vector space; Division ring; Pure mathematics; Elementary abelian group; Discrete mathematics; Division (mathematics); Mathematical analysis; Arithmetic","score_opus":0.030045790282780354,"score_gpt":0.29862693300985216,"score_spread":0.2685811427270718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088134129","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.8358863,0.0005661039,0.085591435,0.00082329346,0.00007632606,0.00009833209,0.00036430807,0.00025254936,0.07634136],"genre_scores_gemma":[0.98593396,0.00008038328,0.0076506953,0.00007317522,0.00007224757,0.000045945773,0.00017802238,0.000019966492,0.0059456015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911636,0.00017463873,0.000075436015,0.00017423417,0.00027691651,0.00018243011],"domain_scores_gemma":[0.99826354,0.00041455447,0.0002909347,0.00022419344,0.00047434532,0.00033243885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006750121,0.0003610883,0.00034873706,0.0017850439,0.0011147668,0.001848119,0.000570032,0.00047222,0.0052326946],"category_scores_gemma":[0.0015355642,0.00025746654,0.0004958466,0.00057933363,0.0025376482,0.0031971098,0.0025728827,0.000998852,0.00054797967],"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.00008290532,0.000050629013,0.0029632202,0.00004694938,0.000018813875,0.00020246602,0.00059459626,0.00059927,0.0062748934,0.9825209,0.0005816714,0.006063647],"study_design_scores_gemma":[0.00003129526,0.00013655683,0.004115931,0.0000492198,0.00004851794,0.0008730178,0.0010485839,0.0069842455,0.014216655,0.9581951,0.014270284,0.00003060811],"about_ca_topic_score_codex":0.00037014746,"about_ca_topic_score_gemma":0.00036495173,"teacher_disagreement_score":0.0052326946,"about_ca_system_score_codex":0.00092624273,"about_ca_system_score_gemma":0.00038839882,"threshold_uncertainty_score":0.01750511},"labels":[],"label_agreement":null},{"id":"W2103381492","doi":"10.2178/jsl/1333566629","title":"Weakly one-based geometric theories","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Generalization; Rank (graph theory); Modularity (biology); Pure mathematics; Vector space; Categorical variable; Modular design; Class (philosophy); Space (punctuation); Field (mathematics); Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.060838623609095664,"score_gpt":0.29881590766209126,"score_spread":0.2379772840529956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103381492","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.8263488,0.00036021555,0.089662075,0.00091030775,0.000059414517,0.00005643366,0.00012846282,0.00019102026,0.082283236],"genre_scores_gemma":[0.990694,0.00006487234,0.0051972293,0.00008695296,0.000029789826,0.000019818524,0.00006011108,0.000013244936,0.0038340043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.00014750696,0.000036784295,0.00015964401,0.0002852239,0.00012665245],"domain_scores_gemma":[0.9990188,0.00024681797,0.00018120503,0.00019400826,0.00018646423,0.00017259386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726018,0.00040705048,0.0004940748,0.0012540616,0.0009235,0.0017174165,0.0007364135,0.0005526746,0.0029981534],"category_scores_gemma":[0.0012971956,0.0001756464,0.00045457692,0.000551386,0.0044581783,0.003283807,0.001971646,0.0012835108,0.0002973112],"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.000013270001,0.000012399094,0.00062970317,0.000016197117,0.000004281458,0.00006867032,0.00020726639,0.0007984859,0.0013150019,0.99460983,0.00014900859,0.0021758275],"study_design_scores_gemma":[0.000017524348,0.00005759547,0.0009530373,0.000017051447,0.000010686399,0.00022485931,0.00024722828,0.008108851,0.001751865,0.9854455,0.0031520282,0.000013747176],"about_ca_topic_score_codex":0.00046450653,"about_ca_topic_score_gemma":0.00047371676,"teacher_disagreement_score":0.0029981534,"about_ca_system_score_codex":0.0012341212,"about_ca_system_score_gemma":0.00036981166,"threshold_uncertainty_score":0.010029793},"labels":[],"label_agreement":null},{"id":"W2104329043","doi":"10.2178/jsl/1318338849","title":"Limits on jump inversion for strong reducibilities","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"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":"Jump; Inversion (geology); Set (abstract data type); Mathematics; Algorithm; Computer science; Discrete mathematics; Combinatorics; Physics; Biology","score_opus":0.1159473559644005,"score_gpt":0.28514799890236,"score_spread":0.16920064293795947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104329043","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.5901428,0.0012514087,0.21359047,0.0029752576,0.00024985042,0.00015242894,0.00043028974,0.00084711623,0.19036044],"genre_scores_gemma":[0.97613156,0.00022011394,0.015542333,0.00030373898,0.00012536177,0.00008622893,0.00018391611,0.000098749355,0.0073079625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962437,0.00066221156,0.00028253574,0.00066445314,0.0015050111,0.0006420624],"domain_scores_gemma":[0.98897064,0.007131481,0.00046370947,0.0013596574,0.0013867071,0.0006878715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038358476,0.0005622786,0.00093223306,0.0024763988,0.0016339973,0.0033268076,0.0014335751,0.0013127865,0.008146934],"category_scores_gemma":[0.016202902,0.00066748966,0.0014709297,0.0010294993,0.006287494,0.007729827,0.006248986,0.0047678538,0.00057059113],"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.000051625484,0.000036820267,0.0007431911,0.000047507583,0.00001643275,0.00022457191,0.0003778653,0.0019164546,0.0011283174,0.9902925,0.00049373816,0.0046710647],"study_design_scores_gemma":[0.00001547038,0.00002824291,0.0002976994,0.00001707744,0.0000151847025,0.00018408912,0.00018348006,0.009266546,0.0016248311,0.9862618,0.0020899188,0.000015707006],"about_ca_topic_score_codex":0.0013173926,"about_ca_topic_score_gemma":0.0010656472,"teacher_disagreement_score":0.008146934,"about_ca_system_score_codex":0.0015149466,"about_ca_system_score_gemma":0.0007351884,"threshold_uncertainty_score":0.027254224},"labels":[],"label_agreement":null},{"id":"W2107810016","doi":"10.2178/jsl/1120224718","title":"On the type-definability of the binding group in simple theories","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"McMaster University","funders":"","keywords":"Type (biology); Combinatorics; Simple (philosophy); Mathematics; Set (abstract data type); Action (physics); Group (periodic table); Discrete mathematics; Physics; Computer science; Biology; Philosophy; Programming language","score_opus":0.035999156350358455,"score_gpt":0.3206802138314298,"score_spread":0.28468105748107136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107810016","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.58720773,0.0010453099,0.32520393,0.0025357066,0.0004146041,0.00014688671,0.00035102363,0.000795644,0.08229911],"genre_scores_gemma":[0.9743319,0.00020935405,0.018686147,0.00026699706,0.00014117402,0.00008165914,0.00014545134,0.00007848831,0.006058814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976,0.0008045606,0.0001947174,0.00043297326,0.00063099276,0.00033677698],"domain_scores_gemma":[0.995769,0.0022473224,0.0003819521,0.00060009724,0.00046472016,0.0005368526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038440756,0.00045839633,0.00092805235,0.0024631922,0.002581076,0.0040672435,0.0013141512,0.0015608066,0.0063232267],"category_scores_gemma":[0.0054181563,0.0007304575,0.0012403145,0.0016635093,0.011798796,0.008829735,0.004704981,0.0029800208,0.0005715896],"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.000040171257,0.000027093134,0.00029876738,0.00002775296,0.000010052425,0.00008672714,0.0009463728,0.0006426543,0.0008749747,0.99447024,0.00018778244,0.002387402],"study_design_scores_gemma":[0.000027060792,0.00002723729,0.00016695385,0.000014052509,0.000010667172,0.00004764337,0.00022676594,0.0019872156,0.0006216706,0.99556476,0.0012929518,0.00001298656],"about_ca_topic_score_codex":0.0021964598,"about_ca_topic_score_gemma":0.0017193577,"teacher_disagreement_score":0.0063232267,"about_ca_system_score_codex":0.001953572,"about_ca_system_score_gemma":0.0010007647,"threshold_uncertainty_score":0.021153271},"labels":[],"label_agreement":null},{"id":"W2108070451","doi":"10.2178/jsl/1230396911","title":"Analytic and coanalytic families of almost disjoint functions","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Countable set; Mathematics; Disjoint sets; Pairwise comparison; Combinatorics; Discrete mathematics; Existential quantification; Statistics","score_opus":0.06064661469918653,"score_gpt":0.31317541817748784,"score_spread":0.2525288034783013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108070451","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.8312678,0.0011562904,0.12725474,0.0014530438,0.00006663986,0.000035199228,0.00023677178,0.00024184519,0.038287766],"genre_scores_gemma":[0.9894538,0.00016102946,0.007157305,0.00009240205,0.00004468578,0.00003873766,0.00012640202,0.00002444715,0.0029012365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764866,0.0005601686,0.000121260426,0.00046143204,0.00088056485,0.0003278434],"domain_scores_gemma":[0.99249,0.0034731259,0.0008680058,0.00077904726,0.0013581935,0.001031637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027387335,0.0004747253,0.0007827045,0.002775816,0.0025623536,0.002712042,0.0010203209,0.0008115693,0.0037536407],"category_scores_gemma":[0.008891482,0.00071252306,0.0009940919,0.0011247396,0.004596156,0.0044730552,0.0047546406,0.0016128271,0.00034699103],"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.000119081786,0.00003103079,0.0028908865,0.000051221563,0.000057889894,0.00052555534,0.0009727375,0.0026730404,0.003691894,0.9831781,0.000596089,0.005212466],"study_design_scores_gemma":[0.00005402499,0.00008570725,0.0030503026,0.00006894499,0.00007873216,0.0016679558,0.0014330155,0.027591491,0.006123822,0.9480155,0.011773334,0.000057145025],"about_ca_topic_score_codex":0.0010772009,"about_ca_topic_score_gemma":0.00060973136,"teacher_disagreement_score":0.0037536407,"about_ca_system_score_codex":0.002714425,"about_ca_system_score_gemma":0.00070747646,"threshold_uncertainty_score":0.019694626},"labels":[],"label_agreement":null},{"id":"W2113017687","doi":"10.2178/jsl/1190150145","title":"On the binding group in simple theories","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Type (biology); Group (periodic table); Tuple; Mathematics; Classification of finite simple groups; Simple group; Combinatorics; Pure mathematics; Algebra over a field; Group theory; Discrete mathematics; Physics; Group of Lie type; Quantum mechanics; Philosophy; Epistemology","score_opus":0.06131086100222974,"score_gpt":0.31288371532782955,"score_spread":0.25157285432559984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113017687","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.6356408,0.0010808298,0.24161269,0.0036386037,0.00048475107,0.00015748318,0.00035493393,0.0009714429,0.11605852],"genre_scores_gemma":[0.9715735,0.0003637692,0.014833251,0.00035735263,0.00017819798,0.00008557733,0.00018053234,0.00008181904,0.012345857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982059,0.00056417484,0.000095069045,0.00026383926,0.0005032462,0.0003677901],"domain_scores_gemma":[0.9974915,0.0012418812,0.00023438265,0.0004221419,0.00023106576,0.00037913668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022983875,0.0004949786,0.00093931006,0.0023638557,0.0030112294,0.0039648134,0.001162699,0.0019229832,0.010015121],"category_scores_gemma":[0.003725556,0.00070335984,0.00081903563,0.0019786619,0.009015494,0.008281978,0.0052350187,0.002983799,0.0012315044],"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.000027814986,0.000017437244,0.00016037175,0.00001705831,0.000004199907,0.00008021911,0.0005147758,0.0005968529,0.0005827639,0.99562776,0.00023549485,0.0021352752],"study_design_scores_gemma":[0.000016296326,0.000014397498,0.000087737324,0.000010000847,0.000005967594,0.000032540396,0.00018072576,0.0013187932,0.0003368247,0.99612755,0.0018604483,0.000008750873],"about_ca_topic_score_codex":0.0021581284,"about_ca_topic_score_gemma":0.0015271439,"teacher_disagreement_score":0.010015121,"about_ca_system_score_codex":0.001690936,"about_ca_system_score_gemma":0.0011241897,"threshold_uncertainty_score":0.03350395},"labels":[],"label_agreement":null},{"id":"W2114226999","doi":"10.2178/jsl/1154698576","title":"The complexity of analytic tableaux","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Resolution (logic); Matching (statistics); Polynomial; Tree (set theory); Young tableau; Binary tree; Mathematics; Computer science; Combinatorics; Discrete mathematics; Artificial intelligence","score_opus":0.04642661743926695,"score_gpt":0.26768155588808984,"score_spread":0.22125493844882288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114226999","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.26850966,0.0007333665,0.68402386,0.0047098743,0.0001550172,0.00034425408,0.00093851535,0.0011760069,0.03940935],"genre_scores_gemma":[0.8218466,0.0005688471,0.1650435,0.0004234154,0.0001276332,0.00028359826,0.00076805276,0.0002827403,0.010655489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447626,0.0019254223,0.00036364316,0.00068832317,0.0020619547,0.00048447645],"domain_scores_gemma":[0.9640536,0.028874595,0.0014014231,0.0030283271,0.002061986,0.00058018474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032005599,0.00040551947,0.00083510944,0.0010139897,0.0015415018,0.005871631,0.002046726,0.0012688821,0.012020203],"category_scores_gemma":[0.025303096,0.0008008441,0.0013339956,0.0012007682,0.0034571046,0.008313844,0.002546363,0.0032278125,0.0010849604],"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.00013788631,0.000044366978,0.0009287204,0.00020055068,0.000034795885,0.00019724759,0.00058390055,0.025411628,0.0029748452,0.9497825,0.0021993336,0.017504279],"study_design_scores_gemma":[0.000039241942,0.000024995226,0.00025881734,0.000032600296,0.000026421276,0.00015029653,0.00011866677,0.085485004,0.004001886,0.9038203,0.006018983,0.000022899972],"about_ca_topic_score_codex":0.0022306023,"about_ca_topic_score_gemma":0.0017500228,"teacher_disagreement_score":0.012020203,"about_ca_system_score_codex":0.0028633634,"about_ca_system_score_gemma":0.0019995645,"threshold_uncertainty_score":0.04021156},"labels":[],"label_agreement":null},{"id":"W2116942026","doi":"10.2307/2695054","title":"Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":30,"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":"Indigenous and Northern Affairs Canada","keywords":"Mathematics; Set (abstract data type); Set theory; Discrete mathematics; Calculus (dental); Computer science","score_opus":0.06064039954745797,"score_gpt":0.36038946937629135,"score_spread":0.29974906982883337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116942026","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.09728491,0.0051350347,0.7754397,0.004491237,0.00036166178,0.00010576474,0.00044668172,0.001226017,0.11550902],"genre_scores_gemma":[0.93342644,0.00090383115,0.05828055,0.0006026834,0.0004172799,0.00013590963,0.00020107032,0.00023148459,0.005800744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99238026,0.0022650445,0.00046222744,0.0008775808,0.003060376,0.0009546198],"domain_scores_gemma":[0.97091204,0.019895451,0.0017114682,0.0030928976,0.0033732592,0.0010148434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067249415,0.0007564109,0.0012237255,0.004495848,0.0024038488,0.007635396,0.00203204,0.0019553103,0.010950892],"category_scores_gemma":[0.028708009,0.0008514832,0.001403824,0.0019049521,0.006164409,0.015648907,0.008445871,0.0060438686,0.0014430804],"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.000014376407,0.000006654684,0.00014556911,0.000034956483,0.0000070280635,0.000018046747,0.0001462377,0.0008551472,0.00031811808,0.9955974,0.00033057824,0.0025258877],"study_design_scores_gemma":[0.000005037217,0.000009763028,0.00016892546,0.000028940805,0.000009575582,0.000034404915,0.00005479251,0.007974834,0.00092036335,0.9885244,0.0022545734,0.000014432248],"about_ca_topic_score_codex":0.001019839,"about_ca_topic_score_gemma":0.0011985302,"teacher_disagreement_score":0.010950892,"about_ca_system_score_codex":0.0038554366,"about_ca_system_score_gemma":0.00097191037,"threshold_uncertainty_score":0.036634386},"labels":[],"label_agreement":null},{"id":"W2118388414","doi":"10.2178/jsl/1190150029","title":"Unique decomposition in classifiable theories","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Homotopy and Cohomology in Algebraic Topology","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":"McMaster University","funders":"","keywords":"Countable set; Mathematics; Notation; Prime (order theory); Decomposition; Property (philosophy); Model theory; Order (exchange); Stability (learning theory); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Arithmetic","score_opus":0.045493672295532576,"score_gpt":0.32656739510958216,"score_spread":0.2810737228140496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118388414","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.34633294,0.006566712,0.4618273,0.0042467266,0.00047069465,0.00009633414,0.0006736656,0.0007636799,0.179022],"genre_scores_gemma":[0.9248736,0.0012204237,0.0569669,0.00034160505,0.0002367362,0.00010872446,0.0005866643,0.00011499494,0.015550322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984895,0.00032785692,0.00010670452,0.0003649354,0.00042115818,0.00028988317],"domain_scores_gemma":[0.9984328,0.00055833487,0.00017097506,0.00031925415,0.00030108134,0.00021754783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016958823,0.00046554685,0.0006375095,0.0027782538,0.0017448864,0.003168296,0.00080109783,0.000852055,0.0045035463],"category_scores_gemma":[0.0021806136,0.0005108816,0.0012311912,0.0014228433,0.0049329083,0.00792979,0.0033988003,0.0025136026,0.0005576342],"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.0000064040123,0.0000034344534,0.00019091822,0.00001854611,0.0000032770877,0.000037125577,0.0003374684,0.00020813818,0.0001815159,0.9957898,0.00042992254,0.002793299],"study_design_scores_gemma":[0.0000053118274,0.000007677577,0.00017111676,0.00001876156,0.0000056713793,0.000058240705,0.00017364744,0.0018775353,0.00031462984,0.99391323,0.0034491178,0.000004979798],"about_ca_topic_score_codex":0.001937021,"about_ca_topic_score_gemma":0.001698348,"teacher_disagreement_score":0.0045035463,"about_ca_system_score_codex":0.0026200875,"about_ca_system_score_gemma":0.0008573245,"threshold_uncertainty_score":0.019010127},"labels":[],"label_agreement":null},{"id":"W2120230527","doi":"10.2178/jsl/1208359065","title":"Generic complexity of undecidable problems","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"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":"Undecidable problem; Construct (python library); Decidability; Word problem (mathematics education); Mathematics; Halting problem; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Turing machine; Arithmetic; Programming language","score_opus":0.0957049011215074,"score_gpt":0.2547248305775202,"score_spread":0.15901992945601282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120230527","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.4756246,0.0009986475,0.48334226,0.0041542454,0.00009409403,0.00042630846,0.0008843819,0.0009627255,0.033512738],"genre_scores_gemma":[0.94943106,0.0003664813,0.044635747,0.00036928768,0.00015800708,0.00031865857,0.0009584391,0.00012240655,0.0036399486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911396,0.0020715732,0.00070211396,0.0018863947,0.0030894415,0.0011109136],"domain_scores_gemma":[0.9656032,0.025264615,0.0023080856,0.0036020202,0.0020144135,0.001207785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172237,0.0009304628,0.0013494169,0.002447104,0.0016629859,0.0049974998,0.0030833243,0.002208327,0.005766624],"category_scores_gemma":[0.02479538,0.00084996904,0.002916331,0.002135905,0.006260367,0.010826065,0.004968703,0.005398076,0.00027511304],"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.00022604883,0.00019755686,0.004172351,0.0005367802,0.00015651227,0.00035195114,0.0006765432,0.06527114,0.004846855,0.89932066,0.0017030165,0.022540523],"study_design_scores_gemma":[0.000044647993,0.000053044772,0.0008838275,0.000035944162,0.000059440994,0.0002771013,0.0001339457,0.11934748,0.0044414336,0.8721403,0.002554466,0.00002847561],"about_ca_topic_score_codex":0.0009772843,"about_ca_topic_score_gemma":0.00070583733,"teacher_disagreement_score":0.005766624,"about_ca_system_score_codex":0.0045298142,"about_ca_system_score_gemma":0.001447056,"threshold_uncertainty_score":0.0328663},"labels":[],"label_agreement":null},{"id":"W2123017773","doi":"10.2178/jsl/1190150053","title":"Pfaffian differential equations over exponential o-minimal structures","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pfaffian; Mathematics; Unary operation; Differentiable function; Combinatorics; Function (biology); Zero (linguistics); Sequence (biology); Discrete mathematics; Pure mathematics","score_opus":0.06992720322201543,"score_gpt":0.32590139667980766,"score_spread":0.25597419345779227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123017773","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.86079913,0.0007546629,0.10073122,0.00087661674,0.00006996524,0.00002829964,0.00009591118,0.00013651437,0.03650775],"genre_scores_gemma":[0.97571135,0.00038411384,0.0142177055,0.000117620075,0.00009497516,0.000023529938,0.00009099781,0.000027895256,0.009331702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997253,0.000055899978,0.000015362748,0.000054902906,0.000078947385,0.000069580456],"domain_scores_gemma":[0.99925596,0.00027016777,0.00013304003,0.00004308744,0.0001495444,0.00014819963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008024593,0.00047001525,0.00044679764,0.00096732186,0.0006112669,0.0011159095,0.0006198044,0.000453,0.0023531343],"category_scores_gemma":[0.002586018,0.00017882581,0.00060785224,0.0004523676,0.0013366936,0.0032446831,0.0012147871,0.0012144662,0.00021640163],"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.000030505953,0.000030975363,0.0010864472,0.00003676735,0.0000095822215,0.0001789245,0.00038269535,0.005763651,0.0030287514,0.98449844,0.00022368378,0.0047294535],"study_design_scores_gemma":[0.000023251096,0.000058413178,0.0012213654,0.000031143747,0.000010940691,0.00017725864,0.00028359744,0.07821915,0.0017521824,0.915763,0.0024386153,0.00002103482],"about_ca_topic_score_codex":0.0017137815,"about_ca_topic_score_gemma":0.0015505753,"teacher_disagreement_score":0.0023531343,"about_ca_system_score_codex":0.001892334,"about_ca_system_score_gemma":0.00050460594,"threshold_uncertainty_score":0.01372987},"labels":[],"label_agreement":null},{"id":"W2123528468","doi":"10.2307/2695039","title":"The covering numbers of Mycielski ideals are all equal","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Discrete mathematics; Philosophy; Epistemology","score_opus":0.07546392514603789,"score_gpt":0.3675730739033885,"score_spread":0.2921091487573506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123528468","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.91326237,0.00073649624,0.030845921,0.00045336157,0.00014865259,0.000032414024,0.00021761675,0.0001488174,0.05415432],"genre_scores_gemma":[0.9928364,0.00018121795,0.004082007,0.000044513254,0.00008059002,0.000021067499,0.00016018758,0.000019438816,0.0025745288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987079,0.00019127599,0.00009862179,0.00028261347,0.00035511111,0.00036444425],"domain_scores_gemma":[0.9980235,0.0006147479,0.00037297513,0.0001412761,0.00035853588,0.0004888997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011663957,0.0003958798,0.00057797384,0.0016440878,0.0015266009,0.0028944444,0.00035251438,0.0004754902,0.0024115224],"category_scores_gemma":[0.002784936,0.00031691394,0.00045212728,0.0007347651,0.003344628,0.0035562653,0.0015727713,0.00083859125,0.00055009936],"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.00038608973,0.000028966948,0.0017851111,0.00006555553,0.000019176485,0.00014102757,0.00070390967,0.001377696,0.008273902,0.97814494,0.0008155627,0.008258202],"study_design_scores_gemma":[0.00004598964,0.00013102542,0.00474539,0.00004186542,0.0000375781,0.00054788217,0.0005816963,0.005843814,0.013963981,0.9624316,0.011585051,0.0000441824],"about_ca_topic_score_codex":0.00043093815,"about_ca_topic_score_gemma":0.00031350434,"teacher_disagreement_score":0.0028944444,"about_ca_system_score_codex":0.001367499,"about_ca_system_score_gemma":0.0003499557,"threshold_uncertainty_score":0.009921908},"labels":[],"label_agreement":null},{"id":"W2125293664","doi":"10.2178/jsl/1164060462","title":"Computability Results Used in Differential Geometry","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":13,"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":"Mathematical proof; Mathematics; Computability; Modulo; Maxima and minima; Computability theory; Differential geometry; Recursively enumerable language; Function (biology); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.01754326544855362,"score_gpt":0.2507667551692935,"score_spread":0.23322348972073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125293664","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.13798814,0.013981187,0.663518,0.013544335,0.0010258118,0.00012489082,0.00077773654,0.00052137487,0.16851859],"genre_scores_gemma":[0.9287723,0.002767048,0.054522507,0.0007981765,0.0007889159,0.00015345374,0.0003175304,0.00010965778,0.011770551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.0005235865,0.00016798956,0.0005561987,0.00060686836,0.00016903094],"domain_scores_gemma":[0.9916198,0.0059724716,0.00037815317,0.001023815,0.00072127586,0.00028438205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021832949,0.00083306,0.00074881065,0.003524192,0.0017906637,0.0045464463,0.0011322341,0.0011635848,0.004963724],"category_scores_gemma":[0.0085580265,0.00037646378,0.0012603692,0.003092459,0.007958663,0.008538928,0.0038183501,0.0048087738,0.0005352438],"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.0000047068474,0.0000032185703,0.000111359564,0.000018307748,0.0000035183873,0.0000183998,0.00007528443,0.00079933845,0.00014378641,0.99689853,0.00022953788,0.0016940518],"study_design_scores_gemma":[0.0000039302085,0.000004690146,0.00012547622,0.000012939933,0.000003880884,0.000031741125,0.00003484027,0.0046800287,0.00033295518,0.9901624,0.004602186,0.000004846315],"about_ca_topic_score_codex":0.0017528122,"about_ca_topic_score_gemma":0.0007621029,"teacher_disagreement_score":0.004963724,"about_ca_system_score_codex":0.004624662,"about_ca_system_score_gemma":0.00061374175,"threshold_uncertainty_score":0.033554435},"labels":[],"label_agreement":null},{"id":"W2127314485","doi":"10.2178/jsl/1154698593","title":"Universal spaces for classes of scattered eberlein compact spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Uncountable set; Mathematics; Retract; Space (punctuation); Class (philosophy); Pure mathematics; Compact space; Combinatorics; Discrete mathematics; Computer science; Countable set","score_opus":0.04099297337689255,"score_gpt":0.3262864976740784,"score_spread":0.28529352429718585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127314485","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.9170402,0.0007081232,0.06949848,0.0003564853,0.000029679004,0.0000360461,0.000113793925,0.0001095397,0.012107712],"genre_scores_gemma":[0.9916161,0.00010201167,0.0062918337,0.000035868252,0.00001680119,0.000028010381,0.000087808236,0.000011514562,0.001810022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990094,0.00015918574,0.000073667514,0.0002581982,0.00027562017,0.00022393983],"domain_scores_gemma":[0.9978321,0.0007444528,0.0003679902,0.00025788855,0.0003117394,0.00048570585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00143426,0.00035656334,0.00048428,0.0013507426,0.0013703965,0.0030250854,0.00057556684,0.0006332998,0.0025039657],"category_scores_gemma":[0.0043690642,0.00028497484,0.00050425064,0.00071330066,0.003411456,0.0044740853,0.0030645235,0.0010234007,0.00011934624],"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.00013692096,0.000047337173,0.0053788316,0.000090171176,0.000030175866,0.00030926324,0.0021116263,0.0018831637,0.0050830827,0.9750259,0.00031130738,0.009592267],"study_design_scores_gemma":[0.00006843115,0.00026673562,0.00981949,0.00015540756,0.0000612965,0.0014304008,0.005027775,0.025999382,0.017776065,0.9179521,0.021386355,0.000056436038],"about_ca_topic_score_codex":0.0005485744,"about_ca_topic_score_gemma":0.00041411078,"teacher_disagreement_score":0.0030250854,"about_ca_system_score_codex":0.0013489979,"about_ca_system_score_gemma":0.0002939818,"threshold_uncertainty_score":0.009787738},"labels":[],"label_agreement":null},{"id":"W2131834026","doi":"10.2178/jsl/1190150048","title":"Open questions in the theory of spaces of orderings","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Ideal (ethics); Bounded function; Isotropy; Combinatorics; Space (punctuation); Finite set; Subspace topology; Linear subspace; Chain (unit); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.03957285186282869,"score_gpt":0.2706639565630444,"score_spread":0.23109110470021574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131834026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31710258,0.051476438,0.3815316,0.051805794,0.0021917203,0.000097482145,0.0017073246,0.00066693383,0.19342007],"genre_scores_gemma":[0.9081338,0.009643649,0.052101314,0.0022960405,0.0038760337,0.0001357036,0.001124435,0.0001590819,0.02252986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968458,0.0011914846,0.00016682214,0.00054966606,0.0008153583,0.0004308548],"domain_scores_gemma":[0.992531,0.00526646,0.00047160272,0.0006082644,0.0005523731,0.000570233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035498887,0.00080872833,0.0010885622,0.002452537,0.0027692467,0.005619618,0.0023439173,0.0027274496,0.0076995296],"category_scores_gemma":[0.0060856678,0.0006126527,0.0014699901,0.0029442317,0.010412052,0.01897666,0.0043517454,0.0054537165,0.0007451703],"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.0000075284106,0.000009253279,0.00011757708,0.000038765153,0.0000038133396,0.00002161663,0.0001744679,0.000499714,0.00008051324,0.99580294,0.0006476942,0.0025961515],"study_design_scores_gemma":[0.0000035768358,0.000008277771,0.000077558536,0.000011944091,0.0000011974138,0.000024872244,0.000121416815,0.0011504627,0.00004353499,0.994852,0.0037007476,0.000004288713],"about_ca_topic_score_codex":0.0010199293,"about_ca_topic_score_gemma":0.0005461349,"teacher_disagreement_score":0.0076995296,"about_ca_system_score_codex":0.0023443142,"about_ca_system_score_gemma":0.000982576,"threshold_uncertainty_score":0.025757432},"labels":[],"label_agreement":null},{"id":"W2132277994","doi":"10.2178/jsl/1245158092","title":"A geometric zero-one law","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Graph Theory Research","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":"McGill University","funders":"","keywords":"Mathematics; Zero (linguistics); Substructure; Combinatorics; Disjoint sets; Bounded function; Ball (mathematics); Graph; Order (exchange); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.03829468688421236,"score_gpt":0.30721491616127056,"score_spread":0.2689202292770582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132277994","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.5485846,0.0011313308,0.32368645,0.00802755,0.00027430494,0.00011222266,0.000698159,0.000816201,0.1166692],"genre_scores_gemma":[0.9820405,0.00016730721,0.011810193,0.00053782336,0.00017493143,0.000058646903,0.0002637517,0.00007602135,0.004870766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957699,0.0008719322,0.00025831946,0.0013991552,0.0011965099,0.0005040916],"domain_scores_gemma":[0.9903971,0.004687193,0.001013649,0.0019212111,0.0013632335,0.0006175252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024347028,0.00040052267,0.0008978097,0.001985803,0.0020043058,0.0023873285,0.0013430932,0.001023002,0.006407815],"category_scores_gemma":[0.0113113,0.00038929403,0.0008604541,0.0009779031,0.010874857,0.008859037,0.003218344,0.0025161696,0.0007015781],"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.000023367349,0.000014801098,0.00083590683,0.000030354766,0.0000060184484,0.00006880515,0.00023358047,0.00060602603,0.00051396526,0.99224865,0.0007577685,0.0046607894],"study_design_scores_gemma":[0.000012902127,0.000035821544,0.00047568773,0.000014781193,0.000010414915,0.00018777866,0.00014922598,0.005240466,0.0006762586,0.9885932,0.004591892,0.000011529392],"about_ca_topic_score_codex":0.0013889769,"about_ca_topic_score_gemma":0.0007962468,"teacher_disagreement_score":0.006407815,"about_ca_system_score_codex":0.0019822887,"about_ca_system_score_gemma":0.00072135235,"threshold_uncertainty_score":0.021436334},"labels":[],"label_agreement":null},{"id":"W2136273143","doi":"10.2178/jsl.7801130","title":"Random reals, the rainbow Ramsey theorem, and arithmetic conservation","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Ramsey's theorem; Mathematics; Ramsey theory; Section (typography); Discrete mathematics; Base (topology); Order (exchange); Combinatorics; Ran; Arithmetic; Computer science","score_opus":0.014036435300935724,"score_gpt":0.22707625445158258,"score_spread":0.21303981915064685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136273143","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.51676536,0.0017847668,0.38809904,0.00574831,0.0002580283,0.00006476176,0.00027694646,0.0004588469,0.086543985],"genre_scores_gemma":[0.97887224,0.00019506407,0.016848065,0.0004035859,0.00010397446,0.000037851984,0.000058296355,0.000030095116,0.0034507366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983,0.0006362022,0.00010206667,0.00038177738,0.0003971966,0.00018264371],"domain_scores_gemma":[0.99448276,0.003554318,0.00057145784,0.0006617585,0.0004726897,0.00025705647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004028586,0.00031144344,0.0005950596,0.0011536403,0.0013903725,0.0017301867,0.0010466808,0.0007696904,0.0036931795],"category_scores_gemma":[0.00673017,0.00034465353,0.0007179285,0.00054519007,0.006272642,0.007298427,0.0026862307,0.0022103083,0.00025069105],"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.000023228013,0.00000976137,0.00031688597,0.000020396817,0.000007247659,0.00006636725,0.00011806648,0.0009360966,0.00076319533,0.9955973,0.00024934535,0.0018921234],"study_design_scores_gemma":[0.000014380363,0.000030952022,0.00052231573,0.000015837191,0.000013064395,0.000101069854,0.000105936655,0.006053239,0.0012301819,0.9893935,0.0025004582,0.00001917697],"about_ca_topic_score_codex":0.0007859992,"about_ca_topic_score_gemma":0.0009301849,"teacher_disagreement_score":0.004028586,"about_ca_system_score_codex":0.0013458098,"about_ca_system_score_gemma":0.0005785619,"threshold_uncertainty_score":0.021305442},"labels":[],"label_agreement":null},{"id":"W2148956539","doi":"10.2178/jsl/1278682213","title":"Quantifier elimination in valued Ore modules","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantifier elimination; Valuation (finance); Mathematics; Quantifier (linguistics); Residue field; Property (philosophy); Independence (probability theory); Field (mathematics); Pure mathematics; Discrete mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.015861606892785717,"score_gpt":0.2604011465616606,"score_spread":0.24453953966887487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148956539","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.7774672,0.00027349906,0.20291193,0.00059130584,0.00007035441,0.000050572362,0.00006399283,0.000338821,0.01823242],"genre_scores_gemma":[0.9807171,0.00008947942,0.013251908,0.00011730549,0.00004692464,0.000019470386,0.00004762824,0.000042992026,0.005667257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880135,0.00022934261,0.00007622633,0.00018682107,0.00045889633,0.0002474184],"domain_scores_gemma":[0.9983754,0.0008298561,0.00015953777,0.0001385644,0.00035587218,0.00014084867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019009254,0.0003372657,0.00053995446,0.00090819714,0.0009750554,0.0016492333,0.00070267887,0.0004977678,0.0020281388],"category_scores_gemma":[0.0021293883,0.0003618775,0.0009993388,0.00042970176,0.0025071632,0.0039661033,0.0016743595,0.0014283655,0.0003589234],"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.00007530779,0.00006841164,0.00087145215,0.000073332274,0.00002770049,0.00059298996,0.0010194913,0.002089944,0.01356756,0.9733628,0.00033797784,0.007913047],"study_design_scores_gemma":[0.000058716574,0.00011716865,0.00073322165,0.000025649219,0.000040721497,0.00061681826,0.00030524065,0.021517692,0.026926486,0.9441174,0.005496986,0.000043896693],"about_ca_topic_score_codex":0.00046401154,"about_ca_topic_score_gemma":0.00039500016,"teacher_disagreement_score":0.0020281388,"about_ca_system_score_codex":0.0007843419,"about_ca_system_score_gemma":0.0006852389,"threshold_uncertainty_score":0.010053158},"labels":[],"label_agreement":null},{"id":"W2149062436","doi":"10.2178/jsl/1190150032","title":"A new “feasible” arithmetic","year":2002,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Realizability; Second-order arithmetic; Recursion (computer science); Peano axioms; Arithmetic; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.04343371595259829,"score_gpt":0.2550560087855378,"score_spread":0.2116222928329395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149062436","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.05957368,0.00066749717,0.8425602,0.0023829816,0.0004407871,0.00012423762,0.00023779043,0.0014441313,0.09256876],"genre_scores_gemma":[0.6810959,0.0005217105,0.2963666,0.00057701155,0.0003412392,0.00020067545,0.00026876223,0.0002813506,0.020346824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831676,0.00043582224,0.000113995884,0.00036902734,0.0005445646,0.0002198328],"domain_scores_gemma":[0.9990067,0.00028825778,0.000097920194,0.00024128889,0.0002561584,0.00010970999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015762944,0.00056025776,0.0005817525,0.0013089448,0.001509083,0.0032545696,0.0013156591,0.0013277997,0.00912218],"category_scores_gemma":[0.0029596584,0.00061314896,0.0011571643,0.0006951632,0.005285093,0.006939059,0.0035225095,0.003557225,0.00167418],"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.000024100182,0.000009703397,0.000042928288,0.000032873788,0.000003525903,0.00004825977,0.00014158535,0.0010194146,0.0022497028,0.99049556,0.00067563733,0.005256625],"study_design_scores_gemma":[0.000026860269,0.00006301839,0.000116002346,0.000048471895,0.00002091072,0.00016146869,0.00009827946,0.014263091,0.004948997,0.94329315,0.036926985,0.000032832464],"about_ca_topic_score_codex":0.0006107899,"about_ca_topic_score_gemma":0.0007332521,"teacher_disagreement_score":0.00912218,"about_ca_system_score_codex":0.001263131,"about_ca_system_score_gemma":0.0010272029,"threshold_uncertainty_score":0.030516803},"labels":[],"label_agreement":null},{"id":"W2149642761","doi":"10.2307/2695103","title":"Number of variables is equivalent to space","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arity; Mathematics; Set (abstract data type); Sequence (biology); PSPACE; Discrete mathematics; Space (punctuation); Turing; Quantifier (linguistics); DSPACE; Universe; Combinatorics; Computational complexity theory; Algorithm; Computer science; Artificial intelligence","score_opus":0.02309942492369837,"score_gpt":0.28764868821992434,"score_spread":0.26454926329622597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149642761","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.69515157,0.0008670338,0.27507222,0.0020839912,0.00013000137,0.00008505598,0.00052990223,0.0009616332,0.025118649],"genre_scores_gemma":[0.9824746,0.000096451135,0.015453265,0.00014460043,0.000051428,0.00004631653,0.00009506744,0.00007399546,0.0015644155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954332,0.0010969031,0.00042201555,0.0011914017,0.0012707709,0.0005858072],"domain_scores_gemma":[0.9616841,0.028377661,0.0026829995,0.004379753,0.0017578055,0.0011176995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023062692,0.00047370192,0.00091667223,0.0010714,0.0012777542,0.004273811,0.001421177,0.0011296221,0.0049215155],"category_scores_gemma":[0.01638693,0.0005905851,0.0010272949,0.0006934918,0.005278516,0.011293972,0.0029572179,0.0022660193,0.000328192],"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.0006560197,0.00012773533,0.0054903924,0.00027615947,0.00009741447,0.000424746,0.0008357378,0.03389703,0.019922668,0.911728,0.0010327639,0.02551134],"study_design_scores_gemma":[0.0000723091,0.00014996044,0.0018883187,0.000053879805,0.000089190755,0.00055613974,0.00028016887,0.058946718,0.02019186,0.91251725,0.0051990384,0.000055138804],"about_ca_topic_score_codex":0.00051911187,"about_ca_topic_score_gemma":0.0005350357,"teacher_disagreement_score":0.0049215155,"about_ca_system_score_codex":0.0014908059,"about_ca_system_score_gemma":0.0007062925,"threshold_uncertainty_score":0.016464114},"labels":[],"label_agreement":null},{"id":"W2150526717","doi":"10.2307/2695105","title":"Cofinitary groups, almost disjoint and dominating families","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Group (periodic table); Genealogy; Computer science; History; Physics; Data mining","score_opus":0.03888326236427211,"score_gpt":0.31860977929055406,"score_spread":0.279726516926282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150526717","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.81462544,0.0008635729,0.11256909,0.0037983062,0.00018991104,0.000046423163,0.00023003948,0.00024918834,0.067428015],"genre_scores_gemma":[0.99071056,0.00007915991,0.007182602,0.00014484381,0.000066109365,0.000016269898,0.00006025006,0.000012003697,0.0017281608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788624,0.0005388002,0.0001341914,0.00053857,0.000512489,0.00038970355],"domain_scores_gemma":[0.99152523,0.0048830663,0.0007264699,0.0013447203,0.000760704,0.0007598209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026271383,0.000327051,0.00070394465,0.0013107412,0.002561055,0.0026324564,0.0007343062,0.001105297,0.0031347987],"category_scores_gemma":[0.005065727,0.00034747398,0.000625646,0.0010092898,0.0069202106,0.0055733253,0.003561448,0.001992593,0.00022491354],"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.0001433463,0.000029679688,0.0018496141,0.00004553996,0.000014587379,0.00017437933,0.00056343566,0.0011638912,0.0024757774,0.98903733,0.00044833333,0.0040541454],"study_design_scores_gemma":[0.000037119495,0.000039245657,0.0009071791,0.000017821309,0.00002138296,0.00033907342,0.00058841635,0.0036614325,0.0029029371,0.98651737,0.004952747,0.0000151686045],"about_ca_topic_score_codex":0.00090812746,"about_ca_topic_score_gemma":0.0011542125,"teacher_disagreement_score":0.0031347987,"about_ca_system_score_codex":0.0016479274,"about_ca_system_score_gemma":0.0006784766,"threshold_uncertainty_score":0.013893783},"labels":[],"label_agreement":null},{"id":"W2152194681","doi":"10.2307/2695043","title":"Elementary properties of power series fields over finite fields","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics; Axiom; Power series; Action (physics); Pure mathematics; Function field; Simple (philosophy); Uniformization (probability theory); Field (mathematics); Property (philosophy); Independence (probability theory); Rational function; Elementary theory; Function (biology); Series (stratigraphy); Algebra over a field; Mathematical analysis; Computer science","score_opus":0.04241540272867443,"score_gpt":0.3007000092058296,"score_spread":0.2582846064771552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152194681","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.9000863,0.00033004134,0.06746779,0.00038732067,0.00004710044,0.00004242143,0.000114514165,0.00016880785,0.031355772],"genre_scores_gemma":[0.9952428,0.00009686608,0.002818054,0.000027165534,0.000046338373,0.000012139357,0.000050730025,0.00001179779,0.0016940669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994879,0.00011813154,0.000041165415,0.000097491655,0.00014195793,0.000113435904],"domain_scores_gemma":[0.99784327,0.0011663621,0.00029612295,0.00024702508,0.00026537277,0.00018183955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013596124,0.00024759496,0.00042688122,0.001068379,0.00072818325,0.0017374313,0.0003681782,0.00036728516,0.0024847882],"category_scores_gemma":[0.0026831604,0.00024800582,0.0004974038,0.0006320414,0.0035394633,0.003843314,0.0009016542,0.0010616947,0.00023624256],"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.00006997922,0.00002570589,0.0017697813,0.00005179344,0.000012753038,0.00025993987,0.00037487378,0.0016189103,0.0046217483,0.98427874,0.00022141072,0.0066944375],"study_design_scores_gemma":[0.000035561967,0.000119948076,0.0028983315,0.000023395309,0.00002292067,0.00048159435,0.00023640055,0.005017637,0.010212859,0.9762151,0.004719387,0.000016765314],"about_ca_topic_score_codex":0.00032164654,"about_ca_topic_score_gemma":0.00023413873,"teacher_disagreement_score":0.0024847882,"about_ca_system_score_codex":0.000782722,"about_ca_system_score_gemma":0.0002788712,"threshold_uncertainty_score":0.008312464},"labels":[],"label_agreement":null},{"id":"W2156168582","doi":"10.2178/jsl.7801150","title":"On the decidability of implicational ticket entailment","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","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":"Decidability; Fragment (logic); Combinatory logic; Logical consequence; Mathematics; Discrete mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.0279169468557467,"score_gpt":0.261768744220187,"score_spread":0.23385179736444028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156168582","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.37121117,0.0017550895,0.5731353,0.0060919756,0.00035991534,0.00036751328,0.0009514106,0.002351936,0.043775722],"genre_scores_gemma":[0.9438529,0.00052296807,0.050253328,0.0007958348,0.00027148228,0.00012051423,0.00053869036,0.00015757822,0.0034866547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99405754,0.0012842282,0.00043169712,0.0014774823,0.001708326,0.0010407976],"domain_scores_gemma":[0.97483885,0.020644974,0.0010590431,0.0012766764,0.0014777257,0.00070279744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006965788,0.000545755,0.0011009895,0.0016877877,0.0025009615,0.005628645,0.0027270308,0.001392612,0.005245613],"category_scores_gemma":[0.01777502,0.0011046671,0.0030276736,0.0015225381,0.006558565,0.008677738,0.00418722,0.006370729,0.00046282413],"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.00037557053,0.00030391317,0.0029412303,0.000328063,0.00009970647,0.0009925349,0.0016237472,0.010493207,0.0050921077,0.9541637,0.0028760738,0.020710107],"study_design_scores_gemma":[0.0001057108,0.00006097411,0.0005351074,0.00007163325,0.00009570142,0.00031950194,0.00032453987,0.04547715,0.0062633012,0.943016,0.003686968,0.00004356078],"about_ca_topic_score_codex":0.0048131202,"about_ca_topic_score_gemma":0.0040442557,"teacher_disagreement_score":0.006965788,"about_ca_system_score_codex":0.003980623,"about_ca_system_score_gemma":0.0031801155,"threshold_uncertainty_score":0.036839068},"labels":[],"label_agreement":null},{"id":"W2157412138","doi":"10.2178/jsl.7803170","title":"The Theory of Tracial Von Neumann Algebras Does Not Have A Model Companion","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Von Neumann architecture; Embedding; Von Neumann algebra; Mathematics; Pure mathematics; Quantifier (linguistics); Quantifier elimination; Model theory; Mathematical economics; Discrete mathematics; Philosophy; Computer science; Epistemology","score_opus":0.06081567080979107,"score_gpt":0.3393238393058795,"score_spread":0.27850816849608845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157412138","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.6607646,0.00093831966,0.16200592,0.0038675652,0.00031601373,0.000095839474,0.00035714032,0.00082505617,0.17082955],"genre_scores_gemma":[0.99134326,0.00009503253,0.0041228235,0.00018860817,0.000063521635,0.000023233153,0.00007396688,0.000028589231,0.004060866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822813,0.0002859067,0.0001122826,0.00044098476,0.0006542716,0.0002783833],"domain_scores_gemma":[0.99661034,0.0012070847,0.00036782608,0.0007347887,0.00060469174,0.00047516642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013415668,0.00040989928,0.0008950121,0.0008819191,0.0022129852,0.004416124,0.0008982547,0.0014958063,0.005888757],"category_scores_gemma":[0.0040830118,0.00044198585,0.0009576785,0.00056170864,0.0053441026,0.009945575,0.0033648722,0.0026657397,0.00058461225],"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.000021010466,0.000014770914,0.00029666902,0.000022738213,0.000007554692,0.00006595125,0.00026476858,0.00034506244,0.00069352536,0.9969015,0.00038801038,0.0009785495],"study_design_scores_gemma":[0.000015260155,0.000051007235,0.00030648473,0.000015641031,0.000016202715,0.00019607838,0.00022672724,0.0055795377,0.002011043,0.9869528,0.0046130843,0.000016125838],"about_ca_topic_score_codex":0.0015358669,"about_ca_topic_score_gemma":0.0011688359,"teacher_disagreement_score":0.005888757,"about_ca_system_score_codex":0.001698517,"about_ca_system_score_gemma":0.0012524686,"threshold_uncertainty_score":0.019699872},"labels":[],"label_agreement":null},{"id":"W2157945276","doi":"10.2178/jsl/1254748693","title":"The strength of the rainbow Ramsey Theorem","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":37,"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":"Ramsey's theorem; Ramsey theory; Converse; Mathematics; Rainbow; Corollary; Combinatorics; Discrete mathematics; Carlson's theorem; Randomness; Constant (computer programming); Injective function; Brouwer fixed-point theorem; Danskin's theorem; Fixed-point theorem; Physics; Computer science; Statistics","score_opus":0.011784069883553738,"score_gpt":0.24186200937785363,"score_spread":0.2300779394942999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157945276","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.5548233,0.0012592421,0.32735392,0.0077133807,0.0003946566,0.000082187005,0.00043723706,0.0008136472,0.107122436],"genre_scores_gemma":[0.9875485,0.000169725,0.008617736,0.00046911673,0.00015213137,0.000042597403,0.000071914415,0.000055670665,0.0028727294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497545,0.001396169,0.00028602796,0.0013844956,0.0013707925,0.0005871656],"domain_scores_gemma":[0.97647494,0.014746151,0.0014390001,0.003910124,0.0020170365,0.001412699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005329707,0.00040240295,0.0012499898,0.0012328335,0.0022249678,0.0034797583,0.0017742536,0.0013368559,0.008621606],"category_scores_gemma":[0.02063236,0.0008108589,0.0008819742,0.00057572016,0.006356212,0.011155939,0.006380169,0.0032286686,0.00071523077],"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.00012926885,0.000027729613,0.0014271927,0.00010388996,0.000035616973,0.00010253742,0.00024615423,0.0022301832,0.002725052,0.985935,0.001289119,0.005748272],"study_design_scores_gemma":[0.000031710144,0.00007047216,0.0007857825,0.000030370751,0.00003428609,0.00027220574,0.00016099165,0.016356496,0.0034085053,0.97501504,0.0037975681,0.000036629088],"about_ca_topic_score_codex":0.00091025943,"about_ca_topic_score_gemma":0.00073208776,"teacher_disagreement_score":0.008621606,"about_ca_system_score_codex":0.0014362166,"about_ca_system_score_gemma":0.0008618375,"threshold_uncertainty_score":0.028842151},"labels":[],"label_agreement":null},{"id":"W2161054195","doi":"10.2178/jsl/1120224719","title":"Lexicographic exponentiation of chains","year":2005,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Lexicographical order; Countable set; Mathematics; Exponentiation; Cartesian product; Focus (optics); Homogeneous; Power (physics); Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.05006869586978464,"score_gpt":0.3446588045126787,"score_spread":0.2945901086428941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161054195","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.54609346,0.0023365146,0.17005485,0.0016411527,0.00071577716,0.00018339863,0.0010867714,0.00058177346,0.27730638],"genre_scores_gemma":[0.9285468,0.00080456975,0.032466687,0.00026467524,0.0002981457,0.00005230961,0.00058374123,0.00014350265,0.036839508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998657,0.00038502293,0.00019794745,0.00022877278,0.00030086387,0.00023042374],"domain_scores_gemma":[0.99753964,0.0010756574,0.0002467265,0.000397817,0.0004797308,0.00026046668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002183,0.00035606403,0.00042358768,0.0015178198,0.0010088172,0.0031562303,0.00035436405,0.00033173818,0.011756251],"category_scores_gemma":[0.0030120197,0.0003404292,0.0003892829,0.0013009958,0.0026476106,0.0043247417,0.0024128282,0.00083207793,0.001719234],"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.00029246302,0.000028775517,0.0012462718,0.00018610817,0.000021391124,0.0006845822,0.0017715972,0.00089672237,0.006723337,0.95855224,0.0020608306,0.027535707],"study_design_scores_gemma":[0.00008068589,0.0001309329,0.0012585608,0.00014095374,0.000042230506,0.00081902713,0.0014964864,0.004489071,0.014499546,0.9061661,0.07083644,0.000039890107],"about_ca_topic_score_codex":0.00061633415,"about_ca_topic_score_gemma":0.0010179324,"teacher_disagreement_score":0.011756251,"about_ca_system_score_codex":0.00082961295,"about_ca_system_score_gemma":0.00040389426,"threshold_uncertainty_score":0.039328516},"labels":[],"label_agreement":null},{"id":"W2163037973","doi":"10.2307/2586689","title":"On the role of implication in formal logic","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"Concordia University","funders":"","keywords":"Finitary; Negation; Mathematics; Proof calculus; Second-order logic; Non-classical logic; Classical logic; Higher-order logic; Predicate logic; Computer science; Discrete mathematics; Calculus (dental); Programming language; Logical consequence; Natural deduction; Description logic; Artificial intelligence","score_opus":0.012738441753293799,"score_gpt":0.2407078262733269,"score_spread":0.2279693845200331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163037973","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18834881,0.0075596655,0.63443685,0.01653398,0.0006022624,0.00008309877,0.00015774128,0.0008369986,0.15144067],"genre_scores_gemma":[0.9542544,0.001041441,0.040070523,0.00075464585,0.00027890442,0.000041361844,0.00004441657,0.00005956225,0.0034547665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973375,0.0013328213,0.00015487878,0.00029028062,0.0005737775,0.00031069823],"domain_scores_gemma":[0.98815364,0.009358086,0.00041658475,0.0007257777,0.0010808035,0.00026514282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005278584,0.00038141332,0.00047387125,0.0012771836,0.0018131395,0.0032144655,0.0010743425,0.0010447844,0.002489281],"category_scores_gemma":[0.008883854,0.0004198668,0.00061450154,0.0008976233,0.012459307,0.008833267,0.002111794,0.0022541764,0.0002983385],"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.000032761644,0.0000099877825,0.00026991806,0.000047176225,0.0000055512824,0.000094626885,0.00033646685,0.0011324,0.00045025419,0.9912465,0.0003751401,0.0059991437],"study_design_scores_gemma":[0.000008756433,0.0000072682683,0.000057778525,0.000015261445,0.000007795691,0.00004975389,0.000035675057,0.003966955,0.00035136257,0.9932562,0.0022379274,0.0000053520266],"about_ca_topic_score_codex":0.002112035,"about_ca_topic_score_gemma":0.001373405,"teacher_disagreement_score":0.005278584,"about_ca_system_score_codex":0.0027044679,"about_ca_system_score_gemma":0.0012843258,"threshold_uncertainty_score":0.027916193},"labels":[],"label_agreement":null},{"id":"W2295043651","doi":"10.1017/jsl.2014.72","title":"HOMOGENEITY AND FIX-POINTS: GOING FORTH!","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Automorphism; Homogeneity (statistics); Homogeneous; Countable set; Mathematics; Automorphism group; Computer science; Discrete mathematics; Combinatorics; Statistics","score_opus":0.043289272169363895,"score_gpt":0.27150557796513153,"score_spread":0.22821630579576763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295043651","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.36213338,0.0019994022,0.4390808,0.0047221,0.000435252,0.000114446986,0.0003130972,0.0009366309,0.19026484],"genre_scores_gemma":[0.96353155,0.00036025918,0.017723128,0.00047067518,0.00015910812,0.000040593448,0.00014128014,0.00025160867,0.017321829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979785,0.0006405278,0.00009486029,0.00043873666,0.00045549095,0.00039189646],"domain_scores_gemma":[0.99405235,0.0026194246,0.00029387756,0.0018542042,0.0007445281,0.00043564182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025620868,0.00046803753,0.0008143779,0.001605135,0.002164327,0.0025316735,0.0007014427,0.0011333396,0.008412179],"category_scores_gemma":[0.005645328,0.0005530197,0.0012624104,0.00091043464,0.008354708,0.007769096,0.0051915324,0.0032633706,0.0010320039],"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.000050486993,0.000012319212,0.0004082645,0.0000339029,0.000012150146,0.00011092981,0.000521892,0.0007193522,0.0013013146,0.9907857,0.0006617737,0.0053819884],"study_design_scores_gemma":[0.000011611304,0.000036197416,0.00025009707,0.0000253613,0.000013950412,0.00010269789,0.00037343835,0.0017200153,0.0032976207,0.9870449,0.007107552,0.00001656041],"about_ca_topic_score_codex":0.001656142,"about_ca_topic_score_gemma":0.0012200507,"teacher_disagreement_score":0.008412179,"about_ca_system_score_codex":0.0015668814,"about_ca_system_score_gemma":0.0005952337,"threshold_uncertainty_score":0.028141558},"labels":[],"label_agreement":null},{"id":"W2405635038","doi":"10.1017/jsl.2014.40","title":"SEMILATTICES AND THE RAMSEY PROPERTY","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Class (philosophy); Automorphism; Bounded function; Combinatorics; Ergodic theory; Limit (mathematics); Interpretation (philosophy); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.10405579147128327,"score_gpt":0.3456146284198892,"score_spread":0.24155883694860594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405635038","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.9300765,0.0003806431,0.021602768,0.00041518008,0.00003432073,0.000018184142,0.00011858456,0.00012982423,0.04722392],"genre_scores_gemma":[0.9963291,0.000042774733,0.0017471524,0.000024759303,0.000017542397,0.0000056491813,0.000032599415,0.0000057266293,0.0017946556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965143,0.000069449095,0.000016225284,0.00006256803,0.0001112884,0.000089082525],"domain_scores_gemma":[0.99910396,0.0003557293,0.00014104624,0.00008954439,0.00011444604,0.00019527205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006081379,0.00019003153,0.00024006561,0.00086388935,0.0010213981,0.0012986121,0.00026268497,0.00031596664,0.0040320316],"category_scores_gemma":[0.0013059077,0.00016152115,0.0002575893,0.0002884326,0.0021704463,0.0015210913,0.00068095105,0.0005872611,0.00025329375],"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.00009465526,0.00003351111,0.002124556,0.000036792084,0.000008513921,0.00010402015,0.00051064166,0.0023172768,0.00619875,0.9825523,0.0005303242,0.005488735],"study_design_scores_gemma":[0.00003066072,0.00006443483,0.003589047,0.000028825065,0.000012517665,0.0002926957,0.00046526114,0.020179901,0.0058757924,0.9632055,0.0062288693,0.000026569664],"about_ca_topic_score_codex":0.0019830237,"about_ca_topic_score_gemma":0.0025273159,"teacher_disagreement_score":0.0040320316,"about_ca_system_score_codex":0.00088967045,"about_ca_system_score_gemma":0.0004075333,"threshold_uncertainty_score":0.013488531},"labels":[],"label_agreement":null},{"id":"W2466224125","doi":"10.1017/jsl.2018.87","title":"AMALGAMABLE DIAGRAM SHAPES","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diagram; Endomorphism; Decidability; Mathematics; Combinatorics; Idempotence; Simple (philosophy); Discrete mathematics; Pure mathematics","score_opus":0.01937334384823893,"score_gpt":0.24700883059446954,"score_spread":0.2276354867462306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466224125","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.2579488,0.00033121562,0.6484322,0.0004797661,0.00031769567,0.00010484668,0.00043793904,0.003206303,0.088741176],"genre_scores_gemma":[0.9278285,0.00011213637,0.061566204,0.00013003159,0.000055151067,0.000074815776,0.0002847357,0.0002708861,0.0096775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899596,0.00015927668,0.00009634186,0.00036000478,0.00023232198,0.00015608266],"domain_scores_gemma":[0.99856734,0.00050333847,0.00009910382,0.00032795224,0.00029685034,0.00020532086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670343,0.00031226344,0.00028627733,0.00079403096,0.0010296126,0.002172271,0.0007639705,0.0008683499,0.0072676195],"category_scores_gemma":[0.0018277394,0.00036184833,0.00081415597,0.00048251156,0.0022216325,0.0043590637,0.002599324,0.0012500999,0.0009888428],"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.0000681515,0.000042857526,0.0009291406,0.000056545345,0.000010816225,0.00047515202,0.0007097724,0.001318656,0.0102532385,0.96872354,0.0010383215,0.01637374],"study_design_scores_gemma":[0.00002149958,0.00009357874,0.00047852928,0.00005765076,0.00003542819,0.0007481292,0.00046134111,0.013381093,0.03155841,0.9100931,0.043029424,0.000041673844],"about_ca_topic_score_codex":0.00043768765,"about_ca_topic_score_gemma":0.00042864218,"teacher_disagreement_score":0.0072676195,"about_ca_system_score_codex":0.00064416864,"about_ca_system_score_gemma":0.00038800342,"threshold_uncertainty_score":0.024312615},"labels":[],"label_agreement":null},{"id":"W2594069757","doi":"10.2178/jsl/1174668399","title":"Forcing indestructibility of set-theoretic axioms","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Axiom; Forcing (mathematics); Consistency (knowledge bases); Countable set; Hierarchy; Set (abstract data type); Mathematics; Set theory; Zermelo–Fraenkel set theory; Mathematical economics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Axiom of choice; Geometry; Mathematical analysis; Programming language; Economics","score_opus":0.05022263839091771,"score_gpt":0.3662132275233379,"score_spread":0.3159905891324202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594069757","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.44436583,0.00074068824,0.47993493,0.0036813202,0.00038017984,0.00013444724,0.0006541555,0.0013899665,0.06871841],"genre_scores_gemma":[0.96051043,0.00019555466,0.03419937,0.00041659124,0.0002052235,0.00007640078,0.00030544112,0.00010522374,0.003985972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404377,0.0013793521,0.0006540372,0.0014055993,0.0018068677,0.00071046007],"domain_scores_gemma":[0.9721797,0.013801917,0.001705623,0.008241901,0.0030711184,0.0009997938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007161429,0.00048151222,0.0012925614,0.0024093646,0.0022355597,0.003770972,0.002584223,0.0016275529,0.0039033678],"category_scores_gemma":[0.019651728,0.0010321008,0.0023231988,0.0014586791,0.010221856,0.0074751065,0.0062440424,0.00605497,0.00047770335],"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.00008639145,0.000052750434,0.0014589078,0.00009799063,0.000055615175,0.00033038144,0.0007583053,0.0026161543,0.003750028,0.9821576,0.0004964819,0.008139242],"study_design_scores_gemma":[0.00003547625,0.00006517032,0.0008526418,0.000034915745,0.00004291967,0.00040599328,0.00019597328,0.008646678,0.007747527,0.9779766,0.003965397,0.000030693787],"about_ca_topic_score_codex":0.0007851701,"about_ca_topic_score_gemma":0.0008298118,"teacher_disagreement_score":0.007161429,"about_ca_system_score_codex":0.0017313897,"about_ca_system_score_gemma":0.001258299,"threshold_uncertainty_score":0.037873685},"labels":[],"label_agreement":null},{"id":"W2594244112","doi":"10.2307/2586531","title":"A finite basis theorem for residually finite, congruence meet-semidistributive varieties","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":41,"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":"Congruence (geometry); Mathematics; Variety (cybernetics); Pure mathematics; Finitely-generated abelian group; Algebra over a field; Discrete mathematics; Geometry","score_opus":0.017192324627891224,"score_gpt":0.2566598042498143,"score_spread":0.2394674796219231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594244112","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.22411618,0.0006462094,0.7172332,0.00092760974,0.00014114384,0.00015713315,0.00047618698,0.00082574866,0.05547664],"genre_scores_gemma":[0.89445806,0.00016136534,0.09748193,0.00017688845,0.00013138392,0.00014193286,0.000531802,0.00009737828,0.006819222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984334,0.00028168884,0.000116960226,0.00034220854,0.00060631393,0.00021934185],"domain_scores_gemma":[0.9967945,0.0016307478,0.00016555913,0.00045364804,0.0007117001,0.00024393381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019583819,0.00025423127,0.0008601681,0.0010755633,0.0012544906,0.003569064,0.00097545166,0.0006263541,0.0059112287],"category_scores_gemma":[0.0048103645,0.000341291,0.0010607728,0.0008339226,0.0036598342,0.0044372776,0.0024257887,0.0019266878,0.0010543083],"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.00006890164,0.00003289652,0.00051323057,0.00004243854,0.00000935211,0.00006984399,0.00033123101,0.0011226921,0.0021879144,0.9861107,0.00053254433,0.008978181],"study_design_scores_gemma":[0.000046043806,0.000057789664,0.000371419,0.000026043173,0.000011832584,0.0001250133,0.00021450732,0.015354115,0.0061178734,0.97007924,0.0075772186,0.000018859811],"about_ca_topic_score_codex":0.000952405,"about_ca_topic_score_gemma":0.00079242466,"teacher_disagreement_score":0.0059112287,"about_ca_system_score_codex":0.0010838334,"about_ca_system_score_gemma":0.0007725054,"threshold_uncertainty_score":0.019775033},"labels":[],"label_agreement":null},{"id":"W2594338555","doi":"10.2178/jsl.7802100","title":"Unexpected imaginaries in valued fields with analytic structure","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"The Imaginary; Code (set theory); Algebraic number; Algebra over a field; Field (mathematics); Mathematics; Pure mathematics; Algebraic structure; Theoretical physics; Computer science; Mathematical analysis; Physics; Programming language; Psychology; Psychoanalysis","score_opus":0.017701862650279784,"score_gpt":0.2909146382977195,"score_spread":0.27321277564743973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594338555","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.62091666,0.00078383076,0.17785084,0.009174977,0.00037106793,0.000051930503,0.00022878064,0.00055255776,0.19006924],"genre_scores_gemma":[0.99057406,0.000079915364,0.005772349,0.00013489532,0.00003311463,0.000014797525,0.00003039874,0.000039799645,0.0033208325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906486,0.00031711836,0.000043424694,0.00011538501,0.00027154465,0.00018762017],"domain_scores_gemma":[0.9970054,0.001710689,0.00023357665,0.00047091802,0.00030519709,0.00027420273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016143157,0.0003487284,0.00045864287,0.001253671,0.0018841245,0.0043368214,0.0006366079,0.001397456,0.0040882714],"category_scores_gemma":[0.005922579,0.00030708834,0.00044577583,0.00074278,0.013519164,0.009027678,0.00260671,0.0031448891,0.00029628008],"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.00002758171,0.000004140096,0.00010709123,0.00001350466,0.0000016473223,0.00015437603,0.0006860882,0.00032488583,0.0006990359,0.9968418,0.00021536952,0.0009244541],"study_design_scores_gemma":[0.00001564455,0.00001254914,0.00011226389,0.000012299447,0.000003406169,0.00017312601,0.0005896597,0.0015840575,0.00086262793,0.9922347,0.0043883924,0.00001118284],"about_ca_topic_score_codex":0.0006615496,"about_ca_topic_score_gemma":0.00045750733,"teacher_disagreement_score":0.0043368214,"about_ca_system_score_codex":0.0017277974,"about_ca_system_score_gemma":0.00046669185,"threshold_uncertainty_score":0.013676643},"labels":[],"label_agreement":null},{"id":"W2601794338","doi":"10.1017/jsl.2016.43","title":"DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS","year":2017,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cone (formal languages); Degree (music); Mathematics; Isomorphism (crystallography); Limit (mathematics); Turing; Discrete mathematics; Combinatorics; Turing machine; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Physics","score_opus":0.04343881680507022,"score_gpt":0.2852791939979936,"score_spread":0.2418403771929234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601794338","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.8099624,0.00028939964,0.16233678,0.0012677604,0.00003613828,0.000093665876,0.00036371927,0.00033231007,0.02531791],"genre_scores_gemma":[0.98589605,0.00008042474,0.01175801,0.00007661122,0.000026990087,0.000031371575,0.00017716447,0.000024420418,0.0019288358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968912,0.0007233848,0.00021030607,0.0005936123,0.0009387767,0.0006426454],"domain_scores_gemma":[0.9870451,0.00834802,0.00095697516,0.0011795824,0.0010244476,0.0014459909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027635535,0.0003442895,0.0007560898,0.0017781969,0.0014587048,0.005426609,0.0012353332,0.000876643,0.0041990425],"category_scores_gemma":[0.0076258234,0.00045078478,0.0012656244,0.0010901314,0.0056083105,0.007816983,0.0032513523,0.0028451558,0.00023785833],"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.000114421266,0.000050045765,0.0026566926,0.00006391849,0.00001719162,0.00013833714,0.0005951422,0.0097480705,0.0022460474,0.9793068,0.00039248922,0.0046709036],"study_design_scores_gemma":[0.000039475734,0.00007756842,0.002094502,0.00003082235,0.000023929138,0.00016473481,0.00043196164,0.041197214,0.0037343635,0.9496726,0.0024902392,0.000042559634],"about_ca_topic_score_codex":0.0035230098,"about_ca_topic_score_gemma":0.0024763637,"teacher_disagreement_score":0.005426609,"about_ca_system_score_codex":0.0036747954,"about_ca_system_score_gemma":0.0010671548,"threshold_uncertainty_score":0.026662588},"labels":[],"label_agreement":null},{"id":"W2609834214","doi":"10.1017/jsl.2019.73","title":"DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Karlova v Praze","keywords":"Idempotence; Congruence (geometry); Mathematics; Variety (cybernetics); Sequence (biology); Class (philosophy); Polynomial; Time complexity; Type (biology); Path (computing); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03510935235772742,"score_gpt":0.2733136988233666,"score_spread":0.23820434646563918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609834214","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.79695886,0.00020100917,0.1919712,0.0017039225,0.00008094309,0.0002760512,0.00071895716,0.0007328912,0.007356099],"genre_scores_gemma":[0.9493758,0.00012181009,0.047644123,0.00015104312,0.00007297548,0.000078519246,0.0009726585,0.00007962571,0.0015033644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949986,0.0014092523,0.00043464344,0.0012091554,0.000951931,0.0009964689],"domain_scores_gemma":[0.96914816,0.02524499,0.0015520747,0.0017108208,0.0012130894,0.0011309215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005007753,0.0005271992,0.0014113561,0.0010946029,0.002083061,0.0060883565,0.0019493131,0.0023106798,0.0067405477],"category_scores_gemma":[0.02111426,0.0007729288,0.0024557854,0.0009816001,0.0046255253,0.012344375,0.0028641596,0.003269456,0.00060901465],"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.0025660072,0.00060756976,0.011334115,0.0005668984,0.00021672813,0.0012556602,0.001223075,0.10273509,0.019859036,0.8173898,0.0034186488,0.03882748],"study_design_scores_gemma":[0.0002248327,0.00021837717,0.00087010977,0.000045187324,0.00006732206,0.00024341553,0.0006278646,0.1692129,0.018877862,0.8076683,0.0018668665,0.00007696687],"about_ca_topic_score_codex":0.002209399,"about_ca_topic_score_gemma":0.002406003,"teacher_disagreement_score":0.0067405477,"about_ca_system_score_codex":0.0023437666,"about_ca_system_score_gemma":0.0023234356,"threshold_uncertainty_score":0.026483893},"labels":[],"label_agreement":null},{"id":"W2768103053","doi":"10.1017/jsl.2018.84","title":"SPACES OF TYPES IN POSITIVE MODEL THEORY","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":10,"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":"Negation; Countable set; Space (punctuation); Distributive property; Duality (order theory); Mathematics; Model theory; Pure mathematics; Algebra over a field; Computer science; Discrete mathematics","score_opus":0.025374211708487426,"score_gpt":0.3180061572629725,"score_spread":0.2926319455544851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768103053","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.2829597,0.0027704518,0.6130717,0.003407932,0.000607688,0.00010464504,0.0007341114,0.00053484703,0.09580896],"genre_scores_gemma":[0.9582981,0.0005200463,0.03278119,0.00024197732,0.00017722342,0.00009498135,0.00018650954,0.0000830967,0.007616951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975084,0.0009857933,0.00014739952,0.00032872267,0.000780311,0.0002492904],"domain_scores_gemma":[0.9977011,0.000997883,0.0002647652,0.00031300465,0.00044356872,0.00027980335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025018193,0.00049785373,0.00080115016,0.0025280481,0.0018053185,0.0067584165,0.0009846085,0.0010558431,0.005018275],"category_scores_gemma":[0.0031956986,0.000504662,0.001199877,0.001975493,0.007573058,0.010053978,0.004197087,0.0023607407,0.0005307093],"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.0000070107462,0.0000030112958,0.0000581124,0.000010721129,0.0000029625467,0.00002027358,0.000104506296,0.00033843543,0.00016666393,0.99839956,0.00010578872,0.0007830651],"study_design_scores_gemma":[0.000006671957,0.000011870004,0.00006800089,0.000012455089,0.0000055909686,0.00008134071,0.00013717457,0.0027605088,0.00035700123,0.9933821,0.0031695422,0.000007780738],"about_ca_topic_score_codex":0.0008308657,"about_ca_topic_score_gemma":0.0006382993,"teacher_disagreement_score":0.0067584165,"about_ca_system_score_codex":0.0017944607,"about_ca_system_score_gemma":0.0010168237,"threshold_uncertainty_score":0.016787767},"labels":[],"label_agreement":null},{"id":"W2798864197","doi":"10.1017/jsl.2020.64","title":"STATIONARY REFLECTION","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic 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 Toronto","funders":"","keywords":"Reflection (computer programming); Consistency (knowledge bases); Mathematics; Upper and lower bounds; Mathematical analysis; Computer science; Geometry","score_opus":0.135059711700596,"score_gpt":0.3842291565934014,"score_spread":0.2491694448928054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798864197","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.2988385,0.0008769303,0.6397983,0.0025747612,0.0007666014,0.00021079791,0.00043661764,0.0020662365,0.05443129],"genre_scores_gemma":[0.9398577,0.00020593122,0.05282637,0.0007174919,0.000393912,0.000114297065,0.00034170022,0.00050210534,0.0050404677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9828377,0.0046685827,0.0009155703,0.004264078,0.0049803127,0.0023339116],"domain_scores_gemma":[0.91447955,0.040981498,0.004628252,0.023568349,0.01271444,0.0036279096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0128128575,0.0010302057,0.0029294242,0.0031405736,0.0027426824,0.00561778,0.005615407,0.002920602,0.009731444],"category_scores_gemma":[0.062701575,0.0016143556,0.0031867581,0.001998634,0.009798253,0.014230589,0.011136202,0.009268841,0.0018392692],"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.000856357,0.00015229345,0.0057466123,0.0003671891,0.00018555783,0.0006960051,0.0009680825,0.012055816,0.01519152,0.9370957,0.0032088086,0.023476211],"study_design_scores_gemma":[0.00012236045,0.00031133878,0.0014026127,0.00015978381,0.00018267959,0.00073037704,0.0004585013,0.07954776,0.01975802,0.8915712,0.005640026,0.000115356845],"about_ca_topic_score_codex":0.0011825665,"about_ca_topic_score_gemma":0.00090319983,"teacher_disagreement_score":0.0128128575,"about_ca_system_score_codex":0.0016643672,"about_ca_system_score_gemma":0.0020712772,"threshold_uncertainty_score":0.06776166},"labels":[],"label_agreement":null},{"id":"W2898117887","doi":"10.1017/jsl.2020.46","title":"THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":10,"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":"Countable set; Combinatorics; Mathematics; Order (exchange); Rank (graph theory); Hausdorff space; Discrete mathematics; Sentence; Sigma; Physics; Computer science; Artificial intelligence","score_opus":0.08827320045250713,"score_gpt":0.28530182910994717,"score_spread":0.19702862865744003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898117887","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.93421197,0.0002749805,0.052146353,0.00082414225,0.000025528143,0.000046714664,0.0007572035,0.00026927414,0.011443845],"genre_scores_gemma":[0.9891803,0.00009894783,0.00783337,0.000070122434,0.000060621016,0.000039378097,0.0006725389,0.000049197795,0.0019954995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974139,0.00058226055,0.00020845814,0.00034573072,0.0010339123,0.00041572817],"domain_scores_gemma":[0.9865481,0.009503255,0.0013344665,0.000725878,0.0010925554,0.0007956446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016266559,0.00040672853,0.000749269,0.0019339168,0.0011956498,0.004371075,0.00088252773,0.0008628614,0.0069104456],"category_scores_gemma":[0.01072682,0.00047722613,0.0010070278,0.0011432045,0.0023178756,0.007841727,0.0016370612,0.001390928,0.00040207276],"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.0010054418,0.00026240473,0.015794374,0.00059449737,0.0001833735,0.0007683143,0.002952721,0.058982514,0.015883327,0.876832,0.003908602,0.022832548],"study_design_scores_gemma":[0.00007755084,0.00018268796,0.009376008,0.00005933544,0.00009631203,0.0003681373,0.0008365751,0.15531817,0.009856343,0.81984115,0.0038683359,0.00011937617],"about_ca_topic_score_codex":0.0017544215,"about_ca_topic_score_gemma":0.0021223703,"teacher_disagreement_score":0.0069104456,"about_ca_system_score_codex":0.0024820617,"about_ca_system_score_gemma":0.0008809067,"threshold_uncertainty_score":0.023117721},"labels":[],"label_agreement":null},{"id":"W2908819577","doi":"10.1017/jsl.2021.65","title":"FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; University of Otago","keywords":"Metric (unit); Subclass; Class (philosophy); Mathematics; Pure mathematics; Discrete mathematics; Computer science; Artificial intelligence; Engineering; Operations management","score_opus":0.11576794836638107,"score_gpt":0.37821398548180213,"score_spread":0.262446037115421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908819577","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.7015158,0.0014377402,0.22447556,0.0012987407,0.00006806459,0.000040859148,0.00033635777,0.00021562997,0.07061131],"genre_scores_gemma":[0.9882521,0.00025009486,0.0075696176,0.00010484991,0.000070620445,0.000032125663,0.0000825687,0.000022212256,0.0036158494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863225,0.00028217628,0.00008498509,0.00027923583,0.0005179558,0.00020334707],"domain_scores_gemma":[0.99657685,0.0015182124,0.0005388909,0.00043813052,0.00052144926,0.00040652472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020481483,0.00032580897,0.0006950871,0.002177814,0.0015317285,0.00218483,0.00060210447,0.00088862,0.0048566107],"category_scores_gemma":[0.0068164165,0.00030822933,0.0005254538,0.0011688209,0.003933927,0.0048889583,0.002556767,0.0015548689,0.00031039203],"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.000009597246,0.000006070435,0.00044218358,0.0000115698995,0.000005261355,0.00007265876,0.0001656434,0.0017636827,0.000663078,0.9947543,0.00014278795,0.0019631556],"study_design_scores_gemma":[0.0000054392385,0.000021791322,0.00073149597,0.0000137319275,0.0000046545574,0.00017760076,0.00012918476,0.015055556,0.00086734013,0.9806551,0.002326671,0.000011427656],"about_ca_topic_score_codex":0.0010740412,"about_ca_topic_score_gemma":0.0007746654,"teacher_disagreement_score":0.0048566107,"about_ca_system_score_codex":0.001554057,"about_ca_system_score_gemma":0.00037956797,"threshold_uncertainty_score":0.016246974},"labels":[],"label_agreement":null},{"id":"W2926532848","doi":"10.1017/jsl.2019.20","title":"STABLE ORDERED UNION ULTRAFILTERS AND cov $\\left( \\mathcal{M} \\right) &lt; \\mathfrak{c}$","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"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":"York University","keywords":"Ultrafilter; Combinatorics; Mathematics; Disjoint sets; Axiom; Omega; Disjoint union (topology); Discrete mathematics; Physics; Geometry","score_opus":0.02096630639013212,"score_gpt":0.28952999992220824,"score_spread":0.2685636935320761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926532848","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.3481496,0.0012339208,0.5302237,0.002485926,0.0001858648,0.00008456803,0.0009430455,0.0010806359,0.115612686],"genre_scores_gemma":[0.9571669,0.00019624003,0.03125066,0.00023419799,0.00011858835,0.000060957314,0.00038894787,0.000081959704,0.010501598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764544,0.0006399746,0.0001405713,0.0004562707,0.000671156,0.00044656429],"domain_scores_gemma":[0.99668366,0.0015145224,0.0003025312,0.00050890056,0.00067686825,0.00031352366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459228,0.0004520609,0.00074595964,0.0015599293,0.003265268,0.0034630746,0.0010332217,0.0010486825,0.006924196],"category_scores_gemma":[0.0032219575,0.0005525205,0.0012297748,0.0011535068,0.00506153,0.0072289095,0.002933968,0.0020508636,0.00070445664],"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.000031994055,0.000013684778,0.00019780257,0.000015578777,0.0000056872495,0.000075163,0.00026012736,0.0004259139,0.00057918567,0.99660885,0.00036260503,0.0014234058],"study_design_scores_gemma":[0.00005300977,0.000036888778,0.0005526311,0.00003071217,0.00002802403,0.00017112956,0.00041378516,0.012489024,0.0038966443,0.9735822,0.0087127965,0.0000331865],"about_ca_topic_score_codex":0.006423162,"about_ca_topic_score_gemma":0.0065825055,"teacher_disagreement_score":0.006924196,"about_ca_system_score_codex":0.0030085624,"about_ca_system_score_gemma":0.00090686814,"threshold_uncertainty_score":0.023163676},"labels":[],"label_agreement":null},{"id":"W2943660833","doi":"10.1017/jsl.2019.26","title":"AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; Massey University; Russian Science Foundation; Kazan Federal University; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Algebraic structure; Computer science; Presentation (obstetrics); Set (abstract data type); Automaton; Turing machine; Algebra over a field; Discrete mathematics; Mathematics; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004713833986705237,"score_gpt":0.20536240274780657,"score_spread":0.20064856876110132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943660833","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.52399695,0.00047050734,0.41468254,0.002843398,0.00017845523,0.00015970328,0.0008646043,0.000977241,0.055826608],"genre_scores_gemma":[0.9476892,0.000119782315,0.043622952,0.00016339529,0.00013629785,0.000109290544,0.00052795,0.00006521905,0.0075660804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691975,0.0007448606,0.00020910494,0.00078997115,0.0009604702,0.000375772],"domain_scores_gemma":[0.9903964,0.005210512,0.0010337027,0.0014682228,0.0013452423,0.0005459609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014231103,0.0003404188,0.00056150975,0.000915046,0.0018437919,0.0035794606,0.0012549709,0.0011579423,0.0072241197],"category_scores_gemma":[0.0077188774,0.00046738793,0.0012820855,0.00089209224,0.004456454,0.0061239097,0.002391887,0.0025951157,0.0006361197],"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.000076874014,0.000055665863,0.0004020683,0.000056215034,0.000010780818,0.00011927128,0.00035109613,0.0061511467,0.002110171,0.98470324,0.0006012376,0.0053622406],"study_design_scores_gemma":[0.000025871788,0.000027379896,0.00016074098,0.000012813451,0.000008657836,0.000104925544,0.0000997269,0.0203959,0.0018761716,0.9744323,0.0028400652,0.000015431848],"about_ca_topic_score_codex":0.0011230605,"about_ca_topic_score_gemma":0.0012535397,"teacher_disagreement_score":0.0072241197,"about_ca_system_score_codex":0.0017525143,"about_ca_system_score_gemma":0.0012374034,"threshold_uncertainty_score":0.02416706},"labels":[],"label_agreement":null},{"id":"W2958785924","doi":"10.1017/jsl.2019.49","title":"A NEW MINIMAL NON-<i>σ</i>-SCATTERED LINEAR ORDER","year":2019,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Order (exchange); Type (biology); Mathematics; Mathematical analysis; Geology; Economics","score_opus":0.02769602480149027,"score_gpt":0.3215030904183239,"score_spread":0.2938070656168337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958785924","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.6114054,0.0005341717,0.22554836,0.0011846937,0.00021527971,0.00010284579,0.00073087576,0.0008715919,0.15940669],"genre_scores_gemma":[0.9464686,0.000113956594,0.032268394,0.0002238946,0.00006432373,0.000027584756,0.00052474,0.00010258964,0.02020585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996718,0.000036527905,0.000031967884,0.00008052253,0.00009486561,0.000084359766],"domain_scores_gemma":[0.99929774,0.000100397054,0.000064712556,0.00010887588,0.00019855105,0.00022975045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030141388,0.00023265177,0.00041495464,0.00072596123,0.000977941,0.0017903834,0.00045058827,0.0003843659,0.0059865634],"category_scores_gemma":[0.00064359023,0.00025256522,0.00042006595,0.0005132351,0.0014470876,0.0016828666,0.0012313935,0.0010543007,0.0008458791],"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.00017835907,0.000088968314,0.0019334556,0.00013170627,0.000016579239,0.00063963386,0.0005718616,0.0014542778,0.025579935,0.9547986,0.0017825823,0.012823973],"study_design_scores_gemma":[0.000095157,0.00041693542,0.0023334755,0.000065536624,0.000041974647,0.0013745321,0.0010658156,0.015197644,0.03219059,0.90853167,0.038628746,0.000057868416],"about_ca_topic_score_codex":0.0008994126,"about_ca_topic_score_gemma":0.0017050146,"teacher_disagreement_score":0.0059865634,"about_ca_system_score_codex":0.00077354594,"about_ca_system_score_gemma":0.00078019715,"threshold_uncertainty_score":0.020027101},"labels":[],"label_agreement":null},{"id":"W2963453271","doi":"10.1017/jsl.2014.20","title":"THE COUNTERPARTS TO STATEMENTS THAT ARE EQUIVALENT TO THE CONTINUUM HYPOTHESIS","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"University of Toronto","funders":"","keywords":"Sigma; Mathematics; Partition (number theory); Continuum hypothesis; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.2258875682696184,"score_gpt":0.41276222620025915,"score_spread":0.18687465793064076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963453271","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.53075504,0.0006309279,0.14273947,0.007085461,0.0016380139,0.0002177813,0.0008507813,0.0007443714,0.31533816],"genre_scores_gemma":[0.9751872,0.00015099208,0.012916425,0.001155685,0.00033591708,0.00010733279,0.00036647334,0.000082121165,0.009697755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976846,0.00061365194,0.00014888594,0.00060827256,0.00046605486,0.0004784247],"domain_scores_gemma":[0.99554354,0.0023845634,0.00046895567,0.0006336673,0.0005994857,0.0003698857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279299,0.0003651548,0.0005400095,0.0010086221,0.0026728637,0.0032812592,0.0012281723,0.0019100487,0.011876651],"category_scores_gemma":[0.0072558704,0.00045705054,0.0010656075,0.0008278563,0.0081994925,0.0064194473,0.0031472177,0.0046244604,0.00084911217],"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.000035885747,0.000021884236,0.00009448326,0.000021480226,0.000004429682,0.00008276734,0.00019908702,0.0002122952,0.00057698676,0.9974342,0.00048350863,0.0008329892],"study_design_scores_gemma":[0.00004273956,0.000028180806,0.00031591227,0.000017081702,0.000009382969,0.00011151594,0.00030447348,0.0015781875,0.0014732239,0.9918,0.0043028565,0.000016493997],"about_ca_topic_score_codex":0.0008454122,"about_ca_topic_score_gemma":0.0009860665,"teacher_disagreement_score":0.011876651,"about_ca_system_score_codex":0.0016983738,"about_ca_system_score_gemma":0.0007672946,"threshold_uncertainty_score":0.039731324},"labels":[],"label_agreement":null},{"id":"W2963944370","doi":"10.1017/jsl.2018.10","title":"CONSTRUCTING TYPES IN DIFFERENTIALLY CLOSED FIELDS THAT ARE ANALYSABLE IN THE CONSTANTS","year":2018,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Algebraic structures and combinatorial models","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":"Combinatorics; Rank (graph theory); Type (biology); Physics; Base (topology); Canonical form; Constant (computer programming); Mathematics; Mathematical analysis; Pure mathematics; Biology","score_opus":0.06778004490792747,"score_gpt":0.3185973889288821,"score_spread":0.2508173440209547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963944370","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.5935259,0.0003908857,0.36607143,0.0008152283,0.00016509026,0.00010572147,0.00038863724,0.00089445827,0.037642654],"genre_scores_gemma":[0.92760104,0.00021402916,0.062159244,0.00011279103,0.00006391897,0.000058523026,0.00023156022,0.00017197398,0.009386922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989773,0.0002405849,0.00006234536,0.00020103999,0.00030765994,0.00021114026],"domain_scores_gemma":[0.99783796,0.0010245066,0.00031287837,0.00039547574,0.0002598091,0.0001694762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016005094,0.0004915136,0.0005418866,0.0022224265,0.0018997913,0.0044892137,0.0008714225,0.00069471984,0.0024487856],"category_scores_gemma":[0.0042567835,0.0005637938,0.0013724477,0.001557218,0.0056550526,0.0052763415,0.0019813445,0.0023346127,0.00039049552],"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.00004780814,0.000018740177,0.00103855,0.00002469524,0.000008981992,0.00010085584,0.0005992023,0.002627027,0.0019208139,0.98797286,0.00023611459,0.005404387],"study_design_scores_gemma":[0.0000111158715,0.000033170865,0.0003943778,0.000029846276,0.000026184267,0.0000829658,0.000471382,0.016032888,0.0057082963,0.9726226,0.0045589204,0.000028185648],"about_ca_topic_score_codex":0.00219381,"about_ca_topic_score_gemma":0.003318254,"teacher_disagreement_score":0.0044892137,"about_ca_system_score_codex":0.0033314687,"about_ca_system_score_gemma":0.0016802275,"threshold_uncertainty_score":0.02417159},"labels":[],"label_agreement":null},{"id":"W3018860897","doi":"10.1017/jsl.2021.31","title":"THE RELATIVIZED LASCAR GROUPS, TYPE-AMALGAMATION, AND ALGEBRAICITY","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Algebraic Geometry and Number 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":"Toronto Metropolitan University","funders":"Samsung; European Commission","keywords":"Type (biology); Mathematics; Pure mathematics; Computer science; Algebra over a field; Biology; Ecology","score_opus":0.039874542352532245,"score_gpt":0.30056704311897847,"score_spread":0.26069250076644623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018860897","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.73727673,0.0013536849,0.15344843,0.0035225514,0.00037242315,0.000055853805,0.0001326679,0.00029248645,0.103545256],"genre_scores_gemma":[0.9912424,0.00014959462,0.00606723,0.00010663217,0.000117802425,0.00001678746,0.000031513617,0.00001388394,0.0022541643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827707,0.00061863393,0.00010106426,0.00030619866,0.00046374736,0.00023328314],"domain_scores_gemma":[0.9978613,0.0007543908,0.00039209734,0.0004641749,0.0002537591,0.00027429918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015503154,0.00037664163,0.00050680933,0.001507888,0.0015785249,0.0030391263,0.0007086519,0.00074911123,0.003919358],"category_scores_gemma":[0.0026724823,0.00020791162,0.00073585816,0.00089137594,0.008660014,0.005552091,0.004119821,0.0016370316,0.00029246355],"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.000011956798,0.0000049776468,0.00017966072,0.000011333085,0.0000042986794,0.00003745678,0.00019898695,0.00036565895,0.0002720662,0.99749964,0.000109165914,0.0013047206],"study_design_scores_gemma":[0.000011179449,0.000033164262,0.00020785944,0.000012552299,0.000008457447,0.0001055331,0.00024545257,0.0021922677,0.000825514,0.99163026,0.0047168527,0.000010825485],"about_ca_topic_score_codex":0.0005246576,"about_ca_topic_score_gemma":0.0002999982,"teacher_disagreement_score":0.003919358,"about_ca_system_score_codex":0.0015074585,"about_ca_system_score_gemma":0.0005819333,"threshold_uncertainty_score":0.013111591},"labels":[],"label_agreement":null},{"id":"W3040826579","doi":"10.1017/jsl.2020.11","title":"THE TREE PROPERTY AT THE TWO IMMEDIATE SUCCESSORS OF A SINGULAR CARDINAL","year":2020,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"University of Toronto","funders":"","keywords":"Successor cardinal; Regular cardinal; Aleph; Mathematics; Property (philosophy); Tree (set theory); Kappa; Limit (mathematics); Combinatorics; Omega; Discrete mathematics; Mathematical analysis; Geometry; Physics; Philosophy; Epistemology; Theology","score_opus":0.05157215452786744,"score_gpt":0.31846684446002144,"score_spread":0.266894689932154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040826579","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.40529215,0.00039020056,0.44236657,0.0016816691,0.00047657924,0.00008284387,0.0002167539,0.0005757869,0.14891747],"genre_scores_gemma":[0.95995325,0.00013377954,0.027786775,0.00025597186,0.00015976446,0.000045000936,0.00006490079,0.000087631575,0.011513017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.00012862601,0.000047849804,0.00014038915,0.00032059758,0.00013895471],"domain_scores_gemma":[0.99728036,0.0011952255,0.00015086483,0.00030226776,0.00071285013,0.0003584596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012376792,0.00027598918,0.0004937652,0.0009220915,0.0017588255,0.0016341552,0.0005896608,0.0007101782,0.0055087567],"category_scores_gemma":[0.0040747984,0.00027663697,0.0010010431,0.0004432816,0.0032163116,0.0036875096,0.003081491,0.002692398,0.00076956715],"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.000048550748,0.00001791637,0.00039403143,0.000033585253,0.0000059364884,0.0002705961,0.00035405316,0.0005450481,0.0043798974,0.9892027,0.00072352414,0.0040240623],"study_design_scores_gemma":[0.00003109529,0.00005889257,0.00045017703,0.000040517905,0.000020349584,0.00045339638,0.00028812757,0.009124871,0.006978755,0.9727012,0.009829874,0.000022749193],"about_ca_topic_score_codex":0.0009858847,"about_ca_topic_score_gemma":0.0012767543,"teacher_disagreement_score":0.0055087567,"about_ca_system_score_codex":0.0007447908,"about_ca_system_score_gemma":0.0009241496,"threshold_uncertainty_score":0.018428624},"labels":[],"label_agreement":null},{"id":"W3091534711","doi":"10.1017/jsl.2021.82","title":"DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS","year":2021,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"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":"University of Waterloo","keywords":"Mathematics; Equivalence relation; Graph; Discrete mathematics; Equivalence (formal languages); Spectrum (functional analysis); Jump; Combinatorics; Degree (music); Pure mathematics; Physics","score_opus":0.08635827828913571,"score_gpt":0.2996625492359246,"score_spread":0.2133042709467889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091534711","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.90289795,0.00026819517,0.062357634,0.00039974347,0.00003191666,0.000020919904,0.00020187232,0.0001652739,0.033656407],"genre_scores_gemma":[0.99367285,0.00007718196,0.0033921967,0.000034827808,0.000027578928,0.000014411769,0.000113752394,0.00002645187,0.0026406818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993069,0.00010383647,0.000026295691,0.00018687427,0.0002599247,0.00011612321],"domain_scores_gemma":[0.99886703,0.00045917387,0.00014732142,0.00015807844,0.00017886532,0.00018953627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039884736,0.0002991197,0.000373356,0.0015693391,0.0007926694,0.0017957063,0.00047467803,0.00048191103,0.0051659467],"category_scores_gemma":[0.0018714793,0.00024075463,0.00033068258,0.0005971933,0.001868351,0.0032533586,0.0014067447,0.0011330778,0.0003295571],"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.000050251318,0.000028685796,0.00071163435,0.000036096768,0.000007956981,0.00011833439,0.00050571986,0.002045303,0.0070449784,0.98375124,0.000288766,0.0054109693],"study_design_scores_gemma":[0.000018254552,0.000027225235,0.0016254628,0.00001420796,0.000009836762,0.00017449468,0.00035191508,0.011304602,0.0056339013,0.97824335,0.0025824476,0.000014423171],"about_ca_topic_score_codex":0.00058556005,"about_ca_topic_score_gemma":0.0005078633,"teacher_disagreement_score":0.0051659467,"about_ca_system_score_codex":0.00084910565,"about_ca_system_score_gemma":0.00015139664,"threshold_uncertainty_score":0.01728177},"labels":[],"label_agreement":null},{"id":"W3159313210","doi":"10.1017/jsl.2021.30","title":"TUKEY ORDER AMONG IDEALS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Flatness (cosmology); Ideal (ethics); Order (exchange); Pure mathematics; Sigma; Tukey's range test; Class (philosophy); Combinatorics; Discrete mathematics; Physics; Statistics; Computer science","score_opus":0.043369855491789705,"score_gpt":0.3434148043049093,"score_spread":0.3000449488131196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159313210","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.8292685,0.0005596299,0.103630185,0.00051436824,0.00010538687,0.00007500329,0.00037193878,0.0002381684,0.06523687],"genre_scores_gemma":[0.98216176,0.00010185202,0.009816443,0.000048540463,0.000047947735,0.000016645987,0.00013708224,0.000022286353,0.007647339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866307,0.00018238145,0.000077659424,0.00031114204,0.000443665,0.0003221332],"domain_scores_gemma":[0.99864084,0.00036938835,0.00018291248,0.00017902326,0.0003338053,0.00029407494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009114762,0.00027918804,0.00048605638,0.0010896169,0.0017076845,0.0017393321,0.00040723814,0.00029847678,0.003496429],"category_scores_gemma":[0.0019700215,0.00030090913,0.00053973217,0.0004669943,0.0034082767,0.0025191142,0.001349397,0.0010931268,0.00041741505],"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.00016426304,0.000026890288,0.0032914856,0.000038376875,0.000015310654,0.00014514614,0.0010299655,0.0011772496,0.0060239146,0.98050416,0.0005166058,0.0070665968],"study_design_scores_gemma":[0.0000497531,0.00024757787,0.008249373,0.000040329232,0.00003797588,0.0005241064,0.0016672037,0.011137133,0.014716565,0.94213605,0.021140732,0.000053204236],"about_ca_topic_score_codex":0.0032517586,"about_ca_topic_score_gemma":0.0037838486,"teacher_disagreement_score":0.003496429,"about_ca_system_score_codex":0.0017021389,"about_ca_system_score_gemma":0.0007500448,"threshold_uncertainty_score":0.012349963},"labels":[],"label_agreement":null},{"id":"W3169538887","doi":"10.1017/jsl.2021.38","title":"CONTRIBUTIONS TO THE THEORY OF <i>F</i>-AUTOMATIC SETS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Endomorphism; Injective function; NIP; Abelian group; Mathematics; Automaticity; Prime (order theory); Combinatorics; Set (abstract data type); Multiplication (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.015106567953820968,"score_gpt":0.27411389948587456,"score_spread":0.2590073315320536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169538887","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.33528775,0.0014861659,0.3943005,0.0041253245,0.00060030585,0.000054430533,0.00039576215,0.0005904689,0.26315933],"genre_scores_gemma":[0.958129,0.0004684911,0.029547866,0.00035338753,0.000530874,0.000057843234,0.0001716277,0.00007418044,0.0106666535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00018836212,0.00004432018,0.00019990517,0.00028551105,0.00015469352],"domain_scores_gemma":[0.99757427,0.0013214934,0.00023504364,0.00034325226,0.000316938,0.00020907987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009840637,0.00040883955,0.00039185066,0.0016999972,0.0014978752,0.0027131643,0.0010756693,0.0009929324,0.004817197],"category_scores_gemma":[0.0027173648,0.0004411499,0.0007678999,0.0011288895,0.0046122354,0.004070654,0.0022666533,0.0021326747,0.00055416476],"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.000007751579,0.000005460797,0.0001778962,0.000015028721,0.000002081718,0.000045788238,0.00017561432,0.0010210703,0.00040443006,0.9957618,0.00037202434,0.0020110728],"study_design_scores_gemma":[0.0000041699727,0.000008891327,0.0001486101,0.0000095064715,0.000003678956,0.00007473698,0.00006388703,0.0072297878,0.000439981,0.98775965,0.0042475914,0.000009345495],"about_ca_topic_score_codex":0.0010140679,"about_ca_topic_score_gemma":0.0006175078,"teacher_disagreement_score":0.004817197,"about_ca_system_score_codex":0.0018943425,"about_ca_system_score_gemma":0.00057353213,"threshold_uncertainty_score":0.01611507},"labels":[],"label_agreement":null},{"id":"W3172144587","doi":"10.1017/jsl.2021.45","title":"WEAK CANONICAL BASES IN NSOP THEORIES","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Base (topology); Transitive relation; Sequence (biology); Collinearity; Simple (philosophy); Geometry; Mathematical analysis; Philosophy","score_opus":0.041669647988091175,"score_gpt":0.3475147025425514,"score_spread":0.3058450545544602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172144587","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.6537588,0.0011396585,0.18561955,0.001259915,0.00030885334,0.000114888346,0.00049035595,0.00067072373,0.15663725],"genre_scores_gemma":[0.9736058,0.00026268582,0.015357314,0.00011926568,0.00010731869,0.000066143606,0.0003016019,0.00007882378,0.010101007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983802,0.0003542134,0.00011099455,0.00024223748,0.0005971184,0.000315245],"domain_scores_gemma":[0.99830484,0.00034359362,0.00017264331,0.0002733038,0.00052915025,0.00037641218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016896252,0.00056757906,0.00064067956,0.002988133,0.002211779,0.0037125577,0.0011562785,0.00066909596,0.0063743284],"category_scores_gemma":[0.0026502574,0.00057634333,0.00065402186,0.0014939344,0.0047060624,0.006798124,0.0038568308,0.0021527922,0.000901272],"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.000019048162,0.000012670094,0.00040091612,0.000023671122,0.000004409787,0.000056478602,0.00026507277,0.0005677963,0.0004383788,0.9952943,0.0002495123,0.0026676315],"study_design_scores_gemma":[0.000008783585,0.00003032171,0.0003137253,0.000032594977,0.000010660053,0.00007079911,0.00045570295,0.0052474574,0.0014747136,0.9872248,0.0051170383,0.000013335706],"about_ca_topic_score_codex":0.0013890207,"about_ca_topic_score_gemma":0.001468382,"teacher_disagreement_score":0.0063743284,"about_ca_system_score_codex":0.0023388024,"about_ca_system_score_gemma":0.00093345746,"threshold_uncertainty_score":0.021324277},"labels":[],"label_agreement":null},{"id":"W3208227432","doi":"10.1017/jsl.2021.58","title":"SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS","year":2021,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Randomness; Prefix; Omega; Combinatorics; Halting problem; BETA (programming language); Alpha (finance); Mathematics; Discrete mathematics; Computer science; Algorithm; Physics; Turing machine; Statistics; Philosophy; Quantum mechanics","score_opus":0.01715385774161524,"score_gpt":0.26727219337782365,"score_spread":0.2501183356362084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208227432","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.47698933,0.0036974808,0.397741,0.022656411,0.0003706865,0.00015759293,0.00057741604,0.0005395366,0.09727061],"genre_scores_gemma":[0.9870204,0.00026112996,0.0073780366,0.0008191957,0.00035602108,0.00013519713,0.00012352587,0.0000722603,0.0038342385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986265,0.007062927,0.00069001,0.0024909275,0.0024137727,0.0010773956],"domain_scores_gemma":[0.93450826,0.052174225,0.002327051,0.0066314787,0.0031829593,0.0011759391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011053109,0.00036555727,0.0012513227,0.0011307854,0.0021617871,0.0033925117,0.0019787606,0.002496489,0.0058482857],"category_scores_gemma":[0.05253038,0.0005798518,0.0012744288,0.00090498896,0.010281851,0.008939906,0.0049331775,0.003717632,0.0004772503],"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.000088484434,0.00002390341,0.0013694,0.00004440155,0.000017813129,0.00007342462,0.00037806015,0.004372161,0.0003769619,0.98728675,0.00082848105,0.005140176],"study_design_scores_gemma":[0.00002826917,0.00004710129,0.00043845634,0.00001944441,0.000008920009,0.00007037843,0.000101434096,0.0155393295,0.00072061195,0.9812692,0.0017426808,0.000014176562],"about_ca_topic_score_codex":0.0008382154,"about_ca_topic_score_gemma":0.0003171772,"teacher_disagreement_score":0.011053109,"about_ca_system_score_codex":0.0019852633,"about_ca_system_score_gemma":0.00089453557,"threshold_uncertainty_score":0.05845517},"labels":[],"label_agreement":null},{"id":"W4254392710","doi":"10.1017/s0022481200000633","title":"JSL volume 77 issue 2 Cover and Back matter","year":2012,"lang":"en","type":"paratext","venue":"Journal of Symbolic Logic","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Cover (algebra); Volume (thermodynamics); Action (physics); Content (measure theory); Computer science; Engineering; Mathematics; Physics; Mechanical engineering","score_opus":0.038982623770781835,"score_gpt":0.22555450848773623,"score_spread":0.1865718847169544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254392710","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056817103,0.00083769154,0.0006070382,0.003965282,0.009880265,0.00011236764,0.0061040204,0.0033825517,0.97454256],"genre_scores_gemma":[0.0012815563,0.00077790796,0.0002294333,0.0012675882,0.0017539391,0.000042859676,0.002814207,0.0012333619,0.9905992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897206,0.00007523338,0.00006387507,0.00014197631,0.0006240562,0.00012288489],"domain_scores_gemma":[0.9970393,0.00036732244,0.00009234534,0.00049695576,0.0014726012,0.0005314153],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010837591,0.0011749257,0.0014884023,0.0043591256,0.0023916594,0.0111144,0.0010520151,0.0021205714,0.89866024],"category_scores_gemma":[0.0048687803,0.000515658,0.00097009155,0.003460997,0.0011154982,0.0033051826,0.002951465,0.0025288202,0.90695554],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000014706986,0.000031794545,0.0001034932,0.00010801288,0.0000034974153,0.000043198994,0.00002411505,0.000032953063,0.00023231382,0.0009787113,0.96754026,0.030886978],"study_design_scores_gemma":[0.0000063487287,0.000008998167,0.00037329996,0.00012027938,0.0000034541804,0.00004765444,0.000042118394,0.0000695961,0.00016887605,0.000608757,0.9985454,0.0000052510723],"about_ca_topic_score_codex":0.0040090536,"about_ca_topic_score_gemma":0.0058791703,"teacher_disagreement_score":0.10133976,"about_ca_system_score_codex":0.0023395526,"about_ca_system_score_gemma":0.0024930644,"threshold_uncertainty_score":0.1445489},"labels":[],"label_agreement":null},{"id":"W4366777573","doi":"10.1017/jsl.2023.26","title":"ON THE C.E. DEGREES REALIZABLE IN $\\Pi ^0_1$ CLASSES","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; Ministry of Education, India","keywords":"Class (philosophy); Mathematics; Degree (music); Pi; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Representation (politics); Computer science; Mathematical analysis; Artificial intelligence; Physics","score_opus":0.049413102059981936,"score_gpt":0.2843571914520112,"score_spread":0.23494408939202927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366777573","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.9020773,0.00047246917,0.069741435,0.0007101398,0.000032341446,0.0000643843,0.000982362,0.0001884278,0.02573109],"genre_scores_gemma":[0.984539,0.00018508456,0.012064006,0.00006905408,0.000026498907,0.00006973267,0.00042059156,0.000036217363,0.0025898283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861383,0.00017024015,0.000075592834,0.0003462825,0.00033474565,0.00045933813],"domain_scores_gemma":[0.99478924,0.0031236524,0.0005595483,0.00057521457,0.0003427422,0.00060964405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012406376,0.00048536004,0.00089167967,0.0018599249,0.0024948877,0.0046800454,0.0009337843,0.00083978835,0.0047240513],"category_scores_gemma":[0.0059199072,0.00053009856,0.001076593,0.0016854024,0.00412058,0.0051102564,0.0021447784,0.002226855,0.00028948],"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.00019429922,0.000056204783,0.003428158,0.000079118334,0.000020506934,0.00015216622,0.0006057473,0.016733866,0.0035745006,0.96564054,0.0005809672,0.008933989],"study_design_scores_gemma":[0.000059461116,0.00007593539,0.003703548,0.00007890837,0.000041111383,0.00033681525,0.0005548208,0.040809926,0.0054342123,0.9418841,0.006950851,0.000070345595],"about_ca_topic_score_codex":0.0038866578,"about_ca_topic_score_gemma":0.003442317,"teacher_disagreement_score":0.0047240513,"about_ca_system_score_codex":0.0024091846,"about_ca_system_score_gemma":0.0011897559,"threshold_uncertainty_score":0.017479956},"labels":[],"label_agreement":null},{"id":"W4382561381","doi":"10.1017/jsl.2023.46","title":"DEFINABLE -THEOREM FOR FAMILIES WITH VC-CODENSITY LESS THAN","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","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":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Conjecture; Mathematics; Intersection (aeronautics); Order (exchange); Omega; Property (philosophy); Discrete mathematics; Physics","score_opus":0.07198059426068447,"score_gpt":0.3253716880741173,"score_spread":0.25339109381343283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382561381","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.6056151,0.0014096564,0.28252718,0.0045719817,0.00031524448,0.00014853416,0.0024914655,0.0011701438,0.10175076],"genre_scores_gemma":[0.9763659,0.00022933976,0.015828496,0.00064161187,0.00015599572,0.00014939527,0.0013907691,0.00010021157,0.005138366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777263,0.00035360307,0.00010979245,0.0007810263,0.00058706297,0.00039583168],"domain_scores_gemma":[0.9917019,0.005559254,0.00038460334,0.00082637515,0.00089368055,0.000634323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023605174,0.0004965473,0.0009568084,0.0023955556,0.0033394422,0.003592918,0.0016486619,0.0012723961,0.008005114],"category_scores_gemma":[0.007629946,0.0006677499,0.0017359441,0.0014791588,0.0040368293,0.006312249,0.0030025025,0.002681701,0.0004918421],"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.00009230829,0.000053650434,0.0029917445,0.00009285854,0.000031709955,0.00023268709,0.0005774724,0.0022830581,0.0015572481,0.9849437,0.0020356253,0.005107842],"study_design_scores_gemma":[0.00007420497,0.000049598464,0.0019447468,0.00006159956,0.000061429666,0.00069055345,0.00035727193,0.022493118,0.003202802,0.95724994,0.013772872,0.000041867188],"about_ca_topic_score_codex":0.0029878602,"about_ca_topic_score_gemma":0.0024663683,"teacher_disagreement_score":0.008005114,"about_ca_system_score_codex":0.0041793734,"about_ca_system_score_gemma":0.0011129318,"threshold_uncertainty_score":0.030323625},"labels":[],"label_agreement":null},{"id":"W4385240321","doi":"10.1017/jsl.2023.55","title":"FRACTAL DIMENSIONS OF <i>k</i>-AUTOMATIC SETS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","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":"","keywords":"Hausdorff dimension; Minkowski–Bouligand dimension; Mathematics; Fractal; Digraph; Automaton; Box counting; Fractal dimension; Cellular automaton; Effective dimension; Packing dimension; Characterization (materials science); Hausdorff measure; Dimension function; Measure (data warehouse); Discrete mathematics; Hausdorff space; Dimension (graph theory); Entropy (arrow of time); Combinatorics; Fractal analysis; Theoretical computer science; Computer science; Algorithm; Data mining; Mathematical analysis","score_opus":0.02116319322224567,"score_gpt":0.270180949605909,"score_spread":0.24901775638366333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385240321","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.98032767,0.00013256066,0.014233691,0.0001316302,0.000011019421,0.000007813188,0.00012195533,0.00006459296,0.004969162],"genre_scores_gemma":[0.9979395,0.000030392646,0.0017700947,0.000009329958,0.000011431653,0.000008990897,0.00005553087,0.000006602581,0.00016808722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.00006260738,0.000028977965,0.000098284305,0.000109741144,0.00007238928],"domain_scores_gemma":[0.99690765,0.0015149567,0.00072545063,0.00026803126,0.00030761954,0.00027632227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044657712,0.00018656666,0.00036440088,0.0020326239,0.0005749341,0.0019418475,0.0004398272,0.0003703331,0.0014519957],"category_scores_gemma":[0.0026908566,0.0002526028,0.00028547848,0.0004985808,0.0021910458,0.0015080839,0.0007232798,0.00043106428,0.00010706567],"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.00021263315,0.000049393613,0.019736521,0.0001253659,0.000048485676,0.00030010685,0.001185413,0.0247317,0.028964438,0.91532505,0.0008999866,0.008420937],"study_design_scores_gemma":[0.000037016813,0.00014902107,0.049427833,0.000056841745,0.000039949555,0.00095067953,0.00089700555,0.1768564,0.01615343,0.7523024,0.0030212204,0.00010808653],"about_ca_topic_score_codex":0.00039364048,"about_ca_topic_score_gemma":0.00023316297,"teacher_disagreement_score":0.0020326239,"about_ca_system_score_codex":0.00083158916,"about_ca_system_score_gemma":0.00020231974,"threshold_uncertainty_score":0.006033659},"labels":[],"label_agreement":null},{"id":"W4386506899","doi":"10.1017/jsl.2023.62","title":"MORE ON HALFWAY NEW CARDINAL CHARACTERISTICS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Austrian Science Fund","keywords":"Consistency (knowledge bases); Combinatorics; Mathematics; Discrete mathematics","score_opus":0.08152712154442658,"score_gpt":0.372710476410601,"score_spread":0.2911833548661744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386506899","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.36521724,0.0022918526,0.24871162,0.0144295525,0.0013506066,0.0000805047,0.0006269757,0.00048073044,0.36681083],"genre_scores_gemma":[0.94676495,0.00038199255,0.025577495,0.0010638436,0.00035691875,0.00005165602,0.00019840358,0.0001792844,0.025425494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979463,0.000641872,0.00009257446,0.00051379,0.0005767245,0.0002287755],"domain_scores_gemma":[0.9923577,0.003287591,0.00044499323,0.0022267227,0.0010634833,0.0006194508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031552417,0.00029741865,0.00082378247,0.0013639417,0.0014333363,0.00332523,0.0012185809,0.0010018732,0.013605827],"category_scores_gemma":[0.00925417,0.0002733876,0.00068218034,0.0012730283,0.0051410813,0.01222083,0.0030349207,0.0037006508,0.0008840212],"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.000015577654,0.0000065777517,0.00023406728,0.000011790105,0.0000021329024,0.000021785025,0.00015725252,0.00029989498,0.00017412708,0.9963413,0.0005406711,0.0021949608],"study_design_scores_gemma":[0.000010311885,0.000017344966,0.0002477563,0.000022917222,0.000003542149,0.00006376018,0.0003047897,0.003288696,0.00038590233,0.98261166,0.013031324,0.000011961767],"about_ca_topic_score_codex":0.0009855527,"about_ca_topic_score_gemma":0.0012086066,"teacher_disagreement_score":0.013605827,"about_ca_system_score_codex":0.0015257319,"about_ca_system_score_gemma":0.0005128253,"threshold_uncertainty_score":0.045516074},"labels":[],"label_agreement":null},{"id":"W4387501283","doi":"10.1017/jsl.2023.71","title":"UNDEFINABILITY OF MULTIPLICATION IN PRESBURGER ARITHMETIC WITH SETS OF POWERS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Presburger arithmetic; Arithmetic; Multiplication (music); Mathematics; Computer science; Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics; Decidability","score_opus":0.02421695461103939,"score_gpt":0.27699702313529884,"score_spread":0.25278006852425944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387501283","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.93242985,0.00014350317,0.045930848,0.0006689859,0.00004753219,0.000025403404,0.00011050954,0.00020154988,0.020441778],"genre_scores_gemma":[0.99433964,0.00005176237,0.0037644857,0.000069020665,0.000036431742,0.000026654412,0.00008852799,0.000013479179,0.0016100543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987118,0.0002291465,0.00010281055,0.00031880903,0.0003691727,0.0002681824],"domain_scores_gemma":[0.996591,0.0022608635,0.00024941788,0.0003552261,0.00026012637,0.00028335454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011840493,0.00024237909,0.00058574876,0.00082291156,0.0009096174,0.002631778,0.0006916361,0.00057298027,0.0031371969],"category_scores_gemma":[0.004410036,0.00030295088,0.00043516842,0.00046418383,0.0036311373,0.0059251487,0.0018773145,0.0017902137,0.00029429814],"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.00032308596,0.000094088944,0.0018646081,0.000051016716,0.000012089737,0.00039981757,0.0007621212,0.0019097164,0.008598941,0.9719758,0.0005376508,0.01347097],"study_design_scores_gemma":[0.00005335259,0.0001009501,0.0011198252,0.000025569036,0.000017872242,0.00030917962,0.00037882637,0.013136364,0.013185401,0.9687349,0.0029138904,0.00002396607],"about_ca_topic_score_codex":0.00045401722,"about_ca_topic_score_gemma":0.00031418924,"teacher_disagreement_score":0.0031371969,"about_ca_system_score_codex":0.0010297219,"about_ca_system_score_gemma":0.00051463494,"threshold_uncertainty_score":0.010495007},"labels":[],"label_agreement":null},{"id":"W4391045159","doi":"10.1017/jsl.2024.4","title":"POLISH SPACE PARTITION PRINCIPLES AND THE HALPERN–LÄUCHLI THEOREM","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Akademie Věd České Republiky; National Science Foundation","keywords":"Mathematical proof; Partition (number theory); Mathematics; Forcing (mathematics); Combinatorial proof; Combinatorial principles; Combinatorics; Discrete mathematics; Consistency (knowledge bases); Combinatorial explosion; Mathematical analysis","score_opus":0.04644626764774502,"score_gpt":0.3254615466338696,"score_spread":0.2790152789861246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391045159","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.3430293,0.0021928076,0.42638534,0.0065150773,0.00021381986,0.00013001468,0.00068772153,0.0006150406,0.22023085],"genre_scores_gemma":[0.96720684,0.00045181802,0.02272031,0.0006260334,0.00016204399,0.00014049762,0.00015918356,0.00007511909,0.008458349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986338,0.00030136027,0.00007144008,0.00029968482,0.0004994156,0.000194326],"domain_scores_gemma":[0.9968727,0.0018603023,0.00023283347,0.00046479757,0.00036420813,0.000205122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020026518,0.00032983057,0.00073758455,0.0016223189,0.0016763821,0.0030634385,0.0009585242,0.00094889704,0.0053122328],"category_scores_gemma":[0.004337783,0.00041373653,0.00081966567,0.0010112744,0.007750845,0.0054814527,0.0030240086,0.0022244323,0.0007225406],"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.000009395006,0.0000045810575,0.00013059688,0.000013035616,0.0000035014955,0.000027084066,0.00011175679,0.00042540397,0.00025947703,0.9967974,0.00055290526,0.0016647648],"study_design_scores_gemma":[0.000011814567,0.0000077784625,0.00020155308,0.000007980448,0.000003931564,0.000043526765,0.00005987711,0.0016776256,0.00041682713,0.99503124,0.0025325946,0.0000051432908],"about_ca_topic_score_codex":0.0011963032,"about_ca_topic_score_gemma":0.0011812499,"teacher_disagreement_score":0.0053122328,"about_ca_system_score_codex":0.0020772617,"about_ca_system_score_gemma":0.00076822005,"threshold_uncertainty_score":0.017771184},"labels":[],"label_agreement":null},{"id":"W4391584293","doi":"10.1017/jsl.2023.86","title":"BETWEENNESS ALGEBRAS","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Betweenness centrality; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.026899806867492472,"score_gpt":0.2764968481607703,"score_spread":0.24959704129327784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391584293","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.14995266,0.0023003214,0.6941109,0.0018320977,0.00051500264,0.00023086881,0.00076096196,0.0005938108,0.14970338],"genre_scores_gemma":[0.91035753,0.00080279744,0.06781629,0.0005788722,0.0005372697,0.00017900024,0.00068097777,0.0001156525,0.018931549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972185,0.0006842369,0.0002175447,0.0005563958,0.0009492976,0.00037408012],"domain_scores_gemma":[0.99747235,0.0007590402,0.00042694813,0.00031356802,0.00075289025,0.0002751384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021193982,0.0005042112,0.0005239522,0.002340677,0.002098956,0.0031158288,0.0010322429,0.0010325792,0.008309034],"category_scores_gemma":[0.003845432,0.00034116476,0.0010490243,0.001408912,0.003367406,0.0076220213,0.0019839997,0.0015937141,0.00094689615],"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.0000066509356,0.0000064499486,0.00010459775,0.000017051436,0.0000053808803,0.00005209744,0.00013053052,0.00039719383,0.0005681259,0.99663407,0.00028395056,0.0017939513],"study_design_scores_gemma":[0.000011856636,0.00002392668,0.00019649227,0.000028918943,0.00001623763,0.00024491272,0.0001687288,0.0048580063,0.0010363624,0.9791574,0.014238592,0.000018556108],"about_ca_topic_score_codex":0.0016275443,"about_ca_topic_score_gemma":0.00076586095,"teacher_disagreement_score":0.008309034,"about_ca_system_score_codex":0.0011527045,"about_ca_system_score_gemma":0.0009787141,"threshold_uncertainty_score":0.027796507},"labels":[],"label_agreement":null},{"id":"W4392714449","doi":"10.1017/jsl.2024.16","title":"TWO-CARDINAL DERIVED TOPOLOGIES, INDESCRIBABILITY AND RAMSEYNESS","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic 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":"University of Toronto","funders":"","keywords":"Network topology; Mathematics; Topology (electrical circuits); Computer science; Combinatorics","score_opus":0.05885324575531981,"score_gpt":0.36701300719205615,"score_spread":0.30815976143673635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392714449","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.6069223,0.00071442325,0.30059457,0.001710244,0.0002201496,0.00008781445,0.000288584,0.00021725538,0.089244656],"genre_scores_gemma":[0.9670893,0.0001435405,0.02747668,0.00014268489,0.00006325991,0.000057967463,0.000120248566,0.000022420088,0.004883916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989083,0.00034791796,0.00007336973,0.0002297527,0.00032273235,0.00011798401],"domain_scores_gemma":[0.99634534,0.0013895587,0.00037619247,0.00056522054,0.00074310723,0.0005806132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017908938,0.00031101765,0.0004913023,0.0013223019,0.0011705133,0.0024721858,0.0009400513,0.000786969,0.004129944],"category_scores_gemma":[0.003982342,0.00027360555,0.00055943785,0.0007689331,0.004825156,0.00527496,0.0029832544,0.0026836644,0.0004462037],"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.000020508476,0.000022543756,0.0005913721,0.00002074251,0.0000033779968,0.0001575875,0.0002507701,0.0005495684,0.0014405537,0.99466974,0.00019951271,0.0020737546],"study_design_scores_gemma":[0.00002073096,0.000056670295,0.0010315744,0.000018114537,0.000004466412,0.000487562,0.00036435708,0.009660208,0.0021065671,0.9809107,0.0053191343,0.00001985552],"about_ca_topic_score_codex":0.00031620078,"about_ca_topic_score_gemma":0.0004672481,"teacher_disagreement_score":0.004129944,"about_ca_system_score_codex":0.00094913295,"about_ca_system_score_gemma":0.00045203845,"threshold_uncertainty_score":0.013816059},"labels":[],"label_agreement":null},{"id":"W4405949452","doi":"10.1017/jsl.2024.69","title":"CATEGORICAL FOUNDATIONS OF FORMALIZED CONDENSED MATHEMATICS","year":2024,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Danmarks Grundforskningsfond; Agence Nationale de la Recherche","keywords":"Mathematics; Sheaf; Hausdorff space; Categorical variable; Topological space; Generalization; Category of topological spaces; Urysohn and completely Hausdorff spaces; Topology (electrical circuits); Pure mathematics; Space (punctuation); Compact-open topology; Algebra over a field; Hausdorff measure; Computer science; Topological tensor product; Combinatorics; Hausdorff dimension; Mathematical analysis; Functional analysis","score_opus":0.04290560431996887,"score_gpt":0.30179208831847226,"score_spread":0.2588864839985034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405949452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095065154,0.0075108693,0.6234336,0.016641835,0.0008043997,0.00014074006,0.0020176691,0.0007357848,0.25364992],"genre_scores_gemma":[0.90661377,0.0023164276,0.07260234,0.0011433164,0.0010691559,0.0002936812,0.0011210402,0.000113737806,0.014726419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978416,0.00077994325,0.00013886116,0.0003443689,0.00066016533,0.00023511739],"domain_scores_gemma":[0.9960747,0.0018537897,0.0003541625,0.00060965394,0.0008296795,0.00027806606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022580556,0.0003101332,0.00050258887,0.002632808,0.0016761746,0.0055921436,0.0010987782,0.0009385509,0.007809953],"category_scores_gemma":[0.0049475865,0.00032769583,0.00066993886,0.0017533062,0.007921102,0.00630605,0.0035668076,0.002962933,0.0008180213],"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.0000017719224,0.0000024168846,0.00003596156,0.000009136332,0.0000013972523,0.000009025904,0.00007407656,0.00011434326,0.0000516266,0.9986866,0.00019498805,0.00081875606],"study_design_scores_gemma":[0.000006205973,0.0000036396677,0.00007570625,0.000011682011,0.0000015897923,0.000017960509,0.000040544826,0.0008519899,0.00008519355,0.99164057,0.0072622197,0.0000027656408],"about_ca_topic_score_codex":0.0018132342,"about_ca_topic_score_gemma":0.0012269848,"teacher_disagreement_score":0.007809953,"about_ca_system_score_codex":0.0035741616,"about_ca_system_score_gemma":0.0012966642,"threshold_uncertainty_score":0.026126921},"labels":[],"label_agreement":null},{"id":"W4409203108","doi":"10.1017/jsl.2025.27","title":"HIGH DIMENSIONAL COUNTABLE COMPACTNESS AND ULTRAFILTERS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Countable set; Compact space; Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.0053894540225443155,"score_gpt":0.2153050431628279,"score_spread":0.20991558914028358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409203108","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.822696,0.0012792931,0.15161562,0.00065257476,0.000047562244,0.000021424432,0.00012539612,0.00013136528,0.023430865],"genre_scores_gemma":[0.98907846,0.00013929908,0.008961397,0.000054040735,0.00003189629,0.000022062353,0.000043178734,0.000006655392,0.0016629345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992969,0.00020992283,0.000048048856,0.00013858112,0.0002087808,0.00009772508],"domain_scores_gemma":[0.9976278,0.0012317558,0.0003187425,0.00025734442,0.0002860423,0.00027835227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011713,0.00025756648,0.0003882587,0.0011990805,0.00079371664,0.0015029724,0.00052490894,0.0005827931,0.0021669238],"category_scores_gemma":[0.0030812144,0.00021826329,0.00038511175,0.0005442789,0.0031861418,0.003890452,0.0021250641,0.0009961075,0.00013526116],"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.00004792327,0.000022259776,0.0015209004,0.00005265018,0.000013608633,0.00017765167,0.0006189044,0.0023480773,0.0048394674,0.98593044,0.00026023606,0.004167803],"study_design_scores_gemma":[0.000020053978,0.00013256723,0.0052462164,0.00005871324,0.000016085036,0.00066170056,0.0006486379,0.03390695,0.0066677174,0.9467759,0.005826023,0.000039312567],"about_ca_topic_score_codex":0.00047157923,"about_ca_topic_score_gemma":0.00036649994,"teacher_disagreement_score":0.0021669238,"about_ca_system_score_codex":0.0007599305,"about_ca_system_score_gemma":0.00019811618,"threshold_uncertainty_score":0.007249117},"labels":[],"label_agreement":null},{"id":"W4412014509","doi":"10.1017/jsl.2025.10100","title":"QUANTUM EXPANDERS AND QUANTIFIER REDUCTION FOR TRACIAL VONNEUMANN ALGEBRAS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Quantum Computing Algorithms and Architecture","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":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Quantifier (linguistics); Reduction (mathematics); Von Neumann architecture; Pure mathematics; Quantifier elimination; Discrete mathematics; Mathematical economics; Philosophy; Epistemology","score_opus":0.015309973849526108,"score_gpt":0.2738600935505323,"score_spread":0.2585501197010062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412014509","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.48749962,0.0025530132,0.2968239,0.0038668774,0.00042538048,0.0001282043,0.00081655954,0.0010942416,0.20679218],"genre_scores_gemma":[0.96819645,0.00038455392,0.015183497,0.00036790263,0.00020920859,0.00006996652,0.00023534452,0.000113008195,0.01523998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982236,0.00034334112,0.00008149686,0.00022605054,0.00076320075,0.0003622499],"domain_scores_gemma":[0.99855906,0.00056466536,0.00015935634,0.00026494285,0.00029380532,0.0001582194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910095,0.0004420343,0.0006858106,0.0015763659,0.0018199577,0.0026667707,0.0008454653,0.00068757555,0.009212308],"category_scores_gemma":[0.0029472176,0.00039043895,0.0013531452,0.0008745873,0.0033901248,0.0059591536,0.002090015,0.002490156,0.00082878646],"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.000008230258,0.000012410158,0.00006128911,0.000012973501,0.0000040496825,0.00004122726,0.00013910884,0.0003940128,0.0005982421,0.9971431,0.00038130875,0.0012040142],"study_design_scores_gemma":[0.0000076839315,0.000011054505,0.0001199863,0.0000086958,0.0000072656403,0.00005860501,0.00007009353,0.0052023735,0.00090813497,0.9905233,0.0030700197,0.0000127494795],"about_ca_topic_score_codex":0.0020199057,"about_ca_topic_score_gemma":0.0016470546,"teacher_disagreement_score":0.009212308,"about_ca_system_score_codex":0.0018514453,"about_ca_system_score_gemma":0.0013977755,"threshold_uncertainty_score":0.030818284},"labels":[],"label_agreement":null},{"id":"W4414298955","doi":"10.1017/jsl.2025.10143","title":"ON THE COMPUTABILITY OF OPTIMAL SCOTT SENTENCES","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sentence; Countable set; Computable number; Computable analysis; Computable function; Computability; Set (abstract data type)","score_opus":0.01896401671791941,"score_gpt":0.2709963990381654,"score_spread":0.252032382320246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414298955","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.72202134,0.00046497377,0.22551073,0.0030341824,0.00008220035,0.00014847459,0.000657833,0.0008306162,0.047249667],"genre_scores_gemma":[0.97480327,0.00010162928,0.022071274,0.00023378133,0.00008601524,0.00006368762,0.00032704932,0.00008731539,0.0022260796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653035,0.000986994,0.00025095715,0.0006843518,0.0010310095,0.00051622174],"domain_scores_gemma":[0.98039055,0.014538972,0.0011618261,0.0018631732,0.0011841203,0.00086135213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035482885,0.00037074744,0.00082847144,0.0017336311,0.0020113564,0.0036773225,0.0011743775,0.0010924917,0.0056328876],"category_scores_gemma":[0.017185517,0.0006012374,0.0016238256,0.0008424581,0.0045236046,0.008543741,0.0033410266,0.0021030947,0.00032703884],"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.00025250358,0.00010442537,0.0023664765,0.00014148506,0.000053168536,0.00022360552,0.0009870963,0.012246813,0.0050999196,0.96869284,0.0015843732,0.008247378],"study_design_scores_gemma":[0.00005404413,0.00006409055,0.0012031399,0.00003180689,0.000036786525,0.00010263142,0.00021144186,0.04028764,0.004112943,0.95170635,0.0021567058,0.000032281903],"about_ca_topic_score_codex":0.0018288229,"about_ca_topic_score_gemma":0.0026787936,"teacher_disagreement_score":0.0056328876,"about_ca_system_score_codex":0.0028405127,"about_ca_system_score_gemma":0.0013260198,"threshold_uncertainty_score":0.020609498},"labels":[],"label_agreement":null},{"id":"W4414908835","doi":"10.1017/jsl.2025.10156","title":"DOMINATION, FIBRATIONS, AND SPLITTING","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Equivalence (formal languages); Rank (graph theory); Product (mathematics); Stability (learning theory); Algebra over a field; Type (biology)","score_opus":0.021625712702737235,"score_gpt":0.35983400117455083,"score_spread":0.3382082884718136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414908835","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.7156018,0.0018740695,0.17888641,0.0017859248,0.0001175061,0.000031833162,0.00015310374,0.00022294381,0.10132642],"genre_scores_gemma":[0.9897141,0.00016449085,0.0051675993,0.000065197855,0.00004984236,0.000009329792,0.000038929375,0.000021628339,0.0047689453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991743,0.00022477322,0.000049888025,0.00016637574,0.00025279503,0.0001319003],"domain_scores_gemma":[0.9984767,0.00051687297,0.0002149305,0.00018325637,0.0003700843,0.00023812361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010962067,0.0002458064,0.0003270513,0.0014170227,0.0011104721,0.0021551575,0.00037852817,0.00044595622,0.0039935904],"category_scores_gemma":[0.0019510625,0.00016569717,0.00041145567,0.0006035014,0.0042140028,0.0034955698,0.0021489135,0.00080306403,0.0002831241],"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.000019725801,0.000008144695,0.0007765067,0.000018115246,0.0000069610287,0.00008654333,0.00056208,0.00060798123,0.0014860218,0.9923901,0.00026793862,0.003769722],"study_design_scores_gemma":[0.000005667496,0.000020021022,0.0006625925,0.000018068384,0.000010220151,0.00020893943,0.00037882873,0.0046898015,0.0014083446,0.9887341,0.0038549488,0.000008484487],"about_ca_topic_score_codex":0.001157516,"about_ca_topic_score_gemma":0.001313981,"teacher_disagreement_score":0.0039935904,"about_ca_system_score_codex":0.0011917464,"about_ca_system_score_gemma":0.00034176765,"threshold_uncertainty_score":0.013359904},"labels":[],"label_agreement":null},{"id":"W4415420634","doi":"10.1017/jsl.2025.10158","title":"WEAK <b>A2</b> SPACES, THE KASTANAS GAME, AND STRATEGICALLY RAMSEY SETS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Countable set; Ramsey theory; Axiom; Space (punctuation); Topological space; Vector space; Connection (principal bundle); Ramsey's theorem","score_opus":0.03326664078427897,"score_gpt":0.3376169892299593,"score_spread":0.3043503484456803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415420634","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.69501436,0.0014650254,0.2160217,0.003224693,0.00014338674,0.00006961831,0.00020727616,0.00023090359,0.08362296],"genre_scores_gemma":[0.9862294,0.00012739723,0.009478258,0.00011996063,0.000026700955,0.00004160724,0.00004908987,0.000012302854,0.0039152685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893564,0.0005108507,0.00005791703,0.00014883326,0.00019526783,0.00015151147],"domain_scores_gemma":[0.99878687,0.00039391912,0.0001584648,0.00015556278,0.00021172928,0.00029352334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476963,0.00047708285,0.00042161733,0.0010137106,0.0014271364,0.0032983648,0.0006778095,0.000885926,0.003527437],"category_scores_gemma":[0.0018202143,0.00022519915,0.00040161386,0.0008487469,0.0043413886,0.005543833,0.0028171488,0.0013779026,0.00033783735],"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.000019831241,0.000008616618,0.00018573091,0.000011104465,0.0000046371197,0.000038554597,0.0001941262,0.00056374306,0.00063565635,0.99681014,0.00018087358,0.0013470043],"study_design_scores_gemma":[0.000011958068,0.000031546868,0.00033431538,0.000011318509,0.000005880719,0.00007821831,0.00050548086,0.008827617,0.000846524,0.9851364,0.004195662,0.000015021611],"about_ca_topic_score_codex":0.001847841,"about_ca_topic_score_gemma":0.0016013127,"teacher_disagreement_score":0.003527437,"about_ca_system_score_codex":0.0013308864,"about_ca_system_score_gemma":0.00070007803,"threshold_uncertainty_score":0.011800408},"labels":[],"label_agreement":null},{"id":"W561883102","doi":"10.1017/jsl.2016.12","title":"COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY","year":2017,"lang":"en","type":"preprint","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"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":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore; City University of New York; National Science Foundation","keywords":"Interpretability; Functor; Equivalence (formal languages); Mathematics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.019870772776410917,"score_gpt":0.28415104373650796,"score_spread":0.26428027096009704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W561883102","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.25417572,0.003350135,0.6088992,0.0061939745,0.000628672,0.00015917084,0.000662763,0.0011677301,0.124762684],"genre_scores_gemma":[0.95858556,0.00057009334,0.033038083,0.0005188526,0.00026010003,0.00011139824,0.00044152638,0.00016750183,0.0063069738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995439,0.0013568128,0.00031221248,0.00078204187,0.0016027883,0.00050712476],"domain_scores_gemma":[0.99389994,0.0031539067,0.00030172535,0.0013731162,0.0009839853,0.00028721837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002982717,0.0006594889,0.0011283401,0.0027938904,0.0012783762,0.004791287,0.0014104579,0.0012568029,0.004896023],"category_scores_gemma":[0.009486027,0.0005655319,0.0016895185,0.0011804978,0.008135787,0.008236503,0.004837192,0.0048415298,0.00054837286],"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.00001587728,0.000015807056,0.00013849261,0.000037387246,0.000008923862,0.000054351716,0.00025379917,0.0010872635,0.00041053933,0.99478155,0.00028212645,0.002913986],"study_design_scores_gemma":[0.000009821685,0.000007709343,0.000089709225,0.000017508046,0.000008694099,0.000050020877,0.00006339486,0.0031445345,0.00066166115,0.9937809,0.0021591273,0.000006940351],"about_ca_topic_score_codex":0.0008538301,"about_ca_topic_score_gemma":0.0005687345,"teacher_disagreement_score":0.004896023,"about_ca_system_score_codex":0.0019103377,"about_ca_system_score_gemma":0.0009672204,"threshold_uncertainty_score":0.01637882},"labels":[],"label_agreement":null}]}