{"meta":{"query_hash":"5302457a56ec","filters":{"venue":"Journal of Applied Logic"},"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/5302457a56ec","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Applied+Logic"},"results":[{"id":"W1964362679","doi":"10.1016/j.jal.2015.02.004","title":"Robot location estimation in the situation calculus","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Formalism (music); Computer science; Situation calculus; Extension (predicate logic); Probability distribution; Robot; Artificial intelligence; Mathematics; Programming language; Statistics","score_opus":0.03803709147389608,"score_gpt":0.273853608544731,"score_spread":0.23581651707083492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964362679","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.02267075,0.00043139764,0.9671794,0.0008046099,0.00006451386,0.00003702381,0.00012686056,0.00031829602,0.008367138],"genre_scores_gemma":[0.7335306,0.0007331629,0.25903246,0.00017247415,0.00019205057,0.0000891526,0.00022268061,0.00010089238,0.005926544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972783,0.0007767228,0.00024604067,0.00055148377,0.0007968807,0.0003505561],"domain_scores_gemma":[0.9970041,0.0017702291,0.00024511036,0.00037037078,0.0004365291,0.00017366199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034679526,0.0006846253,0.0012494029,0.0019197619,0.0017218728,0.005373735,0.003001859,0.001607025,0.0038580857],"category_scores_gemma":[0.009690761,0.00096523843,0.0020780049,0.0020634248,0.0034971982,0.00949583,0.0037920862,0.002375687,0.000704555],"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.000101403006,0.000043269367,0.0006777918,0.000074417185,0.000049862043,0.00030204596,0.00040790226,0.046648733,0.0006311306,0.92907757,0.00097496464,0.021010851],"study_design_scores_gemma":[0.000019326219,0.000014803379,0.00011393181,0.00001805533,0.00004120144,0.00007901654,0.00007555532,0.1917299,0.00044234443,0.8058893,0.0015521214,0.000024552366],"about_ca_topic_score_codex":0.011858707,"about_ca_topic_score_gemma":0.0074535743,"teacher_disagreement_score":0.011858707,"about_ca_system_score_codex":0.0021791852,"about_ca_system_score_gemma":0.0019458252,"threshold_uncertainty_score":0.023579359},"labels":[],"label_agreement":null},{"id":"W1967150508","doi":"10.1016/j.jal.2015.01.003","title":"The fallacy of composition: Guiding concepts, historical cases, and research problems","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Pragmatism in Philosophy and Education","field":"Arts and Humanities","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Universiteit van Amsterdam; University of Windsor","keywords":"Argumentation theory; Epistemology; Fallacy; Argument (complex analysis); Conflation; Pluralism (philosophy); Context (archaeology); Holism; Philosophy; Sociology; Philosophy of science; History","score_opus":0.31197800924728725,"score_gpt":0.35676581717237765,"score_spread":0.044787807925090406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967150508","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082304016,0.016046148,0.31000397,0.075095765,0.0012678034,0.00035783934,0.00015861861,0.0003562665,0.5144096],"genre_scores_gemma":[0.9083551,0.004974836,0.05377848,0.002734017,0.00086423056,0.00030119895,0.000106085696,0.0003117717,0.028574195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917652,0.0055275634,0.00034313908,0.0011063579,0.00083186734,0.0004259778],"domain_scores_gemma":[0.9807499,0.014185354,0.0009541833,0.0022991179,0.0013360621,0.00047537306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01553485,0.0006857527,0.0010979354,0.0033795212,0.008062007,0.008292402,0.002623021,0.004157744,0.008881553],"category_scores_gemma":[0.027420249,0.0007560325,0.0008281206,0.004360167,0.058071155,0.028273761,0.005716546,0.0065871254,0.0012407175],"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.000013646997,0.0000056142358,0.00007924899,0.000013786259,9.0480586e-7,0.000023086426,0.0012520449,0.00004943725,0.000016651764,0.9957178,0.00041164446,0.00241614],"study_design_scores_gemma":[0.000016138103,0.000011283448,0.00007740699,0.00006458868,0.0000040497102,0.000120913726,0.0012530506,0.0005711222,0.00022641527,0.9807585,0.01688966,0.0000068886707],"about_ca_topic_score_codex":0.003081238,"about_ca_topic_score_gemma":0.002592423,"teacher_disagreement_score":0.01553485,"about_ca_system_score_codex":0.004352977,"about_ca_system_score_gemma":0.0039023126,"threshold_uncertainty_score":0.082157135},"labels":[],"label_agreement":null},{"id":"W1971205270","doi":"10.1016/j.jal.2012.07.008","title":"Improving the semantics of the Software Cost Reduction method","year":2012,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McMaster University","funders":"","keywords":"Computer science; Programming language; Semantics (computer science); Ambiguity; Extension (predicate logic); Reduction (mathematics); Software; Readability; Theoretical computer science; Mathematics","score_opus":0.041436600822148575,"score_gpt":0.29699472120135,"score_spread":0.25555812037920145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971205270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014304193,0.00024975007,0.9786709,0.0006293805,0.00012902632,0.000056931603,0.00007085266,0.0010706743,0.004818284],"genre_scores_gemma":[0.3155369,0.00042548688,0.6773371,0.00048771332,0.00026808327,0.00014091667,0.00018797017,0.0010032378,0.004612573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99395293,0.0017696789,0.00033700286,0.0006652759,0.002895736,0.000379393],"domain_scores_gemma":[0.9944147,0.0023843118,0.0003101353,0.0014216393,0.0013480217,0.00012112293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003353573,0.0009278123,0.0008985744,0.001847995,0.0008015312,0.0026623632,0.0021468308,0.0011518504,0.0036047706],"category_scores_gemma":[0.011315664,0.00058801443,0.0016970218,0.0013961623,0.0018955807,0.0050378577,0.0025537203,0.0028269067,0.0008504834],"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.00028502446,0.0001882151,0.0008474879,0.00044277337,0.00009685259,0.00017797787,0.0003319195,0.038226902,0.015977453,0.69903505,0.005228883,0.23916139],"study_design_scores_gemma":[0.00011139688,0.00015925503,0.0004012378,0.00009961895,0.00013991233,0.00023453464,0.00009762797,0.27623242,0.020075915,0.6803967,0.021983072,0.000068361216],"about_ca_topic_score_codex":0.0012316657,"about_ca_topic_score_gemma":0.0015948685,"teacher_disagreement_score":0.0036047706,"about_ca_system_score_codex":0.0011008222,"about_ca_system_score_gemma":0.002485456,"threshold_uncertainty_score":0.01773554},"labels":[],"label_agreement":null},{"id":"W1971671369","doi":"10.1016/j.jal.2004.02.004","title":"Variants of the basic calculus of constructions","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Calculus (dental); Subject (documents); Mathematics; Algebra over a field; Computer science; Pure mathematics; Medicine","score_opus":0.018014591920120702,"score_gpt":0.23053266237357364,"score_spread":0.21251807045345295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971671369","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.02810499,0.0037878237,0.806894,0.00326898,0.0022407786,0.00014082252,0.00090576493,0.0013246518,0.15333225],"genre_scores_gemma":[0.5704994,0.0038926776,0.35159943,0.0018489687,0.0025500262,0.00035428628,0.0012650607,0.0011935778,0.06679651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975073,0.0006867237,0.00017561208,0.00048611182,0.00081258203,0.00033172764],"domain_scores_gemma":[0.9973894,0.0009404271,0.00011411722,0.00081561704,0.0004831873,0.00025730822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029334913,0.0012054541,0.0014085874,0.0022751854,0.003409895,0.0064070257,0.003102629,0.0020396323,0.0103783235],"category_scores_gemma":[0.005009255,0.0010887282,0.0030443075,0.003089451,0.0065312097,0.010507757,0.004727651,0.0062527,0.002267114],"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.00001355681,0.0000059831164,0.00004864325,0.000012859711,0.000004209785,0.000029282346,0.00009335618,0.00012320888,0.00018146216,0.99529475,0.00096981094,0.003222819],"study_design_scores_gemma":[0.000014656655,0.00000896416,0.000068194146,0.000011440269,0.000015269301,0.00012855348,0.000037180474,0.0012977996,0.00025487455,0.98123944,0.01691059,0.00001303145],"about_ca_topic_score_codex":0.0022886186,"about_ca_topic_score_gemma":0.0027797841,"teacher_disagreement_score":0.0103783235,"about_ca_system_score_codex":0.0016655584,"about_ca_system_score_gemma":0.0015441374,"threshold_uncertainty_score":0.03471899},"labels":[],"label_agreement":null},{"id":"W1972387650","doi":"10.1016/j.jal.2011.01.001","title":"Reasoning about conditional probabilities in a higher-order-logic theorem prover","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Conditional probability; Automated theorem proving; Probabilistic logic; Bayes' theorem; Law of total probability; Theoretical computer science; Computer science; Mathematics; Conditional mutual information; Probability theory; Discrete mathematics; Gas meter prover; Regular conditional probability; Algorithm; Posterior probability; Artificial intelligence; Bayesian probability; Mathematical proof; Programming language; Statistics","score_opus":0.06770647973216208,"score_gpt":0.2773710722070462,"score_spread":0.20966459247488411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972387650","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.012465727,0.000051565745,0.982599,0.0004253383,0.000056188823,0.00006570756,0.00020256074,0.0022898938,0.0018439451],"genre_scores_gemma":[0.39505452,0.000191154,0.6001292,0.00055768713,0.00019834645,0.00012181675,0.00060915464,0.0006088558,0.0025292258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99025005,0.003438858,0.00086169847,0.0013458673,0.0032129032,0.0008906021],"domain_scores_gemma":[0.9427005,0.050719846,0.0012618345,0.0029465233,0.0018810023,0.0004904127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012512704,0.0011773187,0.0018580183,0.0028123027,0.0018816073,0.0057796165,0.0047184364,0.0022807927,0.009558126],"category_scores_gemma":[0.040216345,0.0018008428,0.004284343,0.0018270565,0.0038198212,0.011031239,0.0052196626,0.0041235923,0.001420564],"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.00039026194,0.00024068897,0.0032020663,0.00051685976,0.0003102198,0.0010891033,0.00073539186,0.07271471,0.006021401,0.8548964,0.0041482775,0.055734534],"study_design_scores_gemma":[0.00013569897,0.00003765623,0.00022355317,0.00003638979,0.00015543771,0.00022064653,0.000058096728,0.34584135,0.01061056,0.6399473,0.0026895313,0.000043772026],"about_ca_topic_score_codex":0.003107835,"about_ca_topic_score_gemma":0.0048155626,"teacher_disagreement_score":0.012512704,"about_ca_system_score_codex":0.0025099542,"about_ca_system_score_gemma":0.003115032,"threshold_uncertainty_score":0.06617427},"labels":[],"label_agreement":null},{"id":"W1982718004","doi":"10.1016/j.jal.2015.03.003","title":"Uncertain reasoning at FLAIRS","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Artificial intelligence; Computer science","score_opus":0.040646080432969946,"score_gpt":0.25823348373113897,"score_spread":0.21758740329816903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982718004","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.050853234,0.0016337348,0.870225,0.0067424127,0.0003437535,0.000090527654,0.0007880048,0.0010703403,0.06825293],"genre_scores_gemma":[0.781511,0.00082158577,0.1892677,0.000944384,0.00047752983,0.000081166065,0.0012823832,0.00028720775,0.025326943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979634,0.0007971134,0.00011590959,0.00033409748,0.00056445797,0.00022499402],"domain_scores_gemma":[0.9948155,0.0038077298,0.00020205666,0.00041261505,0.00056045933,0.00020158051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024529404,0.0006194533,0.00079765555,0.0022364447,0.0019629633,0.0044289418,0.0015776827,0.0018387889,0.019049803],"category_scores_gemma":[0.013871538,0.00064440747,0.0018333426,0.001428086,0.0027465143,0.0101013,0.002779866,0.0029924691,0.001280654],"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.00019296384,0.000037372196,0.0005846965,0.00011347903,0.00006409401,0.0002615573,0.00030806786,0.04376269,0.0009289191,0.91254663,0.005864456,0.035335083],"study_design_scores_gemma":[0.000008707899,0.000012305065,0.00012873327,0.000025130023,0.000024920027,0.000044197277,0.00006920026,0.10011254,0.00092415005,0.8931163,0.0055205757,0.000013247756],"about_ca_topic_score_codex":0.0103774965,"about_ca_topic_score_gemma":0.007062812,"teacher_disagreement_score":0.019049803,"about_ca_system_score_codex":0.0030646406,"about_ca_system_score_gemma":0.00093901297,"threshold_uncertainty_score":0.063727915},"labels":[],"label_agreement":null},{"id":"W1990869586","doi":"10.1016/j.jal.2012.04.001","title":"Quine on intensional entities: Modality and quantification, truth and satisfaction","year":2012,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quine; Epistemology; Philosophy; Interpretation (philosophy); Explication; Object (grammar); Modal logic; Logical truth; Modal; Computer science; Linguistics","score_opus":0.045809295269993174,"score_gpt":0.315232611619914,"score_spread":0.26942331634992084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990869586","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.09525874,0.02379054,0.54362524,0.04358613,0.0021378226,0.00008693419,0.0006932357,0.0004359168,0.29038554],"genre_scores_gemma":[0.9446954,0.0036702405,0.03318468,0.0018774351,0.0014285336,0.000108881315,0.00015926939,0.00013589529,0.014739694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976295,0.0012809813,0.00016838632,0.00041312567,0.0003184508,0.00018949904],"domain_scores_gemma":[0.9956071,0.0029449542,0.00023167589,0.00060511794,0.00045993083,0.0001512016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004972813,0.0007520338,0.0011594798,0.0021010402,0.0029157582,0.0048815613,0.0013468863,0.0027128262,0.0070932778],"category_scores_gemma":[0.008153622,0.0008609495,0.0016914175,0.002329032,0.014090589,0.020121528,0.0042487206,0.005527734,0.0005790866],"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.000009445901,0.0000029355506,0.00004682328,0.00001890944,0.000004578319,0.000019673098,0.00024133344,0.000112348906,0.0000754847,0.99745077,0.0004328317,0.0015849366],"study_design_scores_gemma":[0.000005187308,0.000004074509,0.00007056734,0.0000089368505,0.000005002268,0.000022981287,0.000041843952,0.0004624712,0.00007907675,0.99711907,0.0021743528,0.0000066016714],"about_ca_topic_score_codex":0.0027310734,"about_ca_topic_score_gemma":0.001867261,"teacher_disagreement_score":0.0070932778,"about_ca_system_score_codex":0.0018709056,"about_ca_system_score_gemma":0.0008920616,"threshold_uncertainty_score":0.02629906},"labels":[],"label_agreement":null},{"id":"W1991850485","doi":"10.1016/j.jal.2015.03.001","title":"Reflecting rules: A note on generalizing the deduction theorem","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Killam Trusts","keywords":"Generalization; Mathematics; Rule of inference; Fundamental theorem; Object (grammar); Automated theorem proving; Compactness theorem; Discrete mathematics; Natural deduction; Calculus (dental); Computer science; Algorithm; Fixed-point theorem; Artificial intelligence; Mathematical analysis","score_opus":0.07179899582884149,"score_gpt":0.3140917748543214,"score_spread":0.2422927790254799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991850485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038192864,0.0020779055,0.95144945,0.0049258093,0.001366374,0.0001861439,0.00024119222,0.0007148007,0.035219006],"genre_scores_gemma":[0.14112929,0.006874296,0.81860536,0.007147492,0.0042635384,0.0005775831,0.00083093194,0.0011190933,0.019452365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901281,0.0031040611,0.0010323358,0.0025292132,0.0026679726,0.0005382911],"domain_scores_gemma":[0.97653687,0.0127410805,0.00050651166,0.0076027378,0.002250829,0.0003619701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016814979,0.0016741833,0.002485696,0.0028386577,0.0023728465,0.008654968,0.009240911,0.005138894,0.009398657],"category_scores_gemma":[0.03149031,0.0014899842,0.0067954944,0.0027843348,0.011110575,0.026416156,0.009110916,0.0128172,0.0034748523],"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.000044418994,0.00003970124,0.0002057756,0.00019411302,0.000055071374,0.00015675004,0.00046271618,0.001980474,0.0006263225,0.95966,0.0048627723,0.031711858],"study_design_scores_gemma":[0.000019987716,0.000015274074,0.000058750695,0.000038650247,0.00003299732,0.00009569413,0.000039060073,0.0035440174,0.0007576883,0.9815958,0.013780219,0.000021783495],"about_ca_topic_score_codex":0.0035739972,"about_ca_topic_score_gemma":0.001770084,"teacher_disagreement_score":0.016814979,"about_ca_system_score_codex":0.002007734,"about_ca_system_score_gemma":0.0020938711,"threshold_uncertainty_score":0.08892715},"labels":[],"label_agreement":null},{"id":"W2009328505","doi":"10.1016/j.jal.2009.02.001","title":"Deontic action logic, atomic boolean algebras and fault-tolerance","year":2009,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Action (physics); Computer science; Theoretical computer science; Fault tolerance; Artificial intelligence; Algorithm; Programming language; Mathematics; Epistemology; Philosophy; Physics; Distributed computing","score_opus":0.019026955996949,"score_gpt":0.25567629607359293,"score_spread":0.23664934007664393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009328505","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.05228167,0.0053312136,0.888088,0.0039128484,0.00048479324,0.00008581577,0.00028333618,0.00060774584,0.048924625],"genre_scores_gemma":[0.84895855,0.0026509543,0.13209659,0.00082257116,0.000498643,0.0001364466,0.00042138316,0.00010629371,0.01430854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998145,0.0004439024,0.00019268076,0.00034124684,0.00058901415,0.00028827874],"domain_scores_gemma":[0.9961707,0.0018796716,0.00047248293,0.00072504644,0.0005621958,0.00018985513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027911311,0.00062409573,0.0008541999,0.0013125907,0.0018478947,0.0039359904,0.0020967557,0.0019448772,0.003488707],"category_scores_gemma":[0.005787579,0.00049892784,0.0011827733,0.0016258607,0.0050047464,0.007937836,0.0019000852,0.0030841702,0.00046050362],"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.000036784808,0.000018950082,0.00013489989,0.000047319103,0.000010150409,0.000056695586,0.00014888731,0.0039807446,0.00038657707,0.98719364,0.0007016093,0.0072836843],"study_design_scores_gemma":[0.000010921323,0.000006809583,0.00004389402,0.000012075266,0.000012666168,0.000043994347,0.00003975043,0.009590994,0.00037035014,0.9871731,0.002688013,0.0000073442184],"about_ca_topic_score_codex":0.004901376,"about_ca_topic_score_gemma":0.0036736657,"teacher_disagreement_score":0.004901376,"about_ca_system_score_codex":0.0023249723,"about_ca_system_score_gemma":0.0019003458,"threshold_uncertainty_score":0.01686889},"labels":[],"label_agreement":null},{"id":"W2011126595","doi":"10.1016/j.jal.2014.07.001","title":"The categorical imperative: Category theory as a foundation for deontic logic","year":2014,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Deontic logic; Foundation (evidence); Categorical variable; Categorical imperative; Category theory; Artificial intelligence; Computer science; Natural language processing; Mathematics; Epistemology; Philosophy; Pure mathematics; Machine learning; Political science","score_opus":0.014039131842560983,"score_gpt":0.26584042099298766,"score_spread":0.25180128915042665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011126595","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.025177557,0.008055841,0.85086685,0.018442016,0.001055902,0.00006672163,0.0005028736,0.00052840007,0.09530374],"genre_scores_gemma":[0.79658264,0.0030569665,0.18286702,0.00236642,0.0018942069,0.00020915222,0.000490152,0.00030820328,0.012225237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776936,0.0010229294,0.0001330173,0.00035925137,0.0005256558,0.00018993995],"domain_scores_gemma":[0.9949326,0.0028447923,0.00022278978,0.0008287526,0.0007918122,0.0003792953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045843343,0.00045629047,0.0010116107,0.0022929322,0.0025369122,0.00663567,0.0020503514,0.0022664657,0.004667171],"category_scores_gemma":[0.0067445356,0.0006827468,0.0012298983,0.0019476132,0.012502409,0.012768776,0.0034298664,0.005301905,0.00063014857],"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.000003207634,0.0000022333863,0.000020122361,0.00000921833,0.0000013345419,0.0000057331767,0.000085508815,0.00015092304,0.000044032247,0.99820673,0.00034734647,0.0011236178],"study_design_scores_gemma":[0.0000027973504,0.0000018137171,0.000017499655,0.000006048988,0.0000013584787,0.0000067889423,0.000020645783,0.0009141717,0.00003457073,0.9962047,0.0027864247,0.000003250304],"about_ca_topic_score_codex":0.0038153531,"about_ca_topic_score_gemma":0.0026312072,"teacher_disagreement_score":0.00663567,"about_ca_system_score_codex":0.0031455695,"about_ca_system_score_gemma":0.0027458665,"threshold_uncertainty_score":0.024244547},"labels":[],"label_agreement":null},{"id":"W2017592844","doi":"10.1016/j.jal.2006.03.005","title":"A consistency-based framework for merging knowledge bases","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Merge (version control); Knowledge base; Computer science; Consistency (knowledge bases); Logical consequence; Operator (biology); Theoretical computer science; Mathematics; Artificial intelligence; Information retrieval","score_opus":0.021584547316818525,"score_gpt":0.2681046684767184,"score_spread":0.24652012115989985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017592844","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.002278893,0.00032215117,0.99317366,0.00040169823,0.00006261286,0.00023626354,0.00027181298,0.0018690547,0.0013837939],"genre_scores_gemma":[0.03307885,0.00021766721,0.9636421,0.00016130056,0.00007738562,0.00016774365,0.001176009,0.00031761135,0.0011612971],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98360026,0.0042677606,0.0026687654,0.0023826265,0.0062168315,0.00086380413],"domain_scores_gemma":[0.9624606,0.013426629,0.0020733539,0.012212092,0.008687806,0.0011395558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023242753,0.001276736,0.0022029204,0.008768401,0.0035148035,0.01027107,0.010452678,0.0038216775,0.0069079916],"category_scores_gemma":[0.05976507,0.0027514205,0.004158261,0.008428473,0.0035376528,0.018976776,0.011780218,0.005144966,0.002140787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066335563,0.00031278763,0.002899748,0.0008847306,0.0006113677,0.0009060405,0.0020501271,0.034560185,0.0070346487,0.3563613,0.014851709,0.578864],"study_design_scores_gemma":[0.0002601665,0.00022776434,0.00092886423,0.00048250053,0.00096911006,0.0009861359,0.0006944397,0.2972812,0.021976134,0.6068416,0.06909557,0.00025645847],"about_ca_topic_score_codex":0.011750469,"about_ca_topic_score_gemma":0.013989459,"teacher_disagreement_score":0.023242753,"about_ca_system_score_codex":0.002059355,"about_ca_system_score_gemma":0.006194079,"threshold_uncertainty_score":0.12292093},"labels":[],"label_agreement":null},{"id":"W2040241347","doi":"10.1016/j.jal.2010.08.009","title":"Algebraic tableau reasoning for the description logic <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"> <mml:mi mathvariant=\"script\">SHOQ</mml:mi> </mml:math>","year":2010,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Algebraic number; Artificial intelligence; Mathematics; Algorithm; Computer science; Calculus (dental); Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.024457511496039357,"score_gpt":0.24210826052528778,"score_spread":0.2176507490292484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040241347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009368334,0.0003948785,0.9517935,0.0025000088,0.00020286902,0.00024295461,0.0031660008,0.002381077,0.029950464],"genre_scores_gemma":[0.23795205,0.0008084677,0.73186207,0.0008127333,0.00021759863,0.00036411438,0.006559689,0.00074799213,0.020675398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701345,0.0008700812,0.0004048965,0.00043790776,0.0010555359,0.00021810275],"domain_scores_gemma":[0.9938245,0.003963636,0.00024727097,0.00068540726,0.0010837759,0.0001954111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038869127,0.0007175253,0.00077507814,0.002453594,0.002627368,0.00661403,0.002656222,0.0015797655,0.025021063],"category_scores_gemma":[0.011847754,0.0010413835,0.0033285695,0.002248382,0.0027448626,0.011249328,0.0034683298,0.002972687,0.003579692],"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.000060486756,0.000054660817,0.00035413168,0.00023150841,0.000033822445,0.00018100736,0.0003864198,0.0055751214,0.00082702923,0.96017134,0.008946016,0.02317845],"study_design_scores_gemma":[0.000045317764,0.000015577536,0.00012243232,0.00008598489,0.000059231847,0.00014105803,0.00022305059,0.055940874,0.0026836486,0.91337484,0.027273735,0.000034161905],"about_ca_topic_score_codex":0.014343137,"about_ca_topic_score_gemma":0.024433311,"teacher_disagreement_score":0.025021063,"about_ca_system_score_codex":0.004544828,"about_ca_system_score_gemma":0.0036349038,"threshold_uncertainty_score":0.083703816},"labels":[],"label_agreement":null},{"id":"W2055778401","doi":"10.1016/j.jal.2008.07.002","title":"Formalization of the ad hominem argumentation scheme","year":2008,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Argumentation theory; Argument (complex analysis); Computer science; Scheme (mathematics); Defeasible estate; Defeasible reasoning; Matching (statistics); Artificial intelligence; Identification (biology); Set (abstract data type); Epistemology; Theoretical computer science; Natural language processing; Mathematics; Programming language; Philosophy","score_opus":0.02786709962843172,"score_gpt":0.2324495649588235,"score_spread":0.20458246533039176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055778401","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.027122168,0.00053433527,0.9008563,0.0015445953,0.00040330124,0.0002684409,0.00040247937,0.0005201387,0.06834819],"genre_scores_gemma":[0.5002344,0.0003992234,0.47219288,0.00031917274,0.00023054247,0.00032401722,0.00049346435,0.00011899506,0.025687333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973901,0.0010123368,0.00024989538,0.00039412564,0.00073964975,0.0002139173],"domain_scores_gemma":[0.99825114,0.0006507567,0.00012574026,0.0003745407,0.0004504727,0.00014738174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033171945,0.0006372778,0.0008224271,0.0019752232,0.001871026,0.0043874388,0.002451136,0.0024452147,0.012373251],"category_scores_gemma":[0.0052829427,0.0005069391,0.0012921435,0.0014224043,0.0029197882,0.00466944,0.003285279,0.0026756234,0.001769059],"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.000022295935,0.000015397676,0.000055747572,0.000037445505,0.000008283562,0.000050455175,0.00017815999,0.0011063167,0.0006382799,0.99119204,0.00048205955,0.0062135933],"study_design_scores_gemma":[0.000050778526,0.00004166393,0.00011252813,0.00006470963,0.00002408124,0.00016869274,0.000117608266,0.0304391,0.0017393089,0.94046885,0.026742736,0.000029893488],"about_ca_topic_score_codex":0.0011021737,"about_ca_topic_score_gemma":0.0008284359,"teacher_disagreement_score":0.012373251,"about_ca_system_score_codex":0.0019647924,"about_ca_system_score_gemma":0.0015014653,"threshold_uncertainty_score":0.041392624},"labels":[],"label_agreement":null},{"id":"W2065614356","doi":"10.1016/j.jal.2009.09.003","title":"Selected papers from the Logic in Databases Workshop 2008","year":2009,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Database; Computer science; Programming language; Information retrieval; Artificial intelligence; Natural language processing","score_opus":0.02759794682926558,"score_gpt":0.2627217851141027,"score_spread":0.23512383828483713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065614356","genre_codex":"review","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.0060460865,0.3989902,0.052866593,0.10970297,0.22488813,0.00072588853,0.014309973,0.0017019033,0.19076821],"genre_scores_gemma":[0.016676487,0.26882136,0.028787784,0.013776037,0.07426231,0.0004319201,0.02554843,0.0017504013,0.5699452],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981294,0.00022234168,0.00016387553,0.00038323828,0.00096686336,0.00013425662],"domain_scores_gemma":[0.9934068,0.0014767579,0.00026732698,0.00030533457,0.0034691223,0.001074789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030035304,0.0016252332,0.0020566452,0.007835593,0.0015313267,0.0066884942,0.0017353996,0.0014740869,0.07214886],"category_scores_gemma":[0.0055550826,0.0006898873,0.0013542429,0.010044148,0.00063071394,0.0047731036,0.00204409,0.002399931,0.024538085],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000785942,0.00005426148,0.00020362955,0.00073978887,0.00002609614,0.000076275704,0.00007657804,0.00028095572,0.0006586973,0.002908696,0.89107174,0.10382468],"study_design_scores_gemma":[0.00003705592,0.00003327032,0.0007087134,0.0005898718,0.00005313901,0.00015769618,0.000118430326,0.0004128117,0.00069355796,0.0045708623,0.99260193,0.00002263438],"about_ca_topic_score_codex":0.003857657,"about_ca_topic_score_gemma":0.008025049,"teacher_disagreement_score":0.07214886,"about_ca_system_score_codex":0.004594603,"about_ca_system_score_gemma":0.0035088046,"threshold_uncertainty_score":0.24136198},"labels":[],"label_agreement":null},{"id":"W2066147202","doi":"10.1016/j.jal.2012.04.002","title":"Opacity and the double life of singular propositions","year":2012,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quine; Epistemology; Semantics (computer science); Modal; Modal logic; Focus (optics); Essentialism; Computer science; Possible world; Mathematics; Philosophy; Linguistics; Programming language","score_opus":0.03442234357019545,"score_gpt":0.29872383609444475,"score_spread":0.2643014925242493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066147202","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.52482814,0.0027090395,0.17713764,0.025660133,0.0006600171,0.00007100834,0.00021720763,0.0005911508,0.26812565],"genre_scores_gemma":[0.9900366,0.00021964876,0.0050519095,0.00032397622,0.00017470174,0.000019095603,0.00002752784,0.0000829453,0.004063631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960247,0.0017726701,0.0002149643,0.0005365504,0.0009742673,0.0004768664],"domain_scores_gemma":[0.9724525,0.019379089,0.0017530846,0.0030795278,0.0021156,0.0012200664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005588396,0.00040450058,0.00079685746,0.002523135,0.0053668967,0.008075651,0.0012489764,0.0029027467,0.0080435],"category_scores_gemma":[0.036821034,0.0009514191,0.0007638966,0.0014014842,0.018112581,0.026135426,0.0055665984,0.00593099,0.00060248014],"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.00005559004,0.000014582687,0.00047258523,0.00002015874,0.0000062649174,0.0001266004,0.002398295,0.0001204755,0.0003196662,0.99247724,0.00042730893,0.0035612967],"study_design_scores_gemma":[0.000010567637,0.0000066852704,0.00014680592,0.000010161548,0.000007779198,0.00007810631,0.00027472482,0.00047759395,0.00022773207,0.9969908,0.0017604545,0.000008526976],"about_ca_topic_score_codex":0.0016120143,"about_ca_topic_score_gemma":0.0010476605,"teacher_disagreement_score":0.008075651,"about_ca_system_score_codex":0.0020660392,"about_ca_system_score_gemma":0.0014866344,"threshold_uncertainty_score":0.029554605},"labels":[],"label_agreement":null},{"id":"W2075202684","doi":"10.1016/j.jal.2006.11.001","title":"Error analysis of digital filters using HOL theorem proving","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Fixed-point arithmetic; Mathematics; Digital filter; Algorithm; Mathematical proof; Parametric statistics; Fixed point; Filter (signal processing); Floating point; Discrete mathematics; Arithmetic; Computer science; Mathematical analysis","score_opus":0.04357466503073198,"score_gpt":0.3204460977775031,"score_spread":0.2768714327467711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075202684","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.012245971,0.00013449856,0.9854138,0.00015129494,0.000051712574,0.0000128008105,0.000021992433,0.00022397931,0.001743951],"genre_scores_gemma":[0.80118865,0.0003849106,0.19221339,0.00021089791,0.00016623475,0.000057275178,0.00012523071,0.00030506527,0.0053483346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959254,0.001055385,0.00023927943,0.00045571633,0.0019810654,0.0003431945],"domain_scores_gemma":[0.9726882,0.019794585,0.001236324,0.0029456369,0.0030785708,0.00025667882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053634285,0.00088610203,0.0012157173,0.0021136124,0.0008880342,0.0027071664,0.0019428014,0.0011397131,0.003884794],"category_scores_gemma":[0.023588901,0.0005243929,0.0009994288,0.0010172171,0.002592541,0.0040902137,0.002673043,0.0021935583,0.0004025898],"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.00084966427,0.00013702206,0.002784457,0.00038732254,0.00018236836,0.00027079004,0.0004052727,0.22870602,0.008285962,0.62327534,0.002442977,0.13227284],"study_design_scores_gemma":[0.00003301494,0.000045042878,0.00024728666,0.000028036604,0.000033112156,0.000060400856,0.00003160958,0.7716597,0.0077648787,0.21910119,0.0009761112,0.000019637244],"about_ca_topic_score_codex":0.0016291793,"about_ca_topic_score_gemma":0.0014281329,"teacher_disagreement_score":0.0053634285,"about_ca_system_score_codex":0.001565586,"about_ca_system_score_gemma":0.0011677113,"threshold_uncertainty_score":0.028364897},"labels":[],"label_agreement":null},{"id":"W2076905458","doi":"10.1016/j.jal.2012.02.001","title":"Reasoning about visibility","year":2012,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary relation; Computer science; Domain (mathematical analysis); Visibility; Sequence (biology); Modal logic; Algorithm; Modal; Polynomial; Firewall (physics); Theoretical computer science; Time complexity; Mathematics; Discrete mathematics; Geometry","score_opus":0.015345888575778484,"score_gpt":0.25432082142577206,"score_spread":0.23897493284999358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076905458","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.16611676,0.0015674483,0.75669134,0.008619297,0.00044089044,0.00021878115,0.0021085504,0.0013804679,0.06285658],"genre_scores_gemma":[0.8499501,0.0007499963,0.13983461,0.0006175167,0.00026248948,0.00007785065,0.0018439501,0.00030772918,0.0063557485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955037,0.0010285231,0.0003728323,0.0012438189,0.0012645995,0.0005864502],"domain_scores_gemma":[0.9865008,0.008645847,0.0007950808,0.0023005307,0.0012459725,0.00051172165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003045723,0.0010285092,0.0011576511,0.002936754,0.0024909368,0.0065327007,0.0028330903,0.0025445228,0.008805472],"category_scores_gemma":[0.024256125,0.0017082187,0.0036377353,0.0026491976,0.0046005123,0.025886368,0.005656316,0.00561815,0.0007031816],"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.00015996724,0.00007951782,0.00263363,0.00021896439,0.00013606613,0.00047433135,0.0010011059,0.008982845,0.0016841125,0.95073867,0.0044221585,0.029468577],"study_design_scores_gemma":[0.000026450476,0.000016981956,0.00032335857,0.00005136104,0.000097705306,0.00016891255,0.00031604906,0.026190054,0.0019710087,0.9647083,0.0061073713,0.000022316355],"about_ca_topic_score_codex":0.0064261025,"about_ca_topic_score_gemma":0.0054920553,"teacher_disagreement_score":0.008805472,"about_ca_system_score_codex":0.0016191184,"about_ca_system_score_gemma":0.0013188218,"threshold_uncertainty_score":0.029457271},"labels":[],"label_agreement":null},{"id":"W2079311564","doi":"10.1016/j.jal.2011.08.003","title":"An analytic tableau calculus for a temporalised belief logic","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Australian Research Council","keywords":"Soundness; Completeness (order theory); Calculus (dental); Proof calculus; Sketch; Modal logic; Computer science; Dynamic logic (digital electronics); Temporal logic; Mathematics; Natural deduction; Algorithm; Theoretical computer science; Programming language; Modal","score_opus":0.07666570988216673,"score_gpt":0.2869100306169845,"score_spread":0.21024432073481777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079311564","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.009254912,0.0003363622,0.9643137,0.0010914163,0.00021580418,0.00010445087,0.00045702196,0.00054328446,0.023683062],"genre_scores_gemma":[0.38187093,0.0006390737,0.5909473,0.0005253089,0.00026219946,0.00032396015,0.00067770877,0.00033927328,0.024414262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987054,0.0003257963,0.00012216848,0.00020959237,0.00045700776,0.00018001928],"domain_scores_gemma":[0.9982698,0.0009916337,0.00008043529,0.00019035737,0.00034403848,0.00012367796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022797133,0.000712982,0.0010023481,0.001716855,0.0022284384,0.006666474,0.0025055525,0.0016009163,0.011916245],"category_scores_gemma":[0.005090244,0.0008650743,0.0021891033,0.002232914,0.0034986192,0.007176175,0.0024687157,0.0030831427,0.00168572],"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.00001004928,0.0000070700457,0.00002682884,0.00001784235,0.000004766909,0.000034812267,0.00013905995,0.0013047967,0.00031759188,0.9947471,0.00052119594,0.0028687643],"study_design_scores_gemma":[0.000011849434,0.000006979341,0.000020518239,0.000011385756,0.000012289623,0.000027691369,0.000044550645,0.016806416,0.00040691218,0.9770314,0.005607366,0.000012581915],"about_ca_topic_score_codex":0.0064796805,"about_ca_topic_score_gemma":0.004635358,"teacher_disagreement_score":0.011916245,"about_ca_system_score_codex":0.004002937,"about_ca_system_score_gemma":0.0023018825,"threshold_uncertainty_score":0.039863825},"labels":[],"label_agreement":null},{"id":"W2083981797","doi":"10.1016/j.jal.2006.03.009","title":"An axiomatization of family resemblance","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Closeness; Term (time); Representation (politics); Mathematics; Family resemblance; Measure (data warehouse); Integer (computer science); Combinatorics; Discrete mathematics; Computer science; Linguistics; Philosophy; Data mining","score_opus":0.02280034758243311,"score_gpt":0.26810708951149853,"score_spread":0.24530674192906543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083981797","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.0601146,0.000721628,0.85840935,0.003648813,0.0004250771,0.0001105103,0.00068940496,0.0006994732,0.07518108],"genre_scores_gemma":[0.72458905,0.00056740094,0.2640761,0.00084590435,0.00031654869,0.00018410177,0.00086903205,0.00014774017,0.008404001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745184,0.00079237507,0.00026637805,0.00081884256,0.00046469248,0.00020587398],"domain_scores_gemma":[0.9951179,0.0021102354,0.00026684933,0.0013481114,0.00087973865,0.00027718634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026640426,0.0004624506,0.0006953828,0.0018896196,0.0029418853,0.0025591261,0.0019774616,0.002001956,0.0074536167],"category_scores_gemma":[0.0070376866,0.0008164505,0.0023326434,0.0018366753,0.0052901963,0.010677602,0.0041899504,0.004166426,0.0008317299],"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.000008751519,0.000010749185,0.00020364014,0.000019690804,0.000008994909,0.00006469457,0.00019424252,0.0004672984,0.00023341313,0.99340993,0.0006721061,0.0047065346],"study_design_scores_gemma":[0.000014573617,0.000014629219,0.00023310448,0.000016095317,0.000019387684,0.00027428806,0.00012043501,0.004740353,0.00039231055,0.9869307,0.0072317785,0.000012464262],"about_ca_topic_score_codex":0.002801361,"about_ca_topic_score_gemma":0.0025060305,"teacher_disagreement_score":0.0074536167,"about_ca_system_score_codex":0.0016565084,"about_ca_system_score_gemma":0.00092425215,"threshold_uncertainty_score":0.024934828},"labels":[],"label_agreement":null},{"id":"W2084642810","doi":"10.1016/j.jal.2007.06.002","title":"The three bases for the enthymeme: A dialogical theory","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"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; Dialogical self; Argument (complex analysis); Epistemology; Computer science; Set (abstract data type); Theory; Argumentative; Set theory; Artificial intelligence; Philosophy; Programming language","score_opus":0.03610602190670964,"score_gpt":0.27226903739068975,"score_spread":0.2361630154839801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084642810","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.023180265,0.0020476948,0.6301717,0.018429156,0.0006245709,0.0002751773,0.00033376666,0.0002897664,0.32464796],"genre_scores_gemma":[0.81585807,0.00078148546,0.15398538,0.0016165322,0.0005026192,0.00066035386,0.0003298699,0.0002146879,0.026051013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952604,0.002664458,0.00029468205,0.0006427492,0.00070030516,0.0004373106],"domain_scores_gemma":[0.99423546,0.003231179,0.0003653839,0.0011547138,0.0005552527,0.00045800532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006282744,0.00086306786,0.0011243225,0.0029201536,0.005492334,0.011121772,0.0034626797,0.00657593,0.017422523],"category_scores_gemma":[0.015112817,0.0011715367,0.0016454542,0.0016582088,0.01966583,0.03041288,0.0069617545,0.007807411,0.0024593088],"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.000009865554,0.0000039579904,0.00002768254,0.000010000179,0.0000019174925,0.000011642969,0.000478637,0.00009971689,0.000032179752,0.9979493,0.00020752523,0.0011676335],"study_design_scores_gemma":[0.000018296294,0.0000098845885,0.00004072157,0.000027145408,0.0000057216293,0.0000324582,0.00030290126,0.0016012746,0.00008692033,0.9934703,0.0043944395,0.000009995708],"about_ca_topic_score_codex":0.002174787,"about_ca_topic_score_gemma":0.001307276,"teacher_disagreement_score":0.017422523,"about_ca_system_score_codex":0.0025856763,"about_ca_system_score_gemma":0.0023759864,"threshold_uncertainty_score":0.058284163},"labels":[],"label_agreement":null},{"id":"W2090407107","doi":"10.1016/j.jal.2005.06.005","title":"Efficient spatio-temporal data mining with GenSpace graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Data mining; Ranking (information retrieval); Process (computing); Path (computing); Temporal database; Machine learning; Information retrieval","score_opus":0.033887326577623,"score_gpt":0.2521135207993993,"score_spread":0.2182261942217763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090407107","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.08140638,0.0006345969,0.90786725,0.00066441594,0.00006707279,0.0001937099,0.0026257394,0.0042660786,0.0022747286],"genre_scores_gemma":[0.37613264,0.00039704557,0.61661917,0.00017613785,0.000039807743,0.00011941474,0.0042801234,0.00023741358,0.001998205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00014075391,0.000046904483,0.00015327717,0.0001684636,0.00005823734],"domain_scores_gemma":[0.99815327,0.00084208284,0.00014549214,0.00057295256,0.00020156613,0.000084549756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054675597,0.00052036747,0.00085632724,0.0017110491,0.00076685817,0.0013112238,0.001387711,0.0006211823,0.0018069631],"category_scores_gemma":[0.0033526246,0.0003821287,0.0010820172,0.0032464757,0.0005663961,0.002907306,0.0019090207,0.0007844379,0.00053184817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006334687,0.00026101293,0.010365807,0.0004926508,0.00022579398,0.00055398856,0.0004966897,0.20782897,0.01268615,0.055140026,0.016684387,0.69463116],"study_design_scores_gemma":[0.000048999245,0.00008157025,0.0010259439,0.000031147774,0.000045999986,0.00030338604,0.00030920032,0.88429683,0.0056817685,0.10140086,0.006758624,0.000015567315],"about_ca_topic_score_codex":0.007059636,"about_ca_topic_score_gemma":0.014363098,"teacher_disagreement_score":0.007059636,"about_ca_system_score_codex":0.0005675331,"about_ca_system_score_gemma":0.0012771507,"threshold_uncertainty_score":0.014037073},"labels":[],"label_agreement":null},{"id":"W2097181978","doi":"10.1016/j.jal.2007.11.001","title":"The seven virtues of simple type theory","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Type theory; Type (biology); Computer science; Order (exchange); Calculus (dental); Extension (predicate logic); Programming language; Mathematics; Mathematics education; Theoretical computer science; Epistemology; Philosophy","score_opus":0.01942985512094914,"score_gpt":0.2610006510376462,"score_spread":0.24157079591669706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097181978","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066466145,0.0146139935,0.39178997,0.09056925,0.006115486,0.00017026564,0.0011082473,0.0009917325,0.42817485],"genre_scores_gemma":[0.8372959,0.0074842065,0.11922824,0.007645409,0.005922765,0.00039497053,0.0004347984,0.0003880258,0.021205705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99312264,0.0031546184,0.0006162816,0.0007242919,0.0019754516,0.0004066239],"domain_scores_gemma":[0.97791505,0.012722095,0.0009289885,0.0051071956,0.0022861953,0.0010405359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009389964,0.0005003881,0.0012876709,0.0020239449,0.003608035,0.010106794,0.0016516973,0.003685175,0.006030726],"category_scores_gemma":[0.023929352,0.00090008246,0.0011044514,0.0022397875,0.02807471,0.019269435,0.004684018,0.006405933,0.0014386997],"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.000016182117,0.000004763054,0.00011456268,0.000025188845,0.0000034345949,0.00001235222,0.00019202332,0.000070387236,0.000044508826,0.99464345,0.0016054505,0.0032676796],"study_design_scores_gemma":[0.0000088557235,0.0000034101472,0.000052330528,0.000014155604,0.0000028615877,0.000026168496,0.000059798003,0.00019125655,0.00004852872,0.9943072,0.005279693,0.000005747886],"about_ca_topic_score_codex":0.0009552404,"about_ca_topic_score_gemma":0.0008707237,"teacher_disagreement_score":0.010106794,"about_ca_system_score_codex":0.0012163799,"about_ca_system_score_gemma":0.0020022467,"threshold_uncertainty_score":0.04965949},"labels":[],"label_agreement":null},{"id":"W2110616577","doi":"10.1016/j.jal.2004.07.023","title":"Deductive databases for computing certain and consistent answers from mediated data integration systems","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Datalog; Deductive database; Computer science; Conjunctive query; Semantics (computer science); Data integrity; Class (philosophy); Theoretical computer science; Database theory; Operator (biology); Database; Programming language; Database design; Artificial intelligence; Relational database","score_opus":0.07065628126672241,"score_gpt":0.2913610897038004,"score_spread":0.22070480843707801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110616577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0427663,0.0010857636,0.94868463,0.0004655797,0.00006977956,0.00032455943,0.00081969035,0.0030860757,0.002697599],"genre_scores_gemma":[0.37321004,0.00054311164,0.6221821,0.00023391945,0.00008979641,0.0003788279,0.0018765357,0.00016306619,0.0013226065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916078,0.0022941022,0.0010343983,0.0011166442,0.0035432656,0.00040377583],"domain_scores_gemma":[0.9826514,0.010539172,0.00076864276,0.0038246838,0.0018981016,0.00031796994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007404847,0.0008320501,0.0018273757,0.004264815,0.001724964,0.008285174,0.0049455543,0.0025199892,0.0047515817],"category_scores_gemma":[0.036620077,0.001071372,0.0019020992,0.004411177,0.002660709,0.009446743,0.0042421655,0.002658049,0.0013532471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014248688,0.00051876524,0.0065326584,0.0011934695,0.0005437046,0.0008758294,0.0022037947,0.09158253,0.0067408825,0.43591687,0.0072466265,0.44522002],"study_design_scores_gemma":[0.00014913135,0.00013770026,0.0008023874,0.00011468284,0.00033955235,0.00033154277,0.0005256192,0.55940276,0.0112807425,0.4212574,0.0055782474,0.00008021177],"about_ca_topic_score_codex":0.0037066578,"about_ca_topic_score_gemma":0.0058434387,"teacher_disagreement_score":0.008285174,"about_ca_system_score_codex":0.0019839108,"about_ca_system_score_gemma":0.0023723082,"threshold_uncertainty_score":0.039161026},"labels":[],"label_agreement":null},{"id":"W2115026027","doi":"10.1016/j.jal.2011.01.002","title":"Formal reliability analysis of combinational circuits using theorem proving","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinational logic; Automated theorem proving; Computer science; HOL; Reliability (semiconductor); Reliability engineering; Boolean circuit; Benchmark (surveying); Sequential logic; Algorithm; Logic gate; Theoretical computer science; Computer engineering; Programming language; Engineering","score_opus":0.07512871240220503,"score_gpt":0.29436376033530653,"score_spread":0.2192350479331015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115026027","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.023032006,0.0001733083,0.9740036,0.00012241336,0.000030139629,0.00008124827,0.00006117858,0.0007909486,0.0017051519],"genre_scores_gemma":[0.73547226,0.00037388454,0.26207694,0.000087046355,0.00009395677,0.00018821497,0.00018633077,0.0003292728,0.0011920535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940398,0.0021998181,0.0003269713,0.0006423626,0.0022585453,0.00053253985],"domain_scores_gemma":[0.96276975,0.029173028,0.0017060633,0.0038019835,0.002388373,0.0001607907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058981967,0.0009752468,0.0009227928,0.0021992328,0.00068173226,0.0017436708,0.0021430645,0.00088065077,0.0041564866],"category_scores_gemma":[0.02689987,0.00082430383,0.0024789434,0.00091605575,0.0023421594,0.0038355377,0.0012050036,0.001989793,0.00047056752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004078451,0.00027178615,0.0026181228,0.0009654877,0.00030738927,0.00052442215,0.00048396952,0.45226157,0.028412117,0.39279845,0.00212479,0.11882416],"study_design_scores_gemma":[0.00005558654,0.00009271694,0.0003246541,0.00005828409,0.00011732944,0.00016916302,0.00003624243,0.79996866,0.01695366,0.18074313,0.001449452,0.000031162734],"about_ca_topic_score_codex":0.0011486904,"about_ca_topic_score_gemma":0.0010442636,"teacher_disagreement_score":0.0058981967,"about_ca_system_score_codex":0.0012549303,"about_ca_system_score_gemma":0.0015570474,"threshold_uncertainty_score":0.031193018},"labels":[],"label_agreement":null},{"id":"W2432950841","doi":"10.1016/j.jal.2016.05.007","title":"Formalization of Reliability Block Diagrams in Higher-order Logic","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund","keywords":"Computer science; HOL; Reliability block diagram; Correctness; Automated theorem proving; Theoretical computer science; Reliability (semiconductor); Mathematical proof; Maintainability; Block (permutation group theory); Formal verification; Programming language; Algorithm; Reliability engineering; Fault tree analysis; Mathematics","score_opus":0.04105063957027853,"score_gpt":0.2843084071889894,"score_spread":0.24325776761871087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2432950841","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.009690467,0.00009701456,0.9861407,0.00011435613,0.000044324974,0.00008598917,0.00009848614,0.00066798157,0.0030606466],"genre_scores_gemma":[0.50870186,0.0004607237,0.48307973,0.0001792465,0.000112167465,0.00030823806,0.00050405395,0.00041707055,0.006236865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975121,0.0007115912,0.00019255749,0.00028449984,0.0010355132,0.00026383746],"domain_scores_gemma":[0.9943469,0.0033449624,0.0005065665,0.00070343143,0.00096045306,0.0001375129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025881184,0.00069680816,0.0005801036,0.0012781675,0.0006630945,0.0023282599,0.0012924019,0.0009466228,0.0058498965],"category_scores_gemma":[0.0062600374,0.0006984926,0.0017263315,0.0005797537,0.0019054292,0.0025869603,0.001241409,0.002384852,0.0008139291],"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.000084655,0.00009772926,0.0006008091,0.00028451972,0.000044063683,0.00037751324,0.00055954425,0.07368361,0.012751193,0.8825064,0.00082513265,0.028184902],"study_design_scores_gemma":[0.00011630267,0.00011730442,0.00043540422,0.00016304055,0.000118454795,0.00036270745,0.00011364753,0.35983598,0.028024435,0.58746743,0.023189861,0.000055392353],"about_ca_topic_score_codex":0.0039099064,"about_ca_topic_score_gemma":0.0035272795,"teacher_disagreement_score":0.0058498965,"about_ca_system_score_codex":0.0013881101,"about_ca_system_score_gemma":0.00219865,"threshold_uncertainty_score":0.019569874},"labels":[],"label_agreement":null},{"id":"W2468222941","doi":"10.1016/j.jal.2016.05.008","title":"Bridging Curry and Church's typing style","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Curry; Style (visual arts); Computer science; Bridging (networking); Programming language; Mathematics; Art; Literature; Computer security","score_opus":0.02138106925749552,"score_gpt":0.2417413539045167,"score_spread":0.22036028464702118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468222941","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.021766085,0.0015278882,0.9073542,0.010099592,0.0017030104,0.00006216741,0.00033313493,0.0018416401,0.055312295],"genre_scores_gemma":[0.5760493,0.0024396684,0.3621142,0.0050541,0.0025157796,0.00021147322,0.0004607438,0.003472996,0.04768178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930912,0.0025352878,0.000550083,0.001055044,0.0020572036,0.00071114994],"domain_scores_gemma":[0.9845961,0.005476225,0.00054433773,0.0058888304,0.0027197818,0.000774708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007580509,0.00082212617,0.0017429224,0.0020418717,0.0035733245,0.0065375953,0.0037894913,0.0025383702,0.016552137],"category_scores_gemma":[0.026962038,0.0015451837,0.0016160251,0.0025851636,0.0058201887,0.021851761,0.009978642,0.0074318224,0.0029887555],"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.00004341971,0.000022863043,0.00028827533,0.00006489576,0.000013209772,0.000057533838,0.0006091979,0.0002520908,0.0003065846,0.9760944,0.005380551,0.016867086],"study_design_scores_gemma":[0.000046828132,0.000017772021,0.00016202155,0.00006574492,0.000035772755,0.00015241287,0.00019894888,0.0035250208,0.0010114289,0.9620816,0.032666232,0.000036117573],"about_ca_topic_score_codex":0.002148842,"about_ca_topic_score_gemma":0.0028216776,"teacher_disagreement_score":0.016552137,"about_ca_system_score_codex":0.001717782,"about_ca_system_score_gemma":0.0024356504,"threshold_uncertainty_score":0.055372477},"labels":[],"label_agreement":null},{"id":"W2552752966","doi":"10.1016/j.jal.2016.11.010","title":"A survey on the inventory-routing problem with stochastic lead times and demands","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Lead time; Operations research; Supply chain; Key (lock); Routing (electronic design automation); Inventory control; Inventory theory; Supply chain management; Control (management); Variable (mathematics); Synchronization (alternating current); Lead (geology); Field (mathematics); Mathematical optimization; Operations management; Economics; Mathematics; Business; Artificial intelligence","score_opus":0.027733129981870525,"score_gpt":0.2422598730721083,"score_spread":0.21452674309023778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552752966","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00730793,0.3722668,0.5703893,0.004315187,0.0012692886,0.00008906621,0.00060243235,0.00022464841,0.043535333],"genre_scores_gemma":[0.09792731,0.6698898,0.20356853,0.0020671133,0.0058628367,0.00022377259,0.001489799,0.00028647025,0.018684398],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985689,0.00046124472,0.00012324094,0.0003151257,0.0004302955,0.00010118862],"domain_scores_gemma":[0.9979796,0.0014806582,0.00010300613,0.00012708503,0.0002495209,0.00006020914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104291,0.0017738551,0.002173852,0.0023896804,0.00061832403,0.0038346634,0.0022706133,0.0021892763,0.0050984565],"category_scores_gemma":[0.0038804896,0.0012663696,0.0018070189,0.008366624,0.0011100268,0.0050358316,0.0012472009,0.0026049514,0.0016416595],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012203375,0.00032391728,0.002071202,0.0051144203,0.00022554123,0.00022912138,0.00015823515,0.10752954,0.00087352685,0.37163228,0.032167695,0.47955248],"study_design_scores_gemma":[0.00004516751,0.00019635765,0.001433532,0.0012285339,0.00017199283,0.00081392634,0.0002147178,0.2528383,0.00073503586,0.48378208,0.2584536,0.000086767985],"about_ca_topic_score_codex":0.002248336,"about_ca_topic_score_gemma":0.0020107345,"teacher_disagreement_score":0.0050984565,"about_ca_system_score_codex":0.0017692426,"about_ca_system_score_gemma":0.0018347802,"threshold_uncertainty_score":0.017056048},"labels":[],"label_agreement":null},{"id":"W2576749665","doi":"10.1016/j.jal.2017.03.001","title":"Formal analysis of SEU mitigation for early dependability and performability analysis of FPGA-based space applications","year":2017,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Space Agency; Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Dependability; Fault tree analysis; Field-programmable gate array; Component (thermodynamics); Aerospace; Fault detection and isolation; Data-flow analysis; Avionics; Design flow","score_opus":0.0074062772702057755,"score_gpt":0.24935155181659654,"score_spread":0.24194527454639078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576749665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025014412,0.00026471005,0.9689922,0.0002855295,0.00006633156,0.00012951788,0.00014839445,0.0005980722,0.0045008324],"genre_scores_gemma":[0.7492813,0.00054005405,0.24376823,0.00028747326,0.00016779828,0.00025981004,0.00044953913,0.00033534557,0.0049103056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997644,0.00056400406,0.00015244319,0.00023910352,0.0010272858,0.00037304815],"domain_scores_gemma":[0.9944507,0.0032083075,0.00044070542,0.00069069833,0.0011290415,0.000080582984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025125197,0.00089266023,0.00051410566,0.0016051334,0.00061796553,0.0018669412,0.0013220803,0.0006848034,0.0033381158],"category_scores_gemma":[0.0063368133,0.00053628866,0.0021519996,0.0005199545,0.0019211255,0.0019675733,0.0012019177,0.0016898265,0.00048068195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021389838,0.0003220398,0.0027936562,0.00074038917,0.00021465684,0.00074241706,0.0004955587,0.3610001,0.03374074,0.51755303,0.0022252086,0.07995826],"study_design_scores_gemma":[0.000052884465,0.0001778876,0.0007806584,0.00020106889,0.00017995443,0.00026164323,0.00011246118,0.69837743,0.027683852,0.26528317,0.0068392344,0.000049801223],"about_ca_topic_score_codex":0.002985746,"about_ca_topic_score_gemma":0.0036723784,"teacher_disagreement_score":0.0033381158,"about_ca_system_score_codex":0.00126924,"about_ca_system_score_gemma":0.002414308,"threshold_uncertainty_score":0.013287604},"labels":[],"label_agreement":null},{"id":"W4206326547","doi":"10.1016/j.jal.2013.07.001","title":"S7","year":2013,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Philosophy and Theoretical Science","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Kwantlen Polytechnic University","keywords":"Monoidal t-norm logic; T-norm fuzzy logics; Extension (predicate logic); Classical logic; Propositional calculus; Paraconsistent logic; Mathematics; Computer science; Modality (human–computer interaction); Discrete mathematics; Artificial intelligence; Calculus (dental); Theoretical computer science; Pure mathematics; Algebra over a field; Description logic; Programming language; Fuzzy logic; Higher-order logic; Medicine; Fuzzy control system; Fuzzy set","score_opus":0.02319056844814743,"score_gpt":0.2850046257982854,"score_spread":0.26181405735013796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206326547","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040609734,0.0017843328,0.007131303,0.007545645,0.0073890686,0.00031932467,0.0709938,0.0039401804,0.8968354],"genre_scores_gemma":[0.034682304,0.0022920116,0.008493297,0.00614181,0.0012509293,0.0005295187,0.10751426,0.0020605433,0.8370354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991666,0.000075820855,0.000036772777,0.00014276271,0.00046051972,0.00011756284],"domain_scores_gemma":[0.99842155,0.00024037837,0.00007289728,0.00023941406,0.0007823859,0.0002434003],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000702921,0.000875489,0.00068031246,0.0018130988,0.0013577259,0.0020009398,0.0017605997,0.002006583,0.7320438],"category_scores_gemma":[0.0036315601,0.00035035005,0.0007494643,0.0013286878,0.0006409721,0.0011362009,0.0015985948,0.0015448977,0.6017142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019720453,0.00006787698,0.00040359414,0.00023844141,0.000017472827,0.00009636551,0.00003778917,0.00016549323,0.003802511,0.0192469,0.90484655,0.07087983],"study_design_scores_gemma":[0.00004339236,0.000043723892,0.00042117687,0.00006854583,0.000009540831,0.00009918449,0.000047145466,0.00026501185,0.0024713401,0.00593625,0.9905804,0.00001435006],"about_ca_topic_score_codex":0.0028307915,"about_ca_topic_score_gemma":0.0055867005,"teacher_disagreement_score":0.2679562,"about_ca_system_score_codex":0.001421889,"about_ca_system_score_gemma":0.002382754,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null}]}