{"meta":{"query_hash":"3ee5f500e745","filters":{"venue":"The Australasian Journal of Logic"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/3ee5f500e745","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Australasian+Journal+of+Logic"},"results":[{"id":"W1529320093","doi":"10.26686/ajl.v4i0.1778","title":"Some non-standard interpretations of the axiomatic basis of Leśniewski’s Ontology","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Semantic Web and Ontologies","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 Calgary","funders":"","keywords":"Axiom; Ontology; Meaning (existential); Functor; Statement (logic); Basis (linear algebra); Mathematics; Semantics (computer science); Constant (computer programming); Axiomatic system; Natural language processing; Epistemology; Computer science; Discrete mathematics; Philosophy; Programming language","score_opus":0.01658101990030346,"score_gpt":0.2585725854186751,"score_spread":0.24199156551837164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529320093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8810266,0.00071341736,0.09862469,0.016071923,0.0009742872,0.00020053299,0.000004431965,0.000016967808,0.0023671244],"genre_scores_gemma":[0.99184155,0.000017376375,0.007873988,0.00009375823,0.000063661726,0.0000010983391,9.2979846e-8,0.0000034970592,0.00010494945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985614,0.0001841486,0.0006851547,0.00009201456,0.00028844486,0.00018888169],"domain_scores_gemma":[0.99826807,0.00024309244,0.00084835576,0.00045417837,0.00015809214,0.000028234968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058587926,0.00010987265,0.00036556803,0.000108980676,0.0000731625,0.000028068342,0.0016182107,0.00005518274,0.000013941563],"category_scores_gemma":[0.00011486888,0.000053460615,0.0002409854,0.00028249295,0.00031447702,0.00024170085,0.00011462803,0.00018739508,0.00000301355],"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.00024854517,0.00079517224,0.06637897,0.00042270665,0.00070176105,0.00019422155,0.014079671,0.008917671,0.036071792,0.83338076,0.014136751,0.02467197],"study_design_scores_gemma":[0.001319579,0.0012431919,0.4373938,0.00048626726,0.00022656127,0.0012928883,0.0017030315,0.0021047855,0.052737262,0.5010588,0.0001829933,0.00025079347],"about_ca_topic_score_codex":0.00003690439,"about_ca_topic_score_gemma":0.000041353716,"teacher_disagreement_score":0.37101483,"about_ca_system_score_codex":0.000027622189,"about_ca_system_score_gemma":0.00012302937,"threshold_uncertainty_score":0.3007065},"labels":[],"label_agreement":null},{"id":"W1535419843","doi":"10.26686/ajl.v2i0.1768","title":"Limiting Cases for Spectrum Closure Results","year":2004,"lang":"en","type":"article","venue":"The Australasian Journal of 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":"Simon Fraser University","funders":"","keywords":"Spectrum (functional analysis); Closure (psychology); Mathematics; Class (philosophy); Image (mathematics); Function (biology); Limiting; Set (abstract data type); Sentence; Order (exchange); Pure mathematics; Spectral line; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.038826823084315766,"score_gpt":0.27515505416402564,"score_spread":0.23632823107970988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535419843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7036264,0.00051225437,0.21298012,0.0792723,0.0012322345,0.00032014214,0.000016917144,0.00011572655,0.0019239213],"genre_scores_gemma":[0.9794344,0.000016685595,0.01966842,0.00034200982,0.0004372533,0.0000011360827,4.446729e-7,0.0000066522957,0.0000930107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891156,0.000059732763,0.00041860619,0.00013234119,0.00019215902,0.0002855827],"domain_scores_gemma":[0.998813,0.00030221773,0.00042412995,0.00031600113,0.00006330251,0.000081363876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671754,0.000114947914,0.00017968428,0.00007125881,0.00016177549,0.00013444122,0.0010655946,0.00004392232,0.0000044486887],"category_scores_gemma":[0.00022214082,0.000066793844,0.00017824223,0.00018676909,0.000065332555,0.00031966277,0.00006337009,0.00022107546,0.0000104428445],"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.0004248216,0.0003269646,0.00044297896,0.00005573392,0.00019988316,0.0022133472,0.0045868545,0.010680493,0.0036224832,0.9448714,0.00541281,0.027162192],"study_design_scores_gemma":[0.0038233267,0.0028009699,0.007836495,0.0003023618,0.00006869186,0.013952217,0.0011279571,0.0004723006,0.018728092,0.94774103,0.0027745285,0.00037200702],"about_ca_topic_score_codex":0.0000033407955,"about_ca_topic_score_gemma":0.0000026509813,"teacher_disagreement_score":0.275808,"about_ca_system_score_codex":0.000040942527,"about_ca_system_score_gemma":0.00008273326,"threshold_uncertainty_score":0.27237737},"labels":[],"label_agreement":null},{"id":"W1559028082","doi":"10.26686/ajl.v12i5.3891","title":"First degree formulas in quantified S5","year":2015,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Logic, programming, and type systems","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 Toronto","funders":"","keywords":"Degree (music); Context (archaeology); Mathematics; Modal logic; Modal; Algebra over a field; Algorithm; Calculus (dental); Pure mathematics; Physics; Chemistry; Geography; Medicine","score_opus":0.12320849640793666,"score_gpt":0.2971933102502508,"score_spread":0.17398481384231415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559028082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22550598,0.0018874576,0.7077808,0.024602672,0.005576737,0.0008370534,8.0494556e-7,0.0001637738,0.03364476],"genre_scores_gemma":[0.99646,0.00001005142,0.0028623291,0.00008922843,0.00018633936,0.0000018295723,1.525515e-7,0.000005606252,0.00038442973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985754,0.00013811828,0.00048076524,0.0001347937,0.00035154138,0.00031939615],"domain_scores_gemma":[0.99888706,0.000076349635,0.00036768336,0.00037331917,0.00013418809,0.00016136919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016592332,0.00012859475,0.00025034416,0.00012928776,0.00006912874,0.00016023415,0.0013930553,0.000071615694,0.000008648559],"category_scores_gemma":[0.00009754863,0.00007137864,0.00011086338,0.0003640942,0.00006723613,0.00040926246,0.00010187251,0.00030757376,0.000083178296],"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.00013917501,0.00042818743,0.03230931,0.00006708794,0.000118729404,0.0016997635,0.013935249,0.002373807,0.00015812114,0.89630973,0.011454864,0.041005976],"study_design_scores_gemma":[0.0054031243,0.0033566835,0.05711808,0.00010609864,0.00006187138,0.006804964,0.003503979,0.006115839,0.0009914123,0.86222965,0.053475067,0.0008332136],"about_ca_topic_score_codex":0.000036812366,"about_ca_topic_score_gemma":0.00009132055,"teacher_disagreement_score":0.7709541,"about_ca_system_score_codex":0.00006540531,"about_ca_system_score_gemma":0.0001142274,"threshold_uncertainty_score":0.29107368},"labels":[],"label_agreement":null},{"id":"W1640057716","doi":"10.26686/ajl.v3i0.1769","title":"Justification of Argumentation Schemes","year":2005,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":45,"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 Winnipeg","funders":"","keywords":"Argumentation theory; Argument (complex analysis); Defeasible estate; Inference; Epistemology; Computer science; Scheme (mathematics); Key (lock); Argumentation framework; Artificial intelligence; Mathematics; Philosophy; Computer security","score_opus":0.04089321282050327,"score_gpt":0.2948102660106069,"score_spread":0.2539170531901036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640057716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6074143,0.00020330561,0.38154092,0.009694538,0.00040777205,0.00014817473,7.366373e-7,0.000015716965,0.0005745014],"genre_scores_gemma":[0.9826834,0.000020197049,0.01692271,0.0000522757,0.00015787572,7.557351e-7,4.0096043e-7,0.0000021468582,0.00016019547],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991419,0.00007806594,0.0004059062,0.00006441344,0.00022437781,0.00008539193],"domain_scores_gemma":[0.99899805,0.00003540038,0.00063213916,0.00018358136,0.00011720178,0.000033648183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055587257,0.0000557704,0.00010404016,0.0000744505,0.000046998022,0.000034820576,0.00043853384,0.000027076458,0.000027109365],"category_scores_gemma":[0.00002696266,0.00003427088,0.0000632749,0.00014755133,0.000025269936,0.0004413923,0.000017277243,0.00008588533,0.000020536843],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00008188835,0.00067441823,0.012498445,0.00015220579,0.00023592747,0.000018198038,0.013813369,0.014363577,0.33229825,0.2936992,0.008991243,0.32317328],"study_design_scores_gemma":[0.0038311898,0.0013192837,0.44877285,0.00044273806,0.00021722738,0.0010672596,0.0023716458,0.042373814,0.46385795,0.017321758,0.017782016,0.00064228405],"about_ca_topic_score_codex":0.0000019398012,"about_ca_topic_score_gemma":9.4285e-7,"teacher_disagreement_score":0.43627438,"about_ca_system_score_codex":0.000029171211,"about_ca_system_score_gemma":0.000027714823,"threshold_uncertainty_score":0.1397526},"labels":[],"label_agreement":null},{"id":"W2167149036","doi":"10.26686/ajl.v6i0.1799","title":"Collapsing Arguments for Facts and Propositions","year":2008,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","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":"Quine; Epistemology; Axiom; Argument (complex analysis); Philosophy; Class (philosophy); Linguistics; Mathematics","score_opus":0.06306229818843614,"score_gpt":0.33214635819220356,"score_spread":0.2690840600037674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167149036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605676,0.000100508216,0.001422255,0.009656375,0.00037523327,0.00019259413,0.000006384716,0.000006897161,0.027672136],"genre_scores_gemma":[0.99839306,0.000010834574,0.0008663106,0.00022037476,0.00013136047,0.000001618637,1.6401745e-7,0.000003244705,0.00037303465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994134,0.00007012209,0.00017516191,0.00007097593,0.0000994062,0.00017095999],"domain_scores_gemma":[0.99952245,0.00012556056,0.00012773045,0.00008433254,0.00004667595,0.000093227536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030217046,0.00005935964,0.000105825646,0.00003254234,0.00023584424,0.0000149874595,0.00017581333,0.000034212095,0.00012025297],"category_scores_gemma":[0.000044218425,0.000032933043,0.00005306119,0.00008903992,0.00039978334,0.00007244327,0.000009575259,0.00012471479,0.000013514012],"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.00032282886,0.00027615434,0.00159528,0.000010150591,0.00011412366,0.00022017868,0.0059157396,0.000022645147,0.0031627405,0.9835977,0.002249647,0.0025128243],"study_design_scores_gemma":[0.0009590094,0.0011542523,0.03851067,0.000033928623,0.000058410016,0.004330018,0.0005705807,0.000007534212,0.00086290605,0.9526594,0.00074823055,0.00010502855],"about_ca_topic_score_codex":7.083454e-7,"about_ca_topic_score_gemma":1.6170978e-7,"teacher_disagreement_score":0.037825443,"about_ca_system_score_codex":0.000012032828,"about_ca_system_score_gemma":0.00001700237,"threshold_uncertainty_score":0.18139471},"labels":[],"label_agreement":null},{"id":"W2295763493","doi":"10.26686/ajl.v13i1.3926","title":"Relevance Logic: Problems Open and Closed","year":2016,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Logic, Reasoning, and Knowledge","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 Toronto","funders":"","keywords":"Decidability; Relevance (law); Fragment (logic); Semilattice; Mathematics; Decision problem; Algebra over a field; Computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.04184020616646513,"score_gpt":0.2815974418179703,"score_spread":0.23975723565150517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295763493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2838761,0.0051817093,0.45887476,0.14021432,0.0030018012,0.001768479,0.000007645352,0.00022971154,0.10684548],"genre_scores_gemma":[0.9873546,0.00032249297,0.009397529,0.0002972777,0.00017264843,0.0000030689346,5.9503165e-8,0.0000070390015,0.0024453283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986543,0.00019115079,0.00038631272,0.00022037898,0.00021842305,0.000329418],"domain_scores_gemma":[0.99856687,0.0002483887,0.00045768693,0.00042001758,0.00014964196,0.00015738542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655198,0.00015943286,0.00028047067,0.000059446695,0.00015879271,0.00026866343,0.0025153488,0.00006709595,0.000046293924],"category_scores_gemma":[0.00022078416,0.00006625951,0.00008387833,0.00020194899,0.00019100848,0.00079712784,0.0004388845,0.00022331515,0.00005922876],"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.00011024974,0.00026717826,0.006801646,0.000043724838,0.00014450116,0.0005300071,0.0030956268,0.00004334703,0.012507805,0.7462922,0.012831141,0.21733259],"study_design_scores_gemma":[0.0028763078,0.0020070004,0.040281825,0.00042108627,0.00004747336,0.004461204,0.00017812995,0.00013009245,0.0024468282,0.9213159,0.025365336,0.00046878774],"about_ca_topic_score_codex":0.0000029930793,"about_ca_topic_score_gemma":0.0000049244018,"teacher_disagreement_score":0.70347846,"about_ca_system_score_codex":0.000037694157,"about_ca_system_score_gemma":0.00008801689,"threshold_uncertainty_score":0.46741858},"labels":[],"label_agreement":null},{"id":"W2620887081","doi":"10.26686/ajl.v14i1.4026","title":"Resolving Quine's Confict: A Neo-Quinean View of the Rational Revisability of Logic","year":2017,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Philosophy, Science, and History","field":"Arts and Humanities","cited_by":8,"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":"Social Sciences and Humanities Research Council of Canada","keywords":"Quine; Argument (complex analysis); Epistemology; Philosophy; Exegesis; Subject (documents); Computer science; Theology","score_opus":0.09137614410707275,"score_gpt":0.28706338370695184,"score_spread":0.1956872395998791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620887081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67412853,0.002096119,0.00004328651,0.0337052,0.0027820074,0.00052014005,0.000052980577,0.000016383936,0.28665534],"genre_scores_gemma":[0.9977295,0.00004004556,0.00006027035,0.00018456615,0.00065849937,9.1833834e-7,3.622488e-7,0.0000052827995,0.0013205721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998551,0.00016851007,0.000619408,0.0001073361,0.00038774853,0.00016598748],"domain_scores_gemma":[0.99765587,0.000101413025,0.0013005415,0.00056648615,0.0003191002,0.000056562763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013014739,0.00012211349,0.00033881684,0.00004991712,0.00073366467,0.00009580335,0.001252248,0.000030198733,0.000911503],"category_scores_gemma":[0.00030517118,0.000059813592,0.00027498862,0.000030844643,0.002495817,0.0002840624,0.000078129255,0.00027942544,0.000007617176],"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.00012046223,0.0002312587,0.0032030714,0.0001832354,0.000082985964,0.00001249746,0.01844545,0.000075609874,0.0023179285,0.9686552,0.00518432,0.0014879504],"study_design_scores_gemma":[0.002426166,0.0024802315,0.15411031,0.0017487654,0.0005865936,0.00041332145,0.010888749,0.00010805075,0.0015557215,0.57820475,0.24673189,0.00074545195],"about_ca_topic_score_codex":0.00004605468,"about_ca_topic_score_gemma":0.00011179031,"teacher_disagreement_score":0.39045048,"about_ca_system_score_codex":0.000037485785,"about_ca_system_score_gemma":0.0001396536,"threshold_uncertainty_score":0.99803185},"labels":[],"label_agreement":null},{"id":"W2874049253","doi":"10.26686/ajl.v15i2.4066","title":"Two Manuscripts, One by Routley, One by Meyer: The Origins of the Routley-Meyer Semantics for Relevance Logics","year":2018,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Relevance (law); Semantics (computer science); Proof-theoretic semantics; Relation (database); Set (abstract data type); Kripke semantics; Presentation (obstetrics); Mathematics; Computer science; Natural language processing; Epistemology; Algebra over a field; Artificial intelligence; Programming language; Operational semantics; Philosophy; Description logic; Pure mathematics; Denotational semantics; Data mining; Intermediate logic","score_opus":0.037993253544921106,"score_gpt":0.27567773915424004,"score_spread":0.23768448560931893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2874049253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26629615,0.006979971,0.6115974,0.09151979,0.006626802,0.0022664738,0.00013258986,0.00017351162,0.014407296],"genre_scores_gemma":[0.98817354,0.00028277127,0.007349751,0.00077355065,0.0007126719,0.0000066420516,0.0000014902369,0.000023077431,0.0026764788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726117,0.00031370166,0.00079907,0.00032085562,0.0006706629,0.00063455506],"domain_scores_gemma":[0.9965801,0.00043643583,0.001180381,0.0010997452,0.00055666984,0.00014664241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017687391,0.00031866797,0.00052022445,0.000056796198,0.0005198011,0.00021009837,0.0040224823,0.00013097413,0.000042238677],"category_scores_gemma":[0.00032986575,0.00014918527,0.0003683848,0.00050223386,0.0007453039,0.00037695342,0.00034210196,0.00065423123,0.00003854642],"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.00031618075,0.0016722648,0.0067643872,0.00015877912,0.0008650737,0.000030602503,0.0077094357,0.00026045882,0.04640058,0.65333,0.26838845,0.01410377],"study_design_scores_gemma":[0.008196483,0.007504382,0.015663749,0.0010768735,0.0013080463,0.0015043869,0.0022090378,0.005784666,0.16459882,0.44921216,0.3409169,0.0020244778],"about_ca_topic_score_codex":0.000028540293,"about_ca_topic_score_gemma":0.000033587763,"teacher_disagreement_score":0.72187746,"about_ca_system_score_codex":0.0001516041,"about_ca_system_score_gemma":0.00015897934,"threshold_uncertainty_score":0.74748397},"labels":[],"label_agreement":null},{"id":"W3130255400","doi":"10.26686/ajl.v18i1.6539","title":"Ehrenfeucht-Fraïssé games without identity","year":2021,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Identity (music); Relation (database); Binary relation; Mathematics; Identity function; Binary number; Linguistics; Computer science; Discrete mathematics; Arithmetic; Philosophy; Data mining","score_opus":0.13659996050845932,"score_gpt":0.4161479154486735,"score_spread":0.2795479549402142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130255400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9511466,0.00044295148,0.017511927,0.018601181,0.00046683176,0.00008467263,0.0000064143337,0.000015531448,0.011723881],"genre_scores_gemma":[0.99205464,0.000029664703,0.0014727253,0.00038317445,0.00025250384,0.0000014592498,3.802726e-7,0.0000060036673,0.0057994355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974618,0.0004868939,0.000745158,0.00017956493,0.0009123676,0.0002142065],"domain_scores_gemma":[0.9974334,0.0005844946,0.00062916544,0.00065484695,0.000556284,0.00014176525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037272118,0.00011371424,0.00030046116,0.00010077103,0.00020197421,0.00033164443,0.0014314204,0.000054756536,0.002121122],"category_scores_gemma":[0.0016208522,0.000060285638,0.00025763744,0.0007542083,0.00024464636,0.0005128593,0.00011857283,0.00038158585,0.00055859156],"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.00023760399,0.0007573499,0.060355946,0.00001566754,0.00033080368,0.00074246817,0.0052710767,0.0016591817,0.04773475,0.73190755,0.050128616,0.100859],"study_design_scores_gemma":[0.00026274758,0.00006896154,0.04911023,0.000018941873,0.000047163412,0.0011697722,0.0024177225,0.000015837108,0.003661842,0.93277884,0.0103616305,0.00008632145],"about_ca_topic_score_codex":9.688649e-7,"about_ca_topic_score_gemma":0.000010287556,"teacher_disagreement_score":0.20087129,"about_ca_system_score_codex":0.000019886946,"about_ca_system_score_gemma":0.0001363429,"threshold_uncertainty_score":0.9987911},"labels":[],"label_agreement":null},{"id":"W4317796404","doi":"10.26686/ajl.v19i5.7540","title":"Minimally Nonstandard K3 and FDE","year":2022,"lang":"en","type":"article","venue":"The Australasian Journal of 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":"Concordia University","funders":"","keywords":"Paraconsistent logic; Sequent; Propositional calculus; Mathematics; Sequent calculus; Classical logic; Many-valued logic; Logical consequence; Intermediate logic; Order (exchange); Intuitionistic logic; Computer science; Calculus (dental); Higher-order logic; Algorithm; Algebra over a field; Discrete mathematics; Description logic; Theoretical computer science; Artificial intelligence; Pure mathematics; Medicine","score_opus":0.03186449682996105,"score_gpt":0.30905431996620286,"score_spread":0.2771898231362418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317796404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78300244,0.00038914583,0.00014135023,0.024920778,0.00069266575,0.00008402391,0.0000145603735,0.000009488555,0.19074555],"genre_scores_gemma":[0.99873275,0.0000059690738,0.00017488738,0.0005731202,0.0001342217,0.0000020041505,1.3484099e-7,0.0000040521895,0.0003728511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989705,0.00026408664,0.00022308176,0.00009545961,0.00024406289,0.00020277212],"domain_scores_gemma":[0.9994239,0.00013864296,0.00016524729,0.00014058671,0.000026019916,0.00010557404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00109171,0.00007146097,0.00013310146,0.00004647999,0.00023094384,0.000021978087,0.0004553342,0.000022445794,0.0028133444],"category_scores_gemma":[0.00004410637,0.000042205775,0.00006874988,0.00016259754,0.00040580716,0.000050390245,0.00008496189,0.0004203228,0.00002045398],"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.0003557434,0.000101580335,0.0008536488,0.0000017708869,0.00004759995,0.00044132132,0.0020146105,0.000027625778,0.0008293049,0.9873008,0.0018617405,0.0061642667],"study_design_scores_gemma":[0.0010222987,0.002516999,0.024080705,0.000013622346,0.000069885944,0.006194187,0.0038463587,0.000005860505,0.00012048984,0.9514646,0.010503322,0.00016169013],"about_ca_topic_score_codex":0.0000013760239,"about_ca_topic_score_gemma":2.755212e-7,"teacher_disagreement_score":0.21573032,"about_ca_system_score_codex":0.00002345673,"about_ca_system_score_gemma":0.0000300057,"threshold_uncertainty_score":0.9980982},"labels":[],"label_agreement":null},{"id":"W4366003179","doi":"10.26686/ajl.v20i1.8086","title":"Geometry of Relevant Implication II","year":2023,"lang":"en","type":"article","venue":"The Australasian Journal of 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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Mathematics; Fragment (logic); Variable (mathematics); Geometry; Algebra over a field; Calculus (dental); Pure mathematics; Algorithm; Mathematical analysis; Philosophy; Epistemology; Medicine","score_opus":0.03860147774022106,"score_gpt":0.2863669516867643,"score_spread":0.24776547394654325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366003179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6714695,0.0006510387,0.3006523,0.020319937,0.0021349022,0.00044710826,0.000001723447,0.00020586843,0.0041176225],"genre_scores_gemma":[0.99799395,0.00004311034,0.0011212846,0.00003498954,0.00014195174,0.0000015191173,4.4218734e-7,0.0000044737953,0.0006582634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886227,0.00008822226,0.00043836085,0.00010502194,0.00029485486,0.0002112669],"domain_scores_gemma":[0.9987995,0.00007994447,0.0005377863,0.000375446,0.00014202695,0.00006531125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218773,0.000082947125,0.0001911205,0.00017125266,0.00010806866,0.000042971253,0.0010737581,0.00005024456,0.00001149064],"category_scores_gemma":[0.000082243816,0.000046513866,0.00012680964,0.0007987819,0.00006529393,0.0001909191,0.00013568663,0.00018044979,0.000058422964],"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.000027402917,0.00016973261,0.0056521595,0.00008569549,0.000152272,0.00013833413,0.0043918155,0.0005325866,0.015425756,0.86940444,0.010790736,0.09322907],"study_design_scores_gemma":[0.0017579821,0.0042380868,0.21227598,0.00008129478,0.00011857123,0.0034418043,0.002377922,0.001520884,0.01905071,0.7166578,0.037887845,0.0005911241],"about_ca_topic_score_codex":0.0000056434255,"about_ca_topic_score_gemma":6.3265736e-7,"teacher_disagreement_score":0.32652447,"about_ca_system_score_codex":0.000020647536,"about_ca_system_score_gemma":0.000051353367,"threshold_uncertainty_score":0.19953276},"labels":[],"label_agreement":null},{"id":"W4400722659","doi":"10.26686/ajl.v21i3.7409","title":"Condorcet-Style Paradoxes for Majority Rule with Infinte Candidates","year":2024,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Game Theory and Voting Systems","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":"Douglas College","funders":"European Commission; Yale University","keywords":"Condorcet method; Style (visual arts); Majority rule; Computer science; Mathematical economics; Mathematics; Artificial intelligence; Political science; Law; Voting; Art; Literature","score_opus":0.03478268939167749,"score_gpt":0.2533978271974986,"score_spread":0.2186151378058211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400722659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9741632,0.0036584248,0.0074161384,0.0046258303,0.0011132084,0.00032911016,0.00013590492,0.00004259137,0.008515646],"genre_scores_gemma":[0.9959694,0.000032901255,0.00044128727,0.00007237046,0.0003349501,0.000006175448,0.0000019355564,0.000016469467,0.0031245213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990075,0.000034874618,0.0005470515,0.00014117037,0.00003795279,0.00023144766],"domain_scores_gemma":[0.9991712,0.00019453785,0.00036122178,0.00016863026,0.00003806079,0.000066345325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014741301,0.00012756199,0.00035529735,0.00012322485,0.000094956435,0.00015926348,0.00031019223,0.000055222496,0.00017554485],"category_scores_gemma":[0.0000760556,0.00007882017,0.00015677222,0.00014627664,0.000109834604,0.00018150368,0.000014610105,0.0002550551,0.00013778414],"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.00032206392,0.00007105635,0.022346862,0.0002859973,0.00053590594,0.00009469494,0.0024967548,0.0004399529,0.00018747897,0.9669796,0.0051725926,0.001067001],"study_design_scores_gemma":[0.0021612463,0.0022309641,0.012615157,0.0006706094,0.00016174777,0.002171358,0.0021706251,0.0013635571,0.0014880833,0.87636226,0.097963735,0.00064063753],"about_ca_topic_score_codex":0.000022538554,"about_ca_topic_score_gemma":0.000006401794,"teacher_disagreement_score":0.09279114,"about_ca_system_score_codex":0.000037167352,"about_ca_system_score_gemma":0.000028976558,"threshold_uncertainty_score":0.32141933},"labels":[],"label_agreement":null}]}