{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":27,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":27,"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":"21dc33dc3221","filters":{"venue":"Journal of Logic and Computation"}},"results":[{"id":"W2143957355","doi":"10.1093/logcom/exp067","title":"Relevance Realization and the Emerging Framework in Cognitive Science","year":2009,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Relevance (law); Queen (butterfly); Library science; Realization (probability); Cognition; Cognitive science; Computer science; Psychology; Political science; Mathematics; Neuroscience; Law","authors":[{"name":"John Vervaeke","is_ca":true},{"name":"Timothy Lillicrap","is_ca":true},{"name":"B. A. Richards","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02545338799857284,"gpt":0.3252811231413684,"spread":0.2998277351427955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00361763,0.000323116,0.0005437528,0.002731123,0.002011759,0.007793821,0.0008008739,0.001460243,0.008130637],"category_scores_gemma":[0.01251101,0.0002726426,0.0007556828,0.002350634,0.01302341,0.01315014,0.003392973,0.002977158,0.0009179264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003572439,"about_ca_system_score_gemma":0.002442621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002130024,"about_ca_topic_score_gemma":0.002203868,"domain_scores_codex":[0.9969205,0.001249488,0.000233508,0.0006035125,0.0008257098,0.0001673746],"domain_scores_gemma":[0.9937657,0.003635792,0.0004683761,0.000716186,0.0009572224,0.0004566659],"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.00002053769,0.000008658973,0.000287985,0.00006598178,0.000008087245,0.00005044883,0.0006127894,0.000297432,0.0001821065,0.9854896,0.001743329,0.01123295],"study_design_scores_gemma":[0.000004952672,0.000005531146,0.0002156921,0.00002659139,0.000003872622,0.00005233517,0.0001242051,0.0005306767,0.00005199787,0.9930648,0.005913917,0.000005401369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09810564,0.0287144,0.3313723,0.07216232,0.001779031,0.0001474343,0.0006005577,0.0006042804,0.4665141],"genre_scores_gemma":[0.9339126,0.004940762,0.04933497,0.001097187,0.0009166532,0.0000864659,0.000344668,0.0001043682,0.00926233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008130637,"threshold_uncertainty_score":0.02719969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034691511","doi":"10.1093/logcom/exn077","title":"Collaborative Runtime Verification with Tracematches","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Runtime verification; Computer science; Software deployment; Overhead (engineering); Benchmark (surveying); Instrumentation (computer programming); Distributed computing; Runtime system; Static analysis; Embedded system; Formal verification; Operating system; Programming language","authors":[{"name":"Eric Bodden","is_ca":true},{"name":"Laurie Hendren","is_ca":true},{"name":"Patrick Lam","is_ca":true},{"name":"Ondřej Lhoták","is_ca":true},{"name":"Nomair A. Naeem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02414460448001329,"gpt":0.26188223757,"spread":0.2377376330899867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01937854,0.001582658,0.001436559,0.001466007,0.001035748,0.003674577,0.004616581,0.001944145,0.004129495],"category_scores_gemma":[0.06793906,0.001539093,0.002279887,0.0009958963,0.003575779,0.008705227,0.006488945,0.003010226,0.001019484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001885765,"about_ca_system_score_gemma":0.003713897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002957523,"about_ca_topic_score_gemma":0.003266347,"domain_scores_codex":[0.9723276,0.01313211,0.002120666,0.004336921,0.006701792,0.001380751],"domain_scores_gemma":[0.9054409,0.04504282,0.005981876,0.03863712,0.00398006,0.0009173145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002042426,0.000946586,0.01334622,0.0007600271,0.0005451859,0.001218159,0.001896399,0.318896,0.05112323,0.1680655,0.006951601,0.4342086],"study_design_scores_gemma":[0.0003414405,0.0003625517,0.000748358,0.00009840174,0.0001203593,0.0003766539,0.0001835122,0.7836748,0.08886275,0.1150255,0.01009144,0.0001142109],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01430643,0.00004265395,0.97458,0.0001533771,0.00002275758,0.0001063864,0.00007141938,0.009906828,0.0008101317],"genre_scores_gemma":[0.4705643,0.00009719883,0.5230229,0.0002839432,0.00005518709,0.0004471367,0.0004656202,0.002721948,0.002341617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01937854,"threshold_uncertainty_score":0.1024847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253372947","doi":"10.1093/logcom/13.1.3","title":"Controlled Revision - An algorithmic approach for belief revision","year":2003,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Belief revision; Library science; Operations research; Artificial intelligence; Mathematics","authors":[{"name":"Michael Gabbay","is_ca":false},{"name":"G. Pigozzi","is_ca":false},{"name":"John Woods","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02937672585649816,"gpt":0.2915116737347467,"spread":0.2621349478782486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0136253,0.001436117,0.001923045,0.002884113,0.00189827,0.006810153,0.004946152,0.002336157,0.009506044],"category_scores_gemma":[0.03589747,0.0008399095,0.003333683,0.002292755,0.006395392,0.006980656,0.004724975,0.004135537,0.001218143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002852278,"about_ca_system_score_gemma":0.003391034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002839869,"about_ca_topic_score_gemma":0.004107133,"domain_scores_codex":[0.9865204,0.007714651,0.0007996047,0.001638421,0.002804628,0.000522376],"domain_scores_gemma":[0.9734706,0.01897545,0.001151388,0.00347904,0.002391188,0.000532445],"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.0000603702,0.00003227935,0.000223108,0.0001760445,0.0001021894,0.00008171391,0.0003627363,0.01419848,0.000300778,0.9530594,0.001717831,0.02968508],"study_design_scores_gemma":[0.00006657843,0.00004406345,0.00005373545,0.00005001435,0.00003811017,0.00005107492,0.00005206858,0.06357712,0.0002984985,0.9315894,0.004153207,0.00002623046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003226007,0.0007994525,0.9846606,0.001293103,0.0001708646,0.0001868657,0.0000907482,0.0002751551,0.009297237],"genre_scores_gemma":[0.3149956,0.0012035,0.669252,0.0006101002,0.0007397103,0.0009566667,0.0003189689,0.0001758924,0.01174751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0136253,"threshold_uncertainty_score":0.07205838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111795230","doi":"10.1093/logcom/exs025","title":"The enriched effect calculus: syntax and semantics","year":2012,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Engineering and Physical Sciences Research Council","keywords":"Syntax; Semantics (computer science); Library science; Computer science; Artificial intelligence; Programming language","authors":[{"name":"Jan Egger","is_ca":true},{"name":"Rasmus Ejlers Møgelberg","is_ca":false},{"name":"Andrew Simpson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01821009552509499,"gpt":0.2705068069005783,"spread":0.2522967113754833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932557,0.0006950983,0.0008960655,0.002027484,0.001605227,0.003577787,0.00205408,0.001345014,0.004485829],"category_scores_gemma":[0.002719089,0.0008343951,0.001931642,0.001970873,0.005370892,0.006711593,0.003779356,0.003341449,0.001092648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001673378,"about_ca_system_score_gemma":0.002187506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003946233,"about_ca_topic_score_gemma":0.00214476,"domain_scores_codex":[0.9978885,0.0004466409,0.0002017594,0.0003391275,0.000835152,0.0002887934],"domain_scores_gemma":[0.9987029,0.0005116147,0.0001162618,0.0002394404,0.0003300725,0.00009969792],"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.00001391952,0.000009139638,0.00008849621,0.00005013463,0.000007916919,0.00008262903,0.0002284352,0.0008640936,0.0006602175,0.9925305,0.0005895139,0.00487495],"study_design_scores_gemma":[0.00002941417,0.00002618537,0.0002059397,0.00005936972,0.0000440824,0.0003225963,0.0001147436,0.008980948,0.001944096,0.9296563,0.05857519,0.00004117981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01119197,0.001157481,0.9640685,0.001058711,0.0002907658,0.0001109041,0.000526321,0.001347108,0.02024824],"genre_scores_gemma":[0.4520256,0.002761771,0.5206194,0.001221403,0.0005891201,0.0005886088,0.0009496657,0.001009908,0.02023452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004485829,"threshold_uncertainty_score":0.01550907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2468564096","doi":"10.1093/logcom/exv031","title":"A modal separation logic for resource dynamics","year":2015,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Separation logic; Computer science; Modal logic; Modal; Dynamic logic (digital electronics); Resource (disambiguation); Epistemic modal logic; Theoretical computer science; Algorithm; Multimodal logic; Description logic; Engineering","authors":[{"name":"Jean-René Courtault","is_ca":true},{"name":"Didier Galmiche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04541417762651414,"gpt":0.3191010226363972,"spread":0.2736868450098831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941621,0.000730785,0.000499278,0.00123743,0.001778879,0.002862503,0.001341407,0.001200555,0.005271646],"category_scores_gemma":[0.002866915,0.0004520913,0.001278746,0.00141131,0.0026325,0.006612677,0.002843283,0.003353184,0.0007339393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002405802,"about_ca_system_score_gemma":0.002140579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00362665,"about_ca_topic_score_gemma":0.003060464,"domain_scores_codex":[0.9984798,0.0003362982,0.0001400758,0.0003322529,0.0005182798,0.0001933469],"domain_scores_gemma":[0.9987555,0.0006327893,0.0001085397,0.0001110493,0.0002817929,0.0001103282],"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.00005834732,0.0000310732,0.00009573355,0.00009717346,0.00001375613,0.0001210573,0.000254839,0.004205274,0.004249108,0.9678541,0.001569725,0.02144981],"study_design_scores_gemma":[0.00005998629,0.00004931994,0.00009897172,0.00005381466,0.00005250281,0.0002176214,0.000133723,0.06654484,0.006297898,0.8984457,0.02800282,0.00004275668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007699825,0.0004323171,0.9779984,0.0009444866,0.0001446606,0.00008496979,0.000223355,0.000615133,0.01185683],"genre_scores_gemma":[0.3325461,0.0007715883,0.6499825,0.001356486,0.0002833672,0.0003475818,0.0005051573,0.0002084365,0.01399875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005271646,"threshold_uncertainty_score":0.01763541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017468133","doi":"10.1093/logcom/exm046","title":"A General Framework for Expressing Preferences in Causal Reasoning and Planning","year":2007,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Library science; Computer science; Operations research; Information retrieval; World Wide Web; Sociology; Mathematics","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false},{"name":"Hans Tompits","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04664817363488474,"gpt":0.3304637165551217,"spread":0.283815542920237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005654504,0.001373292,0.0009095588,0.0021755,0.001965329,0.00397454,0.003186495,0.002276997,0.007279275],"category_scores_gemma":[0.005825906,0.0009916051,0.003752455,0.003382118,0.004376812,0.008305538,0.003138205,0.004763677,0.001500579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002687109,"about_ca_system_score_gemma":0.002641868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008563264,"about_ca_topic_score_gemma":0.007749275,"domain_scores_codex":[0.9964573,0.001354908,0.0003810613,0.0006528855,0.0008085698,0.0003452379],"domain_scores_gemma":[0.9976555,0.001060353,0.0002165954,0.0004911151,0.0003932246,0.0001832223],"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.00002080789,0.0000206546,0.00008664538,0.0001002968,0.0000202447,0.0001029802,0.0004017951,0.006943943,0.0007947214,0.9758728,0.001417464,0.01421771],"study_design_scores_gemma":[0.00003765198,0.00004718398,0.00007824031,0.00007932507,0.00004511017,0.000164825,0.000189819,0.03378539,0.001440228,0.9198906,0.04420175,0.00003987255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001009778,0.0002440771,0.9922493,0.0008682687,0.00005399216,0.00008420931,0.0001776544,0.0002649654,0.005047748],"genre_scores_gemma":[0.07114191,0.0008353202,0.9214252,0.0007439009,0.0001936398,0.0004732221,0.0003945414,0.0001496622,0.004642564],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008563264,"threshold_uncertainty_score":0.02990419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051119578","doi":"10.1093/logcom/exm050","title":"Goal Change in the Situation Calculus","year":2007,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Situation calculus; Calculus (dental); Action (physics); Computer science; Contraction (grammar); Artificial intelligence; Philosophy; Linguistics; Medicine","authors":[{"name":"Steven Shapiro","is_ca":true},{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04146586588425641,"gpt":0.3086231164052781,"spread":0.2671572505210217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008158308,0.0007438964,0.00086425,0.001362728,0.00259657,0.003995548,0.002314749,0.002056489,0.004742318],"category_scores_gemma":[0.01180707,0.0007831036,0.002317206,0.001250554,0.009174429,0.01022892,0.005659219,0.005217514,0.0008974685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002798608,"about_ca_system_score_gemma":0.002109342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002980918,"about_ca_topic_score_gemma":0.001867907,"domain_scores_codex":[0.9913458,0.003380667,0.0004528521,0.001357749,0.002707476,0.0007554771],"domain_scores_gemma":[0.9945135,0.002975372,0.0003068234,0.001030971,0.0008135174,0.0003597995],"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.00001952229,0.00001321529,0.00008171023,0.00002522955,0.000008460438,0.00005371577,0.0006144028,0.001514983,0.0003719128,0.9912432,0.0003847926,0.005668681],"study_design_scores_gemma":[0.00003000477,0.00002356953,0.00007588886,0.0000201305,0.00002432042,0.00007499894,0.0001520374,0.01706814,0.0009845332,0.9698711,0.01165448,0.00002069679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01465845,0.0003946848,0.9483456,0.001579995,0.0001427576,0.0001619093,0.00007762316,0.0006082451,0.03403081],"genre_scores_gemma":[0.4988673,0.0003932597,0.4862942,0.0005197884,0.0001894261,0.0005366264,0.0001596737,0.000284635,0.01275519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008158308,"threshold_uncertainty_score":0.04314578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101208282","doi":"10.1093/logcom/exn040","title":"Monotonic Answer Set Programming","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Answer set programming; Mathematical proof; Computer science; Set (abstract data type); Monotonic function; Logic programming; Non-monotonic logic; Theoretical computer science; Default logic; Logic program; Programming language; Stable model semantics; Algorithm; Mathematics; Semantics (computer science); Description logic","authors":[{"name":"Martin Gebser","is_ca":false},{"name":"Mona Gharib","is_ca":false},{"name":"Robert E. Mercer","is_ca":true},{"name":"Torsten Schaub","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.038008121531624,"gpt":0.2767364146085681,"spread":0.2387282930769441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004511941,0.0007353738,0.0007283193,0.00117002,0.0009045243,0.003263448,0.002896388,0.001099505,0.006406258],"category_scores_gemma":[0.01108068,0.0005948183,0.001970842,0.001129843,0.002999074,0.006125204,0.003489954,0.003145668,0.001256467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277937,"about_ca_system_score_gemma":0.00171997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012804,"about_ca_topic_score_gemma":0.001516268,"domain_scores_codex":[0.9956577,0.001451529,0.0003498303,0.0008989609,0.001302767,0.000339334],"domain_scores_gemma":[0.9937567,0.003887734,0.0002659501,0.001124014,0.0007785492,0.0001871295],"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.00009431049,0.00008964392,0.0003842527,0.0003285831,0.00006058905,0.0001185267,0.0003971076,0.01221255,0.00282523,0.891187,0.002977981,0.08932424],"study_design_scores_gemma":[0.00004449982,0.00007190738,0.0001111825,0.00005961149,0.00005768946,0.0001939536,0.00009028793,0.1005833,0.006393343,0.8703783,0.02198997,0.00002594783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007200257,0.0001756082,0.9808594,0.0005932063,0.0000450075,0.0001907153,0.0002564403,0.001178271,0.009501108],"genre_scores_gemma":[0.1421383,0.0002754806,0.8506513,0.0004396886,0.00009989244,0.0004199913,0.0006063097,0.0002100066,0.005159045],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006406258,"threshold_uncertainty_score":0.02386171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034609074","doi":"10.1093/logcom/exn062","title":"Model Checking Using Description Logic","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Model checking; Programming language; Algorithm","authors":[{"name":"S. Ben-David","is_ca":true},{"name":"Richard Trefler","is_ca":true},{"name":"Grant Weddell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2584475929139776,"gpt":0.3542187284267333,"spread":0.09577113551275568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009855345,0.001589479,0.001675349,0.003144707,0.001326348,0.005332992,0.004261542,0.001748561,0.007100579],"category_scores_gemma":[0.02679998,0.001361452,0.004735699,0.002896098,0.004272204,0.007397246,0.005317719,0.004023892,0.001723743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003791047,"about_ca_system_score_gemma":0.00524374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008031501,"about_ca_topic_score_gemma":0.005598933,"domain_scores_codex":[0.9850895,0.00644942,0.001296688,0.001751072,0.00452079,0.0008924384],"domain_scores_gemma":[0.9789423,0.0145237,0.0009104174,0.003666821,0.001731131,0.0002256198],"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.000182043,0.0001314447,0.0009715414,0.001053156,0.0003150058,0.0005020283,0.0005105109,0.08090914,0.004853469,0.8058369,0.006834864,0.09789995],"study_design_scores_gemma":[0.0001774998,0.00006465951,0.0001690081,0.000277515,0.0001295506,0.0002323771,0.0001008192,0.1979881,0.01000668,0.7526295,0.03815313,0.00007114452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002504976,0.0005504196,0.9880826,0.000743986,0.00008800986,0.000211623,0.0005085313,0.002273694,0.005036192],"genre_scores_gemma":[0.1484615,0.00206123,0.8394028,0.000843073,0.000205085,0.0008714495,0.002773878,0.0008131643,0.004567757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009855345,"threshold_uncertainty_score":0.05212069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100078804","doi":"10.1093/logcom/exi021","title":"Expressing Default Logic Variants in Default Logic","year":2005,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Default logic; Non-monotonic logic; Default rule; Unification; Extension (predicate logic); Computer science; Interpretation (philosophy); Autoepistemic logic; Artificial intelligence; Many-valued logic; Multimodal logic; Mathematics; Theoretical computer science; Description logic; Programming language","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03056074398423831,"gpt":0.2893305849371426,"spread":0.2587698409529043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070597,0.0005787484,0.0005256775,0.0009137235,0.0007750826,0.002689167,0.001664919,0.001459473,0.002419165],"category_scores_gemma":[0.003089683,0.0005618655,0.001335496,0.001013175,0.003789938,0.006242016,0.002351112,0.002662542,0.0004329675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002314886,"about_ca_system_score_gemma":0.0007953153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197316,"about_ca_topic_score_gemma":0.002956483,"domain_scores_codex":[0.9976177,0.0007533799,0.0002180768,0.0005057898,0.0006640386,0.0002409488],"domain_scores_gemma":[0.9986814,0.0005371431,0.0001397837,0.000365641,0.0002216052,0.00005445583],"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.00002512123,0.00001528334,0.0001964314,0.00003439499,0.00001424224,0.0001951812,0.0005871778,0.003587397,0.002456566,0.9842391,0.000593939,0.008055149],"study_design_scores_gemma":[0.00003442912,0.0000448083,0.0002397738,0.000052393,0.00004237722,0.0002663534,0.0002395228,0.03963777,0.004321996,0.937115,0.0179598,0.00004588818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07638561,0.000937083,0.875986,0.001719259,0.0001997435,0.0001522131,0.0003221138,0.0008454189,0.04345254],"genre_scores_gemma":[0.7103532,0.0005485245,0.2805574,0.0006551157,0.000158221,0.0001730867,0.0003667139,0.0001782139,0.007009619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003070597,"threshold_uncertainty_score":0.01679569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967675407","doi":"10.1093/logcom/exl010","title":"A Logic of Type Relations and its Applications to Relational Databases","year":2006,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Relational database; Computer science; Nondeterministic algorithm; Relational model; Rough set; Relational calculus; Type (biology); Set (abstract data type); Relational algebra; Theoretical computer science; Database; Programming language; Algebra over a field; Mathematics; Artificial intelligence; Pure mathematics","authors":[{"name":"Wendy MacCaull","is_ca":true},{"name":"Ewa Orłowska","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05253134681654478,"gpt":0.3101409083156687,"spread":0.2576095614991239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004265331,0.001015349,0.001159579,0.003104315,0.003155317,0.009101949,0.002891486,0.002393855,0.006368912],"category_scores_gemma":[0.008932077,0.001322292,0.003243556,0.007160053,0.00689925,0.01269223,0.004431495,0.006014111,0.002243265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002530247,"about_ca_system_score_gemma":0.002608225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003545612,"about_ca_topic_score_gemma":0.002408752,"domain_scores_codex":[0.9972066,0.0008097599,0.0003431701,0.0004882166,0.0009554343,0.000196824],"domain_scores_gemma":[0.9966948,0.001824945,0.0002882516,0.0004254988,0.0004775428,0.0002890031],"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.00001385088,0.00001487,0.0000662626,0.00007745295,0.00001210859,0.0001757737,0.0002069381,0.001598277,0.0003431673,0.9797071,0.002185439,0.0155988],"study_design_scores_gemma":[0.00001183393,0.00001445427,0.00004471358,0.00007390368,0.00001949296,0.0002834731,0.00007659582,0.008150815,0.0004133481,0.9618162,0.02906872,0.00002643189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003832071,0.008715205,0.9600556,0.003603161,0.001391364,0.0001277654,0.0003197686,0.0006719115,0.0212831],"genre_scores_gemma":[0.1055034,0.01420382,0.8584025,0.001874287,0.002494012,0.0003978685,0.0004562557,0.0003715798,0.01629629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009101949,"threshold_uncertainty_score":0.02255756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3118093767","doi":"10.1093/logcom/exaa079","title":"Parameterized complexity of abduction in Schaefer’s framework","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Parameterized complexity; Computer science; Dimension (graph theory); Artificial intelligence; Kernelization; Set (abstract data type); Satisfiability; Theoretical computer science; Mathematics; Mathematical economics; Algorithm; Combinatorics; Programming language","authors":[{"name":"Yasir Mahmood","is_ca":false},{"name":"Arne Meier","is_ca":false},{"name":"Johannes Schmidt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08801501108235356,"gpt":0.3011803870368022,"spread":0.2131653759544487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009313096,0.0009769645,0.001842889,0.002541602,0.001452356,0.006821302,0.003155539,0.002234176,0.006122053],"category_scores_gemma":[0.05084435,0.001138076,0.004052565,0.003583272,0.004835843,0.01476987,0.00537475,0.004614362,0.0003884049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008173858,"about_ca_system_score_gemma":0.003413441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0076673,"about_ca_topic_score_gemma":0.005477345,"domain_scores_codex":[0.9853824,0.005255552,0.00118128,0.00237621,0.004674824,0.001129675],"domain_scores_gemma":[0.9353737,0.05225349,0.002558381,0.006532725,0.002374912,0.0009067581],"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.0002214921,0.00009602238,0.002214037,0.0002712586,0.0001607428,0.0003092226,0.0008329134,0.1623798,0.001508174,0.7959473,0.002098533,0.0339605],"study_design_scores_gemma":[0.00003999944,0.00002461814,0.0005413889,0.00003917136,0.00005826549,0.00009649031,0.0001088098,0.2063458,0.0007312076,0.7896053,0.0023734,0.00003560767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1954078,0.002467152,0.775952,0.005550595,0.00006383866,0.0002941247,0.001208714,0.0008897491,0.01816604],"genre_scores_gemma":[0.7885288,0.001247112,0.2040223,0.0003647041,0.0001839396,0.0003991949,0.001255561,0.000243962,0.003754491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009313096,"threshold_uncertainty_score":0.05930573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098354393","doi":"10.1093/logcom/exl014","title":"First-order Definable Retraction Problems for Posets and Reflexive Graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Reflexivity; Order (exchange); Mathematics; Star product; Combinatorics; Computer science; Discrete mathematics; Sociology; Business","authors":[{"name":"Víctor Dalmau","is_ca":false},{"name":"Andrei Krokhin","is_ca":false},{"name":"Benoît Larose","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03340010069842562,"gpt":0.3163988984890406,"spread":0.282998797790615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003538909,0.0008182287,0.001290606,0.001508067,0.001669258,0.004885401,0.001549142,0.002132353,0.004614729],"category_scores_gemma":[0.01327015,0.0007394179,0.002543565,0.001596929,0.005480119,0.01868363,0.004211321,0.006384826,0.0005009176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796568,"about_ca_system_score_gemma":0.001276667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006631286,"about_ca_topic_score_gemma":0.0007335558,"domain_scores_codex":[0.997174,0.0005826687,0.0003716756,0.0008119903,0.0006508607,0.0004087317],"domain_scores_gemma":[0.9857098,0.01031717,0.001082281,0.001416738,0.0007225273,0.0007515554],"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.0001774557,0.0001352766,0.001325537,0.000226466,0.00003263486,0.0003793428,0.001180603,0.004222576,0.002971304,0.9685615,0.001141713,0.0196456],"study_design_scores_gemma":[0.00005184898,0.00006825059,0.00034287,0.00002396214,0.00002060251,0.0003565591,0.0003288251,0.008836099,0.00286637,0.9846455,0.002433169,0.00002588685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5901038,0.002081094,0.3707893,0.00470073,0.0002724256,0.0002901204,0.0009308498,0.000922395,0.02990921],"genre_scores_gemma":[0.9201797,0.00111633,0.06865396,0.0004394876,0.0003762654,0.0002510221,0.001701447,0.0001236126,0.00715805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004885401,"threshold_uncertainty_score":0.01871574,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2070000914","doi":"10.1093/logcom/exm094","title":"Reinforcement Belief Revision","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rationality; Belief revision; Computer science; Space (punctuation); Operator (biology); Reinforcement learning; Artificial intelligence; Epistemology","authors":[{"name":"Yi Jin","is_ca":true},{"name":"Michael Thielscher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03146668548599047,"gpt":0.2689124663159305,"spread":0.2374457808299401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004653219,0.0008367019,0.001101242,0.0008588654,0.0007229997,0.002176331,0.001773821,0.001551113,0.004735443],"category_scores_gemma":[0.01645183,0.00032128,0.001204459,0.0006506175,0.003045329,0.002692947,0.00186673,0.002280858,0.0006953706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651558,"about_ca_system_score_gemma":0.001350953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016137,"about_ca_topic_score_gemma":0.0009593972,"domain_scores_codex":[0.9958196,0.002053259,0.0002020181,0.0006115132,0.001075542,0.0002380734],"domain_scores_gemma":[0.9922318,0.00422972,0.0006194793,0.001378184,0.00116846,0.0003724067],"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.0001136339,0.00007899227,0.0006093949,0.0002770924,0.0001858261,0.0001406835,0.0004272893,0.02893984,0.001334612,0.8934999,0.003352956,0.07103969],"study_design_scores_gemma":[0.0001017348,0.0001491341,0.0003041912,0.00005589612,0.00007025556,0.0001680531,0.00006920238,0.1138361,0.0009621772,0.8729958,0.01124521,0.00004218408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0150706,0.001332706,0.9508717,0.002539226,0.0003688612,0.0002304842,0.0001040497,0.000483225,0.02899908],"genre_scores_gemma":[0.8057196,0.00112742,0.1813252,0.0008040526,0.000383083,0.000364858,0.0001375152,0.00006275254,0.01007543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004735443,"threshold_uncertainty_score":0.02460885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2279493147","doi":"10.1093/logcom/exn031","title":"The Settling Time Reducibility Ordering and  Formula Sets","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Waterloo","funders":"","keywords":"Settling; Volume (thermodynamics); Computation; Mathematics; Computer science; Settling time; Algorithm; Engineering; Physics; Thermodynamics","authors":[{"name":"Barbara F. Csima","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02898311213798388,"gpt":0.270619726652699,"spread":0.2416366145147151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441316,0.0004738189,0.0006545818,0.00262404,0.002162094,0.004258253,0.001030265,0.0007777813,0.01217334],"category_scores_gemma":[0.01010871,0.000470171,0.001310059,0.002563533,0.003235915,0.006295663,0.002010979,0.003770078,0.001174858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00277688,"about_ca_system_score_gemma":0.001954626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004210367,"about_ca_topic_score_gemma":0.004292366,"domain_scores_codex":[0.9976212,0.0004295048,0.0002174069,0.0005383715,0.0008938938,0.0002996835],"domain_scores_gemma":[0.9922739,0.00427688,0.0004853742,0.001152913,0.001280905,0.0005300172],"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.0001116662,0.00004992459,0.0006887954,0.00006522668,0.00001600168,0.0001549389,0.0002905419,0.002738872,0.0007353267,0.9658359,0.005028883,0.02428383],"study_design_scores_gemma":[0.00001286879,0.00002093297,0.0003497036,0.00001873826,0.000009513103,0.0001243201,0.00007788913,0.004035132,0.0005358914,0.9882046,0.006598115,0.0000123421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3311925,0.00454795,0.3019556,0.01074478,0.001497142,0.0001901961,0.002428355,0.001785511,0.3456581],"genre_scores_gemma":[0.8870177,0.001099147,0.06652857,0.0008884627,0.0007134272,0.0001010094,0.002141658,0.0003760074,0.04113396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01217334,"threshold_uncertainty_score":0.0407238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3179134436","doi":"10.1093/logcom/exab021","title":"Ideal related algebras and their logics","year":2021,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"National Natural Science Foundation of China","keywords":"Unary operation; Ideal (ethics); Modal; Algebra over a field; Mathematics; Modal operator; Discriminator; Pure mathematics; Normal modal logic; Modal logic; Discrete mathematics; Computer science; Epistemology; Philosophy","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Wojciech Dzik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0185234277822019,"gpt":0.2547389408735739,"spread":0.236215513091372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002210078,0.0003190095,0.0003919526,0.001618776,0.001417633,0.002617789,0.001170238,0.0008652143,0.005576984],"category_scores_gemma":[0.002930587,0.0002415668,0.0007887193,0.0009031228,0.003948592,0.005412919,0.002683626,0.002196347,0.0005959208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001787092,"about_ca_system_score_gemma":0.0007669507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008791454,"about_ca_topic_score_gemma":0.0006992472,"domain_scores_codex":[0.9984743,0.0004687975,0.00008332703,0.0002404048,0.0004961415,0.000237028],"domain_scores_gemma":[0.9985406,0.0005053202,0.0001818528,0.000168697,0.000309771,0.0002937864],"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.000008318905,0.000008766435,0.00009205076,0.000008231983,0.000001866409,0.00002245406,0.0000883004,0.0002261085,0.0002761798,0.9979342,0.0002314052,0.001102061],"study_design_scores_gemma":[0.000009333161,0.00001085428,0.00007516515,0.000009824539,0.000003971104,0.00005753655,0.00009736586,0.004702676,0.0003672582,0.9911256,0.003532905,0.000007390936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.309932,0.002715754,0.4446857,0.004669879,0.0004235257,0.0001911219,0.0004223862,0.0007013117,0.2362585],"genre_scores_gemma":[0.9376118,0.0005119564,0.04692587,0.0006588154,0.0002268575,0.00007925915,0.0002300203,0.00005430678,0.01370108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005576984,"threshold_uncertainty_score":0.01865691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014239444","doi":"10.1093/logcom/exaa059","title":"Operator algebras with hyperarithmetic theory","year":2020,"lang":"en","type":"preprint","venue":"Journal of Logic and Computation","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Finitely-generated abelian group; Embedding; Mathematics; Operator (biology); Omega; Combinatorics; Word (group theory); Operator algebra; Lambda; Group (periodic table); Algebra over a field; Pure mathematics; Discrete mathematics; Physics; Quantum mechanics; Computer science; Geometry","authors":[{"name":"Isaac Goldbring","is_ca":false},{"name":"Bradd Hart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0862647377293853,"gpt":0.3675811881880093,"spread":0.281316450458624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903474,0.0004076481,0.0003640955,0.000934439,0.001380992,0.002598779,0.0006735223,0.0005924095,0.007809476],"category_scores_gemma":[0.001866485,0.0002040007,0.000639501,0.0006819642,0.003613769,0.005640069,0.00220793,0.001551384,0.0006443286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001422667,"about_ca_system_score_gemma":0.0006842274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008625544,"about_ca_topic_score_gemma":0.000745594,"domain_scores_codex":[0.9988621,0.0002215151,0.00006694068,0.0001880623,0.0004955127,0.0001658948],"domain_scores_gemma":[0.998682,0.0004568783,0.0001695861,0.0001534952,0.0003051053,0.0002329453],"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.00001566067,0.00001059122,0.0001575259,0.00001751284,0.000003050797,0.00004555914,0.0001483968,0.0002882245,0.0007100096,0.9970288,0.0002023919,0.001372406],"study_design_scores_gemma":[0.00001273706,0.00001688594,0.0001845226,0.00001385933,0.000006372302,0.000127756,0.0001649517,0.003201936,0.001336279,0.9900042,0.00491763,0.00001286748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.5570283,0.00260536,0.2016805,0.002853585,0.0004422426,0.00008754095,0.0002681576,0.0003567029,0.2346776],"genre_scores_gemma":[0.9726725,0.0003508478,0.01492581,0.0003175488,0.0002376598,0.00004521492,0.0001300135,0.0000310509,0.01128928],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.007809476,"threshold_uncertainty_score":0.02612537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240444301","doi":"10.1093/logcom/exaa064","title":"Editorial","year":2020,"lang":"en","type":"editorial","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Programming language; Computational logic; Computer science; Logic programming; Philosophy of logic; Paraconsistent logic; Type theory; Proof theory; Automated theorem proving; T-norm fuzzy logics; Classical logic; Intuitionistic logic; Mathematical logic; Mathematics; Theoretical computer science; Fuzzy logic; Artificial intelligence; Description logic; Higher-order logic; Propositional calculus; Type (biology); Fuzzy set; Mathematical proof; Fuzzy number","authors":[{"name":"Sergei Artëmov","is_ca":false},{"name":"Anil Nerode","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01385206478299386,"gpt":0.2689839455156572,"spread":0.2551318807326634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586663,0.001310078,0.00125538,0.002191024,0.001929928,0.006754478,0.002029813,0.003857765,0.1914789],"category_scores_gemma":[0.01750155,0.000413341,0.001137489,0.00104944,0.001088908,0.004291371,0.001880871,0.005952002,0.1033477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169581,"about_ca_system_score_gemma":0.002711142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00075078,"about_ca_topic_score_gemma":0.001402701,"domain_scores_codex":[0.9971288,0.0003384729,0.0002410945,0.0006104065,0.001411531,0.0002697488],"domain_scores_gemma":[0.9885659,0.002262684,0.0005294098,0.0007543694,0.005635045,0.00225264],"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.0000182889,0.000006428504,0.00002927648,0.0001023946,0.000003348305,0.00004271622,0.00001574324,0.00001474036,0.00006003513,0.000933771,0.9855961,0.01317724],"study_design_scores_gemma":[0.000005778859,0.000006590129,0.00006746459,0.0001061223,0.000003237269,0.00007937075,0.00002662231,0.00001739384,0.00005394116,0.0006319379,0.9989981,0.000003234812],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001529834,0.007280688,0.0004563493,0.04208941,0.9092411,0.00005274442,0.0005476223,0.0002387034,0.03994027],"genre_scores_gemma":[0.003378503,0.01387542,0.0006228701,0.03519809,0.7210947,0.00009910946,0.001231096,0.0004673836,0.2240329],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1914789,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4243469825","doi":"10.1093/logcom/exaa081","title":"Tracking computability of GPAC-generable functions","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Alexander von Humboldt-Stiftung","keywords":"Computability; Computation; Computable analysis; Computable function; Mathematics; Model of computation; Computer science; Theoretical computer science; Algorithm","authors":[{"name":"Diogo Poças","is_ca":false},{"name":"J. I. Zucker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05934504869684096,"gpt":0.2773355776546156,"spread":0.2179905289577747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444701,0.000379055,0.0005786276,0.001683691,0.0009602344,0.00269244,0.0008749674,0.001224975,0.003813485],"category_scores_gemma":[0.01342865,0.0002661897,0.0008120775,0.0009314252,0.00429078,0.004743828,0.002292737,0.002084395,0.0003244189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001811788,"about_ca_system_score_gemma":0.0007376327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006931372,"about_ca_topic_score_gemma":0.0004071842,"domain_scores_codex":[0.9986193,0.0002918369,0.00008157801,0.0003067857,0.000477677,0.0002227909],"domain_scores_gemma":[0.9943894,0.003444382,0.0004755479,0.0008473889,0.0005698739,0.0002734559],"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.00002828527,0.00001435184,0.0004225679,0.00002342993,0.000004356089,0.0001073275,0.0001589799,0.009645709,0.001260427,0.9825848,0.0002157432,0.005533966],"study_design_scores_gemma":[0.000009250132,0.00003202627,0.0002225431,0.00002138147,0.000005742415,0.0001421514,0.00004953414,0.0881672,0.00241186,0.9076158,0.001310659,0.00001185807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5628402,0.0003821813,0.3920677,0.0008806618,0.00009861754,0.0001080815,0.0002035176,0.0007280181,0.04269107],"genre_scores_gemma":[0.982549,0.0001069867,0.0146041,0.0000755718,0.00003639475,0.00005610907,0.0000744747,0.00004977458,0.002447545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003813485,"threshold_uncertainty_score":0.01314551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2317113105","doi":"10.1093/logcom/exu039","title":"Special Issue on Computational Logic in Honour of Roy Dyckhoff","year":2014,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Honour; Computer science; Law; Political science","authors":[{"name":"Didier Galmiche","is_ca":true},{"name":"Stéphane Graham-Lengrand","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01781327407082046,"gpt":0.271086813178269,"spread":0.2532735391074485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003826037,0.002497501,0.002951372,0.004177524,0.002870719,0.01037154,0.001813706,0.006362148,0.07231466],"category_scores_gemma":[0.01330436,0.000826703,0.001427346,0.002284113,0.002770612,0.009520026,0.003546069,0.008836147,0.02948509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005848669,"about_ca_system_score_gemma":0.003743763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002283277,"about_ca_topic_score_gemma":0.003871621,"domain_scores_codex":[0.9956091,0.0006699256,0.0002798567,0.0008929587,0.002183819,0.0003643293],"domain_scores_gemma":[0.9908293,0.002610068,0.0004521527,0.0007074485,0.003216346,0.002184665],"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.00001786703,0.00001083445,0.00002887631,0.00007119663,0.000007740251,0.00002391217,0.000018705,0.00004397941,0.00007329458,0.008445066,0.9841791,0.007079493],"study_design_scores_gemma":[0.00001282205,0.00001069559,0.0001305797,0.00006904646,0.000008866336,0.00004664664,0.00001646369,0.0001325863,0.00007010094,0.009052058,0.9904419,0.000008378682],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0002936707,0.03058445,0.002025328,0.1455982,0.7618873,0.00005732813,0.0005427884,0.0002153695,0.05879557],"genre_scores_gemma":[0.00429628,0.01234648,0.0006467326,0.01622628,0.812843,0.00005948871,0.0003708134,0.0005271782,0.1526837],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.07231466,"threshold_uncertainty_score":0.2419166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414314109","doi":"10.1093/logcom/exaf046","title":"Logics of spatial isolation","year":2025,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"London Mathematical Society","keywords":"Characterization (materials science); Modal logic; Modal; Neighbourhood (mathematics); Isolation (microbiology); Accessibility relation; Topological space; Normal modal logic","authors":[{"name":"Can Başķent","is_ca":false},{"name":"David Gilbert","is_ca":true},{"name":"Giorgio Venturi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01626115940864831,"gpt":0.2742188377594588,"spread":0.2579576783508105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002267495,0.0004032058,0.0003254421,0.001053217,0.001564036,0.003023153,0.001175248,0.0008361509,0.005441009],"category_scores_gemma":[0.003419453,0.000306192,0.0006928992,0.0007721437,0.006644495,0.0076842,0.005426333,0.002037513,0.0004878225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001722212,"about_ca_system_score_gemma":0.0008677847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001543943,"about_ca_topic_score_gemma":0.001249309,"domain_scores_codex":[0.9980677,0.0007387834,0.0001246746,0.0003524742,0.0005007152,0.0002156737],"domain_scores_gemma":[0.9974912,0.001222982,0.0002472513,0.0004259334,0.0004056293,0.000207],"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.0000250753,0.000005303398,0.00007518483,0.00003931569,0.000004340959,0.00006484163,0.0003284123,0.001202823,0.00101733,0.9939916,0.0003501396,0.002895592],"study_design_scores_gemma":[0.00002086003,0.00002545377,0.0001242903,0.00002920586,0.00001639599,0.0001419107,0.0004668432,0.01649909,0.002738171,0.9673153,0.01260628,0.00001616667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09127474,0.0008082418,0.8105759,0.003479732,0.0001650052,0.00008505988,0.0002528797,0.0009059886,0.09245244],"genre_scores_gemma":[0.9475859,0.0002687425,0.045326,0.0003506246,0.0001100324,0.00008028385,0.0001396262,0.00006464155,0.006074093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005441009,"threshold_uncertainty_score":0.01820201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7125986258","doi":"10.1093/logcom/exaf073","title":"Advances in computational logic (CILC 2024)","year":2025,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Field (mathematics); Association (psychology); Computational logic; Mathematical logic; Computational model; Computational complexity theory","authors":[{"name":"Emanuele De Angelis","is_ca":false},{"name":"Maurizio Proietti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01517022786716741,"gpt":0.2938185786288521,"spread":0.2786483507616846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004909576,0.00134556,0.001256182,0.005122757,0.002127529,0.01180353,0.002336453,0.002529741,0.1025564],"category_scores_gemma":[0.01107939,0.0008001971,0.001759689,0.005573967,0.002190426,0.008926637,0.004362432,0.007294776,0.04048961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008301925,"about_ca_system_score_gemma":0.005251124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003685737,"about_ca_topic_score_gemma":0.003481894,"domain_scores_codex":[0.9942582,0.0009215887,0.0004289157,0.0009924312,0.002891839,0.0005070065],"domain_scores_gemma":[0.9923881,0.00261084,0.0002690581,0.001145129,0.002750353,0.0008365559],"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.00004076748,0.00002385257,0.00007194429,0.0003751892,0.00001934289,0.00003884607,0.0000651109,0.0003844166,0.0002844999,0.07721409,0.8445874,0.07689443],"study_design_scores_gemma":[0.000005644445,0.000006503318,0.0001414616,0.0001606937,0.000005426771,0.00006896833,0.00001703605,0.0003615795,0.0001194499,0.02040072,0.978704,0.000008589458],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001965055,0.1679195,0.05775463,0.08126727,0.2176408,0.0002982712,0.006392433,0.003327972,0.4634342],"genre_scores_gemma":[0.04009098,0.1145798,0.06017575,0.02074246,0.1449516,0.0006392472,0.02104852,0.006470385,0.5913013],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1025564,"threshold_uncertainty_score":0.3430855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113648859","doi":"10.1093/logcom/exr050","title":"Functions definable by numerical set-expressions","year":2011,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Engineering and Physical Sciences Research Council","keywords":"Set (abstract data type); Computer science; Mathematics; Algorithm; Programming language","authors":[{"name":"Ian Pratt‐Hartmann","is_ca":false},{"name":"Ivo Düntsch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05025316820857675,"gpt":0.2668335121783242,"spread":0.2165803439697474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248997,0.0008531432,0.0007467527,0.002047731,0.001106306,0.005027128,0.001315999,0.001164604,0.004111796],"category_scores_gemma":[0.005581349,0.0005454851,0.001152042,0.002215719,0.00472452,0.008904135,0.002097083,0.002415426,0.0009514467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001716864,"about_ca_system_score_gemma":0.0008173372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006883092,"about_ca_topic_score_gemma":0.0004516913,"domain_scores_codex":[0.9973584,0.000782626,0.0003481403,0.0005731187,0.0006843504,0.0002533998],"domain_scores_gemma":[0.9971042,0.00170583,0.0003072829,0.0003614117,0.0003757283,0.0001454862],"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.00001972814,0.000006842575,0.000129785,0.000045266,0.000007394342,0.00006502787,0.0002925918,0.001075925,0.0009441206,0.9891315,0.0003204021,0.007961621],"study_design_scores_gemma":[0.00001505248,0.00002179144,0.0001900044,0.00005495378,0.00002191247,0.0002366974,0.0001361595,0.009597556,0.002727154,0.9664699,0.02050548,0.00002339432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07872777,0.002693106,0.8647924,0.001403673,0.0002941586,0.0001211043,0.00088034,0.001017935,0.05006957],"genre_scores_gemma":[0.6581019,0.002242036,0.3211823,0.0008908771,0.0004754942,0.0005990277,0.001336987,0.0003260757,0.01484529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005027128,"threshold_uncertainty_score":0.01375532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411777705","doi":"10.1093/logcom/exaf034","title":"Relations enumerable from positive information","year":2025,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Österreichische Agentur für Internationale Mobilität und Kooperation in Bildung, Wissenschaft und Forschung; Austrian Science Fund; European Commission","keywords":"Recursively enumerable language; Computer science; Programming language; Algorithm","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Luke MacLean","is_ca":true},{"name":"Dino Rossegger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008665284595332114,"gpt":0.2504032230130481,"spread":0.241737938417716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243313,0.0003469503,0.0005654804,0.001688497,0.001382715,0.002619649,0.001021274,0.0009176483,0.005380216],"category_scores_gemma":[0.008485163,0.0003658872,0.0008092345,0.0009247992,0.003489519,0.006497466,0.002002499,0.002980653,0.0004202742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001222074,"about_ca_system_score_gemma":0.0005610564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008704022,"about_ca_topic_score_gemma":0.0009203026,"domain_scores_codex":[0.9983009,0.0003534758,0.0001103895,0.0003542565,0.000677715,0.0002032505],"domain_scores_gemma":[0.9931652,0.004680139,0.0005201475,0.0008889053,0.0005121093,0.0002335749],"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.00004505939,0.00003107534,0.0004433099,0.00004798959,0.000008228447,0.0001809111,0.0003734472,0.002824821,0.002330881,0.9876385,0.0003754808,0.005700266],"study_design_scores_gemma":[0.00001927065,0.00003228335,0.0003591088,0.00002777764,0.00002109296,0.0001806527,0.0001280627,0.01478593,0.005324189,0.9756514,0.003452253,0.00001801143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6786879,0.0007433571,0.2563525,0.001341752,0.0001182144,0.00009322075,0.0005036386,0.001135932,0.06102351],"genre_scores_gemma":[0.9755263,0.0001396191,0.01966338,0.0001458592,0.00008366061,0.00004841055,0.0002617823,0.00007517275,0.004055771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005380216,"threshold_uncertainty_score":0.01799864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385619649","doi":"10.1093/logcom/exad050","title":"A parametrized axiomatization for a large number of restricted second-order logics","year":2023,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Australian Research Council","keywords":"Predicate logic; Mathematics; Predicate (mathematical logic); Completeness (order theory); Predicate variable; First-order logic; Second-order logic; Predicate functor logic; Argument (complex analysis); Discrete mathematics; Classical logic; Calculus (dental); Algebra over a field; Computer science; Higher-order logic; Pure mathematics; Multimodal logic; Zeroth-order logic; Theoretical computer science; Description logic; Autoepistemic logic; Programming language","authors":[{"name":"Guillermo Badía","is_ca":false},{"name":"John Bell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03834620579276569,"gpt":0.3113974809968479,"spread":0.2730512752040822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005089387,0.0007883767,0.00131763,0.001219166,0.001616418,0.003445411,0.002221699,0.001255886,0.006247988],"category_scores_gemma":[0.005662665,0.001074136,0.00256201,0.001358207,0.003915785,0.008975362,0.004324682,0.006342972,0.000854436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002252799,"about_ca_system_score_gemma":0.001440524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001424367,"about_ca_topic_score_gemma":0.002370638,"domain_scores_codex":[0.9959627,0.001369232,0.0004231168,0.0008021305,0.001148161,0.0002946204],"domain_scores_gemma":[0.9915938,0.004678535,0.000267025,0.002435645,0.0008009142,0.0002239466],"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.0000573655,0.00003569536,0.0002586047,0.00008722637,0.00002884458,0.0001327021,0.0002744581,0.006284454,0.004109655,0.9809933,0.001128335,0.006609439],"study_design_scores_gemma":[0.000105433,0.00006282845,0.0003871036,0.00006041075,0.00007098568,0.0002657609,0.0001006607,0.06154073,0.01124385,0.9040605,0.02204808,0.00005374858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07210734,0.0004876333,0.9003934,0.001242114,0.0001556394,0.0001976304,0.0007447244,0.001353035,0.02331858],"genre_scores_gemma":[0.6851906,0.000456222,0.300955,0.0006268842,0.0001692956,0.0005568559,0.001091123,0.0003103176,0.01064371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006247988,"threshold_uncertainty_score":0.02691555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3015221827","doi":"10.1093/logcom/exaa026","title":"Special Issue on Logical Foundations of Computer Science","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computational logic; Programming language; Computer science; Paraconsistent logic; Philosophy of logic; Logic programming; Proof theory; Type theory; Automated theorem proving; Non-classical logic; Intuitionistic logic; Classical logic; Mathematical logic; T-norm fuzzy logics; Theoretical computer science; Mathematics; Fuzzy logic; Artificial intelligence; Description logic; Propositional calculus; Higher-order logic; Logical consequence; Type (biology); Mathematical proof; Fuzzy set","authors":[{"name":"Sergei Artëmov","is_ca":false},{"name":"Anil Nerode","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04442626409652507,"gpt":0.2985361169041228,"spread":0.2541098528075977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003170043,0.001919882,0.002392281,0.005574525,0.003136774,0.01028964,0.001825683,0.004177728,0.1325141],"category_scores_gemma":[0.01060287,0.000829871,0.002140427,0.003776619,0.003000511,0.008201292,0.003342319,0.008590844,0.04104669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00494466,"about_ca_system_score_gemma":0.003312821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001074795,"about_ca_topic_score_gemma":0.001694132,"domain_scores_codex":[0.9962566,0.0007080066,0.0002810275,0.0007783212,0.001678187,0.0002978763],"domain_scores_gemma":[0.9916667,0.004207954,0.0003658108,0.0008965615,0.001958842,0.0009042122],"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.00002360177,0.00002293611,0.0001186927,0.0003258907,0.00002212313,0.00005667605,0.00008739683,0.0001490444,0.0001845688,0.04940562,0.9218394,0.02776412],"study_design_scores_gemma":[0.000008635646,0.0000163676,0.0001817492,0.0002734051,0.00001068645,0.0001478809,0.00003943841,0.0002103531,0.00007450425,0.03509081,0.9639363,0.000009824442],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0009667033,0.1171353,0.01255681,0.08421623,0.4906045,0.0001605678,0.001848331,0.0009024443,0.2916092],"genre_scores_gemma":[0.01458703,0.06806312,0.004516534,0.02213895,0.5805886,0.0002786503,0.002449112,0.001242936,0.3061351],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1325141,"threshold_uncertainty_score":0.4433039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3117330206","doi":"10.1093/logcom/exaa065","title":"Lifting propositional proof compression algorithms to first-order logic","year":2020,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Resolution (logic); Propositional calculus; Literal (mathematical logic); Proof complexity; Algorithm; Computer science; Propositional variable; Automated reasoning; Zeroth-order logic; Conjunctive normal form; Proof theory; Well-formed formula; Intuitionistic logic; Automated theorem proving; Mathematics; First-order logic; Intermediate logic; Calculus (dental); Discrete mathematics; Theoretical computer science; Programming language; Description logic; Multimodal logic","authors":[{"name":"Jan Gorzny","is_ca":true},{"name":"Ezequiel Postan","is_ca":false},{"name":"Bruno Woltzenlogel Paleo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04514012537969444,"gpt":0.2919407493478152,"spread":0.2468006239681207,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003408751,0.001019462,0.0008865323,0.003334055,0.0007982586,0.002245524,0.002224777,0.0008952168,0.004303084],"category_scores_gemma":[0.01684517,0.0005562341,0.001395944,0.002850814,0.001537892,0.004134235,0.002840623,0.002881298,0.0009777453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00209517,"about_ca_system_score_gemma":0.00223062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002848767,"about_ca_topic_score_gemma":0.002650528,"domain_scores_codex":[0.9952635,0.0014479,0.0002855528,0.0004106472,0.002341933,0.0002504266],"domain_scores_gemma":[0.9852111,0.008228414,0.0006281214,0.003834427,0.001873538,0.0002244357],"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.0003130251,0.0002932315,0.001032684,0.0004740971,0.0001114668,0.0001327999,0.0005734412,0.07104407,0.01089656,0.1024208,0.006349431,0.8063583],"study_design_scores_gemma":[0.0001688145,0.0001777827,0.0008118864,0.0001816531,0.0001072072,0.0004237966,0.0001789019,0.7335134,0.03955893,0.2020413,0.02278289,0.0000534941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04143269,0.001537004,0.9441988,0.0007368369,0.000134477,0.000396245,0.0002733878,0.006194846,0.005095671],"genre_scores_gemma":[0.1909127,0.001028484,0.8031125,0.0002710161,0.0001188057,0.0002729408,0.001001326,0.0006090646,0.002673199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004303084,"threshold_uncertainty_score":0.01802737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}