{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252137,0.00004603981,0.00009367623,0.0001530328,0.0001605766,0.000148243,0.0001502569,0.00001633953,3.179248e-7],"category_scores_gemma":[0.0005492835,0.00002946737,0.00001368718,0.0006526412,0.0002046794,0.0007724798,0.00004094621,0.0001139014,2.241671e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001479468,"about_ca_system_score_gemma":0.00005344993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002170134,"about_ca_topic_score_gemma":6.306907e-7,"domain_scores_codex":[0.9993109,0.00005484633,0.0001904923,0.0001204278,0.0002240688,0.00009930605],"domain_scores_gemma":[0.999198,0.0003010477,0.0001927304,0.00003357244,0.0002411649,0.00003354732],"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.00003667037,0.0000206212,0.0007498583,0.000003010916,0.000002039285,0.00001207352,0.004817333,0.000757694,0.0001802334,0.2086289,0.00001095029,0.7847806],"study_design_scores_gemma":[0.0007874008,0.0001743878,0.07615995,0.0002120332,0.000005327056,0.00009914089,0.0008340605,0.1439801,0.00006252678,0.7775979,0.00001734489,0.00006980172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176494,0.0004445079,0.8784891,0.002783601,0.00008350964,0.00005867076,4.883499e-8,0.000005193882,0.0004859765],"genre_scores_gemma":[0.988237,0.0002977181,0.01049151,0.0009363112,0.0000336683,3.567571e-7,6.410816e-8,5.752269e-7,0.000002763642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8705876,"threshold_uncertainty_score":0.1429511,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818076,0.00005421219,0.0001071953,0.00007117557,0.00009524948,0.00004016126,0.0001027145,0.00002308141,4.31882e-7],"category_scores_gemma":[0.00004219096,0.00003735483,0.00001395124,0.0002147523,0.00004266214,0.0002879261,0.00001316971,0.00006503052,9.817512e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001346102,"about_ca_system_score_gemma":0.00006941161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002271098,"about_ca_topic_score_gemma":1.343217e-7,"domain_scores_codex":[0.9995216,0.00003955394,0.0001584577,0.0000779249,0.0001481002,0.00005432771],"domain_scores_gemma":[0.9992525,0.0001191763,0.0002520332,0.000055695,0.000288369,0.00003221872],"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.0007042135,0.001518687,0.1093373,0.0001974902,0.0003936721,0.001478543,0.06204134,0.02651188,0.00271765,0.07084962,0.08404407,0.6402055],"study_design_scores_gemma":[0.002789316,0.006323588,0.3618771,0.0004086702,0.0000682565,0.009741308,0.0004260044,0.2002902,0.0028258,0.4136073,0.0008587576,0.0007837234],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.13877,0.0001998859,0.8601109,0.0004466631,0.000035334,0.00003893435,1.316693e-7,0.0002311424,0.0001670007],"genre_scores_gemma":[0.6796269,0.00002745869,0.3202491,0.00006452539,0.00002192378,7.258449e-7,2.50674e-7,0.000001559277,0.000007658782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6394218,"threshold_uncertainty_score":0.1523286,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449182,0.0001224541,0.0003719019,0.0001148434,0.000168088,0.0001603259,0.0002190889,0.00007212426,0.000002389528],"category_scores_gemma":[0.0002047215,0.0000817764,0.000124112,0.000152199,0.00002400275,0.000490791,0.00002643017,0.0001166239,0.000001364685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000029,"about_ca_system_score_gemma":0.00006168733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.03177e-7,"about_ca_topic_score_gemma":7.430184e-8,"domain_scores_codex":[0.9987568,0.0002225762,0.0004534449,0.0002027254,0.0002120747,0.0001523669],"domain_scores_gemma":[0.9987512,0.0001579151,0.0004835359,0.0001098277,0.0003859119,0.0001116284],"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.0003029577,0.000704763,0.0002336987,0.0001346139,0.00008104654,0.00002098384,0.00184957,0.004995193,0.0004028162,0.2641067,0.002735499,0.7244322],"study_design_scores_gemma":[0.0096535,0.003123572,0.000649463,0.0001029421,0.00007620282,0.0005013564,0.000256687,0.8888648,0.0001117617,0.09077514,0.005563673,0.0003209617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006230458,0.002255037,0.9894074,0.0001094971,0.0002828293,0.0003016597,3.152381e-7,0.00002057805,0.001392239],"genre_scores_gemma":[0.6280093,0.0001918315,0.3714061,0.0001497546,0.000172071,0.000002266555,0.000002543727,0.000004909225,0.00006127894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8838695,"threshold_uncertainty_score":0.3334745,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101092,0.00006499115,0.0001224485,0.00003212249,0.0001575017,0.0001547347,0.0001187379,0.00003445315,2.5927e-7],"category_scores_gemma":[0.00005166612,0.00003387874,0.0000321815,0.00008145891,0.00003766538,0.0002504493,0.00005193312,0.00008868537,0.000002403012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001176454,"about_ca_system_score_gemma":0.00001197102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000399897,"about_ca_topic_score_gemma":6.342328e-7,"domain_scores_codex":[0.9993264,0.0001366586,0.0001910998,0.00005961393,0.0001532849,0.0001329099],"domain_scores_gemma":[0.9992976,0.000279073,0.0002231753,0.00005602582,0.00007107898,0.00007308542],"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.0000283713,0.00007665873,0.02522504,0.0000736482,0.00008844512,0.00002422343,0.002969173,0.0001390529,0.0003063532,0.4981845,0.0007524131,0.4721321],"study_design_scores_gemma":[0.005271358,0.006600944,0.284531,0.00008087245,0.0003361636,0.007514168,0.002071071,0.2494332,0.0008228578,0.4082144,0.03395313,0.001170797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08884186,0.003985492,0.9057484,0.0005055037,0.0005678629,0.00007461308,2.712876e-8,0.00001332343,0.0002629157],"genre_scores_gemma":[0.997681,0.0001050416,0.001930371,0.00006551176,0.0001909813,7.862266e-7,1.302732e-7,0.000002039112,0.00002411439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9088392,"threshold_uncertainty_score":0.149211,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013269,0.00006378371,0.0001441667,0.00005365581,0.00005394034,0.0001150893,0.0001473323,0.00004410822,1.666875e-7],"category_scores_gemma":[0.00004129561,0.00004918715,0.00004252272,0.0001127752,0.00001526474,0.0003121811,0.00002394458,0.00006199239,0.000001197867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005353982,"about_ca_system_score_gemma":0.00005665834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001905532,"about_ca_topic_score_gemma":0.000001296614,"domain_scores_codex":[0.9993029,0.00004710361,0.0002844643,0.00009694719,0.0001787569,0.00008986067],"domain_scores_gemma":[0.9991717,0.00005540482,0.0003129612,0.00005695572,0.0003233718,0.00007960285],"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.0002127402,0.0002080323,0.0006719015,0.00006550247,0.00005919193,0.00004237448,0.002171781,0.1858231,0.00009463001,0.5983564,0.02711406,0.1851803],"study_design_scores_gemma":[0.0007198331,0.0004721729,0.0004260074,0.00001831275,0.000006544878,0.0001526119,0.000241986,0.9035839,0.000005977283,0.09172408,0.002580194,0.00006834682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01344446,0.0003133176,0.9839513,0.001250515,0.0002302664,0.00008891238,0.00000288037,0.00001475114,0.0007035863],"genre_scores_gemma":[0.9521635,0.000003817119,0.04737245,0.000264122,0.0001346254,0.000001966654,0.000007029892,0.000002381368,0.00005014456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.938719,"threshold_uncertainty_score":0.2005794,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007486137,0.00007587017,0.0001559654,0.0001248703,0.00009467959,0.0001360687,0.000107659,0.0000651373,3.989081e-7],"category_scores_gemma":[0.0001585014,0.00005781594,0.00002424895,0.0001110417,0.00002621297,0.0003135306,0.00004312419,0.0001365115,1.064744e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001933381,"about_ca_system_score_gemma":0.00003278426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003698823,"about_ca_topic_score_gemma":0.000002204294,"domain_scores_codex":[0.9993067,0.00003844887,0.0002651987,0.0001255253,0.0001107324,0.0001533332],"domain_scores_gemma":[0.9991985,0.0003523662,0.0002524575,0.00003532331,0.0000984517,0.00006287956],"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.0002409562,0.0001507978,0.1423971,0.0001086833,0.00004999565,0.0001885706,0.02688699,0.00965799,0.0007755549,0.3254587,0.0002675598,0.4938171],"study_design_scores_gemma":[0.001196264,0.000691238,0.2348284,0.000571062,0.00001656957,0.0003219042,0.001138997,0.1866299,0.0002836084,0.5739718,0.000104497,0.0002458051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4147188,0.0009524713,0.5839078,0.00003820714,0.0001425163,0.00003298158,7.547495e-8,0.000006534842,0.0002005986],"genre_scores_gemma":[0.7025121,0.00001824637,0.2972319,0.00005190946,0.000178214,5.811016e-7,2.540193e-7,0.00000188156,0.000004895453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4935713,"threshold_uncertainty_score":0.2357665,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001253963,0.00005185236,0.00008690219,0.00009699928,0.00005759627,0.00006536453,0.0001841714,0.00003474874,0.000001177137],"category_scores_gemma":[0.00003660588,0.00003072938,0.00003086074,0.0002093063,0.00001822628,0.0003024493,0.00002609261,0.0001113012,0.000003083162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002489825,"about_ca_system_score_gemma":0.00001834075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001167189,"about_ca_topic_score_gemma":0.00002229714,"domain_scores_codex":[0.9993626,0.00007022711,0.0002138536,0.00007052614,0.0001793602,0.0001034348],"domain_scores_gemma":[0.9995029,0.0001417682,0.000180688,0.00004682272,0.00009651056,0.00003130446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003778555,0.000207133,0.01020683,0.00001596522,0.00001252688,0.0001996008,0.02959265,0.0004710153,0.0001601825,0.1767655,0.0004619139,0.7818689],"study_design_scores_gemma":[0.001097968,0.0007020796,0.8070086,0.00004155241,0.00001330813,0.0006097719,0.0008652169,0.1154441,0.0000651115,0.07323734,0.0007615021,0.0001534893],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1975672,0.0005264812,0.7992527,0.0008389065,0.0002254895,0.00006242048,5.087174e-8,0.000006804408,0.001519926],"genre_scores_gemma":[0.9945436,0.00003243512,0.004659688,0.0005140777,0.0002410133,6.503114e-7,3.941733e-7,0.000001207027,0.000006998048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7969763,"threshold_uncertainty_score":0.1253108,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002457739,0.00007680895,0.0001468489,0.00008194825,0.0001326917,0.00006456862,0.0001852954,0.00004057258,0.000002299283],"category_scores_gemma":[0.00002753168,0.00005548822,0.00005795062,0.0001583602,0.00004107017,0.0003519442,0.00004800446,0.0001181109,0.000006319799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002223,"about_ca_system_score_gemma":0.0000653743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002222044,"about_ca_topic_score_gemma":5.89966e-7,"domain_scores_codex":[0.9993085,0.00005087,0.0002361232,0.0001093806,0.0001677155,0.0001274637],"domain_scores_gemma":[0.9993901,0.00005932637,0.0002387735,0.00006216399,0.000174269,0.00007538837],"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.00007028903,0.0004680706,0.02282973,0.00006311977,0.0001307565,0.0008469737,0.0176061,0.005314746,0.000345065,0.07707836,0.007631815,0.867615],"study_design_scores_gemma":[0.006164832,0.005852212,0.2312677,0.000230198,0.0001064721,0.01715034,0.001112106,0.4854217,0.0007981463,0.212319,0.03824601,0.001331309],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2078786,0.0009161399,0.7892473,0.0002849148,0.0002900409,0.00005606404,9.821241e-8,0.00002808943,0.001298705],"genre_scores_gemma":[0.9475047,0.0001195589,0.05205597,0.0001195478,0.0001340405,8.027961e-7,3.949052e-7,0.000002572522,0.00006241055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8662837,"threshold_uncertainty_score":0.2262744,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006979,0.0000664414,0.0001217955,0.0001206051,0.0001422647,0.00005139567,0.0001587935,0.00004456956,6.015276e-7],"category_scores_gemma":[0.00004959069,0.00005509928,0.00003899921,0.0001635032,0.0000374653,0.000894234,0.00003946981,0.0001137865,9.882042e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000550961,"about_ca_system_score_gemma":0.00005469329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001815993,"about_ca_topic_score_gemma":7.25538e-8,"domain_scores_codex":[0.9992251,0.00007840146,0.0003040704,0.00009737861,0.0002029627,0.00009208609],"domain_scores_gemma":[0.9992801,0.00002551858,0.0003834566,0.00006705629,0.0001998964,0.00004399799],"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.00003333403,0.00009536426,0.001293175,0.00002574737,0.00001958364,0.00004107882,0.002553357,0.8147697,0.01262671,0.1096062,0.0001093073,0.05882645],"study_design_scores_gemma":[0.0001700998,0.00009406623,0.003599685,0.00001597871,0.000005658062,0.000685088,0.00002954315,0.9253618,0.0002318805,0.06974013,0.000007087656,0.00005896789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2574255,0.0001521151,0.7419848,0.00007012826,0.0001680376,0.00002954066,6.546306e-8,0.00001413934,0.0001555935],"genre_scores_gemma":[0.5067078,0.00003527536,0.4931251,0.00008860081,0.00003685769,1.666334e-7,1.333086e-7,0.000001511168,0.000004551118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2492823,"threshold_uncertainty_score":0.2246883,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334146,0.0001721628,0.000319776,0.0002345679,0.0001332868,0.0002151694,0.0004051273,0.0001191229,0.00001138097],"category_scores_gemma":[0.0001298323,0.000127574,0.00008531383,0.0003210913,0.00005212641,0.0008083858,0.0001237269,0.0002864034,0.00002121437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008901181,"about_ca_system_score_gemma":0.00008875285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008825719,"about_ca_topic_score_gemma":0.00001017365,"domain_scores_codex":[0.9984226,0.0001818927,0.0005682413,0.0002533758,0.0002919477,0.0002820086],"domain_scores_gemma":[0.998848,0.0001928862,0.0004906654,0.0001242347,0.0002221297,0.0001220933],"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.000142623,0.001096774,0.00932544,0.00009083761,0.0000804746,0.000742272,0.00831145,0.1040419,0.003298426,0.1616406,0.003007176,0.708222],"study_design_scores_gemma":[0.003182797,0.0009112873,0.08742914,0.0002539779,0.00003671096,0.001595802,0.0004050226,0.53619,0.0002877972,0.36784,0.001296049,0.0005714563],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1050821,0.002076207,0.8862758,0.001172972,0.0003709493,0.00009147116,3.577063e-7,0.00004007095,0.004890058],"genre_scores_gemma":[0.9132041,0.0001036811,0.0857093,0.0006413755,0.0002771569,0.000001407213,9.138197e-7,0.00000549674,0.00005651061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.808122,"threshold_uncertainty_score":0.5202318,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001631538,0.00005234661,0.0001116319,0.0001017548,0.00007985595,0.00001207134,0.00005373329,0.0000174579,0.000002493373],"category_scores_gemma":[0.00004616669,0.00004206026,0.00001572691,0.0002248199,0.00002031043,0.0004317282,0.0000510759,0.00005257542,0.000002932672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001071471,"about_ca_system_score_gemma":0.00003756705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000748803,"about_ca_topic_score_gemma":0.000003107584,"domain_scores_codex":[0.9993877,0.00002917098,0.000300782,0.00009551946,0.0001320013,0.00005478913],"domain_scores_gemma":[0.9992275,0.0001466907,0.0002610263,0.00006201092,0.0002635301,0.00003919555],"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.000008234883,0.00003129059,0.0008170499,0.00001367958,0.000006004636,0.000002235132,0.0000733171,0.01413284,0.0005660638,0.9802773,0.000437836,0.00363412],"study_design_scores_gemma":[0.002320818,0.001672214,0.220819,0.0004395759,0.0001135874,0.001298578,0.0005058769,0.2042976,0.0007485872,0.4561433,0.1108373,0.0008035716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0212747,0.001000699,0.9766492,0.0006060505,0.00005301329,0.00009459018,0.00001000642,0.00000882257,0.0003029743],"genre_scores_gemma":[0.6868128,0.00003306444,0.312943,0.0000629925,0.00006930703,0.000002306297,0.00001180763,0.000001951693,0.00006282215],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6655381,"threshold_uncertainty_score":0.1715168,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001652285,0.00004953823,0.0001552211,0.00008851435,0.00002258539,0.00002941898,0.000082928,0.00003807912,0.000008332637],"category_scores_gemma":[0.0000875624,0.00004365878,0.00003346175,0.0002476443,0.00005058702,0.0002814896,0.00002489156,0.0001228877,7.717269e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357655,"about_ca_system_score_gemma":0.0000306182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002917125,"about_ca_topic_score_gemma":5.792722e-7,"domain_scores_codex":[0.9993266,0.00007191201,0.0003357598,0.00008088051,0.000133245,0.00005161126],"domain_scores_gemma":[0.9994208,0.0000662625,0.0003207368,0.00003460053,0.0001101525,0.00004746265],"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.0003426452,0.0002279603,0.01777758,0.0001324713,0.00006577028,0.00003966761,0.00880076,0.2285163,0.005171176,0.3313247,0.000205177,0.4073958],"study_design_scores_gemma":[0.0009661217,0.000484422,0.07554845,0.00006746848,0.000009081846,0.00007650491,0.0002764236,0.7536958,0.0002911547,0.1684419,0.00003501643,0.0001076345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1706652,0.0000475866,0.8257924,0.003286961,0.0001068575,0.00004106545,2.225544e-7,0.000008775747,0.00005090598],"genre_scores_gemma":[0.7891191,0.00003629966,0.2105717,0.0002419393,0.00002886162,1.358321e-7,4.330692e-7,0.000001153848,4.096253e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6184539,"threshold_uncertainty_score":0.1780353,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004866348,0.00006889724,0.0001194132,0.0001582814,0.0001679126,0.00009463737,0.00009988745,0.00004823214,6.712849e-7],"category_scores_gemma":[0.00003868428,0.00005513792,0.00003232869,0.0002317034,0.00004659304,0.0005577558,0.00003178625,0.0001207539,4.237479e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002130489,"about_ca_system_score_gemma":0.00002338887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006750705,"about_ca_topic_score_gemma":0.000004750653,"domain_scores_codex":[0.9992974,0.00004306794,0.0002288342,0.0001307056,0.0001678885,0.0001321141],"domain_scores_gemma":[0.9991279,0.0001902422,0.0002419902,0.000053203,0.000344448,0.00004223724],"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.0002700588,0.0002357105,0.002847631,0.0002011543,0.000050496,0.00003342848,0.0006095854,0.06976408,0.001498632,0.8243426,0.001788641,0.09835796],"study_design_scores_gemma":[0.0005487792,0.000580088,0.007222229,0.00002717703,0.000006468793,0.0001678929,0.00003370069,0.05765843,0.00008150092,0.9330261,0.0005781131,0.00006956678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06048594,0.0007098495,0.9373898,0.0008902794,0.0001078533,0.0001482743,6.305523e-7,0.00001396702,0.0002533996],"genre_scores_gemma":[0.8473278,0.00009130879,0.1524038,0.00005860145,0.00005132197,0.00000387438,0.000001367887,0.000004047006,0.00005784802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7868419,"threshold_uncertainty_score":0.2248459,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819326,0.0000677291,0.0001392502,0.00007829075,0.0001323736,0.00004101975,0.000169465,0.00003275384,0.000005228556],"category_scores_gemma":[0.0000370085,0.00004711976,0.00005201553,0.0001236222,0.00002790626,0.000317451,0.00006208859,0.00009063211,0.000009797131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002395365,"about_ca_system_score_gemma":0.00004610117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001511739,"about_ca_topic_score_gemma":1.212368e-7,"domain_scores_codex":[0.9992872,0.00004130275,0.0002800266,0.00009107243,0.0002060331,0.00009436595],"domain_scores_gemma":[0.99935,0.00004785617,0.0002761899,0.00006631644,0.0001907672,0.00006883546],"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.00009039007,0.0003487853,0.004701489,0.00008620405,0.00009447186,0.0005468508,0.01035199,0.01805075,0.000568037,0.2716385,0.03330853,0.6602141],"study_design_scores_gemma":[0.006426479,0.007809042,0.1019812,0.0004897723,0.00008423813,0.009721377,0.0004450532,0.6221393,0.001099377,0.1970169,0.05168426,0.001103073],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04389852,0.001028868,0.9500914,0.0003761035,0.0003075173,0.00004349165,4.409842e-8,0.00001698793,0.004237053],"genre_scores_gemma":[0.9724608,0.0005204098,0.02644661,0.000252229,0.0001410454,2.251893e-7,4.529858e-7,0.000001853494,0.0001763734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9285623,"threshold_uncertainty_score":0.1921488,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001046837,0.0001026857,0.0001827998,0.00005650119,0.0004134179,0.0001363017,0.0002445797,0.00004098076,0.000001075677],"category_scores_gemma":[0.0001309239,0.00006695768,0.00004956142,0.0001668514,0.0001128041,0.0003897548,0.0001855454,0.0001654132,0.000001717328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003808649,"about_ca_system_score_gemma":0.00006410279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004575634,"about_ca_topic_score_gemma":8.434943e-7,"domain_scores_codex":[0.998881,0.0001188672,0.0003929363,0.0002004755,0.0002482668,0.0001584251],"domain_scores_gemma":[0.9988203,0.0004450163,0.0002762068,0.0001506767,0.0002243481,0.00008341844],"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.0000727346,0.0001941472,0.006670506,0.00005080648,0.00007870774,0.0001385599,0.004984125,0.03598783,0.0006502121,0.004979579,0.0007644805,0.9454283],"study_design_scores_gemma":[0.0004141999,0.000315158,0.05348057,0.00001812484,0.000008013813,0.001646225,0.00006106203,0.8481184,0.00005018841,0.09555569,0.0002108117,0.0001215774],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5704387,0.0006068668,0.4274947,0.001102526,0.0001660054,0.0000684488,2.209746e-7,0.00002236894,0.0001002283],"genre_scores_gemma":[0.9323511,0.0001255312,0.06732684,0.00009367813,0.00008440877,6.304231e-7,2.94397e-7,0.000003248568,0.00001424549],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9453067,"threshold_uncertainty_score":0.3179718,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002097428,0.00008131177,0.0001692795,0.0000523842,0.00008518565,0.00008286073,0.0001021608,0.00004958011,0.000003183143],"category_scores_gemma":[0.00004565655,0.00005546093,0.00003832574,0.0001763114,0.0000386701,0.0003228849,0.00008322056,0.0001468992,0.00000137586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001122616,"about_ca_system_score_gemma":0.00004422313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.141717e-7,"about_ca_topic_score_gemma":2.298198e-7,"domain_scores_codex":[0.9993185,0.0000770114,0.0002725688,0.0001304158,0.0001030423,0.00009840925],"domain_scores_gemma":[0.9993421,0.0001298084,0.0002310011,0.00006080473,0.0001669846,0.00006925696],"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.00002037448,0.0001426561,0.0009680321,0.00002154076,0.0000591039,0.0003469113,0.001832344,0.00294677,0.001635006,0.430798,0.0003066266,0.5609226],"study_design_scores_gemma":[0.0008894896,0.000427048,0.008683586,0.00002419924,0.000008743209,0.001791102,0.0003154889,0.03966816,0.0002785788,0.9473989,0.0004027897,0.0001119356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2624477,0.002533428,0.7332382,0.001197167,0.0001674309,0.00002209553,2.507415e-7,0.00001626725,0.0003774691],"genre_scores_gemma":[0.9629787,0.0003274378,0.03616318,0.0004561138,0.00004653708,2.15907e-7,0.000001023517,0.000002411807,0.00002438685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7005311,"threshold_uncertainty_score":0.2261631,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005848404,0.0002114989,0.0005109892,0.0001270979,0.00007463701,0.0001327165,0.0002119098,0.0001357053,0.00002836392],"category_scores_gemma":[0.0003555002,0.0001403766,0.00007800129,0.0001197201,0.00009377808,0.0001245861,0.0002170407,0.000910926,0.000004439577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006334351,"about_ca_system_score_gemma":0.0002712463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.909251e-7,"about_ca_topic_score_gemma":5.257563e-7,"domain_scores_codex":[0.9984042,0.0002742839,0.0004822423,0.0002167201,0.0004727043,0.0001498468],"domain_scores_gemma":[0.9983881,0.0003787742,0.0004581066,0.0001175118,0.0005030768,0.0001545069],"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.002302574,0.0008268447,0.0009342798,0.002743206,0.001786654,0.002035071,0.007197944,0.024208,0.001585496,0.8332352,0.002876105,0.1202686],"study_design_scores_gemma":[0.0007513359,0.0007033319,0.0003843222,0.0002552826,0.0001227973,0.0002928081,0.0004236837,0.00458866,0.0001486602,0.992076,0.00005067907,0.0002024781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.37359,0.0009670014,0.6231738,0.001428358,0.0001476789,0.0002871006,0.000005097824,0.00002629651,0.0003746363],"genre_scores_gemma":[0.8678325,0.0001001591,0.1314774,0.0002439502,0.0002685921,0.000005205203,0.000003308396,0.00002984601,0.00003906887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4942425,"threshold_uncertainty_score":0.5724391,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004990866,0.0002019388,0.000459927,0.0001176078,0.00009524864,0.0003004275,0.0005887708,0.0004405889,0.000002842645],"category_scores_gemma":[0.0004682513,0.0001524503,0.0001467952,0.0001750158,0.00003888044,0.0003478247,0.0001751717,0.000807173,0.00001676525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006014242,"about_ca_system_score_gemma":0.0004465115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003015761,"about_ca_topic_score_gemma":6.05738e-7,"domain_scores_codex":[0.9981424,0.000123468,0.000498049,0.0002472814,0.0008277697,0.0001609841],"domain_scores_gemma":[0.9974819,0.0005678426,0.0008842929,0.00009836545,0.0008090878,0.0001585218],"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.00002397608,0.0000272929,0.000004044716,0.0000319111,0.00003290473,0.00003031159,0.0003351727,0.00005447265,0.000004724925,0.00229758,0.9880328,0.00912482],"study_design_scores_gemma":[0.000697514,0.0007655411,0.00002017041,0.00006057965,0.00004069564,0.00002287718,0.00001800828,0.00217316,0.000003997083,0.02440711,0.9716037,0.0001866468],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.000006628377,0.0006795434,0.2582336,0.0002323068,0.7396867,0.00004234136,0.000001871732,0.00002621727,0.001090839],"genre_scores_gemma":[0.001600556,0.0002377414,0.007191897,0.00005560247,0.9908319,8.16974e-7,0.000009494448,0.000009034168,0.00006296705],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.2511452,"threshold_uncertainty_score":0.6216743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283446,0.0001336285,0.0003758752,0.00009693519,0.0001040223,0.00009372606,0.0003543086,0.0000599567,0.000009844498],"category_scores_gemma":[0.0001479639,0.000111849,0.000134276,0.0004633464,0.00008321479,0.0004863149,0.0001593323,0.0002272966,0.000002873559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003934807,"about_ca_system_score_gemma":0.0001035899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007401978,"about_ca_topic_score_gemma":9.533002e-7,"domain_scores_codex":[0.9983603,0.000185005,0.000693607,0.0002481795,0.0003562505,0.0001566802],"domain_scores_gemma":[0.9983317,0.0002908528,0.0005463899,0.0001321964,0.0005374369,0.000161449],"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.0001029886,0.000645521,0.01474711,0.0002310728,0.0001359334,0.00004956047,0.004569383,0.3792535,0.003203997,0.01291219,0.001314639,0.5828341],"study_design_scores_gemma":[0.0009274735,0.001356789,0.03971503,0.0000310094,0.00003649705,0.0001748258,0.000251184,0.9060181,0.0005211163,0.05033354,0.0004235379,0.0002109098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1635793,0.0003579403,0.8328636,0.002523396,0.000332742,0.0000905691,0.000001461349,0.00003627563,0.0002147213],"genre_scores_gemma":[0.8919393,0.00001426218,0.1075345,0.000310451,0.0001918649,5.689699e-7,0.000001017617,0.000004231654,0.000003722728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7283601,"threshold_uncertainty_score":0.4561071,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004777219,0.0001044892,0.0002615332,0.000215748,0.00005334723,0.00003495444,0.0002252202,0.00005201119,0.00001023965],"category_scores_gemma":[0.00008328527,0.00008139147,0.00005634629,0.0002262752,0.00004628455,0.0002634309,0.0000459957,0.0001912896,0.000008049798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002955531,"about_ca_system_score_gemma":0.00003656239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001522703,"about_ca_topic_score_gemma":8.793872e-7,"domain_scores_codex":[0.9988442,0.0001456725,0.0004583581,0.0001494329,0.0002772647,0.0001250604],"domain_scores_gemma":[0.9989682,0.0002986891,0.0004563511,0.0000649479,0.000154241,0.00005753194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006877208,0.0002153845,0.00104139,0.00002095298,0.00001244736,0.0000354492,0.0006091319,0.4668855,0.00004059296,0.2406176,0.0009829921,0.2894698],"study_design_scores_gemma":[0.001362778,0.001441318,0.05908402,0.00008009367,0.000006877587,0.000149743,0.0001052868,0.1890525,0.00005815037,0.7469979,0.001497321,0.0001640455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07883133,0.00007743781,0.9156051,0.001143343,0.0005371536,0.00006685564,5.063009e-7,0.00001115442,0.003727171],"genre_scores_gemma":[0.9378136,0.00001814509,0.06036331,0.0005200778,0.00125755,4.97652e-7,0.000001280765,0.000003252446,0.00002231807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8589823,"threshold_uncertainty_score":0.3319048,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002983403,0.00005760427,0.0001533066,0.000125017,0.00004911301,0.00003954052,0.0001564597,0.00004560069,0.000002338023],"category_scores_gemma":[0.00006443363,0.00004223826,0.00004912703,0.0001683612,0.00002903087,0.0001957216,0.00005308256,0.00007995281,0.000001076409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001767984,"about_ca_system_score_gemma":0.00006741749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006202452,"about_ca_topic_score_gemma":0.000001864081,"domain_scores_codex":[0.9993786,0.00005727487,0.0002979944,0.00008000926,0.0001195943,0.00006653985],"domain_scores_gemma":[0.9992045,0.0001070844,0.0003340314,0.00005499913,0.0002725977,0.00002678495],"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.00007344769,0.0002447718,0.01786125,0.00008789277,0.00007331908,0.00001882015,0.001628061,0.007412295,0.001320061,0.4790905,0.00150706,0.4906826],"study_design_scores_gemma":[0.001203608,0.00084698,0.1235421,0.0001074574,0.00003982307,0.00007393964,0.0001273252,0.4047555,0.0007552113,0.4677232,0.0006850727,0.000139776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04250652,0.0005036325,0.9518669,0.0003647612,0.0003768656,0.00003684233,1.538311e-7,0.000009516509,0.004334835],"genre_scores_gemma":[0.9740996,0.00005248588,0.0256179,0.0001104539,0.0000620734,2.311616e-7,4.519271e-7,0.000001020345,0.00005579684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9315931,"threshold_uncertainty_score":0.1722426,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004037333,0.000099677,0.0002143836,0.0002708562,0.00007717344,0.00009630289,0.0002482564,0.00005217686,0.000006024142],"category_scores_gemma":[0.00007072924,0.0000764566,0.00005413313,0.000432694,0.00004614125,0.0005371043,0.00007827811,0.000168976,0.000004787782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005144127,"about_ca_system_score_gemma":0.0001169013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002254347,"about_ca_topic_score_gemma":0.000005504376,"domain_scores_codex":[0.9990399,0.00009303615,0.0003901633,0.0001591241,0.000183909,0.0001338217],"domain_scores_gemma":[0.9991814,0.0002438704,0.0002496186,0.00005745986,0.0002205573,0.0000471199],"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.000037494,0.0001831589,0.007632975,0.0000529987,0.00001908379,0.00007037957,0.0005967567,0.08623711,0.00001939951,0.6215315,0.001483895,0.2821352],"study_design_scores_gemma":[0.0008521219,0.0002315152,0.02841551,0.00008800161,0.000008157979,0.00008813461,0.0001173316,0.1764,0.000008741177,0.7919444,0.001737622,0.0001084238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008292584,0.005136144,0.9702511,0.001352121,0.0007037445,0.00006544107,2.853176e-7,0.00001768119,0.01418085],"genre_scores_gemma":[0.9585249,0.0004008679,0.04036983,0.0004856212,0.00006961123,0.000001309087,0.000001033431,0.000001908949,0.0001448676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9502324,"threshold_uncertainty_score":0.311781,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003528962,0.0001153775,0.0002077702,0.0001052528,0.0001677034,0.0000806586,0.0003122711,0.00006074385,0.00002854988],"category_scores_gemma":[0.00005279169,0.00008856498,0.00007913294,0.0002797737,0.00005053339,0.0004869123,0.000154885,0.000201232,0.00001346213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000388587,"about_ca_system_score_gemma":0.00006281232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001808885,"about_ca_topic_score_gemma":3.515769e-7,"domain_scores_codex":[0.9988642,0.0001217629,0.0003916307,0.0001965957,0.0002488555,0.0001769758],"domain_scores_gemma":[0.9990373,0.0001473701,0.0003003466,0.0001368152,0.0002345837,0.0001435643],"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.0002318435,0.003703312,0.02212995,0.0001146232,0.0003208577,0.0003421441,0.01334129,0.01861492,0.00339955,0.08737054,0.1064079,0.744023],"study_design_scores_gemma":[0.002253345,0.003610577,0.0698737,0.00008539433,0.0001003243,0.001825761,0.0009272638,0.4074612,0.000570191,0.5038304,0.008662868,0.0007990038],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02425935,0.0004082881,0.9727197,0.0004782912,0.0004484079,0.00006676642,0.000001459295,0.00004587405,0.001571815],"genre_scores_gemma":[0.8489799,0.00002154778,0.1506484,0.0001996885,0.00007345097,0.000001919347,0.000001435704,0.000004272134,0.00006936656],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8247206,"threshold_uncertainty_score":0.3611575,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124505,0.00007906456,0.0001548215,0.0001951226,0.0001261357,0.0001866513,0.0002066656,0.00005290012,0.00000569487],"category_scores_gemma":[0.00008772925,0.00006712346,0.00005194311,0.0003253319,0.00002833618,0.001283543,0.00009983786,0.0001558488,0.000008866939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006994558,"about_ca_system_score_gemma":0.000103899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002796963,"about_ca_topic_score_gemma":0.000001371567,"domain_scores_codex":[0.999119,0.00009214933,0.0004183776,0.00009744516,0.000182804,0.00009018122],"domain_scores_gemma":[0.9988688,0.000324391,0.0003003427,0.00008863377,0.0003740489,0.00004376899],"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.00004729968,0.0001836803,0.006105368,0.00002107744,0.0001308444,0.00001565396,0.003645443,0.04780083,0.000153231,0.1581062,0.003635177,0.7801552],"study_design_scores_gemma":[0.0006414577,0.0001897808,0.1194716,0.00005087695,0.00002436956,0.00003034549,0.0001478253,0.3592945,0.0001065472,0.5190937,0.0008442238,0.0001047581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03775312,0.0002714022,0.956363,0.002660266,0.0004710514,0.00008013743,0.000002049252,0.00002689866,0.002372106],"genre_scores_gemma":[0.8610445,0.0000173629,0.1382933,0.0005532101,0.00005261069,9.638142e-7,0.000005276751,0.000001139448,0.00003162605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8232914,"threshold_uncertainty_score":0.2737215,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876857,0.00007539906,0.0002223961,0.0001820665,0.0000698868,0.00007049678,0.0001543698,0.0000688209,0.000004562076],"category_scores_gemma":[0.0001975743,0.00005617425,0.0000655499,0.0008763285,0.00001509565,0.0002240669,0.00004135507,0.00006061226,0.000004613057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001468968,"about_ca_system_score_gemma":0.00005463008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002529893,"about_ca_topic_score_gemma":0.000001181335,"domain_scores_codex":[0.9990312,0.00007982295,0.0004406379,0.000111204,0.000200978,0.0001361971],"domain_scores_gemma":[0.9985423,0.0002631912,0.000592732,0.00006953364,0.0004874595,0.00004476635],"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.0001331961,0.000330369,0.009599193,0.0003795247,0.0001679366,0.00004040809,0.003212221,0.002889562,0.0007327079,0.9083993,0.004523637,0.06959198],"study_design_scores_gemma":[0.003409181,0.0008832108,0.01917385,0.00002543219,0.00003784518,0.000189063,0.0004292392,0.3916892,0.0001880618,0.580784,0.002978602,0.000212363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.070225,0.00009390067,0.9287862,0.0001656486,0.0002892772,0.0001693651,0.000001192675,0.00003866693,0.0002308146],"genre_scores_gemma":[0.9679592,0.00002941354,0.03179875,0.00005792725,0.00006599773,0.000004087428,0.000007836524,0.000004031957,0.00007281479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8977342,"threshold_uncertainty_score":0.2290719,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356801,0.00008447515,0.0002014411,0.0001122752,0.0001300934,0.000119762,0.0003866135,0.00003483424,0.00002283057],"category_scores_gemma":[0.0001016669,0.00006031957,0.00006129666,0.0004161847,0.0001737823,0.000375148,0.000115655,0.0001332451,0.00001810198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002486635,"about_ca_system_score_gemma":0.0001148878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.389831e-7,"about_ca_topic_score_gemma":2.049355e-7,"domain_scores_codex":[0.9989669,0.00005418698,0.0003318939,0.0001745041,0.0003508507,0.0001216374],"domain_scores_gemma":[0.9989915,0.0001259423,0.000334558,0.00006736373,0.0003455898,0.0001349727],"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.00009529547,0.0003704001,0.001266258,0.00004116109,0.00003483758,0.00006685105,0.005810222,0.01444325,0.0006597475,0.3279073,0.01297775,0.6363269],"study_design_scores_gemma":[0.00286741,0.009477151,0.06623376,0.0001349933,0.00005157335,0.0003718389,0.0002902481,0.7816833,0.001261002,0.1135522,0.0235277,0.0005488539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02749963,0.00004454777,0.9608288,0.002373256,0.0008261026,0.00006236394,4.298204e-7,0.00001660042,0.008348241],"genre_scores_gemma":[0.9437085,0.00001850643,0.05155349,0.0007758355,0.003929653,2.608517e-7,4.410436e-7,0.00000214724,0.00001119825],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9162089,"threshold_uncertainty_score":0.245976,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001843692,0.00008855676,0.0001763863,0.00006324234,0.0001362025,0.0001131234,0.0002350527,0.00004029061,0.000004316835],"category_scores_gemma":[0.0001019466,0.00006221588,0.00003857493,0.0002267511,0.00002331228,0.0002888155,0.0001240954,0.0001187344,0.00000552448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001533067,"about_ca_system_score_gemma":0.00004520731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002163206,"about_ca_topic_score_gemma":4.594964e-7,"domain_scores_codex":[0.9991084,0.00005201019,0.0002999835,0.0001555579,0.0002659777,0.0001180454],"domain_scores_gemma":[0.9992446,0.0001038426,0.0002272771,0.00004690863,0.0002612739,0.0001161121],"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.0003668533,0.0006598276,0.009773004,0.0003669118,0.0001849404,0.0006553745,0.01688619,0.3936236,0.00579078,0.06110624,0.01693494,0.4936514],"study_design_scores_gemma":[0.0008595579,0.001684254,0.01691901,0.000138325,0.00001890737,0.0003244156,0.000310352,0.9459591,0.000509917,0.03199852,0.001050344,0.0002273264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01993565,0.0002609889,0.9563856,0.02292849,0.0001804518,0.0001088883,3.661762e-7,0.00003020132,0.0001694347],"genre_scores_gemma":[0.698037,0.000009584308,0.2999779,0.001793343,0.0001726982,0.000001183248,7.504663e-7,0.000002380534,0.000005144624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6781013,"threshold_uncertainty_score":0.253709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}