{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002930477,0.00008195407,0.0001845527,0.00006071509,0.0001013294,0.00005848079,0.0008028112,0.00005602885,0.0000074292],"category_scores_gemma":[0.00005349677,0.00004331193,0.0000824212,0.0002457303,0.00007381653,0.00008148356,0.0000938891,0.000159694,0.00001939378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002246823,"about_ca_system_score_gemma":0.00005689076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002618819,"about_ca_topic_score_gemma":0.00000455653,"domain_scores_codex":[0.9989462,0.00004338873,0.0004253453,0.00009086814,0.0002916274,0.0002025579],"domain_scores_gemma":[0.9986801,0.000342092,0.0005015389,0.0002544193,0.0001590545,0.00006279223],"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.00006690594,0.00003439206,0.00009680988,0.000006321072,0.00003130472,0.00001448584,0.000437592,0.00003176619,0.001251157,0.9230106,0.0004187822,0.07459989],"study_design_scores_gemma":[0.0002672021,0.0003427469,0.001082687,0.000002360844,0.00001184857,0.00007030777,0.0005592222,0.00005474213,0.004185875,0.9398484,0.05348442,0.00009019973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02456156,0.001437915,0.9115471,0.0001882229,0.001134772,0.0002115184,1.866795e-7,0.00004464882,0.06087402],"genre_scores_gemma":[0.9964467,0.00003551258,0.003057412,0.0001351926,0.0001974009,5.530092e-7,1.359771e-7,0.00000449458,0.0001226287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718851,"threshold_uncertainty_score":0.1766209,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401781,0.0001161774,0.0001818211,0.00006809439,0.00006090221,0.00003207471,0.0001190244,0.00004736746,0.00002310015],"category_scores_gemma":[0.00009855008,0.00005284509,0.00002221178,0.0001306097,0.00005112706,0.00004575904,0.00001662331,0.0001772546,0.000006218977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004256719,"about_ca_system_score_gemma":0.0000197614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.098676e-7,"about_ca_topic_score_gemma":0.000002438839,"domain_scores_codex":[0.9992626,0.00006586841,0.0002539607,0.00008087361,0.0001778069,0.0001589358],"domain_scores_gemma":[0.9990832,0.0005441178,0.0001587912,0.0001003178,0.00006033912,0.00005322768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003798603,0.00006366887,0.005181155,0.00006212422,0.0002976625,0.00001498218,0.0010372,0.9435815,0.007725412,0.01474785,0.002009698,0.02489888],"study_design_scores_gemma":[0.01847086,0.004361589,0.1238439,0.004100666,0.0006764737,0.0007240099,0.001749939,0.7751362,0.0165522,0.04967225,0.001152122,0.003559783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3942963,0.0001391136,0.5988532,0.0006573578,0.00008799102,0.000275548,0.000002804979,0.0000977706,0.00558995],"genre_scores_gemma":[0.9872203,0.00001355862,0.0125426,0.00008926188,0.00006316048,0.000003310151,2.300871e-7,0.00002285685,0.00004469121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5929241,"threshold_uncertainty_score":0.215496,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004218715,0.00008920178,0.0001344027,0.00003784796,0.0003686676,0.0001307818,0.0008423419,0.00004798293,0.00001036363],"category_scores_gemma":[0.0001194493,0.00003596539,0.0001400239,0.0001252002,0.00005550265,0.00008982751,0.0000698489,0.0001499067,0.000009043248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000302228,"about_ca_system_score_gemma":0.00003369774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000144869,"about_ca_topic_score_gemma":0.00001374008,"domain_scores_codex":[0.9989203,0.00003619289,0.0004077936,0.0001076134,0.0003092201,0.0002188867],"domain_scores_gemma":[0.9967417,0.002442639,0.0004141431,0.0002519021,0.00009355951,0.00005605377],"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.0001581248,0.00005130464,0.00008607232,0.000004943414,0.00004032079,0.000006090303,0.0002843159,0.0001930107,0.001406422,0.9036883,0.002058065,0.0920231],"study_design_scores_gemma":[0.002714362,0.0007605779,0.04389662,0.00004138014,0.0001015805,0.0001768533,0.0009178138,0.01430305,0.005696063,0.7397485,0.1912281,0.0004150716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005273341,0.0005904055,0.9894801,0.001501478,0.0007603628,0.0003193085,5.607928e-7,0.00001559173,0.002058879],"genre_scores_gemma":[0.992848,0.00005912175,0.005612595,0.0007907296,0.0006224966,0.00001114037,1.763315e-7,0.000004533303,0.00005124371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9875746,"threshold_uncertainty_score":0.2835531,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705409,0.0001036484,0.0002541433,0.0001615047,0.00002716118,0.00001905318,0.0006662504,0.000102013,0.00002615278],"category_scores_gemma":[0.0002081895,0.00006191879,0.00006201104,0.000553388,0.00007906996,0.0004412858,0.00009880024,0.0001337526,0.000009226383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001059561,"about_ca_system_score_gemma":0.00005895118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001785026,"about_ca_topic_score_gemma":9.732906e-7,"domain_scores_codex":[0.9984985,0.00008819788,0.0007327549,0.0001649694,0.0003316688,0.00018393],"domain_scores_gemma":[0.9984389,0.0001528099,0.0007289558,0.0003765695,0.0002476394,0.00005510158],"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.0001522946,0.0003500822,0.003069944,0.00005736661,0.00001393124,0.00000685149,0.0004041607,0.002982307,0.02255018,0.9009915,0.0001661939,0.06925519],"study_design_scores_gemma":[0.002928596,0.001019127,0.1077694,0.0001565452,0.00002542743,0.00006451226,0.00007194984,0.006135715,0.0573642,0.8194351,0.004559444,0.0004700069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09936161,0.00005424869,0.8938946,0.001022314,0.0004943551,0.0001882663,7.889805e-7,0.00002210738,0.004961721],"genre_scores_gemma":[0.6894662,0.00004420847,0.3103109,0.0001069865,0.00004466836,0.000003941545,1.650844e-7,0.000003552157,0.00001944003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5901046,"threshold_uncertainty_score":0.2524975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004603859,0.0001974953,0.0003618286,0.0001474711,0.0001516953,0.0001768049,0.0006172148,0.0001203819,0.00001754773],"category_scores_gemma":[0.00003131308,0.0001450575,0.0001075469,0.0002491128,0.000056719,0.0003723255,0.0000701958,0.0003600208,0.00005743615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007763538,"about_ca_system_score_gemma":0.0000685243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001300334,"about_ca_topic_score_gemma":0.000002922325,"domain_scores_codex":[0.9986699,0.00003837612,0.0004195198,0.0002743941,0.0002825137,0.0003153086],"domain_scores_gemma":[0.998933,0.00006848036,0.0004538308,0.0002569682,0.0001129073,0.0001748097],"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.0002042605,0.0003640676,0.000519697,0.00003589172,0.00005970012,0.0001812452,0.001532788,0.0005813247,0.01939941,0.7594212,0.004386839,0.2133136],"study_design_scores_gemma":[0.003068658,0.00135219,0.05472903,0.00008601087,0.00007915632,0.001362359,0.0002660947,0.009683073,0.008209893,0.909238,0.01115737,0.0007681685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7022856,0.00262606,0.2577387,0.001600823,0.0008394718,0.0002634628,4.929296e-7,0.0001502176,0.03449516],"genre_scores_gemma":[0.9825247,0.0002886143,0.01523494,0.001544003,0.0003167347,0.000001492433,3.085574e-7,0.000006119296,0.00008311414],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2802391,"threshold_uncertainty_score":0.5915274,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762761,0.0001410986,0.0003131313,0.00009557672,0.0001297704,0.0001589925,0.0006837558,0.00005156995,0.000001403133],"category_scores_gemma":[0.00022007,0.0000996366,0.00003995984,0.0001475582,0.0000715217,0.0003751011,0.0002385422,0.0001669944,0.000003319907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008419908,"about_ca_system_score_gemma":0.0001598618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006803477,"about_ca_topic_score_gemma":0.00002710147,"domain_scores_codex":[0.9988471,0.00003887532,0.0004190156,0.000304842,0.0002040828,0.0001860722],"domain_scores_gemma":[0.9983719,0.0004763865,0.0005007482,0.0003541521,0.0001843729,0.0001124315],"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.000431913,0.0006596587,0.0006823666,0.0001396356,0.0005769355,0.0001260525,0.009563654,0.008196694,0.02018121,0.9170238,0.004445416,0.03797264],"study_design_scores_gemma":[0.02690477,0.003081311,0.0109527,0.001841115,0.0009503036,0.001538459,0.03563936,0.6217998,0.01588458,0.2570508,0.0213078,0.003048979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05927387,0.00117572,0.9374434,0.000325594,0.0006802361,0.0002946497,0.00004987022,0.00003503981,0.0007215699],"genre_scores_gemma":[0.9216743,0.00005311436,0.07778895,0.000134935,0.0002677045,0.000002539657,0.00006962181,0.000006028969,0.000002852964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8624004,"threshold_uncertainty_score":0.4063063,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001366644,0.00005228922,0.0001326526,0.00006358253,0.0003115611,0.00008129002,0.0001361085,0.00002680219,0.0000304719],"category_scores_gemma":[0.00007442119,0.00003167948,0.00002752873,0.00003695194,0.0002528801,0.00009602922,0.00003227679,0.0001693979,0.000004663545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001479893,"about_ca_system_score_gemma":0.00008374153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003608429,"about_ca_topic_score_gemma":0.000007819886,"domain_scores_codex":[0.9991291,0.00006700818,0.0003244132,0.00005516361,0.000311773,0.000112522],"domain_scores_gemma":[0.9988423,0.0003985543,0.0002321265,0.00007927436,0.0003757595,0.00007199267],"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.00009600622,0.00006702284,0.00001848168,0.0000220632,0.00001925573,0.00000512487,0.01771061,0.00001463239,0.0002979099,0.9463741,0.03329357,0.002081268],"study_design_scores_gemma":[0.0005051898,0.000530967,0.0000579526,0.00005366404,0.00002505788,0.0001185046,0.009747396,0.00001517094,0.0001987056,0.5531227,0.4355407,0.00008391587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4987063,0.01811074,0.0001087793,0.02356039,0.003027879,0.0005966133,0.000007522425,0.00002677158,0.455855],"genre_scores_gemma":[0.9985212,0.0001416107,0.0001824407,0.00006423645,0.0008970814,0.000004191225,8.699089e-7,0.000004203551,0.0001841844],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4998149,"threshold_uncertainty_score":0.2396307,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001920569,0.0003391982,0.0003464766,0.0001553091,0.0006876581,0.0007533401,0.001702327,0.0004502127,0.00005070908],"category_scores_gemma":[0.0004118782,0.0002742825,0.0004392461,0.0003391018,0.000252174,0.0007138932,0.0004514492,0.0008991191,0.0002071848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002634815,"about_ca_system_score_gemma":0.0003241831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005800751,"about_ca_topic_score_gemma":0.00005943243,"domain_scores_codex":[0.9971789,0.00004837266,0.0008020526,0.0004981789,0.0007383128,0.0007341732],"domain_scores_gemma":[0.9971601,0.0005777132,0.001058525,0.0008669545,0.0001444863,0.0001922557],"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.0001875151,0.0001003411,0.00001227293,0.00006149245,0.0001361278,0.0001175427,0.0005963254,0.0006308288,0.009578234,0.9824923,0.002014621,0.004072442],"study_design_scores_gemma":[0.001380106,0.0007210996,0.0007816603,0.0001493114,0.000277737,0.001546339,0.001075269,0.918686,0.008742984,0.0590437,0.007092597,0.0005031721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8865477,0.0006330186,0.1029203,0.001592326,0.002943447,0.0001474077,0.000007545858,0.0001592915,0.005048938],"genre_scores_gemma":[0.9384097,0.0001806537,0.05849263,0.001893278,0.0008259442,0.0000787727,0.000005969267,0.00004737352,0.00006563198],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9234486,"threshold_uncertainty_score":0.9999709,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006810413,0.0002008648,0.0004069717,0.0002046944,0.0002070055,0.0001427892,0.0007996757,0.0001328491,0.00002626601],"category_scores_gemma":[0.000149482,0.0001493992,0.0002804873,0.0003738837,0.00008102854,0.0001389104,0.00007638752,0.000267304,0.00003261731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007801726,"about_ca_system_score_gemma":0.0003271406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002366403,"about_ca_topic_score_gemma":0.000005342976,"domain_scores_codex":[0.9985622,0.00003679077,0.0005434701,0.0002548773,0.0002325206,0.0003701718],"domain_scores_gemma":[0.9979092,0.0008361997,0.0005264147,0.0003074041,0.00030301,0.0001177192],"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.00005170667,0.0002609714,0.0001394719,0.00004088812,0.00002216826,0.00002219089,0.0001674565,0.0006543369,0.0007541534,0.9863011,0.004370771,0.007214757],"study_design_scores_gemma":[0.00177975,0.0004670016,0.0007855666,0.0001365777,0.00007135122,0.00007606688,0.000108304,0.01348696,0.007355417,0.9276739,0.04761549,0.0004436534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003342981,0.001270101,0.9449874,0.0005018172,0.0006716496,0.0001958337,0.000001691689,0.0000746485,0.04895384],"genre_scores_gemma":[0.69927,0.000007283251,0.2996924,0.0003966649,0.0005281962,0.0000131878,9.292826e-7,0.00001065268,0.00008070535],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.695927,"threshold_uncertainty_score":0.6092322,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006093491,0.00006073701,0.0001178051,0.00005056179,0.00006184969,0.00001467041,0.00004729995,0.00005091346,0.0002236557],"category_scores_gemma":[0.00005374293,0.00004131534,0.00002077662,0.00005921273,0.0002017576,0.00008090568,0.0000151883,0.0001503078,0.00002271286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001432973,"about_ca_system_score_gemma":0.000005583944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003398771,"about_ca_topic_score_gemma":2.818704e-7,"domain_scores_codex":[0.9994183,0.00003510565,0.0001955442,0.00009027173,0.0001381211,0.0001226349],"domain_scores_gemma":[0.9994469,0.0001794771,0.000146281,0.00007499009,0.00003946554,0.0001128383],"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.000205306,0.00006837422,0.001415422,0.000003290211,0.00001183049,0.000001042082,0.0003974033,0.000001979115,0.001673625,0.9926631,0.00007969476,0.00347894],"study_design_scores_gemma":[0.0003021139,0.0001454057,0.2750117,0.000007277365,0.00001521815,0.00007583099,0.0003660212,0.000008489897,0.0002652,0.7234982,0.0002474691,0.0000571208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9568206,0.0001512897,0.001025776,0.001103685,0.0005022364,0.0000475607,0.000002590176,0.000006000119,0.04034023],"genre_scores_gemma":[0.9991057,0.00002231626,0.0002401425,0.0004026725,0.0002104462,0.000001511584,4.416744e-7,0.000002613886,0.00001416649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2735963,"threshold_uncertainty_score":0.2448873,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443372,0.00005324372,0.0001114272,0.0000613439,0.00007615532,0.0000136003,0.0003018797,0.00003265074,0.000009108775],"category_scores_gemma":[0.0000122008,0.00003261179,0.00006289314,0.0001975622,0.00001740151,0.0002317155,0.00003750469,0.00006295096,0.000004711628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000299615,"about_ca_system_score_gemma":0.00003968316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001519772,"about_ca_topic_score_gemma":7.608381e-7,"domain_scores_codex":[0.9991906,0.0000200297,0.0003617168,0.00006307256,0.0002930492,0.00007153493],"domain_scores_gemma":[0.9990345,0.00002014778,0.0006781816,0.0001415243,0.0001012265,0.00002441113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001962942,0.0007491422,0.02202361,0.0002119198,0.0001784483,0.00002313461,0.01564853,0.01508276,0.6194201,0.2935793,0.009952176,0.02293471],"study_design_scores_gemma":[0.006939886,0.0006759246,0.4178146,0.0002159659,0.00007074329,0.0007127174,0.0007529451,0.1098263,0.4357189,0.0184273,0.008212551,0.0006321667],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5950014,0.00007877603,0.4023921,0.0002676893,0.0004003928,0.0001627189,3.835949e-7,0.000009797249,0.00168673],"genre_scores_gemma":[0.9865068,0.00003582451,0.01323725,0.0001227968,0.00005236565,0.000001505687,4.409785e-7,0.000002385562,0.00004062446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.395791,"threshold_uncertainty_score":0.132987,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765291,0.00008692386,0.0002969243,0.0003982219,0.00007365255,0.00002340749,0.0007234286,0.00006229289,0.00002775112],"category_scores_gemma":[0.0001299568,0.00006876467,0.0001628098,0.0009603113,0.00008923694,0.0006111819,0.0001104089,0.0001723188,0.000001191543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008547391,"about_ca_system_score_gemma":0.00009844821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000035145,"about_ca_topic_score_gemma":2.29497e-7,"domain_scores_codex":[0.9985691,0.00007856643,0.0006472568,0.0001386067,0.0004072695,0.0001591999],"domain_scores_gemma":[0.9981744,0.00009345081,0.001005683,0.0003173121,0.000354061,0.0000550809],"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.00002182953,0.0002152692,0.001508801,0.00002233703,0.000175815,0.000002450285,0.001572433,0.006087349,0.005472072,0.9590759,0.000002998194,0.02584277],"study_design_scores_gemma":[0.0007362804,0.0003972885,0.2088252,0.00002688329,0.0005579912,0.00005455716,0.0002866391,0.4385123,0.03151024,0.3187605,0.00003420964,0.0002978613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2491165,0.00001169217,0.7438259,0.000009850392,0.0001230823,0.00007328233,7.292389e-7,0.00001033752,0.006828569],"genre_scores_gemma":[0.6298565,0.000001556278,0.3700962,0.00002784885,0.00001338786,8.689581e-7,2.884968e-7,0.000002177108,0.000001221683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6403154,"threshold_uncertainty_score":0.2804142,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001591872,0.0001390484,0.0002464816,0.0001870571,0.00006914206,0.00006122953,0.0007910937,0.0000972094,0.0001502555],"category_scores_gemma":[0.0001351272,0.0001041224,0.00006621458,0.0003903313,0.0001526639,0.0005095723,0.0001057872,0.0003482092,0.00002170261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000117377,"about_ca_system_score_gemma":0.0001313791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003206016,"about_ca_topic_score_gemma":0.000001076091,"domain_scores_codex":[0.998517,0.0001050899,0.0005598796,0.0002095281,0.0003590184,0.0002494449],"domain_scores_gemma":[0.9988264,0.0001006067,0.0005420966,0.0002782105,0.0001836357,0.00006906223],"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.00006781166,0.0001152529,0.0001814604,0.00001650039,0.000009740918,0.00001360219,0.001278485,0.0001742367,0.0004945505,0.9935147,0.00006776497,0.004065924],"study_design_scores_gemma":[0.0004960442,0.0002495394,0.01958438,0.00003866343,0.000006504593,0.00007944484,0.0001651264,0.001720344,0.002027263,0.9747453,0.0007251721,0.0001622359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07499764,0.0002508696,0.6926169,0.0005758643,0.001124923,0.0007009855,0.00000290878,0.0001187685,0.2296111],"genre_scores_gemma":[0.4755204,0.000008052639,0.5240535,0.0002743723,0.00007401847,0.00001729881,5.126747e-7,0.000004865795,0.00004699988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4005228,"threshold_uncertainty_score":0.4245988,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001111475,0.0001181462,0.0005936346,0.0005065923,0.0001241495,0.00003054572,0.0002419354,0.00009832047,0.00001442906],"category_scores_gemma":[0.00009324999,0.0001064891,0.0003524447,0.0005531554,0.000109595,0.0002127938,0.00001614408,0.0001561134,1.859367e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001204633,"about_ca_system_score_gemma":0.000055389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001035946,"about_ca_topic_score_gemma":0.00005703925,"domain_scores_codex":[0.9988509,0.00001874019,0.0006092465,0.0001208262,0.0002264689,0.0001737586],"domain_scores_gemma":[0.9981727,0.0002961448,0.0007799516,0.0004431767,0.0002396617,0.00006836382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000969952,0.00006448269,0.01622112,0.000146971,0.002433619,8.509154e-8,0.000142528,0.9694152,0.003194857,0.00184276,0.000004929228,0.006436391],"study_design_scores_gemma":[0.0004673326,0.0001107082,0.3210485,0.000003375856,0.004679522,3.454523e-7,0.00003211732,0.6608984,0.01112889,0.001490871,0.00004733992,0.00009261668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8084372,0.00005491918,0.1907806,0.00004298565,0.00001977132,0.0002773197,0.00003972821,0.00001026493,0.0003371947],"genre_scores_gemma":[0.9928741,0.00001337813,0.007027498,0.000006981406,0.00002465015,0.00002827388,0.00001549484,0.000008468925,0.000001166852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3085169,"threshold_uncertainty_score":0.4342498,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00112532,0.00009753224,0.0003743125,0.0003697064,0.00004211107,0.00008422169,0.0005257252,0.00004467481,0.000009654378],"category_scores_gemma":[0.00005123626,0.00006647763,0.0002109819,0.001133331,0.00005790596,0.0002425764,0.0001015273,0.0001758895,0.000001028825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003804262,"about_ca_system_score_gemma":0.00003481241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001551835,"about_ca_topic_score_gemma":1.668468e-7,"domain_scores_codex":[0.9987864,0.00002146383,0.0005096193,0.0001372105,0.0003388437,0.0002064239],"domain_scores_gemma":[0.998765,0.0002358663,0.0006185444,0.0001889443,0.00008858593,0.0001030807],"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.0001568185,0.0004119476,0.001595721,0.00003014907,0.001173421,0.0002002144,0.001251056,0.01829926,0.06701049,0.07884857,0.00003063272,0.8309917],"study_design_scores_gemma":[0.002651033,0.001753966,0.02398401,0.0001305526,0.002111155,0.0003572035,0.002866095,0.5940418,0.05601977,0.31295,0.001602327,0.001532191],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1007467,0.00002599028,0.8969351,0.00005083385,0.0001097209,0.00004299893,0.000001224355,0.000009458849,0.002077965],"genre_scores_gemma":[0.6016838,0.000001204167,0.3981892,0.00006855401,0.00004988985,1.212832e-7,1.535278e-7,0.000002951553,0.000004087977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8294595,"threshold_uncertainty_score":0.2710879,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439689,0.0001210558,0.000182195,0.0001691553,0.00007890271,0.0001920502,0.001825389,0.00002537778,0.0000180021],"category_scores_gemma":[0.000006966162,0.00008195492,0.00003101298,0.0003568215,0.00003742716,0.0003637674,0.0004882437,0.0001416543,0.00002670058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002311987,"about_ca_system_score_gemma":0.00004463541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001726155,"about_ca_topic_score_gemma":0.000008076473,"domain_scores_codex":[0.9987832,0.00001399,0.0002886434,0.0002470574,0.0004534637,0.0002136771],"domain_scores_gemma":[0.998769,0.00003286126,0.000382621,0.0006712014,0.00005541727,0.00008893666],"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.0003558917,0.00108116,0.002613745,0.0000676428,0.0004155095,0.0006543153,0.00233575,0.1011709,0.0003199384,0.2191415,0.08210574,0.5897378],"study_design_scores_gemma":[0.004027626,0.0008541378,0.004182194,0.0001039008,0.0001481783,0.0003009323,0.000757147,0.8061287,0.0005573388,0.004503033,0.1775023,0.0009345109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1175533,0.000223239,0.8672445,0.003261123,0.0003341975,0.0002201617,0.000008550866,0.00008089838,0.01107404],"genre_scores_gemma":[0.5640386,0.00001022623,0.435376,0.0003568664,0.0001563077,8.052218e-7,0.000009854129,0.000005346859,0.0000459757],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7049577,"threshold_uncertainty_score":0.3392057,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002643763,0.0001839263,0.0003085998,0.00008645642,0.0004236487,0.0003200787,0.001071578,0.0001050704,0.00001845155],"category_scores_gemma":[0.0004479644,0.00009904758,0.0001855489,0.000220632,0.0001252833,0.000217414,0.0001124288,0.0002902972,0.0001018622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025384,"about_ca_system_score_gemma":0.0001900752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001772267,"about_ca_topic_score_gemma":0.000004628481,"domain_scores_codex":[0.998476,0.0001699013,0.0004672396,0.0002389554,0.0002910018,0.0003569014],"domain_scores_gemma":[0.9974998,0.001238781,0.0004890349,0.0003255912,0.0003169845,0.0001298351],"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.00009167667,0.00005851771,0.000007440322,0.000007407901,0.00003005181,0.000006584292,0.000588345,0.00008998754,0.0006595801,0.952414,0.0007934816,0.04525295],"study_design_scores_gemma":[0.0007047841,0.0005741009,0.0002298199,0.000003855292,0.00003003829,0.0001807746,0.0001679721,0.004585698,0.0006571259,0.973023,0.01968819,0.0001546645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005047798,0.0004259617,0.9655229,0.00114567,0.000774773,0.00027973,1.329426e-7,0.00004322872,0.02675978],"genre_scores_gemma":[0.9901298,0.00007396295,0.008134703,0.0007478622,0.0005241555,0.0000286864,9.553817e-7,0.00001022256,0.000349649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.985082,"threshold_uncertainty_score":0.4039043,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427118,0.000070551,0.0001163683,0.0001039774,0.00004292915,0.00009950564,0.0005140431,0.0000495103,0.000002043492],"category_scores_gemma":[0.0001287794,0.00004203837,0.00003053876,0.0004230506,0.00001983355,0.0002804593,0.00003644757,0.0001592727,0.00004699652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009755579,"about_ca_system_score_gemma":0.0001306382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005186394,"about_ca_topic_score_gemma":0.000009108546,"domain_scores_codex":[0.9991297,0.00006058865,0.0002782112,0.00009364954,0.0003227423,0.0001151317],"domain_scores_gemma":[0.9992384,0.00007657595,0.0002799752,0.0001652674,0.0001890275,0.00005069536],"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.00005444142,0.0002953811,0.0002160377,0.00001484596,0.00001345655,0.00003366656,0.0162214,0.1621741,0.0007231674,0.7232797,0.002987036,0.09398675],"study_design_scores_gemma":[0.002016402,0.000517001,0.02048958,0.00003910015,0.00002872887,0.0002721435,0.001344278,0.5349807,0.00117603,0.4373876,0.001477314,0.0002711144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0146133,0.0001514165,0.9704286,0.001018875,0.0002392944,0.0001134829,4.063126e-8,0.00001515762,0.01341984],"genre_scores_gemma":[0.9771792,0.000005947895,0.02238561,0.0003021012,0.0001058297,0.000004127971,8.137262e-7,0.000002256701,0.00001409105],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9625659,"threshold_uncertainty_score":0.1714275,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195147,0.0001516578,0.0003421094,0.000198325,0.0001087874,0.0000874383,0.0007675958,0.00009669449,0.00004228121],"category_scores_gemma":[0.00002077863,0.0001086111,0.0001462998,0.0002645341,0.00002391283,0.0003976162,0.00004209634,0.0001326479,0.00001996521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006452956,"about_ca_system_score_gemma":0.00008265621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002544365,"about_ca_topic_score_gemma":0.000007111831,"domain_scores_codex":[0.9985467,0.00004046458,0.0006179757,0.0002358335,0.0002951655,0.000263851],"domain_scores_gemma":[0.998505,0.00004775648,0.0007299407,0.0003551587,0.000188407,0.0001737288],"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.0004099202,0.001387793,0.0008594649,0.0001494227,0.0002136907,0.0001175544,0.005180194,0.002095916,0.04303924,0.9271541,0.004266769,0.01512597],"study_design_scores_gemma":[0.01180278,0.008437376,0.02796831,0.0002175462,0.0004327823,0.0005961715,0.001785962,0.3693463,0.04212005,0.5220146,0.01289337,0.002384754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02620551,0.00009836273,0.9683805,0.0002267187,0.0004718057,0.000414013,0.000002517138,0.00005108254,0.004149453],"genre_scores_gemma":[0.9212613,0.000008329514,0.07800744,0.0004519154,0.0002047696,0.00001177601,0.000001794592,0.000009065316,0.0000436015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8950558,"threshold_uncertainty_score":0.4429033,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000384231,0.0001506309,0.0002878839,0.00007712171,0.00009487253,0.00004757496,0.0006759109,0.00004341719,0.00003259191],"category_scores_gemma":[0.0001139396,0.00008597624,0.00005502084,0.0006474534,0.00004569634,0.0003817462,0.00009639528,0.0003722692,0.00001463971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004499508,"about_ca_system_score_gemma":0.00008814716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001682626,"about_ca_topic_score_gemma":0.00005975185,"domain_scores_codex":[0.9986905,0.00005802893,0.0004721597,0.0002145364,0.0003074018,0.0002573747],"domain_scores_gemma":[0.9987128,0.0003318569,0.0003668407,0.000439488,0.00007584216,0.00007318787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003217709,0.000390791,0.0007597861,0.000009620161,0.00006998965,0.0006044892,0.001625445,0.006378308,0.03033608,0.8409928,0.02042671,0.09808423],"study_design_scores_gemma":[0.007555335,0.001185929,0.1605501,0.0008247663,0.0001095695,0.0009530541,0.005074426,0.004365847,0.008885195,0.1836109,0.6245696,0.002315207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05909048,0.003894641,0.9146399,0.01015559,0.0007810531,0.0004968569,0.00004310621,0.000128777,0.01076957],"genre_scores_gemma":[0.848343,0.000310536,0.1473029,0.003621503,0.0003597669,0.000003900128,0.00001334616,0.000006905272,0.00003809646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7892525,"threshold_uncertainty_score":0.350601,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003753555,0.00007377654,0.0002311785,0.00006913429,0.00005826388,0.00002046372,0.0006611968,0.00005497505,0.000008738641],"category_scores_gemma":[0.00002344832,0.00004194087,0.0001297087,0.0003273894,0.0001274153,0.00008080514,0.00008890413,0.000148154,0.000004889226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003286747,"about_ca_system_score_gemma":0.0001749093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001807221,"about_ca_topic_score_gemma":0.000003754595,"domain_scores_codex":[0.9990263,0.00002624855,0.0004453957,0.00009051341,0.0002866084,0.0001249451],"domain_scores_gemma":[0.9988242,0.00003468633,0.0006839078,0.0002706329,0.0001399291,0.00004666817],"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.000007570563,0.00007997963,0.0001388664,0.00001601665,0.00003272965,0.000007260317,0.0004106761,0.0007755837,0.003532176,0.9909601,0.00004969438,0.00398941],"study_design_scores_gemma":[0.002834121,0.0005679967,0.01028867,0.00004306097,0.00008772683,0.001457876,0.0006902933,0.000314699,0.03082936,0.9496066,0.0030246,0.0002550069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08878034,0.000266347,0.873767,0.0006398516,0.001956318,0.0003074031,0.00000139301,0.00002534694,0.03425604],"genre_scores_gemma":[0.9930649,0.000007236683,0.006770018,0.00006204486,0.00007453693,0.000001151458,5.431535e-8,0.000002831094,0.00001724928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9042845,"threshold_uncertainty_score":0.1710299,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221599,0.00005728179,0.0001093212,0.00006931475,0.00005440809,0.00005049903,0.0002038187,0.00003686995,0.00008441447],"category_scores_gemma":[0.00003558926,0.00004445313,0.00005147129,0.00015692,0.0000202361,0.0003759448,0.00004023685,0.0001392937,0.00002506756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000437993,"about_ca_system_score_gemma":0.00003776365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.983573e-7,"about_ca_topic_score_gemma":3.163156e-7,"domain_scores_codex":[0.9993492,0.00001938669,0.0002434881,0.00006763621,0.0001785463,0.000141778],"domain_scores_gemma":[0.999401,0.00004273711,0.0002465201,0.0001383813,0.00006822274,0.0001031454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003729479,0.0001586487,0.01354756,0.00001162973,0.00003274014,0.000006264828,0.001501315,0.003368871,0.002283248,0.7053775,0.001106343,0.2725686],"study_design_scores_gemma":[0.003104574,0.0003624104,0.8395776,0.00009419049,0.00007579924,0.001117764,0.0007577214,0.03457801,0.008023645,0.08258309,0.0287667,0.0009585689],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03168842,0.0001107869,0.9393176,0.0002881344,0.0004846897,0.0000513766,1.673877e-7,0.00003202482,0.02802678],"genre_scores_gemma":[0.8639013,0.00001540467,0.1356432,0.000293125,0.0001308688,5.223587e-7,1.319881e-7,0.000001964956,0.00001349813],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8322129,"threshold_uncertainty_score":0.1812746,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00214617,0.0001013625,0.0001970055,0.00004621987,0.00009350816,0.00002219137,0.0009260933,0.00005861772,0.000002432358],"category_scores_gemma":[0.0007404754,0.00005083475,0.0001035205,0.0003264841,0.00006487484,0.000238522,0.0002966496,0.0003700248,0.000001867088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005473043,"about_ca_system_score_gemma":0.00003620558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000106163,"about_ca_topic_score_gemma":6.998911e-8,"domain_scores_codex":[0.9989734,0.00012453,0.0003261131,0.00008573399,0.0002827951,0.0002073715],"domain_scores_gemma":[0.9981151,0.0007453103,0.0006029365,0.0004048899,0.00009020315,0.00004158799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004214024,0.0001021717,0.000497449,0.0000750227,0.00008443068,0.000002677119,0.002927754,0.4222474,0.09331315,0.05865816,0.0006696722,0.42138],"study_design_scores_gemma":[0.001375053,0.00035396,0.01844318,0.0001411017,0.0002840147,0.002139435,0.002246535,0.007162812,0.6021176,0.3581655,0.006683222,0.0008875584],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003020396,0.0002039969,0.9950638,0.0003200677,0.001170302,0.0001224004,3.057597e-7,0.00003841817,0.00006030052],"genre_scores_gemma":[0.2407316,0.00001211811,0.758998,0.00007013098,0.0001691908,0.000002575464,3.119975e-8,0.000006300939,0.00001005092],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5088044,"threshold_uncertainty_score":0.2072981,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004850173,0.00005414084,0.000131437,0.0001542297,0.00004382955,0.00004710201,0.0005182206,0.00002604031,0.000003031131],"category_scores_gemma":[0.00001297767,0.00004180958,0.00003702016,0.0004457873,0.00003858882,0.000397942,0.00003781604,0.00006656705,0.000004882778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001595125,"about_ca_system_score_gemma":0.00005561804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000510067,"about_ca_topic_score_gemma":0.000001541597,"domain_scores_codex":[0.9991649,0.00001761544,0.0002984983,0.0001023329,0.0003016925,0.0001149583],"domain_scores_gemma":[0.9992203,0.00003589959,0.0003613167,0.0001417577,0.0002049354,0.00003586838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002263542,0.0001458362,0.0004519246,0.00001390264,0.000005979735,0.0000165461,0.0003240935,0.002761409,0.6429072,0.3162977,0.0007041428,0.03634871],"study_design_scores_gemma":[0.001450333,0.000873865,0.1494974,0.0001130563,0.00002060411,0.00009203781,0.0007297838,0.03092102,0.1203019,0.6935352,0.002055174,0.0004096453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2798445,0.00005658588,0.6994116,0.0001338283,0.0001101255,0.00004869721,3.160574e-7,0.00001363405,0.02038065],"genre_scores_gemma":[0.9674163,0.00001045415,0.03229539,0.0001718607,0.00009292726,6.578645e-7,3.290649e-7,0.000001804892,0.00001024954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6875718,"threshold_uncertainty_score":0.1704945,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009702859,0.0000480064,0.00014914,0.00002669849,0.00007138801,0.000008908349,0.0001391195,0.0000402536,0.0001989503],"category_scores_gemma":[0.00002704483,0.0000239966,0.00004851415,0.00009954376,0.0006193223,0.00005030718,0.00002704035,0.0001634895,0.00001371782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006160182,"about_ca_system_score_gemma":0.00001221659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002268758,"about_ca_topic_score_gemma":6.687702e-8,"domain_scores_codex":[0.9994372,0.00004497248,0.0002036873,0.0000471506,0.0001323686,0.000134596],"domain_scores_gemma":[0.9994489,0.0001243302,0.0001884881,0.00009540367,0.00003388357,0.000108976],"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.000542268,0.0001242646,0.00008117322,0.000003148564,0.00002314492,0.000001140331,0.0009135219,0.00000289079,0.001250369,0.9966679,0.00006414946,0.0003260674],"study_design_scores_gemma":[0.001740258,0.0001041383,0.004038869,0.00000671614,0.00005630722,0.00008737719,0.0003030524,0.000004328863,0.001027832,0.9920928,0.000487078,0.00005119374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4872341,0.0006328878,0.001952443,0.002776599,0.0002808292,0.0001501608,0.000001284677,0.000005068512,0.5069667],"genre_scores_gemma":[0.9988391,0.000007769671,0.0005212561,0.0004130429,0.0002009659,0.000002249926,8.146571e-8,0.000002135533,0.0000133541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.511605,"threshold_uncertainty_score":0.2281919,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002611953,0.00005428886,0.0001189003,0.00004094985,0.00003148259,0.00001810802,0.0002513509,0.0000515956,0.006576259],"category_scores_gemma":[0.00001593379,0.00003389947,0.00005366489,0.0001090145,0.0001252926,0.00005082238,0.00002024382,0.0001810489,0.001936365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001112143,"about_ca_system_score_gemma":0.000008689185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001971349,"about_ca_topic_score_gemma":5.293793e-8,"domain_scores_codex":[0.9994044,0.00001809436,0.0002041324,0.00007381046,0.0001406401,0.0001589647],"domain_scores_gemma":[0.9995328,0.00007453149,0.0001361106,0.000104358,0.00004149231,0.0001106924],"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.00002824379,0.00006439878,0.00002095664,8.207194e-7,0.00001085082,0.00001252653,0.0001605559,0.00000360191,0.002325077,0.9877678,0.002154479,0.007450688],"study_design_scores_gemma":[0.0002347981,0.0001219006,0.003978205,0.000002337882,0.000006454191,0.0000549807,0.0001185242,0.000003364717,0.0002596985,0.9925361,0.002634464,0.00004913957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1258012,0.00005308692,0.000663344,0.001451959,0.0003401711,0.00005535387,2.384895e-7,0.000007684952,0.871627],"genre_scores_gemma":[0.9974896,0.000002808625,0.0007218854,0.001360435,0.0002736507,0.000003365057,6.607861e-8,0.000003089967,0.0001450808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8716884,"threshold_uncertainty_score":0.9988407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201866,0.0001081698,0.000201078,0.0001018769,0.000101404,0.00008279733,0.000633301,0.00006503934,0.00001259052],"category_scores_gemma":[0.00006394853,0.00008170193,0.00005254892,0.0002283076,0.00002423673,0.0001653386,0.000141752,0.0002546016,0.00006940566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001409845,"about_ca_system_score_gemma":0.0001648009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003815819,"about_ca_topic_score_gemma":0.000001028499,"domain_scores_codex":[0.9989092,0.00003735393,0.0003066999,0.0001427142,0.0003718715,0.0002321042],"domain_scores_gemma":[0.9989825,0.0001119291,0.0003655355,0.0002108875,0.0001172389,0.0002119228],"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.0007013779,0.0002478855,0.006096651,0.00007695804,0.0002206648,0.001621309,0.01587019,0.2664979,0.009593346,0.4133016,0.2159309,0.06984127],"study_design_scores_gemma":[0.009734027,0.004306874,0.002469884,0.0007754139,0.000165732,0.004879359,0.002471152,0.180524,0.01879598,0.468217,0.3051041,0.002556463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381561,0.001773492,0.6966462,0.003873559,0.001525526,0.0001979711,0.000001499537,0.0002224945,0.1576032],"genre_scores_gemma":[0.8473355,0.000006181755,0.151694,0.0005625373,0.0001856634,0.000001218732,7.098241e-7,0.000006522486,0.0002076495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7091795,"threshold_uncertainty_score":0.3331708,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313891,0.00009586599,0.0001986016,0.00009522307,0.00007753039,0.0001103944,0.0003860508,0.00005033722,0.00001220762],"category_scores_gemma":[0.00002475206,0.00005341081,0.00005261131,0.0001197597,0.00004475152,0.0002320186,0.0001217401,0.0001152899,0.00003110454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003199447,"about_ca_system_score_gemma":0.00003818686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002067607,"about_ca_topic_score_gemma":4.554103e-7,"domain_scores_codex":[0.9991437,0.00002359064,0.0002853632,0.0001537941,0.0001830104,0.0002105879],"domain_scores_gemma":[0.9992831,0.00006687231,0.0003128464,0.0001711467,0.00006486779,0.0001011107],"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.00001777591,0.00003591704,0.0005703035,0.00002086441,0.00002935399,0.00003869661,0.0004631109,0.000006312436,0.01006712,0.5669705,0.000998687,0.4207814],"study_design_scores_gemma":[0.006366146,0.001329018,0.01851985,0.0001710648,0.0000827021,0.002560954,0.0005253253,0.002653589,0.009880542,0.760399,0.1961144,0.001397347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02616338,0.0006560493,0.9551725,0.0008937441,0.0005305401,0.00010581,1.430117e-7,0.00005488937,0.01642295],"genre_scores_gemma":[0.9943287,0.00006288037,0.004985715,0.0001914222,0.0003097787,0.00000164599,4.185272e-8,0.000005251143,0.0001145791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9681653,"threshold_uncertainty_score":0.217803,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609683,0.0001286653,0.0001873922,0.0001015665,0.0001907355,0.000171593,0.000770084,0.00006632662,0.000004637668],"category_scores_gemma":[0.0001306593,0.0000689689,0.00009889009,0.0002598781,0.00004744457,0.0001688505,0.0001092003,0.0003701572,0.0000724507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00013384,"about_ca_system_score_gemma":0.0001296699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002749166,"about_ca_topic_score_gemma":0.000001348719,"domain_scores_codex":[0.9988509,0.00008328571,0.0003086897,0.000168082,0.0003579025,0.0002311217],"domain_scores_gemma":[0.9988768,0.0001317975,0.0004286807,0.0002754303,0.0001712148,0.0001160527],"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.00009980481,0.000103838,0.00002951024,0.000006097221,0.0000331874,0.00003266742,0.006865984,0.00326993,0.00455899,0.9304551,0.005285498,0.04925937],"study_design_scores_gemma":[0.001647095,0.001012401,0.0003441942,0.00007348164,0.00005141295,0.000963832,0.001693818,0.01014413,0.01438302,0.9396793,0.02955811,0.0004491539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1685386,0.0007333896,0.4394941,0.002750116,0.003045061,0.0002515672,3.153016e-7,0.0001367251,0.3850501],"genre_scores_gemma":[0.9670548,0.00002304751,0.03097596,0.0008128444,0.001041731,0.000002763585,1.817666e-7,0.000008017983,0.00008062883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7985162,"threshold_uncertainty_score":0.281247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}