{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"5302457a56ec","filters":{"venue":"Journal of Applied Logic"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"William M. Farmer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01942985512094914,"gpt":0.2610006510376462,"spread":0.2415707959166971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009389964,0.0005003881,0.001287671,0.002023945,0.003608035,0.01010679,0.001651697,0.003685175,0.006030726],"category_scores_gemma":[0.02392935,0.0009000825,0.001104451,0.002239787,0.02807471,0.01926943,0.004684018,0.006405933,0.0014387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121638,"about_ca_system_score_gemma":0.002002247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009552404,"about_ca_topic_score_gemma":0.0008707237,"domain_scores_codex":[0.9931226,0.003154618,0.0006162816,0.0007242919,0.001975452,0.0004066239],"domain_scores_gemma":[0.977915,0.01272209,0.0009289885,0.005107196,0.002286195,0.001040536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001618212,0.000004763054,0.0001145627,0.00002518885,0.000003434595,0.00001235222,0.0001920233,0.00007038724,0.00004450883,0.9946434,0.001605451,0.00326768],"study_design_scores_gemma":[0.000008855724,0.000003410147,0.00005233053,0.0000141556,0.000002861588,0.0000261685,0.000059798,0.0001912565,0.00004852872,0.9943072,0.005279693,0.000005747886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06646615,0.01461399,0.39179,0.09056925,0.006115486,0.0001702656,0.001108247,0.0009917325,0.4281749],"genre_scores_gemma":[0.8372959,0.007484206,0.1192282,0.007645409,0.005922765,0.0003949705,0.0004347984,0.0003880258,0.0212057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01010679,"threshold_uncertainty_score":0.04965949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Raúl F. Roldán","is_ca":false},{"name":"Rosa Basagoiti","is_ca":false},{"name":"Leandro C. Coelho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02773312998187052,"gpt":0.2422598730721083,"spread":0.2145267430902378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104291,0.001773855,0.002173852,0.00238968,0.000618324,0.003834663,0.002270613,0.002189276,0.005098457],"category_scores_gemma":[0.00388049,0.00126637,0.001807019,0.008366624,0.001110027,0.005035832,0.001247201,0.002604951,0.00164166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001769243,"about_ca_system_score_gemma":0.00183478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002248336,"about_ca_topic_score_gemma":0.002010735,"domain_scores_codex":[0.9985689,0.0004612447,0.0001232409,0.0003151257,0.0004302955,0.0001011886],"domain_scores_gemma":[0.9979796,0.001480658,0.0001030061,0.000127085,0.0002495209,0.00006020914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001220338,0.0003239173,0.002071202,0.00511442,0.0002255412,0.0002291214,0.0001582352,0.1075295,0.0008735268,0.3716323,0.0321677,0.4795525],"study_design_scores_gemma":[0.00004516751,0.0001963577,0.001433532,0.001228534,0.0001719928,0.0008139263,0.0002147178,0.2528383,0.0007350359,0.4837821,0.2584536,0.00008676798],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.00730793,0.3722668,0.5703893,0.004315187,0.001269289,0.00008906621,0.0006024324,0.0002246484,0.04353533],"genre_scores_gemma":[0.09792731,0.6698898,0.2035685,0.002067113,0.005862837,0.0002237726,0.001489799,0.0002864703,0.0186844],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005098457,"threshold_uncertainty_score":0.01705605,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Douglas Walton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03610602190670964,"gpt":0.2722690373906897,"spread":0.2361630154839801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006282744,0.0008630679,0.001124323,0.002920154,0.005492334,0.01112177,0.00346268,0.00657593,0.01742252],"category_scores_gemma":[0.01511282,0.001171537,0.001645454,0.001658209,0.01966583,0.03041288,0.006961755,0.007807411,0.002459309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002585676,"about_ca_system_score_gemma":0.002375986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002174787,"about_ca_topic_score_gemma":0.001307276,"domain_scores_codex":[0.9952604,0.002664458,0.000294682,0.0006427492,0.0007003052,0.0004373106],"domain_scores_gemma":[0.9942355,0.003231179,0.0003653839,0.001154714,0.0005552527,0.0004580053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009865554,0.00000395799,0.00002768254,0.00001000018,0.000001917492,0.00001164297,0.000478637,0.00009971689,0.00003217975,0.9979493,0.0002075252,0.001167633],"study_design_scores_gemma":[0.00001829629,0.000009884589,0.00004072157,0.00002714541,0.000005721629,0.0000324582,0.0003029013,0.001601275,0.00008692033,0.9934703,0.00439444,0.000009995708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02318026,0.002047695,0.6301717,0.01842916,0.0006245709,0.0002751773,0.0003337667,0.0002897664,0.324648],"genre_scores_gemma":[0.8158581,0.0007814855,0.1539854,0.001616532,0.0005026192,0.0006603539,0.0003298699,0.0002146879,0.02605101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01742252,"threshold_uncertainty_score":0.05828416,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Waqar Ahmed","is_ca":false},{"name":"Osman Hasan","is_ca":false},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04105063957027853,"gpt":0.2843084071889894,"spread":0.2432577676187109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002588118,0.0006968082,0.0005801036,0.001278167,0.0006630945,0.00232826,0.001292402,0.0009466228,0.005849896],"category_scores_gemma":[0.006260037,0.0006984926,0.001726332,0.0005797537,0.001905429,0.00258696,0.001241409,0.002384852,0.0008139291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00138811,"about_ca_system_score_gemma":0.00219865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003909906,"about_ca_topic_score_gemma":0.003527279,"domain_scores_codex":[0.9975121,0.0007115912,0.0001925575,0.0002844998,0.001035513,0.0002638375],"domain_scores_gemma":[0.9943469,0.003344962,0.0005065665,0.0007034314,0.0009604531,0.0001375129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000084655,0.00009772926,0.0006008091,0.0002845197,0.00004406368,0.0003775132,0.0005595442,0.07368361,0.01275119,0.8825064,0.0008251327,0.0281849],"study_design_scores_gemma":[0.0001163027,0.0001173044,0.0004354042,0.0001630405,0.0001184548,0.0003627074,0.0001136475,0.359836,0.02802444,0.5874674,0.02318986,0.00005539235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009690467,0.00009701456,0.9861407,0.0001143561,0.00004432497,0.00008598917,0.00009848614,0.0006679816,0.003060647],"genre_scores_gemma":[0.5087019,0.0004607237,0.4830797,0.0001792465,0.0001121675,0.0003082381,0.000504054,0.0004170706,0.006236865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005849896,"threshold_uncertainty_score":0.01956987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pablo F. Castro","is_ca":true},{"name":"T. S. E. Maibaum","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.019026955996949,"gpt":0.2556762960735929,"spread":0.2366493400766439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002791131,0.0006240957,0.0008541999,0.001312591,0.001847895,0.00393599,0.002096756,0.001944877,0.003488707],"category_scores_gemma":[0.005787579,0.0004989278,0.001182773,0.001625861,0.005004746,0.007937836,0.001900085,0.00308417,0.0004605036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002324972,"about_ca_system_score_gemma":0.001900346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004901376,"about_ca_topic_score_gemma":0.003673666,"domain_scores_codex":[0.998145,0.0004439024,0.0001926808,0.0003412468,0.0005890141,0.0002882787],"domain_scores_gemma":[0.9961707,0.001879672,0.0004724829,0.0007250464,0.0005621958,0.0001898551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003678481,0.00001895008,0.0001348999,0.0000473191,0.00001015041,0.00005669559,0.0001488873,0.003980745,0.0003865771,0.9871936,0.0007016093,0.007283684],"study_design_scores_gemma":[0.00001092132,0.000006809583,0.00004389402,0.00001207527,0.00001266617,0.00004399435,0.00003975043,0.009590994,0.0003703501,0.9871731,0.002688013,0.000007344218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05228167,0.005331214,0.888088,0.003912848,0.0004847932,0.00008581577,0.0002833362,0.0006077458,0.04892462],"genre_scores_gemma":[0.8489586,0.002650954,0.1320966,0.0008225712,0.000498643,0.0001364466,0.0004213832,0.0001062937,0.01430854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004901376,"threshold_uncertainty_score":0.01686889,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Loreto Bravo","is_ca":true},{"name":"Leopoldo Bertossi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07065628126672241,"gpt":0.2913610897038004,"spread":0.220704808437078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007404847,0.0008320501,0.001827376,0.004264815,0.001724964,0.008285174,0.004945554,0.002519989,0.004751582],"category_scores_gemma":[0.03662008,0.001071372,0.001902099,0.004411177,0.002660709,0.009446743,0.004242165,0.002658049,0.001353247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001983911,"about_ca_system_score_gemma":0.002372308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003706658,"about_ca_topic_score_gemma":0.005843439,"domain_scores_codex":[0.9916078,0.002294102,0.001034398,0.001116644,0.003543266,0.0004037758],"domain_scores_gemma":[0.9826514,0.01053917,0.0007686428,0.003824684,0.001898102,0.0003179699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001424869,0.0005187652,0.006532658,0.00119347,0.0005437046,0.0008758294,0.002203795,0.09158253,0.006740883,0.4359169,0.007246627,0.44522],"study_design_scores_gemma":[0.0001491313,0.0001377003,0.0008023874,0.0001146828,0.0003395524,0.0003315428,0.0005256192,0.5594028,0.01128074,0.4212574,0.005578247,0.00008021177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0427663,0.001085764,0.9486846,0.0004655797,0.00006977956,0.0003245594,0.0008196904,0.003086076,0.002697599],"genre_scores_gemma":[0.37321,0.0005431116,0.6221821,0.0002339194,0.00008979641,0.0003788279,0.001876536,0.0001630662,0.001322606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008285174,"threshold_uncertainty_score":0.03916103,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maurice A. Finocchiaro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3119780092472872,"gpt":0.3567658171723777,"spread":0.04478780792509041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01553485,0.0006857527,0.001097935,0.003379521,0.008062007,0.008292402,0.002623021,0.004157744,0.008881553],"category_scores_gemma":[0.02742025,0.0007560325,0.0008281206,0.004360167,0.05807116,0.02827376,0.005716546,0.006587125,0.001240717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004352977,"about_ca_system_score_gemma":0.003902313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003081238,"about_ca_topic_score_gemma":0.002592423,"domain_scores_codex":[0.9917652,0.005527563,0.0003431391,0.001106358,0.0008318673,0.0004259778],"domain_scores_gemma":[0.9807499,0.01418535,0.0009541833,0.002299118,0.001336062,0.0004753731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000013647,0.000005614236,0.00007924899,0.00001378626,9.048059e-7,0.00002308643,0.001252045,0.00004943725,0.00001665176,0.9957178,0.0004116445,0.00241614],"study_design_scores_gemma":[0.0000161381,0.00001128345,0.00007740699,0.00006458868,0.00000404971,0.0001209137,0.001253051,0.0005711222,0.0002264153,0.9807585,0.01688966,0.000006888671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08230402,0.01604615,0.310004,0.07509577,0.001267803,0.0003578393,0.0001586186,0.0003562665,0.5144096],"genre_scores_gemma":[0.9083551,0.004974836,0.05377848,0.002734017,0.0008642306,0.0003011989,0.0001060857,0.0003117717,0.02857419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01553485,"threshold_uncertainty_score":0.08215714,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jocelyne Faddoul","is_ca":true},{"name":"Volker Haarslev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02445751149603936,"gpt":0.2421082605252878,"spread":0.2176507490292484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003886913,0.0007175253,0.0007750781,0.002453594,0.002627368,0.00661403,0.002656222,0.001579765,0.02502106],"category_scores_gemma":[0.01184775,0.001041383,0.003328569,0.002248382,0.002744863,0.01124933,0.00346833,0.002972687,0.003579692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004544828,"about_ca_system_score_gemma":0.003634904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01434314,"about_ca_topic_score_gemma":0.02443331,"domain_scores_codex":[0.9970134,0.0008700812,0.0004048965,0.0004379078,0.001055536,0.0002181028],"domain_scores_gemma":[0.9938245,0.003963636,0.000247271,0.0006854073,0.001083776,0.0001954111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006048676,0.00005466082,0.0003541317,0.0002315084,0.00003382245,0.0001810074,0.0003864198,0.005575121,0.0008270292,0.9601713,0.008946016,0.02317845],"study_design_scores_gemma":[0.00004531776,0.00001557754,0.0001224323,0.00008598489,0.00005923185,0.000141058,0.0002230506,0.05594087,0.002683649,0.9133748,0.02727374,0.00003416191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009368334,0.0003948785,0.9517935,0.002500009,0.000202869,0.0002429546,0.003166001,0.002381077,0.02995046],"genre_scores_gemma":[0.2379521,0.0008084677,0.7318621,0.0008127333,0.0002175986,0.0003641144,0.006559689,0.0007479921,0.0206754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02502106,"threshold_uncertainty_score":0.08370382,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02158454731681853,"gpt":0.2681046684767184,"spread":0.2465201211598999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02324275,0.001276736,0.00220292,0.008768401,0.003514803,0.01027107,0.01045268,0.003821678,0.006907992],"category_scores_gemma":[0.05976507,0.00275142,0.004158261,0.008428473,0.003537653,0.01897678,0.01178022,0.005144966,0.002140787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002059355,"about_ca_system_score_gemma":0.006194079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01175047,"about_ca_topic_score_gemma":0.01398946,"domain_scores_codex":[0.9836003,0.004267761,0.002668765,0.002382627,0.006216832,0.0008638041],"domain_scores_gemma":[0.9624606,0.01342663,0.002073354,0.01221209,0.008687806,0.001139556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006633556,0.0003127876,0.002899748,0.0008847306,0.0006113677,0.0009060405,0.002050127,0.03456018,0.007034649,0.3563613,0.01485171,0.578864],"study_design_scores_gemma":[0.0002601665,0.0002277643,0.0009288642,0.0004825005,0.0009691101,0.0009861359,0.0006944397,0.2972812,0.02197613,0.6068416,0.06909557,0.0002564585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002278893,0.0003221512,0.9931737,0.0004016982,0.00006261286,0.0002362635,0.000271813,0.001869055,0.001383794],"genre_scores_gemma":[0.03307885,0.0002176672,0.9636421,0.0001613006,0.00007738562,0.0001677437,0.001176009,0.0003176114,0.001161297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02324275,"threshold_uncertainty_score":0.1229209,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Roberta Ballarin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04580929526999317,"gpt":0.315232611619914,"spread":0.2694233163499208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004972813,0.0007520338,0.00115948,0.00210104,0.002915758,0.004881561,0.001346886,0.002712826,0.007093278],"category_scores_gemma":[0.008153622,0.0008609495,0.001691418,0.002329032,0.01409059,0.02012153,0.004248721,0.005527734,0.0005790866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001870906,"about_ca_system_score_gemma":0.0008920616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731073,"about_ca_topic_score_gemma":0.001867261,"domain_scores_codex":[0.9976295,0.001280981,0.0001683863,0.0004131257,0.0003184508,0.000189499],"domain_scores_gemma":[0.9956071,0.002944954,0.0002316759,0.0006051179,0.0004599308,0.0001512016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009445901,0.000002935551,0.00004682328,0.00001890944,0.000004578319,0.0000196731,0.0002413334,0.0001123489,0.0000754847,0.9974508,0.0004328317,0.001584937],"study_design_scores_gemma":[0.000005187308,0.000004074509,0.00007056734,0.00000893685,0.000005002268,0.00002298129,0.00004184395,0.0004624712,0.00007907675,0.9971191,0.002174353,0.000006601671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09525874,0.02379054,0.5436252,0.04358613,0.002137823,0.00008693419,0.0006932357,0.0004359168,0.2903855],"genre_scores_gemma":[0.9446954,0.003670241,0.03318468,0.001877435,0.001428534,0.0001088813,0.0001592694,0.0001358953,0.01473969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007093278,"threshold_uncertainty_score":0.02629906,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Douglas Walton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02786709962843172,"gpt":0.2324495649588235,"spread":0.2045824653303918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003317195,0.0006372778,0.0008224271,0.001975223,0.001871026,0.004387439,0.002451136,0.002445215,0.01237325],"category_scores_gemma":[0.005282943,0.0005069391,0.001292143,0.001422404,0.002919788,0.00466944,0.003285279,0.002675623,0.001769059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001964792,"about_ca_system_score_gemma":0.001501465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001102174,"about_ca_topic_score_gemma":0.0008284359,"domain_scores_codex":[0.9973901,0.001012337,0.0002498954,0.0003941256,0.0007396498,0.0002139173],"domain_scores_gemma":[0.9982511,0.0006507567,0.0001257403,0.0003745407,0.0004504727,0.0001473817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002229594,0.00001539768,0.00005574757,0.0000374455,0.000008283562,0.00005045518,0.00017816,0.001106317,0.0006382799,0.991192,0.0004820595,0.006213593],"study_design_scores_gemma":[0.00005077853,0.00004166393,0.0001125281,0.00006470963,0.00002408124,0.0001686927,0.0001176083,0.0304391,0.001739309,0.9404688,0.02674274,0.00002989349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02712217,0.0005343353,0.9008563,0.001544595,0.0004033012,0.0002684409,0.0004024794,0.0005201387,0.06834819],"genre_scores_gemma":[0.5002344,0.0003992234,0.4721929,0.0003191727,0.0002305425,0.0003240172,0.0004934644,0.0001189951,0.02568733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01237325,"threshold_uncertainty_score":0.04139262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Osman Hasan","is_ca":false},{"name":"Jigar Patel","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07512871240220503,"gpt":0.2943637603353065,"spread":0.2192350479331015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005898197,0.0009752468,0.0009227928,0.002199233,0.0006817323,0.001743671,0.002143065,0.0008806508,0.004156487],"category_scores_gemma":[0.02689987,0.0008243038,0.002478943,0.0009160558,0.002342159,0.003835538,0.001205004,0.001989793,0.0004705675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125493,"about_ca_system_score_gemma":0.001557047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114869,"about_ca_topic_score_gemma":0.001044264,"domain_scores_codex":[0.9940398,0.002199818,0.0003269713,0.0006423626,0.002258545,0.0005325399],"domain_scores_gemma":[0.9627697,0.02917303,0.001706063,0.003801984,0.002388373,0.0001607907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004078451,0.0002717861,0.002618123,0.0009654877,0.0003073893,0.0005244222,0.0004839695,0.4522616,0.02841212,0.3927985,0.00212479,0.1188242],"study_design_scores_gemma":[0.00005558654,0.00009271694,0.0003246541,0.00005828409,0.0001173294,0.000169163,0.00003624243,0.7999687,0.01695366,0.1807431,0.001449452,0.00003116273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02303201,0.0001733083,0.9740036,0.0001224134,0.00003013963,0.00008124827,0.00006117858,0.0007909486,0.001705152],"genre_scores_gemma":[0.7354723,0.0003738845,0.2620769,0.00008704636,0.00009395677,0.000188215,0.0001863308,0.0003292728,0.001192054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005898197,"threshold_uncertainty_score":0.03119302,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06770647973216208,"gpt":0.2773710722070462,"spread":0.2096645924748841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0125127,0.001177319,0.001858018,0.002812303,0.001881607,0.005779617,0.004718436,0.002280793,0.009558126],"category_scores_gemma":[0.04021635,0.001800843,0.004284343,0.001827057,0.003819821,0.01103124,0.005219663,0.004123592,0.001420564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002509954,"about_ca_system_score_gemma":0.003115032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003107835,"about_ca_topic_score_gemma":0.004815563,"domain_scores_codex":[0.9902501,0.003438858,0.0008616985,0.001345867,0.003212903,0.0008906021],"domain_scores_gemma":[0.9427005,0.05071985,0.001261835,0.002946523,0.001881002,0.0004904127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003902619,0.000240689,0.003202066,0.0005168598,0.0003102198,0.001089103,0.0007353919,0.07271471,0.006021401,0.8548964,0.004148277,0.05573453],"study_design_scores_gemma":[0.000135699,0.00003765623,0.0002235532,0.00003638979,0.0001554377,0.0002206465,0.00005809673,0.3458413,0.01061056,0.6399473,0.002689531,0.00004377203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01246573,0.00005156574,0.982599,0.0004253383,0.00005618882,0.00006570756,0.0002025607,0.002289894,0.001843945],"genre_scores_gemma":[0.3950545,0.000191154,0.6001292,0.0005576871,0.0001983464,0.0001218168,0.0006091546,0.0006088558,0.002529226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0125127,"threshold_uncertainty_score":0.06617427,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.007406277270205775,"gpt":0.2493515518165965,"spread":0.2419452745463908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00251252,0.0008926602,0.0005141057,0.001605133,0.0006179655,0.001866941,0.00132208,0.0006848034,0.003338116],"category_scores_gemma":[0.006336813,0.0005362887,0.002152,0.0005199545,0.001921125,0.001967573,0.001201918,0.001689826,0.0004806819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126924,"about_ca_system_score_gemma":0.002414308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002985746,"about_ca_topic_score_gemma":0.003672378,"domain_scores_codex":[0.997644,0.0005640041,0.0001524432,0.0002391035,0.001027286,0.0003730482],"domain_scores_gemma":[0.9944507,0.003208308,0.0004407054,0.0006906983,0.001129042,0.00008058298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002138984,0.0003220398,0.002793656,0.0007403892,0.0002146568,0.0007424171,0.0004955587,0.3610001,0.03374074,0.517553,0.002225209,0.07995826],"study_design_scores_gemma":[0.00005288446,0.0001778876,0.0007806584,0.0002010689,0.0001799544,0.0002616432,0.0001124612,0.6983774,0.02768385,0.2652832,0.006839234,0.00004980122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02501441,0.00026471,0.9689922,0.0002855295,0.00006633156,0.0001295179,0.0001483945,0.0005980722,0.004500832],"genre_scores_gemma":[0.7492813,0.0005400541,0.2437682,0.0002874733,0.0001677983,0.00025981,0.0004495391,0.0003353456,0.004910306],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003338116,"threshold_uncertainty_score":0.0132876,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Behzad Akbarpour","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04357466503073198,"gpt":0.3204460977775031,"spread":0.2768714327467711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005363428,0.000886102,0.001215717,0.002113612,0.0008880342,0.002707166,0.001942801,0.001139713,0.003884794],"category_scores_gemma":[0.0235889,0.0005243929,0.0009994288,0.001017217,0.002592541,0.004090214,0.002673043,0.002193558,0.0004025898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001565586,"about_ca_system_score_gemma":0.001167711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001629179,"about_ca_topic_score_gemma":0.001428133,"domain_scores_codex":[0.9959254,0.001055385,0.0002392794,0.0004557163,0.001981065,0.0003431945],"domain_scores_gemma":[0.9726882,0.01979459,0.001236324,0.002945637,0.003078571,0.0002566788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008496643,0.0001370221,0.002784457,0.0003873225,0.0001823684,0.00027079,0.0004052727,0.228706,0.008285962,0.6232753,0.002442977,0.1322728],"study_design_scores_gemma":[0.00003301494,0.00004504288,0.0002472867,0.0000280366,0.00003311216,0.00006040086,0.00003160958,0.7716597,0.007764879,0.2191012,0.0009761112,0.00001963724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01224597,0.0001344986,0.9854138,0.0001512949,0.00005171257,0.00001280081,0.00002199243,0.0002239793,0.001743951],"genre_scores_gemma":[0.8011886,0.0003849106,0.1922134,0.0002108979,0.0001662347,0.00005727518,0.0001252307,0.0003050653,0.005348335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005363428,"threshold_uncertainty_score":0.0283649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Howard J. Hamilton","is_ca":true},{"name":"Liqiang Geng","is_ca":true},{"name":"Leah Findlater","is_ca":true},{"name":"Dee Jay Randall","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.033887326577623,"gpt":0.2521135207993993,"spread":0.2182261942217763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000546756,0.0005203675,0.0008563272,0.001711049,0.0007668582,0.001311224,0.001387711,0.0006211823,0.001806963],"category_scores_gemma":[0.003352625,0.0003821287,0.001082017,0.003246476,0.0005663961,0.002907306,0.001909021,0.0007844379,0.0005318482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005675331,"about_ca_system_score_gemma":0.001277151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007059636,"about_ca_topic_score_gemma":0.0143631,"domain_scores_codex":[0.9994323,0.0001407539,0.00004690448,0.0001532772,0.0001684636,0.00005823734],"domain_scores_gemma":[0.9981533,0.0008420828,0.0001454921,0.0005729526,0.0002015661,0.00008454976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006334687,0.0002610129,0.01036581,0.0004926508,0.000225794,0.0005539886,0.0004966897,0.207829,0.01268615,0.05514003,0.01668439,0.6946312],"study_design_scores_gemma":[0.00004899925,0.00008157025,0.001025944,0.00003114777,0.00004599999,0.000303386,0.0003092003,0.8842968,0.005681769,0.1014009,0.006758624,0.00001556732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08140638,0.0006345969,0.9078673,0.0006644159,0.00006707279,0.0001937099,0.002625739,0.004266079,0.002274729],"genre_scores_gemma":[0.3761326,0.0003970456,0.6166192,0.0001761379,0.00003980774,0.0001194147,0.004280123,0.0002374136,0.001998205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007059636,"threshold_uncertainty_score":0.01403707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Clayton Peterson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01403913184256098,"gpt":0.2658404209929877,"spread":0.2518012891504267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004584334,0.0004562905,0.001011611,0.002292932,0.002536912,0.00663567,0.002050351,0.002266466,0.004667171],"category_scores_gemma":[0.006744536,0.0006827468,0.001229898,0.001947613,0.01250241,0.01276878,0.003429866,0.005301905,0.0006301486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003145569,"about_ca_system_score_gemma":0.002745867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003815353,"about_ca_topic_score_gemma":0.002631207,"domain_scores_codex":[0.9977694,0.001022929,0.0001330173,0.0003592514,0.0005256558,0.00018994],"domain_scores_gemma":[0.9949326,0.002844792,0.0002227898,0.0008287526,0.0007918122,0.0003792953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003207634,0.000002233386,0.00002012236,0.00000921833,0.000001334542,0.000005733177,0.00008550881,0.000150923,0.00004403225,0.9982067,0.0003473465,0.001123618],"study_design_scores_gemma":[0.00000279735,0.000001813717,0.00001749965,0.000006048988,0.000001358479,0.000006788942,0.00002064578,0.0009141717,0.00003457073,0.9962047,0.002786425,0.000003250304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02517756,0.008055841,0.8508669,0.01844202,0.001055902,0.00006672163,0.0005028736,0.0005284001,0.09530374],"genre_scores_gemma":[0.7965826,0.003056966,0.182867,0.00236642,0.001894207,0.0002091522,0.000490152,0.0003082033,0.01222524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00663567,"threshold_uncertainty_score":0.02424455,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Vaishak Belle","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03803709147389608,"gpt":0.273853608544731,"spread":0.2358165170708349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467953,0.0006846253,0.001249403,0.001919762,0.001721873,0.005373735,0.003001859,0.001607025,0.003858086],"category_scores_gemma":[0.009690761,0.0009652384,0.002078005,0.002063425,0.003497198,0.00949583,0.003792086,0.002375687,0.000704555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002179185,"about_ca_system_score_gemma":0.001945825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01185871,"about_ca_topic_score_gemma":0.007453574,"domain_scores_codex":[0.9972783,0.0007767228,0.0002460407,0.0005514838,0.0007968807,0.0003505561],"domain_scores_gemma":[0.9970041,0.001770229,0.0002451104,0.0003703708,0.0004365291,0.000173662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000101403,0.00004326937,0.0006777918,0.00007441718,0.00004986204,0.000302046,0.0004079023,0.04664873,0.0006311306,0.9290776,0.0009749646,0.02101085],"study_design_scores_gemma":[0.00001932622,0.00001480338,0.0001139318,0.00001805533,0.00004120144,0.00007901654,0.00007555532,0.1917299,0.0004423444,0.8058893,0.001552121,0.00002455237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02267075,0.0004313976,0.9671794,0.0008046099,0.00006451386,0.00003702381,0.0001268606,0.000318296,0.008367138],"genre_scores_gemma":[0.7335306,0.0007331629,0.2590325,0.0001724741,0.0001920506,0.0000891526,0.0002226806,0.0001008924,0.005926544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01185871,"threshold_uncertainty_score":0.02357936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ji Ma","is_ca":false},{"name":"Mehmet A. Orgun","is_ca":false},{"name":"Kamel Adi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07666570988216673,"gpt":0.2869100306169845,"spread":0.2102443207348178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279713,0.000712982,0.001002348,0.001716855,0.002228438,0.006666474,0.002505552,0.001600916,0.01191625],"category_scores_gemma":[0.005090244,0.0008650743,0.002189103,0.002232914,0.003498619,0.007176175,0.002468716,0.003083143,0.00168572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004002937,"about_ca_system_score_gemma":0.002301882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006479681,"about_ca_topic_score_gemma":0.004635358,"domain_scores_codex":[0.9987054,0.0003257963,0.0001221685,0.0002095924,0.0004570078,0.0001800193],"domain_scores_gemma":[0.9982698,0.0009916337,0.00008043529,0.0001903574,0.0003440385,0.000123678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001004928,0.000007070046,0.00002682884,0.00001784235,0.000004766909,0.00003481227,0.00013906,0.001304797,0.0003175919,0.9947471,0.0005211959,0.002868764],"study_design_scores_gemma":[0.00001184943,0.000006979341,0.00002051824,0.00001138576,0.00001228962,0.00002769137,0.00004455064,0.01680642,0.0004069122,0.9770314,0.005607366,0.00001258192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009254912,0.0003363622,0.9643137,0.001091416,0.0002158042,0.0001044509,0.000457022,0.0005432845,0.02368306],"genre_scores_gemma":[0.3818709,0.0006390737,0.5909473,0.0005253089,0.0002621995,0.0003239602,0.0006777088,0.0003392733,0.02441426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01191625,"threshold_uncertainty_score":0.03986382,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Database; Computer science; Programming language; Information retrieval; Artificial intelligence; Natural language processing","authors":[{"name":"Andrea Calı̀","is_ca":false},{"name":"Laks V. S. Lakshmanan","is_ca":true},{"name":"Davide Martinenghi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02759794682926558,"gpt":0.2627217851141027,"spread":0.2351238382848371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00300353,0.001625233,0.002056645,0.007835593,0.001531327,0.006688494,0.0017354,0.001474087,0.07214886],"category_scores_gemma":[0.005555083,0.0006898873,0.001354243,0.01004415,0.0006307139,0.004773104,0.00204409,0.002399931,0.02453808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004594603,"about_ca_system_score_gemma":0.003508805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003857657,"about_ca_topic_score_gemma":0.008025049,"domain_scores_codex":[0.9981294,0.0002223417,0.0001638755,0.0003832383,0.0009668634,0.0001342566],"domain_scores_gemma":[0.9934068,0.001476758,0.000267327,0.0003053346,0.003469122,0.001074789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000785942,0.00005426148,0.0002036295,0.0007397889,0.00002609614,0.0000762757,0.00007657804,0.0002809557,0.0006586973,0.002908696,0.8910717,0.1038247],"study_design_scores_gemma":[0.00003705592,0.00003327032,0.0007087134,0.0005898718,0.00005313901,0.0001576962,0.0001184303,0.0004128117,0.000693558,0.004570862,0.9926019,0.00002263438],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"other","genre_scores_codex":[0.006046087,0.3989902,0.05286659,0.109703,0.2248881,0.0007258885,0.01430997,0.001701903,0.1907682],"genre_scores_gemma":[0.01667649,0.2688214,0.02878778,0.01377604,0.07426231,0.0004319201,0.02554843,0.001750401,0.5699452],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.07214886,"threshold_uncertainty_score":0.241362,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Calculus (dental); Subject (documents); Mathematics; Algebra over a field; Computer science; Pure mathematics; Medicine","authors":[{"name":"M. W. Bunder","is_ca":false},{"name":"Jonathan P. Seldin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0180145919201207,"gpt":0.2305326623735736,"spread":0.2125180704534529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002933491,0.001205454,0.001408587,0.002275185,0.003409895,0.006407026,0.003102629,0.002039632,0.01037832],"category_scores_gemma":[0.005009255,0.001088728,0.003044307,0.003089451,0.00653121,0.01050776,0.004727651,0.0062527,0.002267114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001665558,"about_ca_system_score_gemma":0.001544137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002288619,"about_ca_topic_score_gemma":0.002779784,"domain_scores_codex":[0.9975073,0.0006867237,0.0001756121,0.0004861118,0.000812582,0.0003317276],"domain_scores_gemma":[0.9973894,0.0009404271,0.0001141172,0.000815617,0.0004831873,0.0002573082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001355681,0.000005983116,0.00004864325,0.00001285971,0.000004209785,0.00002928235,0.00009335618,0.0001232089,0.0001814622,0.9952947,0.0009698109,0.003222819],"study_design_scores_gemma":[0.00001465666,0.00000896416,0.00006819415,0.00001144027,0.0000152693,0.0001285535,0.00003718047,0.0012978,0.0002548746,0.9812394,0.01691059,0.00001303145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02810499,0.003787824,0.806894,0.00326898,0.002240779,0.0001408225,0.0009057649,0.001324652,0.1533322],"genre_scores_gemma":[0.5704994,0.003892678,0.3515994,0.001848969,0.002550026,0.0003542863,0.001265061,0.001193578,0.06679651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01037832,"threshold_uncertainty_score":0.03471899,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Roger Villemaire","is_ca":true},{"name":"Sylvain Hallé","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01534588857577848,"gpt":0.2543208214257721,"spread":0.2389749328499936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003045723,0.001028509,0.001157651,0.002936754,0.002490937,0.006532701,0.00283309,0.002544523,0.008805472],"category_scores_gemma":[0.02425613,0.001708219,0.003637735,0.002649198,0.004600512,0.02588637,0.005656316,0.00561815,0.0007031816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001619118,"about_ca_system_score_gemma":0.001318822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006426102,"about_ca_topic_score_gemma":0.005492055,"domain_scores_codex":[0.9955037,0.001028523,0.0003728323,0.001243819,0.0012646,0.0005864502],"domain_scores_gemma":[0.9865008,0.008645847,0.0007950808,0.002300531,0.001245972,0.0005117216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001599672,0.00007951782,0.00263363,0.0002189644,0.0001360661,0.0004743313,0.001001106,0.008982845,0.001684112,0.9507387,0.004422158,0.02946858],"study_design_scores_gemma":[0.00002645048,0.00001698196,0.0003233586,0.00005136104,0.00009770531,0.0001689125,0.0003160491,0.02619005,0.001971009,0.9647083,0.006107371,0.00002231636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1661168,0.001567448,0.7566913,0.008619297,0.0004408904,0.0002187811,0.00210855,0.001380468,0.06285658],"genre_scores_gemma":[0.8499501,0.0007499963,0.1398346,0.0006175167,0.0002624895,0.00007785065,0.00184395,0.0003077292,0.006355749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008805472,"threshold_uncertainty_score":0.02945727,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Imen Bourguiba","is_ca":true},{"name":"Belaid Moa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04143660082214858,"gpt":0.29699472120135,"spread":0.2555581203792014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003353573,0.0009278123,0.0008985744,0.001847995,0.0008015312,0.002662363,0.002146831,0.00115185,0.003604771],"category_scores_gemma":[0.01131566,0.0005880144,0.001697022,0.001396162,0.001895581,0.005037858,0.00255372,0.002826907,0.0008504834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100822,"about_ca_system_score_gemma":0.002485456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001231666,"about_ca_topic_score_gemma":0.001594868,"domain_scores_codex":[0.9939529,0.001769679,0.0003370029,0.0006652759,0.002895736,0.000379393],"domain_scores_gemma":[0.9944147,0.002384312,0.0003101353,0.001421639,0.001348022,0.0001211229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002850245,0.0001882151,0.0008474879,0.0004427734,0.00009685259,0.0001779779,0.0003319195,0.0382269,0.01597745,0.699035,0.005228883,0.2391614],"study_design_scores_gemma":[0.0001113969,0.000159255,0.0004012378,0.00009961895,0.0001399123,0.0002345346,0.00009762797,0.2762324,0.02007592,0.6803967,0.02198307,0.00006836122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01430419,0.0002497501,0.9786709,0.0006293805,0.0001290263,0.0000569316,0.00007085266,0.001070674,0.004818284],"genre_scores_gemma":[0.3155369,0.0004254869,0.6773371,0.0004877133,0.0002680833,0.0001409167,0.0001879702,0.001003238,0.004612573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003604771,"threshold_uncertainty_score":0.01773554,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"R. E. Jennings","is_ca":true},{"name":"D.X. Nicholson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02280034758243311,"gpt":0.2681070895114985,"spread":0.2453067419290654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002664043,0.0004624506,0.0006953828,0.00188962,0.002941885,0.002559126,0.001977462,0.002001956,0.007453617],"category_scores_gemma":[0.007037687,0.0008164505,0.002332643,0.001836675,0.005290196,0.0106776,0.00418995,0.004166426,0.0008317299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001656508,"about_ca_system_score_gemma":0.0009242521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002801361,"about_ca_topic_score_gemma":0.00250603,"domain_scores_codex":[0.9974518,0.0007923751,0.000266378,0.0008188426,0.0004646925,0.000205874],"domain_scores_gemma":[0.9951179,0.002110235,0.0002668493,0.001348111,0.0008797387,0.0002771863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008751519,0.00001074919,0.0002036401,0.0000196908,0.000008994909,0.00006469457,0.0001942425,0.0004672984,0.0002334131,0.9934099,0.0006721061,0.004706535],"study_design_scores_gemma":[0.00001457362,0.00001462922,0.0002331045,0.00001609532,0.00001938768,0.0002742881,0.000120435,0.004740353,0.0003923106,0.9869307,0.007231778,0.00001246426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0601146,0.000721628,0.8584093,0.003648813,0.0004250771,0.0001105103,0.000689405,0.0006994732,0.07518108],"genre_scores_gemma":[0.724589,0.0005674009,0.2640761,0.0008459043,0.0003165487,0.0001841018,0.0008690321,0.0001477402,0.008404001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007453617,"threshold_uncertainty_score":0.02493483,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Roberta Ballarin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03442234357019545,"gpt":0.2987238360944448,"spread":0.2643014925242493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005588396,0.0004045006,0.0007968575,0.002523135,0.005366897,0.008075651,0.001248976,0.002902747,0.0080435],"category_scores_gemma":[0.03682103,0.0009514191,0.0007638966,0.001401484,0.01811258,0.02613543,0.005566598,0.00593099,0.0006024801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002066039,"about_ca_system_score_gemma":0.001486634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001612014,"about_ca_topic_score_gemma":0.00104766,"domain_scores_codex":[0.9960247,0.00177267,0.0002149643,0.0005365504,0.0009742673,0.0004768664],"domain_scores_gemma":[0.9724525,0.01937909,0.001753085,0.003079528,0.0021156,0.001220066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005559004,0.00001458269,0.0004725852,0.00002015874,0.000006264917,0.0001266004,0.002398295,0.0001204755,0.0003196662,0.9924772,0.0004273089,0.003561297],"study_design_scores_gemma":[0.00001056764,0.00000668527,0.0001468059,0.00001016155,0.000007779198,0.00007810631,0.0002747248,0.0004775939,0.0002277321,0.9969908,0.001760454,0.000008526976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5248281,0.002709039,0.1771376,0.02566013,0.0006600171,0.00007100834,0.0002172076,0.0005911508,0.2681257],"genre_scores_gemma":[0.9900366,0.0002196488,0.005051909,0.0003239762,0.0001747017,0.0000190956,0.00002752784,0.0000829453,0.004063631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008075651,"threshold_uncertainty_score":0.02955461,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andrew David Irvine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02319056844814743,"gpt":0.2850046257982854,"spread":0.261814057350138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000702921,0.000875489,0.0006803125,0.001813099,0.001357726,0.00200094,0.0017606,0.002006583,0.7320438],"category_scores_gemma":[0.00363156,0.00035035,0.0007494643,0.001328688,0.0006409721,0.001136201,0.001598595,0.001544898,0.6017142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001421889,"about_ca_system_score_gemma":0.002382754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002830792,"about_ca_topic_score_gemma":0.005586701,"domain_scores_codex":[0.9991666,0.00007582086,0.00003677278,0.0001427627,0.0004605197,0.0001175628],"domain_scores_gemma":[0.9984215,0.0002403784,0.00007289728,0.0002394141,0.0007823859,0.0002434003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001972045,0.00006787698,0.0004035941,0.0002384414,0.00001747283,0.00009636551,0.00003778917,0.0001654932,0.003802511,0.0192469,0.9048465,0.07087983],"study_design_scores_gemma":[0.00004339236,0.00004372389,0.0004211769,0.00006854583,0.000009540831,0.00009918449,0.00004714547,0.0002650119,0.00247134,0.00593625,0.9905804,0.00001435006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.004060973,0.001784333,0.007131303,0.007545645,0.007389069,0.0003193247,0.0709938,0.00394018,0.8968354],"genre_scores_gemma":[0.0346823,0.002292012,0.008493297,0.00614181,0.001250929,0.0005295187,0.1075143,0.002060543,0.8370354],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2679562,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Artificial intelligence; Computer science","authors":[{"name":"Christoph Beierle","is_ca":true},{"name":"Cory J. Butz","is_ca":true},{"name":"Souhila Kaci","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04064608043296995,"gpt":0.258233483731139,"spread":0.217587403298169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00245294,0.0006194533,0.0007976555,0.002236445,0.001962963,0.004428942,0.001577683,0.001838789,0.0190498],"category_scores_gemma":[0.01387154,0.0006444075,0.001833343,0.001428086,0.002746514,0.0101013,0.002779866,0.002992469,0.001280654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003064641,"about_ca_system_score_gemma":0.000939013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0103775,"about_ca_topic_score_gemma":0.007062812,"domain_scores_codex":[0.9979634,0.0007971134,0.0001159096,0.0003340975,0.000564458,0.000224994],"domain_scores_gemma":[0.9948155,0.00380773,0.0002020567,0.000412615,0.0005604593,0.0002015805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001929638,0.0000373722,0.0005846965,0.000113479,0.00006409401,0.0002615573,0.0003080679,0.04376269,0.0009289191,0.9125466,0.005864456,0.03533508],"study_design_scores_gemma":[0.000008707899,0.00001230506,0.0001287333,0.00002513002,0.00002492003,0.00004419728,0.00006920026,0.1001125,0.0009241501,0.8931163,0.005520576,0.00001324776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05085323,0.001633735,0.870225,0.006742413,0.0003437535,0.00009052765,0.0007880048,0.00107034,0.06825293],"genre_scores_gemma":[0.781511,0.0008215858,0.1892677,0.000944384,0.0004775298,0.00008116606,0.001282383,0.0002872077,0.02532694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190498,"threshold_uncertainty_score":0.06372792,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Fairouz Kamareddine","is_ca":false},{"name":"Jonathan P. Seldin","is_ca":true},{"name":"J. B. Wells","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02138106925749552,"gpt":0.2417413539045167,"spread":0.2203602846470212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007580509,0.0008221262,0.001742922,0.002041872,0.003573325,0.006537595,0.003789491,0.00253837,0.01655214],"category_scores_gemma":[0.02696204,0.001545184,0.001616025,0.002585164,0.005820189,0.02185176,0.009978642,0.007431822,0.002988755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001717782,"about_ca_system_score_gemma":0.00243565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002148842,"about_ca_topic_score_gemma":0.002821678,"domain_scores_codex":[0.9930912,0.002535288,0.000550083,0.001055044,0.002057204,0.0007111499],"domain_scores_gemma":[0.9845961,0.005476225,0.0005443377,0.00588883,0.002719782,0.000774708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004341971,0.00002286304,0.0002882753,0.00006489576,0.00001320977,0.00005753384,0.0006091979,0.0002520908,0.0003065846,0.9760944,0.005380551,0.01686709],"study_design_scores_gemma":[0.00004682813,0.00001777202,0.0001620215,0.00006574492,0.00003577275,0.0001524129,0.0001989489,0.003525021,0.001011429,0.9620816,0.03266623,0.00003611757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02176609,0.001527888,0.9073542,0.01009959,0.00170301,0.00006216741,0.0003331349,0.00184164,0.05531229],"genre_scores_gemma":[0.5760493,0.002439668,0.3621142,0.0050541,0.00251578,0.0002114732,0.0004607438,0.003472996,0.04768178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01655214,"threshold_uncertainty_score":0.05537248,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Gillman Payette","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07179899582884149,"gpt":0.3140917748543214,"spread":0.2422927790254799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01681498,0.001674183,0.002485696,0.002838658,0.002372846,0.008654968,0.009240911,0.005138894,0.009398657],"category_scores_gemma":[0.03149031,0.001489984,0.006795494,0.002784335,0.01111057,0.02641616,0.009110916,0.0128172,0.003474852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002007734,"about_ca_system_score_gemma":0.002093871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003573997,"about_ca_topic_score_gemma":0.001770084,"domain_scores_codex":[0.9901281,0.003104061,0.001032336,0.002529213,0.002667973,0.0005382911],"domain_scores_gemma":[0.9765369,0.01274108,0.0005065117,0.007602738,0.002250829,0.0003619701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004441899,0.00003970124,0.0002057756,0.000194113,0.00005507137,0.00015675,0.0004627162,0.001980474,0.0006263225,0.95966,0.004862772,0.03171186],"study_design_scores_gemma":[0.00001998772,0.00001527407,0.00005875069,0.00003865025,0.00003299732,0.00009569413,0.00003906007,0.003544017,0.0007576883,0.9815958,0.01378022,0.00002178349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003819286,0.002077905,0.9514495,0.004925809,0.001366374,0.0001861439,0.0002411922,0.0007148007,0.03521901],"genre_scores_gemma":[0.1411293,0.006874296,0.8186054,0.007147492,0.004263538,0.0005775831,0.0008309319,0.001119093,0.01945237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01681498,"threshold_uncertainty_score":0.08892715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}