{"meta":{"query_hash":"c6f5c3dbd578","filters":{"venue":"Mathematical logic quarterly"},"cohort_total":29,"direct_labels_cover":0,"predictions_cover":29,"exported":29,"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/c6f5c3dbd578","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+logic+quarterly"},"results":[{"id":"W1493806114","doi":"10.1002/malq.201300030","title":"Generic trivializations of geometric theories","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; NIP; Converse; Rank (graph theory); Simplicity; Stability (learning theory); Pure mathematics; Discrete mathematics; Combinatorics; Geometry; Computer science","score_opus":0.03355777729189491,"score_gpt":0.3065429095177503,"score_spread":0.2729851322258554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493806114","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.79878914,0.00071702234,0.09367966,0.0014465883,0.00007563979,0.00005806848,0.00038892258,0.0004336707,0.10441127],"genre_scores_gemma":[0.9925747,0.00009538043,0.0041235876,0.00008443254,0.000048558224,0.000020014628,0.000236899,0.000031169184,0.0027853772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983747,0.00033009087,0.00011009405,0.00039911753,0.00044637933,0.000339576],"domain_scores_gemma":[0.9982911,0.00047688832,0.00036531236,0.0003865091,0.00024489718,0.00023527288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096592656,0.0006105993,0.00066356675,0.0021835049,0.0021866104,0.0032430969,0.0012851182,0.0009738249,0.005607252],"category_scores_gemma":[0.0024914595,0.00047155647,0.0009801072,0.0010549251,0.006815767,0.0062668105,0.0052055935,0.0018067815,0.0003674161],"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.000009837817,0.000005253475,0.0003488563,0.000016041862,0.000007204575,0.00009226913,0.00026245878,0.00054348813,0.0004707878,0.9972185,0.00014746985,0.0008778534],"study_design_scores_gemma":[0.000014865617,0.00003172042,0.0006550707,0.000014435468,0.000018789033,0.00020039133,0.00044826322,0.0041905995,0.000881233,0.99002445,0.003506234,0.000013946774],"about_ca_topic_score_codex":0.0012832842,"about_ca_topic_score_gemma":0.001512553,"teacher_disagreement_score":0.005607252,"about_ca_system_score_codex":0.0029924775,"about_ca_system_score_gemma":0.0006211122,"threshold_uncertainty_score":0.021712065},"labels":[],"label_agreement":null},{"id":"W1597965172","doi":"10.1002/malq.201300006","title":"Rado's Conjecture and Ascent Paths of Square Sequences","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"University of Toronto","funders":"","keywords":"Successor cardinal; Mathematics; Conjecture; Continuation; Combinatorics; Square (algebra); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.022191613290356616,"score_gpt":0.29666036370792476,"score_spread":0.27446875041756813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597965172","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.4218496,0.0014984004,0.16095024,0.013194855,0.0013257429,0.00010267503,0.0005522064,0.00088127964,0.399645],"genre_scores_gemma":[0.95033616,0.0004814551,0.019454464,0.0010484657,0.00033481224,0.000079959784,0.0003770517,0.00007777615,0.027809795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986524,0.000270461,0.00008592974,0.0003841984,0.00027916426,0.00032780695],"domain_scores_gemma":[0.99413365,0.003247989,0.00036438563,0.0010458941,0.00070042914,0.00050767354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014987284,0.000457969,0.0008241632,0.0011502671,0.0032342195,0.0027083277,0.0011586541,0.0016361495,0.014074554],"category_scores_gemma":[0.008791873,0.00042746434,0.0010303648,0.0012919927,0.006022671,0.00871131,0.004021363,0.002920992,0.0015524736],"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.000045910423,0.00001117281,0.0003717282,0.000027246591,0.0000031220784,0.000064723085,0.00019389253,0.0007012612,0.00018032176,0.9936904,0.001306895,0.0034033759],"study_design_scores_gemma":[0.000015639565,0.000019575036,0.00021703255,0.000013427077,0.0000046989094,0.00007660349,0.0001493113,0.002152043,0.0003264389,0.99026847,0.0067470823,0.000009612001],"about_ca_topic_score_codex":0.0016109347,"about_ca_topic_score_gemma":0.0015763547,"teacher_disagreement_score":0.014074554,"about_ca_system_score_codex":0.0013340928,"about_ca_system_score_gemma":0.0010626657,"threshold_uncertainty_score":0.047084093},"labels":[],"label_agreement":null},{"id":"W1625734883","doi":"10.1002/malq.201500004","title":"The conjugacy problem for automorphism groups of countable homogeneous structures","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":4,"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; Boise State University","keywords":"Mathematics; Omega; Combinatorics; Isomorphism (crystallography); Conjugacy class; Conjecture; Discrete mathematics; Physics","score_opus":0.029220698429902044,"score_gpt":0.30509187738468224,"score_spread":0.2758711789547802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625734883","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.7837518,0.0009491407,0.14728579,0.003992171,0.00018678268,0.00015326012,0.00027026204,0.00009683469,0.063313976],"genre_scores_gemma":[0.98009515,0.0005694523,0.010244342,0.00018781597,0.00029287284,0.000090278605,0.00027814717,0.000035673766,0.008206261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980052,0.00051269284,0.0001764584,0.0004360358,0.0005118098,0.00035784335],"domain_scores_gemma":[0.9921961,0.0054405765,0.00072433316,0.0009204482,0.00028915567,0.00042939105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019671482,0.0006659514,0.001114948,0.0024054113,0.0038309402,0.0067631304,0.001054028,0.0024988698,0.005791946],"category_scores_gemma":[0.009606866,0.00049132056,0.0017533213,0.0022115873,0.0074717,0.01315764,0.006040235,0.0038027053,0.0007152798],"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.000037011152,0.000025148282,0.0008943316,0.000033951164,0.000012168397,0.0001382996,0.00046351098,0.0014307996,0.000530572,0.9925011,0.00032604544,0.003607076],"study_design_scores_gemma":[0.000011842737,0.0000114444465,0.00021372917,0.000007276253,0.000008220775,0.000076768425,0.00014496823,0.0027154223,0.00060225086,0.99528486,0.00091535714,0.000007934673],"about_ca_topic_score_codex":0.00095801515,"about_ca_topic_score_gemma":0.0005899919,"teacher_disagreement_score":0.0067631304,"about_ca_system_score_codex":0.0026126562,"about_ca_system_score_gemma":0.00080085936,"threshold_uncertainty_score":0.01937592},"labels":[],"label_agreement":null},{"id":"W1849716023","doi":"10.1002/malq.201400110","title":"Computable axiomatizability of elementary classes","year":2016,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"McMaster University","funders":"","keywords":"Ultraproduct; Class (philosophy); Algebra over a field; New class; Calculus (dental)","score_opus":0.018746146630212374,"score_gpt":0.25473146860272017,"score_spread":0.2359853219725078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849716023","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.4721279,0.00069940556,0.38020614,0.004629188,0.00026460277,0.00014400974,0.00050446345,0.00089359115,0.14053072],"genre_scores_gemma":[0.9595822,0.00017548076,0.032021277,0.00034178345,0.00010620966,0.000103288185,0.00037112768,0.00009316745,0.0072056083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976025,0.0006663986,0.00013609027,0.0006785203,0.0006218044,0.00029471144],"domain_scores_gemma":[0.9892042,0.007680217,0.00031036267,0.0016980354,0.0007651203,0.00034208075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133362,0.00039006802,0.0007073015,0.00084777176,0.0017635756,0.003034785,0.0015677864,0.0007628011,0.0061524785],"category_scores_gemma":[0.010105906,0.0004995269,0.0015244619,0.0007097336,0.004920056,0.0092116725,0.0037651397,0.0039435932,0.0004489327],"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.000026449088,0.000017587769,0.0003858746,0.000032663036,0.000007224313,0.000041925694,0.0001868064,0.0010286162,0.0010805398,0.99301517,0.0005165232,0.0036605073],"study_design_scores_gemma":[0.000019849183,0.000014576309,0.00049211964,0.000016086167,0.000011772597,0.000066117966,0.00007696666,0.0073186276,0.0023050967,0.9837299,0.0059367926,0.0000120897175],"about_ca_topic_score_codex":0.0016408883,"about_ca_topic_score_gemma":0.0021282285,"teacher_disagreement_score":0.0061524785,"about_ca_system_score_codex":0.0022572114,"about_ca_system_score_gemma":0.001258938,"threshold_uncertainty_score":0.02058208},"labels":[],"label_agreement":null},{"id":"W2015311986","doi":"10.1002/malq.200410029","title":"Excluded Middle versus Choice in a topos","year":2005,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Logic, Reasoning, and Knowledge","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":"McMaster University","funders":"","keywords":"Law of excluded middle; Topos theory; Epimorphism; Mathematics; Pure mathematics; Combinatorics; Linguistics; Philosophy; Literature","score_opus":0.046753796971506896,"score_gpt":0.27962813159821714,"score_spread":0.23287433462671026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015311986","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.16284236,0.005355546,0.4580335,0.008830819,0.00089726713,0.00007397076,0.000308676,0.0005841547,0.3630737],"genre_scores_gemma":[0.9605986,0.0010298529,0.02234312,0.00079590356,0.0005148646,0.00005191438,0.00009247098,0.000068004854,0.014505308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854976,0.00040472104,0.00009255899,0.00030981438,0.00040895457,0.00023410807],"domain_scores_gemma":[0.99876523,0.0006429871,0.000110545196,0.0001964251,0.00011967968,0.00016528732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020676425,0.0003896226,0.00051400135,0.0014024857,0.0021002525,0.0042852913,0.00070421066,0.0012977127,0.006623112],"category_scores_gemma":[0.0020069096,0.00027583845,0.0009201488,0.0013174308,0.0128440475,0.010577966,0.0032832061,0.0023234268,0.00072782184],"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.000007645787,0.0000024693325,0.000031104013,0.000008298355,0.0000023456844,0.000036824484,0.00010153884,0.00009657456,0.00015313832,0.99823654,0.0002111983,0.0011123968],"study_design_scores_gemma":[0.000007202209,0.000008971273,0.000054473207,0.000009232513,0.000005152196,0.00004654961,0.00006310559,0.00077836285,0.0002481073,0.99454933,0.0042247884,0.0000045773913],"about_ca_topic_score_codex":0.0013206587,"about_ca_topic_score_gemma":0.0010761592,"teacher_disagreement_score":0.006623112,"about_ca_system_score_codex":0.0016792198,"about_ca_system_score_gemma":0.0006748469,"threshold_uncertainty_score":0.022156537},"labels":[],"label_agreement":null},{"id":"W2024325951","doi":"10.1002/malq.200610049","title":"Local sentences and Mahlo cardinals","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Mathematics; Equivalence (formal languages); Axiom; Regular cardinal; Sentence; Consistency (knowledge bases); Combinatorics; Integer (computer science); Order (exchange); Discrete mathematics; Type (biology); Pure mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.035422512756671166,"score_gpt":0.3315521679374453,"score_spread":0.2961296551807741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024325951","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.65909153,0.001980966,0.18611145,0.0039150706,0.00023564577,0.00006452078,0.00045839127,0.0006500574,0.14749229],"genre_scores_gemma":[0.98597556,0.00013721209,0.009206073,0.00028923736,0.00011924343,0.000034374934,0.00011029202,0.000020729185,0.004107171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992311,0.00024982667,0.000055978482,0.00015295151,0.00020808053,0.00010200649],"domain_scores_gemma":[0.9970483,0.0014473192,0.00043139546,0.00029092463,0.00046166393,0.00032038355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012533994,0.00026302057,0.00026505004,0.0009364862,0.0010747192,0.0014782182,0.00055718975,0.00048729547,0.003488067],"category_scores_gemma":[0.0027189585,0.00024372384,0.00030228094,0.00047301652,0.0032341133,0.004013902,0.0017508293,0.0014947519,0.00040409318],"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.000047428974,0.000018353723,0.0009034808,0.000058130096,0.000007920238,0.00018269158,0.0008529518,0.00038004076,0.003067066,0.9896067,0.0007852138,0.0040898626],"study_design_scores_gemma":[0.000029433648,0.00007087528,0.0021723667,0.000046831672,0.000022163635,0.0004120364,0.0007414972,0.0050796415,0.0034633572,0.9728741,0.015061435,0.000026241094],"about_ca_topic_score_codex":0.00032783172,"about_ca_topic_score_gemma":0.00048935704,"teacher_disagreement_score":0.003488067,"about_ca_system_score_codex":0.001036106,"about_ca_system_score_gemma":0.00031989333,"threshold_uncertainty_score":0.011668742},"labels":[],"label_agreement":null},{"id":"W2045590994","doi":"10.1002/malq.200810012","title":"Commutative rings whose ideals form an MV‐algebra","year":2009,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"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; Commutative ring; Commutative algebra; Noncommutative ring; Class (philosophy); Semiprime ring; Pure mathematics; Commutative property; Maximal ideal; Artinian ring; Von Neumann regular ring; Local ring; Lattice (music); Ideal (ethics); Unit (ring theory); Ring (chemistry); Algebra over a field; Combinatorics; Law; Chemistry; Noetherian","score_opus":0.019081062640995457,"score_gpt":0.28462956003784207,"score_spread":0.2655484973968466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045590994","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.75575906,0.0010083207,0.15201199,0.0007092122,0.00023414384,0.00008385961,0.0002064248,0.00041515933,0.08957181],"genre_scores_gemma":[0.9779585,0.00014884463,0.0150970025,0.0000823167,0.00017545912,0.000026003403,0.0000989022,0.000023738337,0.006389322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989644,0.0002430957,0.00006287525,0.00018435883,0.0003733624,0.00017185835],"domain_scores_gemma":[0.998838,0.00019296206,0.00021033108,0.00014228783,0.00029004493,0.0003264486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014258872,0.00019168755,0.00042970487,0.0006893487,0.00093863276,0.0020876375,0.0005258141,0.00025350827,0.0039252075],"category_scores_gemma":[0.001333847,0.00020885005,0.00043124286,0.00034205482,0.0025124121,0.003364631,0.0014575662,0.00073687924,0.00072539755],"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.00012016375,0.000049002734,0.0013506194,0.000042148833,0.000018259472,0.00020184553,0.0004878754,0.0006572357,0.0076838825,0.98182344,0.00064028107,0.0069252057],"study_design_scores_gemma":[0.00008640906,0.00029188822,0.0034190456,0.000049350274,0.00005258863,0.0016144268,0.0008943636,0.015289162,0.019664852,0.9154468,0.043134347,0.00005660741],"about_ca_topic_score_codex":0.00028758522,"about_ca_topic_score_gemma":0.00018403867,"teacher_disagreement_score":0.0039252075,"about_ca_system_score_codex":0.0004521415,"about_ca_system_score_gemma":0.000426544,"threshold_uncertainty_score":0.013131142},"labels":[],"label_agreement":null},{"id":"W2060156489","doi":"10.1002/malq.200610011","title":"On the extender algebra being complete","year":2006,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Extender; Simple (philosophy); Mathematics; Algebra over a field; Pure mathematics; Chemistry; Philosophy; Organic chemistry; Epistemology","score_opus":0.03827155897042094,"score_gpt":0.29030495982462134,"score_spread":0.2520334008542004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060156489","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.63181895,0.0011252931,0.19043826,0.0018999919,0.00029024083,0.00011280922,0.0004533483,0.00037921243,0.17348182],"genre_scores_gemma":[0.9746516,0.00033372725,0.012884376,0.0002473951,0.0002291719,0.000045725228,0.00026825635,0.000038398564,0.011301282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880004,0.0002952851,0.000091182315,0.00027795503,0.00032460302,0.0002108728],"domain_scores_gemma":[0.9972664,0.0009044735,0.00023282725,0.0004509572,0.0006779894,0.00046739745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024076148,0.00032412607,0.0007044023,0.00089204375,0.0016416915,0.0024621778,0.00036687378,0.00069666374,0.0063084727],"category_scores_gemma":[0.0031079901,0.00024370989,0.00064762967,0.0005615456,0.0037246256,0.007998885,0.0024826133,0.0015528005,0.0006657179],"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.000045692017,0.000021979791,0.00027017604,0.00002744248,0.000007604588,0.00015662574,0.0002806636,0.00035281616,0.0014670689,0.9939659,0.000494283,0.0029097025],"study_design_scores_gemma":[0.000018382403,0.0000610383,0.0006190214,0.000017233298,0.0000092964365,0.00030296462,0.000256705,0.0020695308,0.0016552788,0.9864748,0.00849984,0.000015905187],"about_ca_topic_score_codex":0.00044130802,"about_ca_topic_score_gemma":0.00036278352,"teacher_disagreement_score":0.0063084727,"about_ca_system_score_codex":0.00039055359,"about_ca_system_score_gemma":0.0004267927,"threshold_uncertainty_score":0.021103919},"labels":[],"label_agreement":null},{"id":"W2062755128","doi":"10.1002/malq.200610040","title":"Bounded BCK‐algebras and their generated variety","year":2007,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":11,"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":"Institute of Population and Public Health","keywords":"Bounded function; Mathematics; Residuated lattice; Commutative property; Simple (philosophy); Class (philosophy); Variety (cybernetics); Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015349064421880842,"score_gpt":0.2413161522678692,"score_spread":0.22596708784598837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062755128","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.7114202,0.0016693487,0.18729062,0.0007193267,0.00014993391,0.00009127263,0.00035165908,0.0003259901,0.097981595],"genre_scores_gemma":[0.9840247,0.00018094476,0.0077589573,0.00005309386,0.000055564044,0.000029851515,0.00017063691,0.00002006006,0.0077061234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991912,0.000120408025,0.000039462262,0.00016367075,0.0003863153,0.00009895563],"domain_scores_gemma":[0.99940014,0.00017435479,0.00008129048,0.000053716456,0.00019088104,0.00009970571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051416596,0.00023896148,0.000366825,0.000993477,0.001090727,0.0019151816,0.0005657471,0.00030233082,0.0038416223],"category_scores_gemma":[0.0011136545,0.00017665028,0.0004973514,0.00082416716,0.002168348,0.0026512975,0.0014179818,0.0009825798,0.00045925425],"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.000037681704,0.00002376646,0.00045156747,0.000033679913,0.000012139473,0.00013622009,0.0004229033,0.0019496863,0.0027453154,0.9891293,0.00044675157,0.0046109986],"study_design_scores_gemma":[0.000030405263,0.000033996206,0.00089519104,0.000018181387,0.000014860543,0.00027959226,0.00019669764,0.0149288615,0.004494117,0.9673525,0.011731427,0.000024147601],"about_ca_topic_score_codex":0.00090519857,"about_ca_topic_score_gemma":0.0004054325,"teacher_disagreement_score":0.0038416223,"about_ca_system_score_codex":0.0010621131,"about_ca_system_score_gemma":0.00038055854,"threshold_uncertainty_score":0.012851477},"labels":[],"label_agreement":null},{"id":"W2067703954","doi":"10.1002/malq.201020093","title":"Simulating non-prenex cuts in quantified propositional calculus","year":2011,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"McGill University","funders":"","keywords":"Mathematics; Calculus (dental); Propositional variable; Propositional formula; Propositional calculus; Computer science; Discrete mathematics; Artificial intelligence; Orthodontics; Medicine","score_opus":0.04646462270182227,"score_gpt":0.27033705662141105,"score_spread":0.22387243391958878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067703954","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.30558085,0.00026715422,0.6797867,0.00058981264,0.00014575348,0.0001986941,0.00027241476,0.0035697913,0.009588867],"genre_scores_gemma":[0.84114414,0.00017156653,0.15511578,0.00015838358,0.000028713015,0.000099388686,0.00022822486,0.00025626214,0.0027975822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963731,0.001502688,0.00016089779,0.00042749237,0.0009902808,0.000545469],"domain_scores_gemma":[0.9897288,0.0079067135,0.00045230117,0.0011807954,0.00044825865,0.00028312762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025717032,0.00062815176,0.0006960708,0.000558858,0.00073425024,0.0026804032,0.001907851,0.0012005892,0.005146027],"category_scores_gemma":[0.013736977,0.000802407,0.0012155987,0.0004915506,0.0026666007,0.003736219,0.0033058946,0.0024263335,0.00046768744],"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.00065551075,0.00029856205,0.0019368854,0.00040852866,0.00015196431,0.000594669,0.001234752,0.35699138,0.018976022,0.5796502,0.0015005409,0.037600983],"study_design_scores_gemma":[0.0001602146,0.00011139985,0.00025531414,0.00003857094,0.00007592016,0.00008240371,0.00007837204,0.67175007,0.018416217,0.30610347,0.0028928716,0.00003515298],"about_ca_topic_score_codex":0.0043770014,"about_ca_topic_score_gemma":0.00552543,"teacher_disagreement_score":0.005146027,"about_ca_system_score_codex":0.0020262597,"about_ca_system_score_gemma":0.0021518336,"threshold_uncertainty_score":0.017215192},"labels":[],"label_agreement":null},{"id":"W2082808755","doi":"10.1002/malq.200710030","title":"The axiom of choice and the law of excluded middle in weak set theories","year":2008,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Philosophy and Theoretical Science","field":"Psychology","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":"Western University","funders":"","keywords":"Extensionality; Axiom of choice; Constructive set theory; Urelement; Law of excluded middle; Mathematics; Zermelo–Fraenkel set theory; Axiom; Quotient; Set (abstract data type); Pure mathematics; Mathematical economics; Set theory; Discrete mathematics; Computer science; Geometry; Epistemology; Philosophy","score_opus":0.04597893310610612,"score_gpt":0.29704903133439436,"score_spread":0.25107009822828824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082808755","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.23265032,0.002323968,0.6252294,0.009415335,0.0007298195,0.0001231708,0.00028206204,0.00035856524,0.12888736],"genre_scores_gemma":[0.94980633,0.0005094507,0.0425646,0.000726522,0.0002780317,0.00011895823,0.0001099892,0.00006584124,0.0058202245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972812,0.000994235,0.00027208234,0.00030284424,0.00089958386,0.0002499484],"domain_scores_gemma":[0.9958598,0.0023769552,0.00029483813,0.00060744176,0.00050551066,0.00035541836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004932281,0.0005318223,0.00090173323,0.0022950002,0.0020710672,0.004711493,0.0015975337,0.001881567,0.00382585],"category_scores_gemma":[0.0077707875,0.00059443945,0.0016363333,0.0014303944,0.0126996515,0.011433899,0.0063586216,0.004444829,0.0005005837],"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.0000067262595,0.0000042309744,0.00005530045,0.000009005898,0.0000034380296,0.0000153489,0.00007995057,0.00019812032,0.00014093737,0.998566,0.000120130644,0.00080073235],"study_design_scores_gemma":[0.0000056035246,0.0000052868954,0.000036522044,0.000006064428,0.0000024877017,0.000014386397,0.000019553187,0.0010588064,0.00013949434,0.99791247,0.0007954787,0.000003913066],"about_ca_topic_score_codex":0.0010305862,"about_ca_topic_score_gemma":0.0007802433,"teacher_disagreement_score":0.004932281,"about_ca_system_score_codex":0.002321173,"about_ca_system_score_gemma":0.00149949,"threshold_uncertainty_score":0.026084721},"labels":[],"label_agreement":null},{"id":"W2089220531","doi":"10.1002/malq.200910001","title":"Degree spectra and immunity properties","year":2010,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"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); Uncountable set; Mathematics; Corollary; Complement (music); Pure mathematics; Spectrum (functional analysis); Combinatorics; Physics; Biology","score_opus":0.037241469415239,"score_gpt":0.240759079117303,"score_spread":0.20351760970206398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089220531","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.8906342,0.00016517904,0.081168674,0.000529776,0.00003678907,0.000033912434,0.00017074776,0.0001999246,0.02706079],"genre_scores_gemma":[0.9941368,0.000044500885,0.0047222115,0.000041425497,0.000027216569,0.00001440529,0.000054269472,0.000016353093,0.00094271236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896955,0.00020404973,0.000052818694,0.00023351955,0.00031412466,0.00022588058],"domain_scores_gemma":[0.9964216,0.0018454527,0.00039928683,0.0004758144,0.0003794936,0.00047849072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009511259,0.00021896219,0.000338226,0.0016636092,0.0011065586,0.0021902954,0.0006595376,0.0006548314,0.0045025093],"category_scores_gemma":[0.004431808,0.00023738008,0.00041396637,0.00054303935,0.0035571575,0.004685788,0.001724111,0.0012270426,0.00033351878],"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.00004406162,0.00001868122,0.0014452713,0.000025006722,0.0000063656894,0.000086278174,0.00039614656,0.0020605351,0.005454558,0.9865333,0.00023979237,0.0036900367],"study_design_scores_gemma":[0.000022346258,0.00004644843,0.0026478518,0.000028814147,0.00001567834,0.0004495524,0.00042740945,0.018683614,0.008023629,0.96671975,0.0029027197,0.000032259915],"about_ca_topic_score_codex":0.0003560009,"about_ca_topic_score_gemma":0.00027156496,"teacher_disagreement_score":0.0045025093,"about_ca_system_score_codex":0.0008337227,"about_ca_system_score_gemma":0.00030686677,"threshold_uncertainty_score":0.015062392},"labels":[],"label_agreement":null},{"id":"W2093788800","doi":"10.1002/malq.201110037","title":"Conjectures of Rado and Chang and special Aronszajn trees","year":2012,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Limits and Structures in Graph 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":"University of Toronto","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Square (algebra); Geometry","score_opus":0.03163157865390188,"score_gpt":0.28557650544306257,"score_spread":0.2539449267891607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093788800","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.819901,0.0030269346,0.030896096,0.008493045,0.00047034858,0.00003420366,0.00022920029,0.00023107594,0.13671803],"genre_scores_gemma":[0.99288154,0.00032901907,0.0031813285,0.0004847834,0.00017305113,0.00002174151,0.00009705011,0.0000127781295,0.002818806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860805,0.00032487322,0.000098682314,0.0003656063,0.0003428931,0.00025991767],"domain_scores_gemma":[0.99026346,0.0060181078,0.00072004687,0.0012236448,0.0009230546,0.00085168227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030277444,0.00026779642,0.0011111319,0.0016139614,0.0025523661,0.0026364883,0.0011928725,0.0018504991,0.0057908697],"category_scores_gemma":[0.010603635,0.0004059323,0.00072342803,0.001317469,0.0073353266,0.0057063727,0.0023930976,0.0016371413,0.00049309595],"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.00005225152,0.000017150096,0.001457754,0.000044594064,0.000005991789,0.00008652133,0.00025638603,0.00074938557,0.00041878468,0.9932634,0.0012471721,0.00240049],"study_design_scores_gemma":[0.000028239256,0.0000240203,0.001048881,0.000026062378,0.000010582785,0.0002100863,0.00036877766,0.0036583089,0.00052849326,0.989786,0.004294727,0.000015654683],"about_ca_topic_score_codex":0.0011756456,"about_ca_topic_score_gemma":0.0012960975,"teacher_disagreement_score":0.0057908697,"about_ca_system_score_codex":0.0012299054,"about_ca_system_score_gemma":0.000613881,"threshold_uncertainty_score":0.019372344},"labels":[],"label_agreement":null},{"id":"W2114015893","doi":"10.1002/malq.201200079","title":"Cofinalities of Borel ideals","year":2014,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Saint Mary's University","funders":"Consejo de Ciencia y Tecnología del Estado de Chiapas; Universidad Nacional Autónoma de México; Akademie Věd České Republiky; Grantová Agentura České Republiky","keywords":"Cofinality; Mathematics; Invariant (physics); Ideal (ethics); Uncountable set; Pairwise comparison; Pure mathematics; Discrete mathematics; Countable set; Epistemology; Statistics; Philosophy","score_opus":0.03852999292608383,"score_gpt":0.3240765200978396,"score_spread":0.28554652717175577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114015893","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.84744865,0.0008451116,0.115987994,0.00065965473,0.0000469384,0.000053080545,0.00016799143,0.00029410046,0.034496423],"genre_scores_gemma":[0.9894832,0.00010472304,0.007975176,0.000044191813,0.000028305802,0.000041998475,0.00012050973,0.000024669718,0.0021772538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754274,0.00038747964,0.00011192037,0.000577051,0.00067311426,0.00070775324],"domain_scores_gemma":[0.9925033,0.0032488008,0.0011613655,0.0008153787,0.0010075335,0.0012636143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024114456,0.00055811944,0.00096022297,0.0025902032,0.0035328318,0.004199487,0.0013809503,0.00087462395,0.002349041],"category_scores_gemma":[0.005665447,0.00061140937,0.0011023895,0.0011355133,0.008052327,0.0050136945,0.0038978634,0.003056971,0.000320243],"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.0001453496,0.000052347463,0.0028793511,0.00004964868,0.00002750933,0.00025853704,0.0012236413,0.0018630066,0.003921826,0.9861925,0.00023379942,0.0031524962],"study_design_scores_gemma":[0.000046258454,0.00017901183,0.0040068156,0.000053288113,0.000070492344,0.00057233876,0.0013765222,0.01812342,0.011958827,0.9583953,0.0051617613,0.000055886485],"about_ca_topic_score_codex":0.0019368301,"about_ca_topic_score_gemma":0.0021182508,"teacher_disagreement_score":0.004199487,"about_ca_system_score_codex":0.0029454792,"about_ca_system_score_gemma":0.000856218,"threshold_uncertainty_score":0.021371067},"labels":[],"label_agreement":null},{"id":"W2166403219","doi":"10.1002/malq.200310061","title":"On existence of complete sets for bounded reducibilities","year":2003,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Recursively enumerable language; Oracle; Mathematics; Hierarchy; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Computer science","score_opus":0.06315396646092529,"score_gpt":0.2998707246096498,"score_spread":0.2367167581487245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166403219","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.7841934,0.0015480771,0.15712492,0.0014710553,0.000051868108,0.00015155211,0.0011432568,0.00047215846,0.05384367],"genre_scores_gemma":[0.9769498,0.00027876234,0.01983989,0.00013038366,0.00006346785,0.00008393688,0.00046960937,0.00004539054,0.002138657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970415,0.0005599686,0.00019505229,0.0005735164,0.0010903043,0.0005396903],"domain_scores_gemma":[0.97293603,0.021272428,0.0013769639,0.0017069109,0.0016084881,0.0010991566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111331,0.0003547311,0.00096308615,0.002759699,0.0016887505,0.0039345515,0.0010913912,0.0013199892,0.004754216],"category_scores_gemma":[0.021808986,0.0006981878,0.0010608279,0.0013629769,0.00439534,0.006742527,0.00295151,0.0024905268,0.00026737648],"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.00008235635,0.000039976643,0.0014742013,0.00009155572,0.00001742022,0.00013110612,0.00059013255,0.0036261098,0.0011905134,0.9837843,0.00060884334,0.008363465],"study_design_scores_gemma":[0.000034748606,0.00005875048,0.0014013769,0.000056941833,0.000022318995,0.00036578477,0.00034422733,0.016577667,0.0034626657,0.9743148,0.0033221387,0.000038602953],"about_ca_topic_score_codex":0.0008366729,"about_ca_topic_score_gemma":0.00075074774,"teacher_disagreement_score":0.004754216,"about_ca_system_score_codex":0.0017048045,"about_ca_system_score_gemma":0.0006380876,"threshold_uncertainty_score":0.016454518},"labels":[],"label_agreement":null},{"id":"W2193617815","doi":"10.1002/malq.201500067","title":"The length of an intersection","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","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 Calgary","funders":"","keywords":"Combinatorics; Mathematics; Partially ordered set; Infimum and supremum; Cardinality (data modeling); Intersection (aeronautics); Discrete mathematics","score_opus":0.028636140349287027,"score_gpt":0.29710783054218814,"score_spread":0.2684716901929011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193617815","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.80042994,0.0010866578,0.13963774,0.0015862015,0.00018050043,0.000051922685,0.0009906888,0.00051732635,0.055518955],"genre_scores_gemma":[0.9740303,0.00025782085,0.018537896,0.00012068777,0.00018097126,0.000053260992,0.00051398977,0.00013095712,0.006174084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680895,0.00065674697,0.00029547766,0.00074968924,0.00096157216,0.00052750745],"domain_scores_gemma":[0.9903741,0.004031553,0.0015656675,0.0009859109,0.0016202927,0.0014225753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019317312,0.0004475897,0.00074825005,0.0026143442,0.002202477,0.005922554,0.0009994135,0.00076145754,0.0078964215],"category_scores_gemma":[0.0064159264,0.0007694891,0.0006798989,0.0014238456,0.0048712967,0.010703649,0.003431699,0.0021340135,0.0009078922],"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.000298454,0.00006693135,0.0047563505,0.000094533636,0.00003762222,0.00022343539,0.001336762,0.0026494064,0.005417279,0.9672453,0.0013663432,0.01650766],"study_design_scores_gemma":[0.000021665091,0.00015626887,0.002238807,0.00007907941,0.00004475351,0.00037621328,0.0008279535,0.010340234,0.0087968465,0.96493065,0.012120047,0.000067447596],"about_ca_topic_score_codex":0.0009018505,"about_ca_topic_score_gemma":0.00084692275,"teacher_disagreement_score":0.0078964215,"about_ca_system_score_codex":0.0018454794,"about_ca_system_score_gemma":0.0008558309,"threshold_uncertainty_score":0.026416183},"labels":[],"label_agreement":null},{"id":"W2227441040","doi":"10.1002/malq.201600071","title":"Constructing quasiminimal structures","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","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":"Outcome (game theory); Mathematics; Upper and lower bounds; Order (exchange); Epistemology; Mathematical economics; Pure mathematics; Computer science; Philosophy; Mathematical analysis; Economics","score_opus":0.08272061478614534,"score_gpt":0.37401943283780004,"score_spread":0.2912988180516547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227441040","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.4096166,0.0010248456,0.5267032,0.002868142,0.00038061338,0.00009546506,0.00029418056,0.00075137574,0.058265578],"genre_scores_gemma":[0.9449395,0.00022818918,0.049249474,0.0002184468,0.00008820268,0.00007457839,0.00011920299,0.00009397082,0.004988426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863917,0.00054815935,0.000068090354,0.00023103617,0.00035418064,0.0001594129],"domain_scores_gemma":[0.99586403,0.0019748367,0.000337204,0.0011541746,0.00035734888,0.0003124295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027033892,0.00038564976,0.0006058571,0.0010718461,0.0015325733,0.002361737,0.0011234885,0.0010985212,0.0055305604],"category_scores_gemma":[0.004521947,0.0007033156,0.0009949869,0.00065739074,0.0039817556,0.0053910147,0.004165261,0.0024296134,0.0005067975],"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.000022030743,0.000010596043,0.00023245538,0.000033443244,0.0000059521735,0.000052627107,0.0002071626,0.0010168812,0.002314585,0.9939004,0.0002842955,0.0019196399],"study_design_scores_gemma":[0.000013954601,0.00004326879,0.00026802928,0.000022057213,0.000009091653,0.0001271835,0.000121915225,0.009904977,0.0034275847,0.980656,0.005391407,0.000014506836],"about_ca_topic_score_codex":0.00033725525,"about_ca_topic_score_gemma":0.0004794421,"teacher_disagreement_score":0.0055305604,"about_ca_system_score_codex":0.0017385067,"about_ca_system_score_gemma":0.00070072885,"threshold_uncertainty_score":0.01850158},"labels":[],"label_agreement":null},{"id":"W2777179981","doi":"10.1002/malq.201500022","title":"Supersimple structures with a dense independent subset","year":2017,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","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":"Memorial University of Newfoundland","funders":"Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Triviality; Omega; Modulo; Predicate (mathematical logic); Mathematics; Rank (graph theory); Combinatorics; Type (biology); Discrete mathematics; Pure mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.05767260280052555,"score_gpt":0.3393782905255882,"score_spread":0.28170568772506266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777179981","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.72123104,0.0003269792,0.16240321,0.00089402567,0.000087483764,0.000050863586,0.000278118,0.0003030481,0.11442514],"genre_scores_gemma":[0.98585933,0.00005336815,0.00937914,0.00009898951,0.000046882753,0.0000186342,0.00009789384,0.000029015899,0.0044167847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990885,0.00019834882,0.000046158555,0.00018284725,0.00031379823,0.00017025496],"domain_scores_gemma":[0.99893624,0.0003131672,0.00017862218,0.0002462075,0.00017339076,0.00015234774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087991764,0.00034444494,0.0004662341,0.0012559025,0.0011105948,0.0020042898,0.00073190505,0.0005843922,0.0048879148],"category_scores_gemma":[0.0012101497,0.0003130638,0.000860368,0.00092169526,0.0044790725,0.003748879,0.0024612164,0.0016122996,0.0003907318],"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.000019440475,0.000007902735,0.00023887999,0.000008977563,0.0000035362164,0.000100125166,0.0001744265,0.0006117518,0.0008782944,0.9968016,0.0001373106,0.0010177094],"study_design_scores_gemma":[0.000019699528,0.000050716455,0.00075972965,0.000019082623,0.000017471433,0.00033003857,0.0004334814,0.01115519,0.0024910006,0.97897184,0.005734516,0.0000171222],"about_ca_topic_score_codex":0.001061888,"about_ca_topic_score_gemma":0.001295005,"teacher_disagreement_score":0.0048879148,"about_ca_system_score_codex":0.0015094156,"about_ca_system_score_gemma":0.00037498953,"threshold_uncertainty_score":0.0163517},"labels":[],"label_agreement":null},{"id":"W2919009353","doi":"10.1002/malq.201900058","title":"On universal modules with pure embeddings","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Rings, Modules, and Algebras","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":"University of Manitoba","funders":"","keywords":"Cofinality; Mathematics; Embedding; Lambda; Cardinality (data modeling); Injective function; Abelian group; Countable set; Limit (mathematics); Model theory; Pure mathematics; Discrete mathematics; Combinatorics; Uncountable set; Physics; Computer science; Mathematical analysis","score_opus":0.03884149798080114,"score_gpt":0.27498290341155107,"score_spread":0.23614140543074993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919009353","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.9068534,0.000765733,0.06529116,0.00043419478,0.000037776525,0.000035561345,0.00013984456,0.00025308406,0.02618933],"genre_scores_gemma":[0.99576294,0.000100596044,0.0024290257,0.00003492054,0.000025906455,0.000018383553,0.0000556935,0.000016699369,0.0015558023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823976,0.00050435297,0.00009605031,0.00036050365,0.00044524577,0.00035409452],"domain_scores_gemma":[0.9969994,0.0011272641,0.00043104385,0.00047446557,0.00041909234,0.0005487814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019540333,0.0005565154,0.00072048366,0.0015411671,0.0011888354,0.0031885037,0.00083722715,0.00081473147,0.0031644683],"category_scores_gemma":[0.004251717,0.00047570237,0.0009798598,0.0007357632,0.004104618,0.006855179,0.0039700554,0.0012254216,0.00032629454],"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.00005758309,0.000054929293,0.003859816,0.00006605309,0.00002528981,0.00032127224,0.0012541461,0.0016044283,0.0025840357,0.9867748,0.0002975789,0.0031001065],"study_design_scores_gemma":[0.00003206276,0.00014629,0.0033535599,0.000079440666,0.00006564268,0.0009830056,0.0014164891,0.027979255,0.0066769836,0.9526593,0.0065617017,0.000046202218],"about_ca_topic_score_codex":0.0008043097,"about_ca_topic_score_gemma":0.0005227936,"teacher_disagreement_score":0.0031885037,"about_ca_system_score_codex":0.0014465076,"about_ca_system_score_gemma":0.0004646068,"threshold_uncertainty_score":0.010586202},"labels":[],"label_agreement":null},{"id":"W2947754331","doi":"10.1002/malq.201900041","title":"Concrete barriers to quantifier elimination in finite dimensional C*‐algebras","year":2019,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Advanced Operator Algebra Research","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 Victoria","funders":"University of Victoria","keywords":"Quantifier elimination; Predicate (mathematical logic); Separable space; Mathematics; Quantifier (linguistics); Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Computer science; Programming language; Artificial intelligence; Mathematical analysis","score_opus":0.05546138578556566,"score_gpt":0.35685333530604646,"score_spread":0.3013919495204808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947754331","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.60230374,0.0016308324,0.32294014,0.0030184838,0.00017654285,0.00006064287,0.00023631254,0.00074023806,0.06889302],"genre_scores_gemma":[0.97439903,0.0002501694,0.021411242,0.00020700348,0.00006142772,0.000048340593,0.000097979595,0.000042979966,0.0034818358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998741,0.00029084133,0.00007719702,0.00017193284,0.00048056646,0.00023858495],"domain_scores_gemma":[0.99760985,0.0012723175,0.00020212475,0.00030268586,0.00041845726,0.00019444969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016953981,0.0003173487,0.00054779294,0.0010485292,0.0016236021,0.0033259934,0.0010534714,0.0010106657,0.0033809445],"category_scores_gemma":[0.0045679477,0.000430514,0.0006862418,0.0008233328,0.003977318,0.007056358,0.0021396535,0.002311591,0.00036101192],"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.000014484832,0.000010273635,0.00007959702,0.000017078752,0.000003730187,0.000041804593,0.00014260164,0.00071401533,0.0007401933,0.99704605,0.00021443903,0.00097578915],"study_design_scores_gemma":[0.000018760631,0.0000125013985,0.00014232477,0.00001629557,0.00000935676,0.00007603565,0.000107348285,0.011016513,0.0017711371,0.98386484,0.0029492516,0.000015636126],"about_ca_topic_score_codex":0.0017242252,"about_ca_topic_score_gemma":0.0013008348,"teacher_disagreement_score":0.0033809445,"about_ca_system_score_codex":0.0018766669,"about_ca_system_score_gemma":0.0011762258,"threshold_uncertainty_score":0.013616264},"labels":[],"label_agreement":null},{"id":"W2980681923","doi":"10.1002/malq.201700049","title":"Degrees of categoricity of trees and the isomorphism problem","year":2019,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"University of Waterloo","keywords":"Mathematics; Isomorphism (crystallography); Rank (graph theory); Degree (music); Mathematical proof; Tree (set theory); Limit (mathematics); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.010032088061797992,"score_gpt":0.21377323759178685,"score_spread":0.20374114952998884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980681923","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.84969914,0.00034798557,0.12776046,0.0018545712,0.000049860748,0.00007067278,0.0002311645,0.00022628838,0.019759951],"genre_scores_gemma":[0.9910157,0.000064428146,0.006640701,0.00007234028,0.00003175282,0.000028573653,0.00011209411,0.00001737649,0.002017006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966869,0.0012358978,0.00024717426,0.00056475296,0.00079868606,0.0004667126],"domain_scores_gemma":[0.9801444,0.013612069,0.0012293018,0.002104547,0.0015022128,0.0014074887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028184124,0.00024918857,0.0006032728,0.0015177722,0.0013157417,0.003189692,0.0007257277,0.000975725,0.0037003518],"category_scores_gemma":[0.010893286,0.0003842038,0.0008147652,0.00092663645,0.0045624697,0.0075541344,0.004006661,0.0022614023,0.000248312],"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.000090460286,0.000052085077,0.004324345,0.00008790653,0.00002041594,0.000150353,0.0010951338,0.0050334022,0.0030138365,0.97867364,0.0004710658,0.0069874404],"study_design_scores_gemma":[0.00003748542,0.00008376761,0.0028286013,0.000035708003,0.00002842555,0.00036122906,0.000911259,0.014619345,0.004094847,0.9714472,0.0055162837,0.000035975812],"about_ca_topic_score_codex":0.0007582783,"about_ca_topic_score_gemma":0.00091481936,"teacher_disagreement_score":0.0037003518,"about_ca_system_score_codex":0.0013623826,"about_ca_system_score_gemma":0.00082000124,"threshold_uncertainty_score":0.0149053335},"labels":[],"label_agreement":null},{"id":"W2997454689","doi":"10.1002/malq.202000005","title":"Turing invariant sets and the perfect set property","year":2020,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Countable set; Property (philosophy); Invariant (physics); Turing; Mathematics; Discrete mathematics; Equivalence (formal languages); Set (abstract data type); Computer science","score_opus":0.04685334213629911,"score_gpt":0.2649848492308628,"score_spread":0.2181315070945637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997454689","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.3972505,0.0014131212,0.4172955,0.0027265747,0.00036183113,0.000058956273,0.0007476174,0.0007982495,0.17934754],"genre_scores_gemma":[0.98685247,0.00018678364,0.009542278,0.0001350744,0.00010063017,0.000021644059,0.00012381701,0.00003537343,0.003001981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981298,0.00039075446,0.00014148882,0.00038248443,0.000661689,0.00029381513],"domain_scores_gemma":[0.9950937,0.0026398455,0.00053268264,0.0011484486,0.00036133526,0.00022401265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013509857,0.00036056133,0.0005185849,0.0012134688,0.0013346112,0.003325475,0.0008566207,0.00071213883,0.007803031],"category_scores_gemma":[0.0058339513,0.0003781904,0.00066054316,0.0010527209,0.005730426,0.006165312,0.003009944,0.0012658691,0.00054805883],"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.000018256116,0.000008595694,0.00035152354,0.00002690961,0.000008005698,0.00006955435,0.000105163046,0.0013272294,0.0009614817,0.9927995,0.00064298284,0.003680794],"study_design_scores_gemma":[0.00000779563,0.000016607839,0.000531429,0.000016156435,0.000015594063,0.00015242907,0.0001032805,0.0066026878,0.0032666773,0.9842003,0.0050760647,0.0000108819995],"about_ca_topic_score_codex":0.00091012585,"about_ca_topic_score_gemma":0.0006905444,"teacher_disagreement_score":0.007803031,"about_ca_system_score_codex":0.001194532,"about_ca_system_score_gemma":0.00072818884,"threshold_uncertainty_score":0.026103735},"labels":[],"label_agreement":null},{"id":"W3118314718","doi":"10.1002/malq.202100008","title":"Pathological examples of structures with o‐minimal open core","year":2021,"lang":"en","type":"preprint","venue":"Mathematical logic quarterly","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":"McMaster University","funders":"","keywords":"Unary operation; Predicate (mathematical logic); Core (optical fiber); Mathematics; Graph; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.13346662143024196,"score_gpt":0.37374109803885847,"score_spread":0.2402744766086165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118314718","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.7917651,0.000458151,0.13412184,0.0011105271,0.00008428229,0.00006261824,0.0002207713,0.00049859827,0.07167805],"genre_scores_gemma":[0.98022354,0.00009174931,0.015408598,0.00009551215,0.00002088533,0.000033577806,0.00012482963,0.000052832907,0.003948396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955076,0.000099138044,0.000022913773,0.00009419982,0.00012082757,0.000112144065],"domain_scores_gemma":[0.9991372,0.00040463873,0.00009074276,0.00013229006,0.00010299303,0.0001320837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487308,0.00034054753,0.000392027,0.0011180105,0.0015329504,0.001526715,0.00064760837,0.0008254766,0.0037293686],"category_scores_gemma":[0.0015521729,0.00036013915,0.00045495102,0.00069971214,0.003734086,0.003245746,0.003046957,0.0014815835,0.00035290595],"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.000098950724,0.00002075054,0.00073625904,0.00004435588,0.000007935881,0.00087243103,0.00091409107,0.0011175176,0.004917117,0.9871672,0.00057058764,0.0035328537],"study_design_scores_gemma":[0.00004836046,0.000037645932,0.0014512698,0.000039545903,0.000023520237,0.0008445708,0.0011404054,0.00834549,0.006571383,0.9708232,0.0106470315,0.00002762769],"about_ca_topic_score_codex":0.0005847675,"about_ca_topic_score_gemma":0.0008292474,"teacher_disagreement_score":0.0037293686,"about_ca_system_score_codex":0.00085648074,"about_ca_system_score_gemma":0.00030665562,"threshold_uncertainty_score":0.012475967},"labels":[],"label_agreement":null},{"id":"W4283221234","doi":"10.1002/malq.202100074","title":"κ‐Madness and definability","year":2022,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Uncountable set; Mathematics; Regular cardinal; Construct (python library); Pure mathematics; Discrete mathematics; Computer science","score_opus":0.038059841576573036,"score_gpt":0.3132345562557084,"score_spread":0.27517471467913535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283221234","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.5532327,0.0015350678,0.21697465,0.00918843,0.0002697996,0.0001108296,0.00068338594,0.0007198341,0.21728535],"genre_scores_gemma":[0.9867291,0.00012244606,0.007644527,0.00021826975,0.000057365894,0.000036407306,0.00012205047,0.00002336467,0.0050463937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982014,0.00044532973,0.0001239751,0.0004976068,0.00042987757,0.00030169607],"domain_scores_gemma":[0.9955415,0.0020294983,0.00044248241,0.0009439823,0.00053252815,0.00051007746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018967711,0.00036050344,0.00060446735,0.0010331115,0.0024383012,0.0041381535,0.0012275178,0.0010333887,0.0054278392],"category_scores_gemma":[0.0047160634,0.00043030168,0.000879537,0.00070005667,0.008088939,0.007736435,0.0031897968,0.002894143,0.00034015896],"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.00001860877,0.000010663995,0.00037865134,0.000017157938,0.0000036346,0.00004116376,0.00029001446,0.00042888348,0.00036334965,0.9971047,0.00032755214,0.0010156004],"study_design_scores_gemma":[0.000018729212,0.000018095796,0.00040871237,0.000029126406,0.00000933368,0.00012965238,0.00035410427,0.0043365164,0.0010175785,0.98540145,0.008263724,0.000012965405],"about_ca_topic_score_codex":0.0026531983,"about_ca_topic_score_gemma":0.0024149076,"teacher_disagreement_score":0.0054278392,"about_ca_system_score_codex":0.0028647806,"about_ca_system_score_gemma":0.0009259886,"threshold_uncertainty_score":0.02078551},"labels":[],"label_agreement":null},{"id":"W4379010621","doi":"10.1002/malq.202200021","title":"Cofinal types on ω<sub>2</sub>","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Science Fund of the Republic of Serbia","keywords":"Successor cardinal; Mathematics; Cofinality; Class (philosophy); Simple (philosophy); Type (biology); Discrete mathematics; Countable set; Uncountable set; Computer science; Artificial intelligence; Mathematical analysis; Epistemology","score_opus":0.04692441027446455,"score_gpt":0.31960517528390653,"score_spread":0.272680765009442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379010621","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.80755734,0.00077656866,0.12695484,0.0002898632,0.00014272738,0.00006084703,0.00042172734,0.00040079112,0.0633952],"genre_scores_gemma":[0.9778986,0.0001361666,0.010794278,0.00008155155,0.00006591662,0.000039044433,0.00026156916,0.00007080944,0.010652083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882406,0.00020669738,0.00009019251,0.00022803161,0.000390088,0.0002609568],"domain_scores_gemma":[0.9967213,0.0012767084,0.00046350574,0.00047067925,0.0006969761,0.0003707887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011882806,0.00028993134,0.0006215812,0.0019527598,0.0018545972,0.0033928163,0.0005628424,0.00049040373,0.004267969],"category_scores_gemma":[0.0026323085,0.00042556436,0.00054661266,0.0011348546,0.0027403138,0.002748844,0.001329051,0.0012069667,0.00056011835],"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.00019128356,0.000029076013,0.0038759368,0.0000535801,0.00001676548,0.00017969513,0.0010576186,0.0013841228,0.0040064063,0.98181087,0.0006944379,0.0067002857],"study_design_scores_gemma":[0.00005135567,0.000099942925,0.008087849,0.00007542462,0.000055473356,0.0009781717,0.0018447789,0.009176791,0.017677652,0.91909283,0.04279544,0.00006426907],"about_ca_topic_score_codex":0.0021012642,"about_ca_topic_score_gemma":0.00273122,"teacher_disagreement_score":0.004267969,"about_ca_system_score_codex":0.0019745633,"about_ca_system_score_gemma":0.00071755744,"threshold_uncertainty_score":0.014326572},"labels":[],"label_agreement":null},{"id":"W4385222867","doi":"10.1002/malq.202200044","title":"Topological duality for orthomodular lattices","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Advanced Algebra and Logic","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 Alberta","funders":"","keywords":"Mathematics; Morphism; Topological space; Category of topological spaces; Pure mathematics; Class (philosophy); Duality (order theory); Discrete mathematics; Algebra over a field; Topological tensor product; Functional analysis","score_opus":0.04756827024346589,"score_gpt":0.31647797732285965,"score_spread":0.26890970707939377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385222867","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.39690048,0.0018639195,0.49779055,0.0013878045,0.0005669821,0.0001085188,0.00036257273,0.00037549116,0.10064368],"genre_scores_gemma":[0.9576465,0.00024721152,0.035877235,0.00020523835,0.000101652004,0.00007385157,0.00013307514,0.000029930126,0.005685393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880016,0.00041919516,0.00006426893,0.00017087362,0.00037065957,0.00017480954],"domain_scores_gemma":[0.999097,0.0002263681,0.00014730221,0.000116830866,0.00024013003,0.00017235306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452656,0.00025484528,0.0003134105,0.0011303772,0.0010692033,0.0021245608,0.00043837892,0.0003566973,0.0030165452],"category_scores_gemma":[0.0014150115,0.00015860566,0.00041777213,0.0005071012,0.0031461753,0.0029769314,0.0022265126,0.0009103839,0.00026213133],"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.000017834243,0.00001292079,0.0001474971,0.000015994534,0.0000034580842,0.00006329238,0.00016059134,0.0005029301,0.0010302688,0.9951509,0.00020654385,0.002687704],"study_design_scores_gemma":[0.00001904003,0.00004631754,0.0003830536,0.00002296931,0.0000065386726,0.00021997473,0.00044129268,0.0074076517,0.0018691407,0.9715897,0.017976068,0.000018307615],"about_ca_topic_score_codex":0.0007955487,"about_ca_topic_score_gemma":0.0008041821,"teacher_disagreement_score":0.0030165452,"about_ca_system_score_codex":0.00086188765,"about_ca_system_score_gemma":0.0005438915,"threshold_uncertainty_score":0.010091305},"labels":[],"label_agreement":null},{"id":"W4385224119","doi":"10.1002/malq.202200059","title":"Avoiding Medvedev reductions inside a linear order","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"Prevention of Organ Failure","funders":"","keywords":"Mathematics; Lift (data mining); Order (exchange); Interval (graph theory); Construct (python library); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.04155128374394942,"score_gpt":0.290644978695253,"score_spread":0.2490936949513036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385224119","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.3424093,0.0008391784,0.5363487,0.0013827593,0.0001970384,0.00011776943,0.00034324935,0.0011223431,0.11723977],"genre_scores_gemma":[0.9313222,0.0001766459,0.052582804,0.00024955196,0.000069504975,0.00006440881,0.00028706578,0.00016059515,0.015087115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984549,0.0003431624,0.000098734476,0.00030768447,0.00056144095,0.00023399164],"domain_scores_gemma":[0.9981029,0.0008005828,0.00011453982,0.00054842094,0.00028928308,0.0001442596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011835464,0.00040340194,0.00057367596,0.0010340194,0.0015501059,0.00219166,0.00091318216,0.00047425987,0.0036033753],"category_scores_gemma":[0.0031351831,0.0003977347,0.0011735931,0.00072821457,0.0032876625,0.0033031995,0.004463235,0.0033627527,0.0006330648],"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.000069177535,0.00002973502,0.00050527725,0.000058256108,0.000013102257,0.00013064033,0.00062625366,0.0030050888,0.0017389931,0.98304445,0.00066305295,0.010115955],"study_design_scores_gemma":[0.000027369919,0.00006980154,0.00041765976,0.000042484524,0.000021472531,0.00016507259,0.00039464512,0.011730903,0.007837269,0.96098596,0.018283816,0.000023656396],"about_ca_topic_score_codex":0.001391282,"about_ca_topic_score_gemma":0.0015346132,"teacher_disagreement_score":0.0036033753,"about_ca_system_score_codex":0.0017265963,"about_ca_system_score_gemma":0.00073330867,"threshold_uncertainty_score":0.012527406},"labels":[],"label_agreement":null},{"id":"W4388933863","doi":"10.1002/malq.202300017","title":"A dichotomy for T$T$‐convex fields with a monomial group","year":2023,"lang":"en","type":"article","venue":"Mathematical logic quarterly","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":"National Science Foundation","keywords":"Monomial; Mathematics; Regular polygon; Group (periodic table); Combinatorics; Pure mathematics; Geometry; Physics","score_opus":0.045650421504437246,"score_gpt":0.3262218439188264,"score_spread":0.28057142241438915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388933863","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.8115791,0.00057045056,0.07061191,0.0069717946,0.00015086797,0.000048455124,0.00034242327,0.00016552136,0.109559506],"genre_scores_gemma":[0.9940196,0.000098378136,0.0026266014,0.00024461705,0.00006765281,0.000023621787,0.00007931463,0.000012507854,0.0028277836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990945,0.00020237689,0.000041162795,0.0001689114,0.00021103356,0.0002819622],"domain_scores_gemma":[0.9987895,0.00057684554,0.0001405446,0.00009862938,0.00013853863,0.0002559362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014134174,0.00024931357,0.00048556182,0.001168615,0.0016078929,0.0028240923,0.0004676538,0.0007319312,0.0058888183],"category_scores_gemma":[0.0019670771,0.00018819912,0.00066257204,0.00052675314,0.0046748086,0.005743321,0.0026932827,0.00239429,0.00040156257],"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.00004233698,0.000018620392,0.00032835492,0.000015283827,0.0000038811395,0.00011118474,0.00018002096,0.00042577,0.00091101945,0.9959013,0.0004406909,0.0016215189],"study_design_scores_gemma":[0.000039301493,0.000047292222,0.0007970945,0.000018611898,0.000008698623,0.00017685798,0.00030017982,0.0053635077,0.001366491,0.9881715,0.003699421,0.000011054393],"about_ca_topic_score_codex":0.0007018683,"about_ca_topic_score_gemma":0.00043497616,"teacher_disagreement_score":0.0058888183,"about_ca_system_score_codex":0.002033187,"about_ca_system_score_gemma":0.0005067598,"threshold_uncertainty_score":0.01970005},"labels":[],"label_agreement":null},{"id":"W4402522828","doi":"10.1002/malq.202400030","title":"Effectiveness of Walker's cancellation theorem","year":2024,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Power Line Communications and Noise","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":"University of Waterloo","funders":"","keywords":"Mathematics; Mathematical economics; Calculus (dental); Discrete mathematics; Mathematics education; Medicine","score_opus":0.010137675523845344,"score_gpt":0.24654553770877644,"score_spread":0.2364078621849311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402522828","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.26351106,0.0010716378,0.4765982,0.0047519756,0.00053304347,0.00040434644,0.00091406534,0.0015730364,0.25064266],"genre_scores_gemma":[0.95928955,0.00028496547,0.027441178,0.0005626873,0.0002508268,0.00017206962,0.00037602638,0.000106521395,0.011516205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9879609,0.003931806,0.00073312904,0.0012702815,0.0050490424,0.0010548024],"domain_scores_gemma":[0.9536759,0.03570875,0.00144967,0.0045352676,0.003443966,0.0011865387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008067099,0.000552456,0.0014107636,0.0014998291,0.0021851438,0.0036223393,0.0020281505,0.0014053568,0.012756142],"category_scores_gemma":[0.0372719,0.0004252728,0.0014089517,0.0009572442,0.0037136937,0.007727377,0.004230499,0.002440405,0.0012962674],"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.00027816766,0.00007143242,0.0010059756,0.00011227923,0.000030051877,0.0001253696,0.00012528007,0.008763976,0.002060293,0.96920455,0.00229676,0.015925897],"study_design_scores_gemma":[0.000085794585,0.00011908991,0.00035759,0.000026591413,0.000028270477,0.00018984037,0.000055562985,0.07819877,0.0068870313,0.90730447,0.006708615,0.000038409984],"about_ca_topic_score_codex":0.0012062369,"about_ca_topic_score_gemma":0.0006558338,"teacher_disagreement_score":0.012756142,"about_ca_system_score_codex":0.0020964704,"about_ca_system_score_gemma":0.002180498,"threshold_uncertainty_score":0.04267353},"labels":[],"label_agreement":null}]}