{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014613297,0.00015141648,0.9704286,0.0010188749,0.00023929439,0.000113482914,4.063126e-8,0.000015157621,0.013419842],"genre_scores_gemma":[0.9771792,0.0000059478953,0.022385614,0.0003021012,0.000105829655,0.000004127971,8.137262e-7,0.0000022567015,0.0000140910515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912965,0.000060588645,0.0002782112,0.00009364954,0.0003227423,0.00011513174],"domain_scores_gemma":[0.99923843,0.00007657595,0.00027997524,0.00016526743,0.00018902755,0.000050695362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014271181,0.000070551,0.00011636829,0.000103977414,0.00004292915,0.00009950564,0.0005140431,0.000049510305,0.0000020434918],"category_scores_gemma":[0.00012877937,0.00004203837,0.00003053876,0.0004230506,0.00001983355,0.00028045932,0.00003644757,0.00015927266,0.00004699652],"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.00005444142,0.00029538112,0.00021603772,0.000014845957,0.000013456552,0.000033666558,0.016221404,0.16217408,0.00072316744,0.7232797,0.002987036,0.09398675],"study_design_scores_gemma":[0.002016402,0.000517001,0.020489585,0.000039100152,0.000028728871,0.0002721435,0.001344278,0.53498065,0.0011760303,0.43738765,0.0014773136,0.00027111443],"about_ca_topic_score_codex":0.0000051863935,"about_ca_topic_score_gemma":0.000009108546,"teacher_disagreement_score":0.9625659,"about_ca_system_score_codex":0.00009755579,"about_ca_system_score_gemma":0.00013063825,"threshold_uncertainty_score":0.17142749},"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":"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.4987063,0.01811074,0.00010877933,0.023560388,0.0030278794,0.0005966133,0.0000075224248,0.000026771577,0.45585498],"genre_scores_gemma":[0.9985212,0.00014161071,0.00018244066,0.00006423645,0.0008970814,0.0000041912253,8.6990894e-7,0.000004203551,0.00018418439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991291,0.00006700818,0.0003244132,0.000055163608,0.00031177304,0.000112521964],"domain_scores_gemma":[0.9988423,0.0003985543,0.00023212649,0.00007927436,0.00037575947,0.00007199267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013666438,0.000052289222,0.00013265255,0.000063582534,0.00031156107,0.00008129002,0.00013610852,0.000026802189,0.000030471896],"category_scores_gemma":[0.000074421194,0.00003167948,0.000027528735,0.000036951937,0.0002528801,0.000096029224,0.000032276792,0.00016939787,0.0000046635455],"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.000096006224,0.00006702284,0.000018481682,0.000022063205,0.000019255725,0.00000512487,0.01771061,0.000014632388,0.00029790986,0.94637406,0.03329357,0.0020812685],"study_design_scores_gemma":[0.00050518976,0.000530967,0.000057952602,0.000053664044,0.000025057883,0.00011850461,0.009747396,0.000015170941,0.00019870562,0.5531227,0.43554074,0.000083915875],"about_ca_topic_score_codex":0.000036084293,"about_ca_topic_score_gemma":0.000007819886,"teacher_disagreement_score":0.49981487,"about_ca_system_score_codex":0.00014798925,"about_ca_system_score_gemma":0.00008374153,"threshold_uncertainty_score":0.23963074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030203955,0.00020399694,0.99506384,0.00032006775,0.0011703023,0.00012240041,3.0575967e-7,0.000038418173,0.00006030052],"genre_scores_gemma":[0.24073155,0.000012118109,0.75899804,0.000070130984,0.0001691908,0.000002575464,3.1199747e-8,0.000006300939,0.000010050923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989734,0.00012453002,0.00032611308,0.00008573399,0.00028279508,0.0002073715],"domain_scores_gemma":[0.99811506,0.0007453103,0.00060293655,0.0004048899,0.000090203146,0.00004158799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021461702,0.00010136248,0.00019700546,0.000046219873,0.000093508155,0.000022191369,0.0009260933,0.000058617716,0.000002432358],"category_scores_gemma":[0.0007404754,0.00005083475,0.000103520506,0.0003264841,0.00006487484,0.00023852199,0.00029664964,0.00037002485,0.000001867088],"study_design_candidate":"bench_or_experimental","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.000042140236,0.00010217166,0.000497449,0.000075022705,0.00008443068,0.0000026771193,0.0029277538,0.4222474,0.09331315,0.058658164,0.0006696722,0.42137995],"study_design_scores_gemma":[0.0013750527,0.00035396003,0.018443177,0.0001411017,0.00028401468,0.002139435,0.0022465347,0.0071628117,0.6021176,0.35816553,0.0066832216,0.0008875584],"about_ca_topic_score_codex":0.0000010616301,"about_ca_topic_score_gemma":6.998911e-8,"teacher_disagreement_score":0.50880444,"about_ca_system_score_codex":0.000054730426,"about_ca_system_score_gemma":0.000036205583,"threshold_uncertainty_score":0.2072981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08878034,0.00026634702,0.87376696,0.00063985155,0.0019563183,0.00030740307,0.0000013930103,0.000025346935,0.034256037],"genre_scores_gemma":[0.9930649,0.0000072366834,0.0067700185,0.000062044855,0.000074536925,0.0000011514578,5.431535e-8,0.000002831094,0.00001724928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990263,0.000026248546,0.0004453957,0.00009051341,0.00028660844,0.00012494507],"domain_scores_gemma":[0.9988242,0.00003468633,0.00068390777,0.00027063294,0.0001399291,0.00004666817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037535548,0.00007377654,0.00023117854,0.000069134294,0.00005826388,0.00002046372,0.0006611968,0.00005497505,0.000008738641],"category_scores_gemma":[0.00002344832,0.000041940868,0.0001297087,0.0003273894,0.00012741535,0.00008080514,0.00008890413,0.00014815401,0.000004889226],"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.0000075705634,0.00007997963,0.00013886642,0.000016016655,0.00003272965,0.000007260317,0.00041067615,0.00077558367,0.0035321764,0.99096006,0.00004969438,0.0039894097],"study_design_scores_gemma":[0.0028341208,0.0005679967,0.010288666,0.00004306097,0.00008772683,0.0014578762,0.00069029327,0.00031469905,0.030829357,0.9496066,0.0030246002,0.00025500686],"about_ca_topic_score_codex":0.000018072213,"about_ca_topic_score_gemma":0.000003754595,"teacher_disagreement_score":0.90428454,"about_ca_system_score_codex":0.00003286747,"about_ca_system_score_gemma":0.00017490932,"threshold_uncertainty_score":0.1710299},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07499764,0.0002508696,0.6926169,0.00057586434,0.0011249231,0.0007009855,0.0000029087796,0.00011876853,0.22961114],"genre_scores_gemma":[0.47552043,0.000008052639,0.52405345,0.00027437235,0.00007401847,0.000017298813,5.1267466e-7,0.000004865795,0.000046999878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851704,0.00010508994,0.0005598796,0.0002095281,0.0003590184,0.0002494449],"domain_scores_gemma":[0.9988264,0.0001006067,0.0005420966,0.00027821053,0.00018363571,0.000069062226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015918721,0.0001390484,0.0002464816,0.00018705713,0.000069142065,0.000061229526,0.00079109374,0.0000972094,0.0001502555],"category_scores_gemma":[0.0001351272,0.00010412239,0.00006621458,0.0003903313,0.00015266392,0.00050957233,0.00010578719,0.0003482092,0.000021702608],"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.000067811656,0.00011525291,0.0001814604,0.000016500391,0.000009740918,0.000013602189,0.0012784854,0.00017423675,0.0004945505,0.99351466,0.00006776497,0.004065924],"study_design_scores_gemma":[0.00049604423,0.00024953941,0.01958438,0.000038663435,0.000006504593,0.000079444835,0.00016512636,0.0017203444,0.0020272632,0.9747453,0.00072517205,0.00016223594],"about_ca_topic_score_codex":0.0000032060163,"about_ca_topic_score_gemma":0.000001076091,"teacher_disagreement_score":0.4005228,"about_ca_system_score_codex":0.000117377,"about_ca_system_score_gemma":0.0001313791,"threshold_uncertainty_score":0.42459878},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13815607,0.0017734915,0.69664615,0.0038735592,0.0015255264,0.0001979711,0.0000014995373,0.00022249453,0.1576032],"genre_scores_gemma":[0.8473355,0.0000061817545,0.151694,0.0005625373,0.00018566339,0.0000012187321,7.098241e-7,0.000006522486,0.00020764953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890924,0.000037353926,0.00030669986,0.0001427142,0.00037187155,0.00023210424],"domain_scores_gemma":[0.9989825,0.0001119291,0.00036553547,0.00021088753,0.00011723893,0.00021192277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012018658,0.00010816983,0.00020107796,0.000101876925,0.00010140401,0.00008279733,0.000633301,0.00006503934,0.000012590521],"category_scores_gemma":[0.00006394853,0.00008170193,0.000052548916,0.00022830757,0.00002423673,0.00016533861,0.00014175198,0.00025460156,0.00006940566],"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.00070137787,0.00024788553,0.0060966513,0.000076958044,0.0002206648,0.0016213093,0.015870191,0.26649788,0.009593346,0.41330156,0.21593092,0.069841266],"study_design_scores_gemma":[0.009734027,0.004306874,0.0024698835,0.00077541394,0.00016573204,0.0048793587,0.002471152,0.18052398,0.018795976,0.468217,0.30510414,0.0025564632],"about_ca_topic_score_codex":0.000003815819,"about_ca_topic_score_gemma":0.0000010284991,"teacher_disagreement_score":0.70917946,"about_ca_system_score_codex":0.00014098453,"about_ca_system_score_gemma":0.00016480089,"threshold_uncertainty_score":0.3331708},"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":"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.9568206,0.00015128969,0.0010257763,0.001103685,0.00050223636,0.0000475607,0.0000025901763,0.0000060001194,0.040340234],"genre_scores_gemma":[0.9991057,0.000022316259,0.00024014249,0.0004026725,0.00021044625,0.0000015115838,4.4167436e-7,0.000002613886,0.0000141664905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994183,0.000035105648,0.0001955442,0.00009027173,0.00013812115,0.00012263493],"domain_scores_gemma":[0.9994469,0.00017947712,0.00014628103,0.00007499009,0.00003946554,0.00011283833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060934905,0.000060737013,0.000117805146,0.000050561794,0.00006184969,0.000014670406,0.00004729995,0.00005091346,0.00022365569],"category_scores_gemma":[0.000053742933,0.000041315336,0.000020776617,0.00005921273,0.00020175756,0.00008090568,0.000015188298,0.00015030778,0.00002271286],"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.00020530596,0.00006837422,0.0014154217,0.0000032902105,0.000011830488,0.0000010420816,0.00039740332,0.000001979115,0.0016736247,0.9926631,0.00007969476,0.0034789403],"study_design_scores_gemma":[0.00030211388,0.00014540572,0.2750117,0.0000072773646,0.00001521815,0.00007583099,0.00036602115,0.0000084898975,0.0002652,0.72349817,0.00024746906,0.000057120797],"about_ca_topic_score_codex":0.0000033987706,"about_ca_topic_score_gemma":2.8187037e-7,"teacher_disagreement_score":0.2735963,"about_ca_system_score_codex":0.000014329729,"about_ca_system_score_gemma":0.000005583944,"threshold_uncertainty_score":0.2448873},"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":"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.1685386,0.0007333896,0.4394941,0.0027501164,0.003045061,0.0002515672,3.1530163e-7,0.00013672512,0.38505012],"genre_scores_gemma":[0.96705484,0.000023047505,0.03097596,0.00081284443,0.0010417305,0.0000027635847,1.8176661e-7,0.0000080179825,0.00008062883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.00008328571,0.00030868966,0.00016808198,0.00035790246,0.00023112174],"domain_scores_gemma":[0.9988768,0.00013179747,0.00042868068,0.0002754303,0.00017121482,0.00011605268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096834,0.00012866527,0.00018739223,0.00010156651,0.00019073546,0.00017159295,0.00077008404,0.00006632662,0.0000046376676],"category_scores_gemma":[0.00013065926,0.000068968904,0.00009889009,0.00025987814,0.00004744457,0.00016885054,0.00010920032,0.00037015724,0.000072450704],"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.000099804805,0.00010383799,0.000029510242,0.000006097221,0.000033187396,0.000032667424,0.0068659843,0.0032699297,0.00455899,0.93045515,0.005285498,0.049259372],"study_design_scores_gemma":[0.0016470948,0.001012401,0.0003441942,0.00007348164,0.000051412953,0.00096383196,0.0016938179,0.01014413,0.014383022,0.9396793,0.029558107,0.00044915394],"about_ca_topic_score_codex":0.000002749166,"about_ca_topic_score_gemma":0.0000013487188,"teacher_disagreement_score":0.7985162,"about_ca_system_score_codex":0.00013383996,"about_ca_system_score_gemma":0.00012966989,"threshold_uncertainty_score":0.28124705},"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":"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.7022856,0.0026260598,0.25773874,0.001600823,0.0008394718,0.00026346283,4.929296e-7,0.0001502176,0.03449516],"genre_scores_gemma":[0.9825247,0.00028861428,0.0152349435,0.001544003,0.0003167347,0.0000014924328,3.0855742e-7,0.0000061192964,0.000083114144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866986,0.00003837612,0.00041951978,0.00027439406,0.00028251368,0.00031530857],"domain_scores_gemma":[0.998933,0.00006848036,0.00045383078,0.0002569682,0.00011290731,0.00017480973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046038587,0.00019749526,0.00036182863,0.00014747107,0.00015169529,0.00017680487,0.0006172148,0.000120381905,0.000017547733],"category_scores_gemma":[0.000031313084,0.00014505752,0.000107546926,0.00024911284,0.000056719004,0.0003723255,0.0000701958,0.00036002084,0.000057436147],"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.00020426055,0.00036406756,0.00051969703,0.00003589172,0.00005970012,0.00018124517,0.0015327876,0.00058132474,0.01939941,0.75942117,0.0043868395,0.21331358],"study_design_scores_gemma":[0.0030686576,0.0013521898,0.054729033,0.00008601087,0.00007915632,0.0013623586,0.00026609472,0.009683073,0.0082098935,0.909238,0.011157367,0.0007681685],"about_ca_topic_score_codex":0.0000013003337,"about_ca_topic_score_gemma":0.0000029223254,"teacher_disagreement_score":0.2802391,"about_ca_system_score_codex":0.00007763538,"about_ca_system_score_gemma":0.0000685243,"threshold_uncertainty_score":0.5915274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050477977,0.0004259617,0.96552294,0.0011456702,0.000774773,0.00027973004,1.3294256e-7,0.00004322872,0.026759777],"genre_scores_gemma":[0.9901298,0.000073962954,0.008134703,0.0007478622,0.0005241555,0.000028686403,9.553817e-7,0.000010222563,0.00034964897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998476,0.00016990126,0.00046723962,0.00023895543,0.00029100184,0.00035690144],"domain_scores_gemma":[0.99749976,0.0012387807,0.00048903486,0.00032559116,0.00031698451,0.00012983507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026437629,0.00018392625,0.00030859985,0.00008645642,0.00042364866,0.00032007866,0.0010715778,0.00010507036,0.000018451552],"category_scores_gemma":[0.00044796438,0.00009904758,0.00018554892,0.000220632,0.00012528326,0.00021741398,0.000112428796,0.00029029723,0.000101862184],"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.000091676666,0.00005851771,0.000007440322,0.000007407901,0.000030051808,0.000006584292,0.000588345,0.00008998754,0.0006595801,0.952414,0.0007934816,0.045252945],"study_design_scores_gemma":[0.00070478406,0.00057410094,0.00022981987,0.0000038552917,0.00003003829,0.0001807746,0.00016797207,0.0045856982,0.0006571259,0.973023,0.019688189,0.00015466448],"about_ca_topic_score_codex":0.0000017722673,"about_ca_topic_score_gemma":0.000004628481,"teacher_disagreement_score":0.98508203,"about_ca_system_score_codex":0.00010253837,"about_ca_system_score_gemma":0.00019007524,"threshold_uncertainty_score":0.40390432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033429808,0.001270101,0.9449874,0.0005018172,0.0006716496,0.00019583368,0.0000016916891,0.0000746485,0.04895384],"genre_scores_gemma":[0.69927,0.0000072832513,0.2996924,0.00039666492,0.0005281962,0.000013187804,9.2928263e-7,0.000010652684,0.00008070535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856216,0.000036790774,0.00054347015,0.00025487735,0.00023252064,0.00037017182],"domain_scores_gemma":[0.99790925,0.0008361997,0.0005264147,0.00030740415,0.00030301,0.00011771922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006810413,0.0002008648,0.00040697167,0.00020469436,0.00020700552,0.0001427892,0.0007996757,0.00013284908,0.000026266005],"category_scores_gemma":[0.000149482,0.00014939919,0.00028048732,0.00037388367,0.00008102854,0.00013891041,0.00007638752,0.00026730399,0.000032617307],"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.00005170667,0.00026097143,0.0001394719,0.000040888124,0.000022168262,0.000022190889,0.00016745653,0.0006543369,0.0007541534,0.9863011,0.004370771,0.007214757],"study_design_scores_gemma":[0.0017797503,0.00046700164,0.0007855666,0.0001365777,0.00007135122,0.00007606688,0.00010830395,0.013486965,0.0073554167,0.9276739,0.04761549,0.0004436534],"about_ca_topic_score_codex":0.0000023664031,"about_ca_topic_score_gemma":0.000005342976,"teacher_disagreement_score":0.695927,"about_ca_system_score_codex":0.00007801726,"about_ca_system_score_gemma":0.00032714062,"threshold_uncertainty_score":0.6092322},"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":"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.8865477,0.0006330186,0.10292032,0.0015923259,0.0029434466,0.0001474077,0.000007545858,0.00015929154,0.0050489376],"genre_scores_gemma":[0.93840975,0.00018065372,0.058492627,0.0018932777,0.00082594424,0.0000787727,0.0000059692675,0.000047373516,0.000065631975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971789,0.00004837266,0.0008020526,0.0004981789,0.00073831284,0.0007341732],"domain_scores_gemma":[0.9971601,0.0005777132,0.001058525,0.0008669545,0.00014448627,0.00019225565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019205688,0.0003391982,0.0003464766,0.00015530911,0.0006876581,0.00075334014,0.0017023268,0.00045021265,0.000050709084],"category_scores_gemma":[0.0004118782,0.00027428247,0.00043924607,0.0003391018,0.00025217398,0.0007138932,0.00045144916,0.00089911907,0.00020718481],"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.00018751514,0.00010034113,0.000012272931,0.00006149245,0.00013612777,0.000117542666,0.0005963254,0.00063082884,0.009578234,0.98249227,0.0020146207,0.0040724417],"study_design_scores_gemma":[0.0013801064,0.00072109955,0.00078166026,0.00014931143,0.000277737,0.0015463389,0.0010752686,0.91868603,0.008742984,0.0590437,0.007092597,0.0005031721],"about_ca_topic_score_codex":0.000058007514,"about_ca_topic_score_gemma":0.00005943243,"teacher_disagreement_score":0.92344856,"about_ca_system_score_codex":0.000026348152,"about_ca_system_score_gemma":0.00032418314,"threshold_uncertainty_score":0.9999709},"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":"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.5950014,0.00007877603,0.4023921,0.00026768932,0.00040039278,0.00016271886,3.8359494e-7,0.000009797249,0.0016867302],"genre_scores_gemma":[0.9865068,0.00003582451,0.01323725,0.00012279682,0.00005236565,0.0000015056874,4.4097848e-7,0.000002385562,0.00004062446],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919057,0.000020029702,0.00036171684,0.000063072555,0.00029304923,0.00007153493],"domain_scores_gemma":[0.9990345,0.00002014778,0.00067818165,0.00014152427,0.00010122651,0.000024411129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024433716,0.000053243715,0.00011142723,0.0000613439,0.00007615532,0.000013600304,0.00030187969,0.000032650743,0.000009108775],"category_scores_gemma":[0.0000122008005,0.000032611788,0.000062893145,0.00019756217,0.00001740151,0.00023171547,0.00003750469,0.00006295096,0.0000047116278],"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.00019629419,0.0007491422,0.02202361,0.00021191977,0.00017844829,0.000023134613,0.01564853,0.015082761,0.61942005,0.29357925,0.009952176,0.022934705],"study_design_scores_gemma":[0.006939886,0.0006759246,0.4178146,0.00021596588,0.00007074329,0.0007127174,0.0007529451,0.109826274,0.4357189,0.018427297,0.0082125515,0.0006321667],"about_ca_topic_score_codex":0.0000015197719,"about_ca_topic_score_gemma":7.6083813e-7,"teacher_disagreement_score":0.39579102,"about_ca_system_score_codex":0.000029961502,"about_ca_system_score_gemma":0.000039683157,"threshold_uncertainty_score":0.13298701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059090484,0.0038946413,0.9146399,0.01015559,0.0007810531,0.0004968569,0.000043106214,0.000128777,0.010769574],"genre_scores_gemma":[0.848343,0.00031053604,0.14730291,0.0036215032,0.00035976688,0.0000039001284,0.000013346156,0.000006905272,0.000038096463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986905,0.000058028934,0.00047215974,0.0002145364,0.00030740176,0.00025737475],"domain_scores_gemma":[0.9987128,0.00033185692,0.00036684072,0.000439488,0.00007584216,0.00007318787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000384231,0.00015063086,0.00028788386,0.00007712171,0.00009487253,0.00004757496,0.00067591085,0.000043417185,0.000032591906],"category_scores_gemma":[0.00011393964,0.000085976244,0.000055020835,0.00064745336,0.000045696343,0.00038174618,0.000096395284,0.00037226916,0.000014639705],"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.00032177087,0.000390791,0.00075978605,0.000009620161,0.00006998965,0.0006044892,0.0016254446,0.006378308,0.030336082,0.8409928,0.020426711,0.098084226],"study_design_scores_gemma":[0.007555335,0.0011859288,0.16055012,0.00082476635,0.00010956946,0.00095305406,0.005074426,0.004365847,0.008885195,0.18361095,0.6245696,0.002315207],"about_ca_topic_score_codex":0.000016826256,"about_ca_topic_score_gemma":0.00005975185,"teacher_disagreement_score":0.7892525,"about_ca_system_score_codex":0.00004499508,"about_ca_system_score_gemma":0.00008814716,"threshold_uncertainty_score":0.35060096},"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":"other","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.48723412,0.00063288776,0.0019524429,0.0027765995,0.0002808292,0.00015016082,0.0000012846766,0.000005068512,0.50696665],"genre_scores_gemma":[0.99883914,0.000007769671,0.0005212561,0.00041304287,0.00020096594,0.000002249926,8.1465714e-8,0.0000021355327,0.0000133541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994372,0.00004497248,0.00020368728,0.0000471506,0.00013236863,0.00013459602],"domain_scores_gemma":[0.9994489,0.00012433017,0.00018848815,0.000095403666,0.000033883567,0.00010897605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097028585,0.000048006405,0.00014914,0.000026698493,0.000071388014,0.000008908349,0.00013911953,0.0000402536,0.00019895029],"category_scores_gemma":[0.000027044829,0.000023996605,0.000048514154,0.00009954376,0.0006193223,0.00005030718,0.000027040347,0.00016348955,0.00001371782],"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.000542268,0.00012426462,0.000081173224,0.000003148564,0.000023144918,0.0000011403313,0.0009135219,0.0000028907905,0.0012503691,0.99666786,0.000064149455,0.0003260674],"study_design_scores_gemma":[0.0017402582,0.00010413831,0.004038869,0.0000067161395,0.000056307217,0.000087377186,0.00030305242,0.0000043288633,0.001027832,0.99209285,0.00048707804,0.000051193743],"about_ca_topic_score_codex":0.000002268758,"about_ca_topic_score_gemma":6.687702e-8,"teacher_disagreement_score":0.511605,"about_ca_system_score_codex":0.0000061601822,"about_ca_system_score_gemma":0.000012216586,"threshold_uncertainty_score":0.22819187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1007467,0.000025990279,0.8969351,0.00005083385,0.00010972092,0.00004299893,0.0000012243554,0.0000094588495,0.0020779653],"genre_scores_gemma":[0.6016838,0.0000012041667,0.39818925,0.000068554014,0.000049889848,1.2128318e-7,1.5352775e-7,0.0000029515531,0.0000040879772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.000021463833,0.0005096193,0.00013721053,0.00033884367,0.00020642385],"domain_scores_gemma":[0.998765,0.00023586632,0.0006185444,0.00018894432,0.000088585926,0.00010308068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011253202,0.00009753224,0.0003743125,0.00036970637,0.00004211107,0.00008422169,0.0005257252,0.000044674805,0.000009654378],"category_scores_gemma":[0.000051236257,0.00006647763,0.00021098193,0.0011333314,0.000057905956,0.00024257643,0.00010152727,0.00017588945,0.0000010288254],"study_design_candidate":"design_other","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.0001568185,0.0004119476,0.0015957209,0.000030149075,0.0011734206,0.00020021445,0.001251056,0.018299265,0.06701049,0.07884857,0.000030632724,0.8309917],"study_design_scores_gemma":[0.0026510328,0.0017539655,0.023984011,0.00013055257,0.002111155,0.00035720348,0.0028660947,0.59404176,0.056019768,0.31294996,0.0016023272,0.0015321907],"about_ca_topic_score_codex":0.0000015518355,"about_ca_topic_score_gemma":1.6684685e-7,"teacher_disagreement_score":0.82945955,"about_ca_system_score_codex":0.00003804262,"about_ca_system_score_gemma":0.00003481241,"threshold_uncertainty_score":0.2710879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03168842,0.00011078691,0.93931764,0.00028813444,0.0004846897,0.000051376603,1.673877e-7,0.000032024822,0.02802678],"genre_scores_gemma":[0.8639013,0.000015404674,0.13564317,0.00029312496,0.0001308688,5.223587e-7,1.3198812e-7,0.000001964956,0.000013498126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993492,0.000019386694,0.00024348815,0.00006763621,0.00017854627,0.00014177801],"domain_scores_gemma":[0.999401,0.00004273711,0.0002465201,0.00013838132,0.00006822274,0.00010314536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062215986,0.000057281788,0.000109321234,0.00006931475,0.000054408087,0.00005049903,0.00020381871,0.00003686995,0.000084414474],"category_scores_gemma":[0.000035589263,0.000044453132,0.00005147129,0.00015692002,0.000020236104,0.00037594477,0.000040236853,0.00013929371,0.000025067564],"study_design_candidate":"observational","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.00003729479,0.00015864875,0.013547562,0.000011629733,0.000032740143,0.000006264828,0.001501315,0.0033688706,0.0022832484,0.70537746,0.0011063435,0.2725686],"study_design_scores_gemma":[0.0031045738,0.0003624104,0.83957756,0.00009419049,0.00007579924,0.0011177639,0.00075772137,0.034578007,0.008023645,0.08258309,0.028766695,0.0009585689],"about_ca_topic_score_codex":4.9835734e-7,"about_ca_topic_score_gemma":3.1631564e-7,"teacher_disagreement_score":0.8322129,"about_ca_system_score_codex":0.000043799297,"about_ca_system_score_gemma":0.000037763653,"threshold_uncertainty_score":0.18127462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026205514,0.00009836273,0.9683805,0.00022671874,0.0004718057,0.00041401302,0.000002517138,0.00005108254,0.0041494532],"genre_scores_gemma":[0.9212613,0.000008329514,0.07800744,0.00045191537,0.00020476965,0.000011776006,0.0000017945916,0.000009065316,0.000043601496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985467,0.00004046458,0.0006179757,0.00023583348,0.00029516546,0.00026385096],"domain_scores_gemma":[0.998505,0.000047756483,0.0007299407,0.00035515873,0.00018840701,0.00017372883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195147,0.00015165779,0.00034210942,0.00019832495,0.00010878739,0.000087438304,0.0007675958,0.00009669449,0.000042281208],"category_scores_gemma":[0.000020778629,0.00010861113,0.00014629976,0.00026453414,0.000023912831,0.00039761618,0.00004209634,0.00013264785,0.00001996521],"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.00040992023,0.0013877935,0.00085946487,0.00014942269,0.00021369073,0.00011755438,0.005180194,0.0020959156,0.04303924,0.92715406,0.004266769,0.015125969],"study_design_scores_gemma":[0.011802778,0.0084373765,0.027968312,0.00021754621,0.00043278225,0.00059617154,0.001785962,0.36934632,0.042120054,0.52201456,0.012893371,0.0023847544],"about_ca_topic_score_codex":0.000025443653,"about_ca_topic_score_gemma":0.000007111831,"teacher_disagreement_score":0.8950558,"about_ca_system_score_codex":0.00006452956,"about_ca_system_score_gemma":0.00008265621,"threshold_uncertainty_score":0.44290334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27984452,0.000056585883,0.69941163,0.00013382829,0.00011012554,0.000048697213,3.160574e-7,0.000013634048,0.02038065],"genre_scores_gemma":[0.96741635,0.0000104541505,0.03229539,0.0001718607,0.000092927265,6.5786446e-7,3.2906493e-7,0.0000018048925,0.000010249538],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991649,0.000017615443,0.0002984983,0.000102332895,0.0003016925,0.00011495825],"domain_scores_gemma":[0.99922025,0.000035899593,0.00036131666,0.00014175767,0.00020493541,0.000035868376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004850173,0.000054140837,0.00013143705,0.00015422973,0.000043829546,0.000047102007,0.0005182206,0.000026040309,0.0000030311312],"category_scores_gemma":[0.000012977674,0.000041809577,0.000037020163,0.0004457873,0.000038588816,0.000397942,0.000037816037,0.00006656705,0.000004882778],"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.000022635417,0.00014583615,0.00045192457,0.000013902641,0.0000059797353,0.000016546102,0.00032409347,0.002761409,0.6429072,0.31629765,0.00070414285,0.036348708],"study_design_scores_gemma":[0.0014503328,0.000873865,0.14949736,0.00011305631,0.00002060411,0.00009203781,0.0007297838,0.030921023,0.12030188,0.6935352,0.0020551744,0.0004096453],"about_ca_topic_score_codex":0.0000051006696,"about_ca_topic_score_gemma":0.0000015415967,"teacher_disagreement_score":0.6875718,"about_ca_system_score_codex":0.000015951253,"about_ca_system_score_gemma":0.000055618042,"threshold_uncertainty_score":0.1704945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005273341,0.00059040554,0.9894801,0.001501478,0.0007603628,0.00031930848,5.6079284e-7,0.000015591733,0.0020588795],"genre_scores_gemma":[0.992848,0.00005912175,0.005612595,0.0007907296,0.0006224966,0.000011140369,1.7633145e-7,0.0000045333027,0.00005124371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989203,0.000036192887,0.0004077936,0.00010761344,0.00030922008,0.00021888674],"domain_scores_gemma":[0.9967417,0.0024426393,0.0004141431,0.00025190212,0.00009355951,0.00005605377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042187152,0.00008920178,0.00013440265,0.000037847956,0.00036866762,0.00013078176,0.0008423419,0.000047982925,0.000010363634],"category_scores_gemma":[0.000119449294,0.000035965393,0.00014002385,0.00012520017,0.000055502653,0.00008982751,0.0000698489,0.00014990667,0.000009043248],"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.00015812484,0.000051304643,0.000086072316,0.000004943414,0.00004032079,0.0000060903026,0.0002843159,0.00019301068,0.0014064219,0.90368825,0.0020580648,0.0920231],"study_design_scores_gemma":[0.0027143615,0.0007605779,0.04389662,0.00004138014,0.00010158046,0.00017685325,0.0009178138,0.014303054,0.0056960634,0.73974854,0.19122808,0.0004150716],"about_ca_topic_score_codex":0.0000014486905,"about_ca_topic_score_gemma":0.000013740079,"teacher_disagreement_score":0.98757464,"about_ca_system_score_codex":0.000030222802,"about_ca_system_score_gemma":0.000033697743,"threshold_uncertainty_score":0.28355306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117553316,0.00022323898,0.8672445,0.0032611229,0.00033419748,0.00022016172,0.000008550866,0.000080898375,0.011074039],"genre_scores_gemma":[0.56403863,0.000010226231,0.435376,0.0003568664,0.00015630767,8.0522176e-7,0.000009854129,0.000005346859,0.000045975703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.000013990001,0.0002886434,0.00024705744,0.00045346367,0.00021367714],"domain_scores_gemma":[0.998769,0.00003286126,0.00038262104,0.00067120144,0.000055417266,0.000088936664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064396893,0.00012105577,0.00018219497,0.00016915535,0.00007890271,0.00019205017,0.0018253886,0.000025377778,0.000018002102],"category_scores_gemma":[0.000006966162,0.00008195492,0.000031012984,0.00035682152,0.000037427162,0.0003637674,0.00048824374,0.0001416543,0.000026700576],"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.00035589174,0.0010811604,0.0026137452,0.0000676428,0.0004155095,0.00065431534,0.0023357505,0.10117095,0.00031993835,0.21914151,0.08210574,0.58973783],"study_design_scores_gemma":[0.004027626,0.0008541378,0.0041821944,0.00010390081,0.0001481783,0.00030093227,0.00075714703,0.8061287,0.00055733876,0.0045030327,0.1775023,0.0009345109],"about_ca_topic_score_codex":0.0000017261551,"about_ca_topic_score_gemma":0.000008076473,"teacher_disagreement_score":0.7049577,"about_ca_system_score_codex":0.00002311987,"about_ca_system_score_gemma":0.000044635406,"threshold_uncertainty_score":0.33920565},"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":"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.024561564,0.0014379151,0.9115471,0.00018822285,0.0011347722,0.00021151845,1.8667946e-7,0.000044648816,0.060874023],"genre_scores_gemma":[0.99644667,0.00003551258,0.003057412,0.00013519262,0.00019740094,5.530092e-7,1.3597709e-7,0.0000044945796,0.00012262868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989462,0.00004338873,0.00042534526,0.00009086814,0.0002916274,0.00020255789],"domain_scores_gemma":[0.9986801,0.00034209198,0.00050153886,0.00025441934,0.00015905453,0.000062792235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029304773,0.00008195407,0.00018455267,0.000060715087,0.00010132935,0.000058480793,0.0008028112,0.00005602885,0.0000074291997],"category_scores_gemma":[0.000053496773,0.000043311935,0.0000824212,0.00024573028,0.00007381653,0.00008148356,0.000093889095,0.00015969401,0.000019393781],"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.000066905945,0.00003439206,0.000096809876,0.000006321072,0.00003130472,0.000014485836,0.00043759198,0.000031766187,0.0012511569,0.9230106,0.0004187822,0.07459989],"study_design_scores_gemma":[0.0002672021,0.0003427469,0.0010826874,0.0000023608436,0.000011848574,0.00007030777,0.00055922224,0.00005474213,0.004185875,0.93984836,0.053484417,0.000090199734],"about_ca_topic_score_codex":0.0000026188186,"about_ca_topic_score_gemma":0.0000045565303,"teacher_disagreement_score":0.9718851,"about_ca_system_score_codex":0.000022468234,"about_ca_system_score_gemma":0.000056890764,"threshold_uncertainty_score":0.17662093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059273873,0.0011757197,0.93744344,0.00032559398,0.0006802361,0.00029464974,0.000049870225,0.00003503981,0.00072156993],"genre_scores_gemma":[0.92167425,0.00005311436,0.07778895,0.00013493502,0.0002677045,0.0000025396569,0.00006962181,0.0000060289685,0.0000028529641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988471,0.000038875318,0.00041901556,0.00030484196,0.00020408277,0.00018607215],"domain_scores_gemma":[0.9983719,0.0004763865,0.0005007482,0.00035415214,0.0001843729,0.00011243145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762761,0.00014109859,0.00031313128,0.000095576725,0.00012977044,0.00015899252,0.00068375585,0.000051569954,0.0000014031326],"category_scores_gemma":[0.00022007,0.0000996366,0.00003995984,0.00014755821,0.000071521696,0.00037510105,0.00023854221,0.00016699443,0.0000033199074],"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.00043191298,0.0006596587,0.0006823666,0.00013963562,0.0005769355,0.0001260525,0.009563654,0.008196694,0.020181207,0.91702384,0.0044454164,0.037972637],"study_design_scores_gemma":[0.026904773,0.0030813115,0.010952703,0.0018411154,0.00095030357,0.0015384593,0.035639364,0.6217998,0.015884582,0.25705078,0.021307802,0.0030489794],"about_ca_topic_score_codex":0.00006803477,"about_ca_topic_score_gemma":0.000027101469,"teacher_disagreement_score":0.86240035,"about_ca_system_score_codex":0.000084199084,"about_ca_system_score_gemma":0.00015986181,"threshold_uncertainty_score":0.40630627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24911654,0.000011692174,0.7438259,0.0000098503915,0.00012308225,0.00007328233,7.2923893e-7,0.000010337522,0.006828569],"genre_scores_gemma":[0.62985647,0.0000015562781,0.3700962,0.000027848846,0.000013387858,8.689581e-7,2.8849684e-7,0.0000021771082,0.0000012216829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985691,0.00007856643,0.0006472568,0.0001386067,0.0004072695,0.00015919987],"domain_scores_gemma":[0.9981744,0.000093450806,0.0010056825,0.00031731214,0.00035406096,0.000055080898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027652907,0.000086923865,0.0002969243,0.00039822195,0.000073652554,0.000023407485,0.0007234286,0.000062292886,0.00002775112],"category_scores_gemma":[0.00012995681,0.00006876467,0.00016280977,0.0009603113,0.000089236935,0.0006111819,0.00011040893,0.00017231883,0.0000011915428],"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.00002182953,0.00021526922,0.0015088008,0.000022337033,0.00017581497,0.0000024502851,0.0015724327,0.006087349,0.0054720724,0.95907587,0.0000029981938,0.025842773],"study_design_scores_gemma":[0.0007362804,0.00039728853,0.20882523,0.000026883288,0.00055799115,0.000054557164,0.00028663914,0.4385123,0.03151024,0.3187605,0.000034209643,0.00029786126],"about_ca_topic_score_codex":0.0000035145003,"about_ca_topic_score_gemma":2.2949705e-7,"teacher_disagreement_score":0.64031535,"about_ca_system_score_codex":0.00008547391,"about_ca_system_score_gemma":0.00009844821,"threshold_uncertainty_score":0.2804142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09936161,0.00005424869,0.8938946,0.001022314,0.0004943551,0.0001882663,7.889805e-7,0.000022107379,0.004961721],"genre_scores_gemma":[0.6894662,0.00004420847,0.31031087,0.00010698645,0.000044668363,0.0000039415454,1.6508443e-7,0.000003552157,0.000019440025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984985,0.00008819788,0.0007327549,0.00016496939,0.0003316688,0.00018392998],"domain_scores_gemma":[0.9984389,0.00015280992,0.00072895584,0.00037656946,0.00024763943,0.00005510158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017054094,0.00010364845,0.00025414326,0.00016150474,0.000027161175,0.00001905318,0.00066625036,0.00010201302,0.000026152777],"category_scores_gemma":[0.0002081895,0.00006191879,0.000062011044,0.00055338803,0.00007906996,0.00044128575,0.00009880024,0.00013375256,0.000009226383],"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.00015229463,0.00035008218,0.0030699437,0.00005736661,0.000013931241,0.0000068514896,0.00040416067,0.0029823065,0.02255018,0.9009915,0.0001661939,0.06925519],"study_design_scores_gemma":[0.0029285958,0.0010191273,0.10776941,0.00015654521,0.00002542743,0.000064512256,0.00007194984,0.0061357147,0.057364203,0.81943506,0.004559444,0.00047000693],"about_ca_topic_score_codex":0.0000017850265,"about_ca_topic_score_gemma":9.732906e-7,"teacher_disagreement_score":0.5901046,"about_ca_system_score_codex":0.00010595606,"about_ca_system_score_gemma":0.00005895118,"threshold_uncertainty_score":0.2524975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026163382,0.0006560493,0.9551725,0.00089374406,0.0005305401,0.00010581,1.4301168e-7,0.00005488937,0.016422952],"genre_scores_gemma":[0.9943287,0.00006288037,0.0049857153,0.00019142224,0.00030977867,0.0000016459899,4.1852715e-8,0.0000052511427,0.000114579096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914366,0.000023590641,0.0002853632,0.00015379414,0.0001830104,0.00021058785],"domain_scores_gemma":[0.99928313,0.00006687231,0.00031284636,0.00017114666,0.00006486779,0.00010111065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313891,0.000095865995,0.00019860158,0.00009522307,0.000077530385,0.000110394394,0.0003860508,0.00005033722,0.000012207618],"category_scores_gemma":[0.000024752062,0.00005341081,0.00005261131,0.000119759694,0.000044751516,0.00023201857,0.000121740144,0.00011528991,0.000031104537],"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.000017775914,0.000035917037,0.00057030347,0.00002086441,0.000029353985,0.000038696613,0.00046311095,0.000006312436,0.010067125,0.56697047,0.000998687,0.42078137],"study_design_scores_gemma":[0.0063661463,0.0013290178,0.018519849,0.0001710648,0.0000827021,0.002560954,0.0005253253,0.0026535895,0.009880542,0.76039904,0.19611442,0.0013973467],"about_ca_topic_score_codex":0.0000020676068,"about_ca_topic_score_gemma":4.5541032e-7,"teacher_disagreement_score":0.9681653,"about_ca_system_score_codex":0.000031994474,"about_ca_system_score_gemma":0.00003818686,"threshold_uncertainty_score":0.21780297},"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":"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.39429626,0.0001391136,0.59885323,0.0006573578,0.00008799102,0.00027554802,0.0000028049792,0.0000977706,0.0055899504],"genre_scores_gemma":[0.98722035,0.00001355862,0.012542596,0.00008926188,0.00006316048,0.0000033101514,2.3008708e-7,0.00002285685,0.00004469121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992626,0.00006586841,0.00025396072,0.000080873615,0.00017780688,0.00015893577],"domain_scores_gemma":[0.9990832,0.00054411776,0.00015879117,0.00010031777,0.000060339116,0.00005322768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014017809,0.000116177405,0.00018182106,0.00006809439,0.00006090221,0.00003207471,0.00011902442,0.00004736746,0.000023100152],"category_scores_gemma":[0.00009855008,0.000052845095,0.000022211776,0.00013060973,0.000051127063,0.00004575904,0.00001662331,0.00017725458,0.0000062189765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00037986034,0.00006366887,0.005181155,0.00006212422,0.00029766254,0.000014982181,0.0010372002,0.9435815,0.0077254116,0.014747852,0.0020096977,0.024898877],"study_design_scores_gemma":[0.01847086,0.004361589,0.1238439,0.004100666,0.00067647366,0.00072400994,0.0017499392,0.77513623,0.016552202,0.04967225,0.001152122,0.0035597833],"about_ca_topic_score_codex":8.098676e-7,"about_ca_topic_score_gemma":0.0000024388387,"teacher_disagreement_score":0.59292406,"about_ca_system_score_codex":0.00004256719,"about_ca_system_score_gemma":0.000019761404,"threshold_uncertainty_score":0.21549605},"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":"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.8084372,0.00005491918,0.19078057,0.000042985648,0.000019771323,0.00027731966,0.000039728213,0.000010264927,0.00033719468],"genre_scores_gemma":[0.9928741,0.000013378128,0.0070274984,0.000006981406,0.00002465015,0.00002827388,0.000015494841,0.0000084689245,0.0000011668524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885094,0.00001874019,0.0006092465,0.00012082623,0.00022646888,0.00017375856],"domain_scores_gemma":[0.9981727,0.00029614478,0.00077995163,0.0004431767,0.00023966172,0.00006836382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011114746,0.000118146236,0.0005936346,0.00050659233,0.00012414948,0.00003054572,0.00024193541,0.000098320466,0.000014429055],"category_scores_gemma":[0.00009324999,0.00010648905,0.00035244465,0.00055315543,0.000109594985,0.00021279376,0.000016144082,0.00015611344,1.8593671e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0000969952,0.00006448269,0.016221123,0.00014697098,0.0024336195,8.5091536e-8,0.00014252802,0.96941525,0.003194857,0.0018427595,0.0000049292285,0.0064363913],"study_design_scores_gemma":[0.00046733257,0.00011070817,0.32104847,0.0000033758558,0.0046795225,3.4545226e-7,0.000032117325,0.6608984,0.011128891,0.0014908714,0.000047339923,0.00009261668],"about_ca_topic_score_codex":0.000010359464,"about_ca_topic_score_gemma":0.000057039248,"teacher_disagreement_score":0.30851686,"about_ca_system_score_codex":0.00012046327,"about_ca_system_score_gemma":0.000055389,"threshold_uncertainty_score":0.43424976},"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":"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.12580118,0.000053086922,0.00066334405,0.0014519595,0.00034017107,0.00005535387,2.3848955e-7,0.000007684952,0.871627],"genre_scores_gemma":[0.99748963,0.0000028086251,0.0007218854,0.001360435,0.00027365074,0.0000033650565,6.6078606e-8,0.000003089967,0.00014508082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994044,0.000018094357,0.00020413242,0.000073810465,0.00014064006,0.00015896474],"domain_scores_gemma":[0.9995328,0.00007453149,0.00013611057,0.000104358,0.000041492312,0.00011069237],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026119527,0.00005428886,0.000118900316,0.000040949846,0.00003148259,0.00001810802,0.00025135092,0.000051595598,0.0065762587],"category_scores_gemma":[0.000015933794,0.00003389947,0.00005366489,0.000109014545,0.00012529259,0.00005082238,0.000020243817,0.00018104893,0.0019363647],"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.000028243794,0.00006439878,0.000020956637,8.2071944e-7,0.000010850817,0.000012526525,0.0001605559,0.0000036019096,0.0023250766,0.9877678,0.0021544786,0.0074506877],"study_design_scores_gemma":[0.00023479808,0.00012190061,0.0039782054,0.0000023378823,0.0000064541914,0.000054980697,0.00011852418,0.0000033647175,0.00025969854,0.9925361,0.002634464,0.00004913957],"about_ca_topic_score_codex":0.0000019713493,"about_ca_topic_score_gemma":5.293793e-8,"teacher_disagreement_score":0.8716884,"about_ca_system_score_codex":0.0000111214285,"about_ca_system_score_gemma":0.000008689185,"threshold_uncertainty_score":0.99884075},"labels":[],"label_agreement":null}]}