{"meta":{"query_hash":"21dc33dc3221","filters":{"venue":"Journal of Logic and Computation"},"cohort_total":27,"direct_labels_cover":1,"predictions_cover":27,"exported":27,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/21dc33dc3221","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Logic+and+Computation"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.052531346816544776,"score_gpt":0.31014090831566865,"score_spread":0.2576095614991239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967675407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021274703,0.0010006994,0.97664917,0.0006060505,0.000053013293,0.00009459018,0.000010006422,0.00000882257,0.0003029743],"genre_scores_gemma":[0.68681276,0.00003306444,0.31294298,0.0000629925,0.00006930703,0.0000023062971,0.000011807628,0.0000019516926,0.00006282215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938774,0.000029170978,0.00030078203,0.00009551946,0.00013200131,0.000054789132],"domain_scores_gemma":[0.9992275,0.00014669068,0.00026102632,0.00006201092,0.0002635301,0.000039195547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016315383,0.00005234661,0.00011163186,0.0001017548,0.00007985595,0.0000120713385,0.000053733293,0.0000174579,0.0000024933727],"category_scores_gemma":[0.000046166686,0.00004206026,0.000015726911,0.00022481992,0.000020310428,0.00043172823,0.0000510759,0.00005257542,0.000002932672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008234883,0.000031290594,0.00081704993,0.000013679575,0.0000060046364,0.0000022351317,0.000073317104,0.014132843,0.0005660638,0.9802773,0.000437836,0.00363412],"study_design_scores_gemma":[0.002320818,0.0016722135,0.22081903,0.00043957593,0.00011358745,0.0012985785,0.0005058769,0.2042976,0.00074858725,0.4561433,0.11083729,0.0008035716],"about_ca_topic_score_codex":0.00000748803,"about_ca_topic_score_gemma":0.0000031075836,"teacher_disagreement_score":0.6655381,"about_ca_system_score_codex":0.000010714707,"about_ca_system_score_gemma":0.00003756705,"threshold_uncertainty_score":0.17151676},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Library science; Computer science; Operations research; Information retrieval; World Wide Web; Sociology; Mathematics","score_opus":0.046648173634884736,"score_gpt":0.3304637165551217,"score_spread":0.283815542920237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017468133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41471884,0.00095247134,0.5839078,0.00003820714,0.00014251626,0.000032981578,7.547495e-8,0.0000065348418,0.00020059863],"genre_scores_gemma":[0.7025121,0.000018246372,0.29723194,0.000051909465,0.00017821403,5.811016e-7,2.5401926e-7,0.0000018815605,0.0000048954525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930674,0.000038448874,0.00026519867,0.00012552529,0.00011073239,0.00015333324],"domain_scores_gemma":[0.9991985,0.0003523662,0.00025245748,0.00003532331,0.0000984517,0.00006287956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074861373,0.00007587017,0.00015596538,0.00012487032,0.00009467959,0.00013606866,0.00010765897,0.000065137305,3.989081e-7],"category_scores_gemma":[0.00015850144,0.000057815938,0.00002424895,0.00011104166,0.00002621297,0.0003135306,0.000043124193,0.0001365115,1.0647444e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002409562,0.00015079784,0.14239712,0.000108683256,0.000049995648,0.00018857063,0.026886988,0.00965799,0.00077555486,0.3254587,0.00026755978,0.49381706],"study_design_scores_gemma":[0.0011962637,0.00069123803,0.23482838,0.000571062,0.00001656957,0.00032190423,0.0011389969,0.18662988,0.00028360836,0.5739718,0.00010449697,0.00024580513],"about_ca_topic_score_codex":0.0000036988229,"about_ca_topic_score_gemma":0.0000022042943,"teacher_disagreement_score":0.49357125,"about_ca_system_score_codex":0.00001933381,"about_ca_system_score_gemma":0.00003278426,"threshold_uncertainty_score":0.23576654},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.2584475929139776,"score_gpt":0.3542187284267333,"score_spread":0.09577113551275568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034609074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25742555,0.00015211514,0.74198484,0.000070128255,0.00016803762,0.000029540655,6.546306e-8,0.000014139336,0.00015559349],"genre_scores_gemma":[0.50670785,0.00003527536,0.49312505,0.00008860081,0.00003685769,1.6663343e-7,1.3330856e-7,0.0000015111677,0.000004551118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992251,0.00007840146,0.00030407042,0.00009737861,0.00020296266,0.00009208609],"domain_scores_gemma":[0.9992801,0.00002551858,0.0003834566,0.000067056295,0.00019989641,0.00004399799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006979,0.000066441404,0.00012179548,0.00012060514,0.00014226467,0.000051395673,0.00015879347,0.000044569562,6.015276e-7],"category_scores_gemma":[0.00004959069,0.000055099277,0.000038999213,0.0001635032,0.000037465303,0.000894234,0.000039469815,0.000113786504,9.882042e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033334032,0.00009536426,0.0012931747,0.000025747366,0.000019583638,0.00004107882,0.0025533573,0.8147697,0.012626713,0.10960623,0.00010930732,0.058826454],"study_design_scores_gemma":[0.00017009978,0.00009406623,0.0035996852,0.000015978707,0.0000056580616,0.00068508805,0.000029543147,0.9253618,0.0002318805,0.06974013,0.0000070876563,0.000058967893],"about_ca_topic_score_codex":0.0000018159927,"about_ca_topic_score_gemma":7.2553796e-8,"teacher_disagreement_score":0.24928232,"about_ca_system_score_codex":0.0000550961,"about_ca_system_score_gemma":0.000054693293,"threshold_uncertainty_score":0.22468834},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024144604480013293,"score_gpt":0.26188223756999995,"score_spread":0.23773763308998666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034691511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13877004,0.0001998859,0.8601109,0.0004466631,0.000035334004,0.00003893435,1.316693e-7,0.0002311424,0.00016700073],"genre_scores_gemma":[0.6796269,0.000027458695,0.32024905,0.00006452539,0.000021923777,7.2584487e-7,2.50674e-7,0.0000015592769,0.000007658782],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995216,0.000039553935,0.00015845774,0.0000779249,0.00014810018,0.000054327713],"domain_scores_gemma":[0.9992525,0.000119176286,0.00025203323,0.000055695,0.00028836905,0.00003221872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018180761,0.000054212185,0.000107195345,0.00007117557,0.00009524948,0.000040161263,0.0001027145,0.000023081415,4.3188197e-7],"category_scores_gemma":[0.000042190957,0.00003735483,0.00001395124,0.0002147523,0.000042662137,0.00028792606,0.00001316971,0.00006503052,9.817512e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070421345,0.0015186873,0.109337315,0.00019749021,0.00039367212,0.001478543,0.062041342,0.026511878,0.0027176496,0.07084962,0.08404407,0.6402055],"study_design_scores_gemma":[0.0027893155,0.0063235876,0.36187708,0.0004086702,0.0000682565,0.009741308,0.00042600444,0.20029023,0.0028258003,0.41360727,0.00085875764,0.0007837234],"about_ca_topic_score_codex":0.0000022710976,"about_ca_topic_score_gemma":1.3432172e-7,"teacher_disagreement_score":0.6394218,"about_ca_system_score_codex":0.00001346102,"about_ca_system_score_gemma":0.00006941161,"threshold_uncertainty_score":0.15232857},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04146586588425641,"score_gpt":0.3086231164052781,"score_spread":0.2671572505210217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051119578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19756722,0.0005264812,0.7992527,0.0008389065,0.00022548948,0.000062420484,5.0871744e-8,0.0000068044083,0.0015199262],"genre_scores_gemma":[0.99454355,0.000032435124,0.0046596876,0.0005140777,0.00024101332,6.5031145e-7,3.9417333e-7,0.0000012070275,0.000006998048],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993626,0.000070227106,0.0002138536,0.00007052614,0.00017936018,0.000103434846],"domain_scores_gemma":[0.9995029,0.00014176819,0.00018068796,0.000046822723,0.00009651056,0.000031304462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012539625,0.000051852363,0.00008690219,0.00009699928,0.000057596266,0.000065364526,0.00018417137,0.000034748744,0.0000011771374],"category_scores_gemma":[0.000036605885,0.000030729385,0.00003086074,0.00020930632,0.000018226283,0.00030244933,0.000026092612,0.0001113012,0.0000030831625],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003778555,0.00020713298,0.010206831,0.000015965225,0.0000125268825,0.00019960076,0.029592648,0.0004710153,0.00016018255,0.1767655,0.00046191394,0.7818689],"study_design_scores_gemma":[0.0010979676,0.00070207956,0.8070086,0.00004155241,0.000013308135,0.00060977193,0.00086521695,0.11544406,0.000065111504,0.07323734,0.0007615021,0.00015348934],"about_ca_topic_score_codex":0.000011671887,"about_ca_topic_score_gemma":0.000022297145,"teacher_disagreement_score":0.7969763,"about_ca_system_score_codex":0.00002489825,"about_ca_system_score_gemma":0.00001834075,"threshold_uncertainty_score":0.1253108},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rationality; Belief revision; Computer science; Space (punctuation); Operator (biology); Reinforcement learning; Artificial intelligence; Epistemology","score_opus":0.03146668548599047,"score_gpt":0.2689124663159305,"score_spread":0.23744578082994006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070000914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04389852,0.001028868,0.9500914,0.00037610353,0.00030751733,0.00004349165,4.4098424e-8,0.00001698793,0.004237053],"genre_scores_gemma":[0.9724608,0.0005204098,0.026446609,0.00025222896,0.0001410454,2.2518925e-7,4.529858e-7,0.000001853494,0.00017637345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992872,0.000041302752,0.00028002658,0.00009107243,0.0002060331,0.000094365954],"domain_scores_gemma":[0.99935,0.00004785617,0.00027618985,0.00006631644,0.00019076721,0.000068835456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028193256,0.0000677291,0.00013925025,0.00007829075,0.00013237358,0.000041019746,0.00016946495,0.00003275384,0.0000052285563],"category_scores_gemma":[0.000037008496,0.00004711976,0.00005201553,0.00012362223,0.000027906259,0.00031745105,0.00006208859,0.000090632115,0.0000097971315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090390065,0.00034878525,0.0047014887,0.000086204054,0.00009447186,0.0005468508,0.010351987,0.018050745,0.000568037,0.27163848,0.03330853,0.66021407],"study_design_scores_gemma":[0.0064264787,0.0078090425,0.1019812,0.0004897723,0.00008423813,0.009721377,0.00044505316,0.6221393,0.0010993767,0.19701687,0.051684257,0.0011030727],"about_ca_topic_score_codex":0.0000015117391,"about_ca_topic_score_gemma":1.2123677e-7,"teacher_disagreement_score":0.9285623,"about_ca_system_score_codex":0.000023953646,"about_ca_system_score_gemma":0.000046101166,"threshold_uncertainty_score":0.1921488},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reflexivity; Order (exchange); Mathematics; Star product; Combinatorics; Computer science; Discrete mathematics; Sociology; Business","score_opus":0.033400100698425625,"score_gpt":0.3163988984890406,"score_spread":0.282998797790615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098354393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060485944,0.00070984947,0.9373898,0.0008902794,0.00010785334,0.00014827427,6.3055234e-7,0.000013967024,0.00025339963],"genre_scores_gemma":[0.8473278,0.000091308786,0.15240379,0.00005860145,0.00005132197,0.0000038743797,0.0000013678872,0.0000040470063,0.000057848025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.000043067936,0.00022883421,0.00013070558,0.00016788852,0.00013211415],"domain_scores_gemma":[0.99912786,0.00019024224,0.00024199017,0.000053203,0.000344448,0.000042237236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048663476,0.000068897236,0.00011941324,0.00015828144,0.00016791264,0.00009463737,0.00009988745,0.000048232137,6.7128485e-7],"category_scores_gemma":[0.000038684277,0.00005513792,0.00003232869,0.00023170336,0.000046593035,0.00055775576,0.00003178625,0.000120753924,4.237479e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027005875,0.00023571045,0.0028476315,0.00020115431,0.000050495997,0.000033428478,0.0006095854,0.06976408,0.0014986324,0.8243426,0.0017886406,0.09835796],"study_design_scores_gemma":[0.0005487792,0.000580088,0.0072222287,0.000027177028,0.000006468793,0.00016789293,0.000033700686,0.05765843,0.00008150092,0.9330261,0.00057811313,0.000069566784],"about_ca_topic_score_codex":0.000006750705,"about_ca_topic_score_gemma":0.0000047506533,"teacher_disagreement_score":0.78684187,"about_ca_system_score_codex":0.000021304886,"about_ca_system_score_gemma":0.000023388866,"threshold_uncertainty_score":0.22484592},"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":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030560743984238314,"score_gpt":0.2893305849371426,"score_spread":0.2587698409529043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100078804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10508214,0.0020762067,0.88627577,0.0011729724,0.00037094933,0.000091471156,3.5770626e-7,0.00004007095,0.0048900577],"genre_scores_gemma":[0.91320413,0.00010368114,0.0857093,0.0006413755,0.00027715688,0.0000014072131,9.138197e-7,0.0000054967404,0.000056510613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842256,0.00018189267,0.00056824135,0.0002533758,0.00029194768,0.00028200864],"domain_scores_gemma":[0.99884796,0.00019288616,0.00049066544,0.00012423474,0.00022212967,0.00012209332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334146,0.00017216278,0.000319776,0.00023456785,0.00013328678,0.0002151694,0.00040512733,0.00011912292,0.00001138097],"category_scores_gemma":[0.00012983233,0.00012757402,0.00008531383,0.00032109127,0.00005212641,0.0008083858,0.00012372689,0.00028640343,0.000021214366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014262304,0.0010967742,0.00932544,0.00009083761,0.0000804746,0.000742272,0.00831145,0.1040419,0.0032984256,0.16164057,0.003007176,0.70822203],"study_design_scores_gemma":[0.0031827965,0.0009112873,0.087429136,0.0002539779,0.00003671096,0.0015958017,0.0004050226,0.53619,0.00028779716,0.36784,0.0012960493,0.00057145633],"about_ca_topic_score_codex":0.000008825719,"about_ca_topic_score_gemma":0.000010173654,"teacher_disagreement_score":0.80812204,"about_ca_system_score_codex":0.00008901181,"about_ca_system_score_gemma":0.00008875285,"threshold_uncertainty_score":0.5202318},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038008121531624,"score_gpt":0.27673641460856807,"score_spread":0.23872829307694407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101208282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20787865,0.0009161399,0.7892473,0.0002849148,0.00029004095,0.000056064036,9.821241e-8,0.000028089433,0.0012987047],"genre_scores_gemma":[0.9475047,0.00011955887,0.052055974,0.00011954784,0.00013404051,8.027961e-7,3.9490524e-7,0.0000025725217,0.000062410545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.000050870003,0.00023612316,0.00010938064,0.00016771548,0.00012746366],"domain_scores_gemma":[0.99939007,0.00005932637,0.00023877354,0.00006216399,0.00017426902,0.000075388365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002457739,0.00007680895,0.0001468489,0.00008194825,0.00013269173,0.00006456862,0.00018529539,0.000040572584,0.000002299283],"category_scores_gemma":[0.000027531676,0.00005548822,0.00005795062,0.00015836024,0.000041070172,0.00035194418,0.00004800446,0.00011811094,0.000006319799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007028903,0.0004680706,0.022829732,0.00006311977,0.00013075654,0.0008469737,0.017606098,0.0053147464,0.00034506497,0.07707836,0.0076318146,0.867615],"study_design_scores_gemma":[0.0061648316,0.0058522117,0.23126774,0.00023019798,0.00010647207,0.01715034,0.001112106,0.48542166,0.0007981463,0.21231899,0.03824601,0.0013313091],"about_ca_topic_score_codex":0.0000022220436,"about_ca_topic_score_gemma":5.8996596e-7,"teacher_disagreement_score":0.86628366,"about_ca_system_score_codex":0.000022230002,"about_ca_system_score_gemma":0.0000653743,"threshold_uncertainty_score":0.2262744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01821009552509499,"score_gpt":0.2705068069005783,"score_spread":0.2522967113754833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111795230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088841856,0.0039854916,0.9057484,0.0005055037,0.0005678629,0.000074613075,2.7128756e-8,0.000013323433,0.0002629157],"genre_scores_gemma":[0.997681,0.00010504165,0.0019303709,0.00006551176,0.00019098129,7.862266e-7,1.3027324e-7,0.0000020391117,0.00002411439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993264,0.00013665861,0.00019109981,0.000059613933,0.00015328488,0.00013290986],"domain_scores_gemma":[0.99929756,0.00027907296,0.00022317532,0.000056025816,0.000071078975,0.000073085415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109204,0.000064991145,0.00012244853,0.000032122487,0.00015750171,0.00015473472,0.00011873792,0.00003445315,2.5927e-7],"category_scores_gemma":[0.000051666117,0.000033878736,0.000032181502,0.000081458915,0.000037665384,0.0002504493,0.000051933122,0.00008868537,0.0000024030119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028371296,0.000076658725,0.025225041,0.000073648196,0.00008844512,0.00002422343,0.0029691732,0.00013905294,0.00030635323,0.49818453,0.00075241306,0.4721321],"study_design_scores_gemma":[0.0052713584,0.006600944,0.284531,0.00008087245,0.00033616365,0.0075141676,0.0020710712,0.24943317,0.00082285784,0.40821445,0.033953134,0.0011707969],"about_ca_topic_score_codex":0.0000039989704,"about_ca_topic_score_gemma":6.3423283e-7,"teacher_disagreement_score":0.90883917,"about_ca_system_score_codex":0.000011764537,"about_ca_system_score_gemma":0.000011971018,"threshold_uncertainty_score":0.14921105},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05025316820857675,"score_gpt":0.2668335121783242,"score_spread":0.21658034396974743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113648859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024259353,0.00040828815,0.9727197,0.00047829116,0.00044840787,0.00006676642,0.0000014592953,0.000045874047,0.0015718153],"genre_scores_gemma":[0.8489799,0.00002154778,0.1506484,0.00019968854,0.000073450974,0.000001919347,0.0000014357042,0.0000042721335,0.000069366564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988642,0.000121762874,0.00039163066,0.00019659568,0.00024885553,0.00017697578],"domain_scores_gemma":[0.9990373,0.00014737014,0.00030034658,0.0001368152,0.0002345837,0.00014356429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003528962,0.0001153775,0.00020777018,0.00010525283,0.00016770343,0.0000806586,0.0003122711,0.000060743845,0.000028549885],"category_scores_gemma":[0.000052791685,0.00008856498,0.00007913294,0.0002797737,0.00005053339,0.00048691232,0.00015488495,0.00020123199,0.000013462128],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023184347,0.0037033116,0.022129953,0.00011462321,0.00032085768,0.0003421441,0.013341292,0.018614918,0.0033995495,0.08737054,0.10640792,0.744023],"study_design_scores_gemma":[0.0022533454,0.003610577,0.0698737,0.00008539433,0.000100324316,0.0018257613,0.00092726375,0.4074612,0.000570191,0.5038304,0.008662868,0.00079900376],"about_ca_topic_score_codex":0.000018088851,"about_ca_topic_score_gemma":3.5157694e-7,"teacher_disagreement_score":0.82472056,"about_ca_system_score_codex":0.0000388587,"about_ca_system_score_gemma":0.000062812316,"threshold_uncertainty_score":0.3611575},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025453387998572836,"score_gpt":0.32528112314136837,"score_spread":0.29982773514279554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143957355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117649436,0.0004445079,0.8784891,0.002783601,0.000083509636,0.000058670765,4.8834988e-8,0.0000051938823,0.00048597646],"genre_scores_gemma":[0.988237,0.0002977181,0.010491505,0.0009363112,0.000033668304,3.5675706e-7,6.410816e-8,5.752269e-7,0.0000027636424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931085,0.000054846332,0.00019049234,0.00012042784,0.00022406883,0.00009930605],"domain_scores_gemma":[0.99919796,0.00030104766,0.00019273037,0.00003357244,0.00024116487,0.000033547323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012521367,0.00004603981,0.00009367623,0.00015303277,0.00016057657,0.00014824301,0.0001502569,0.000016339527,3.1792476e-7],"category_scores_gemma":[0.00054928346,0.000029467368,0.0000136871795,0.00065264123,0.00020467941,0.0007724798,0.000040946208,0.00011390142,2.2416708e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003667037,0.000020621203,0.00074985827,0.0000030109156,0.0000020392854,0.000012073522,0.004817333,0.000757694,0.00018023339,0.20862894,0.0000109502935,0.78478056],"study_design_scores_gemma":[0.0007874008,0.00017438781,0.07615995,0.00021203322,0.000005327056,0.00009914089,0.00083406054,0.1439801,0.00006252678,0.7775979,0.000017344886,0.000069801725],"about_ca_topic_score_codex":0.0000021701342,"about_ca_topic_score_gemma":6.306907e-7,"teacher_disagreement_score":0.8705876,"about_ca_system_score_codex":0.000014794682,"about_ca_system_score_gemma":0.000053449927,"threshold_uncertainty_score":0.14295107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Settling; Volume (thermodynamics); Computation; Mathematics; Computer science; Settling time; Algorithm; Engineering; Physics; Thermodynamics","score_opus":0.02898311213798388,"score_gpt":0.270619726652699,"score_spread":0.24163661451471513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279493147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5704387,0.0006068668,0.42749467,0.0011025263,0.0001660054,0.000068448804,2.209746e-7,0.000022368937,0.00010022825],"genre_scores_gemma":[0.9323511,0.00012553115,0.067326844,0.00009367813,0.00008440877,6.3042313e-7,2.94397e-7,0.0000032485684,0.000014245487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888104,0.00011886718,0.00039293626,0.00020047554,0.00024826676,0.00015842514],"domain_scores_gemma":[0.9988203,0.00044501625,0.00027620676,0.00015067666,0.00022434813,0.00008341844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468374,0.000102685735,0.00018279979,0.000056501187,0.0004134179,0.00013630169,0.00024457974,0.000040980758,0.0000010756771],"category_scores_gemma":[0.00013092393,0.00006695768,0.000049561422,0.00016685137,0.000112804104,0.00038975483,0.00018554543,0.00016541322,0.000001717328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727346,0.00019414723,0.0066705057,0.00005080648,0.000078707744,0.00013855989,0.0049841255,0.035987828,0.0006502121,0.0049795792,0.0007644805,0.9454283],"study_design_scores_gemma":[0.0004141999,0.00031515805,0.05348057,0.00001812484,0.000008013813,0.0016462255,0.00006106203,0.84811836,0.00005018841,0.09555569,0.00021081166,0.00012157736],"about_ca_topic_score_codex":0.0000045756337,"about_ca_topic_score_gemma":8.4349426e-7,"teacher_disagreement_score":0.9453067,"about_ca_system_score_codex":0.000038086488,"about_ca_system_score_gemma":0.00006410279,"threshold_uncertainty_score":0.3179718},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Honour; Computer science; Law; Political science","score_opus":0.017813274070820458,"score_gpt":0.271086813178269,"score_spread":0.25327353910744854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317113105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07883133,0.00007743781,0.91560507,0.0011433428,0.0005371536,0.00006685564,5.063009e-7,0.000011154418,0.003727171],"genre_scores_gemma":[0.9378136,0.000018145094,0.06036331,0.0005200778,0.0012575503,4.9765197e-7,0.0000012807645,0.0000032524458,0.000022318067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988442,0.00014567251,0.0004583581,0.00014943286,0.00027726468,0.00012506038],"domain_scores_gemma":[0.99896824,0.00029868906,0.00045635112,0.0000649479,0.00015424097,0.000057531935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047772186,0.00010448923,0.00026153316,0.00021574799,0.00005334723,0.000034954443,0.0002252202,0.000052011193,0.000010239645],"category_scores_gemma":[0.000083285275,0.000081391474,0.00005634629,0.00022627517,0.00004628455,0.0002634309,0.000045995697,0.00019128957,0.000008049798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006877208,0.00021538454,0.0010413904,0.000020952984,0.000012447355,0.0000354492,0.00060913194,0.46688554,0.00004059296,0.24061756,0.0009829921,0.2894698],"study_design_scores_gemma":[0.0013627784,0.001441318,0.059084024,0.00008009367,0.000006877587,0.00014974298,0.00010528676,0.18905249,0.00005815037,0.7469979,0.0014973211,0.0001640455],"about_ca_topic_score_codex":0.0000015227034,"about_ca_topic_score_gemma":8.793872e-7,"teacher_disagreement_score":0.85898226,"about_ca_system_score_codex":0.00002955531,"about_ca_system_score_gemma":0.000036562386,"threshold_uncertainty_score":0.3319048},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04541417762651414,"score_gpt":0.31910102263639717,"score_spread":0.27368684500988305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468564096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013444462,0.00031331758,0.98395133,0.001250515,0.00023026638,0.00008891238,0.0000028803702,0.000014751137,0.00070358627],"genre_scores_gemma":[0.95216346,0.000003817119,0.04737245,0.000264122,0.00013462543,0.0000019666538,0.0000070298925,0.000002381368,0.00005014456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930286,0.00004710361,0.0002844643,0.00009694719,0.00017875686,0.000089860674],"domain_scores_gemma":[0.9991717,0.00005540482,0.00031296123,0.000056955716,0.00032337185,0.00007960285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013269,0.000063783715,0.00014416673,0.000053655807,0.000053940345,0.00011508929,0.00014733229,0.000044108216,1.6668753e-7],"category_scores_gemma":[0.00004129561,0.000049187147,0.00004252272,0.00011277517,0.000015264739,0.0003121811,0.000023944582,0.00006199239,0.0000011978666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021274024,0.00020803233,0.0006719015,0.00006550247,0.000059191934,0.000042374475,0.0021717811,0.18582314,0.00009463001,0.59835637,0.027114058,0.1851803],"study_design_scores_gemma":[0.00071983313,0.0004721729,0.0004260074,0.000018312747,0.000006544878,0.00015261187,0.00024198598,0.90358394,0.0000059772833,0.091724075,0.0025801938,0.00006834682],"about_ca_topic_score_codex":0.0000019055319,"about_ca_topic_score_gemma":0.0000012966138,"teacher_disagreement_score":0.938719,"about_ca_system_score_codex":0.000053539825,"about_ca_system_score_gemma":0.000056658337,"threshold_uncertainty_score":0.20057936},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0862647377293853,"score_gpt":0.3675811881880093,"score_spread":0.28131645045862397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014239444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37359002,0.0009670014,0.62317383,0.0014283583,0.00014767893,0.00028710059,0.0000050978238,0.000026296508,0.00037463632],"genre_scores_gemma":[0.8678325,0.00010015913,0.1314774,0.00024395018,0.00026859212,0.000005205203,0.0000033083961,0.000029846009,0.00003906887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984042,0.00027428387,0.00048224232,0.0002167201,0.00047270427,0.00014984679],"domain_scores_gemma":[0.99838805,0.00037877422,0.00045810657,0.000117511765,0.0005030768,0.0001545069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058484037,0.00021149887,0.00051098916,0.00012709794,0.00007463701,0.00013271646,0.00021190976,0.00013570525,0.000028363918],"category_scores_gemma":[0.00035550023,0.0001403766,0.000078001285,0.00011972015,0.00009377808,0.0001245861,0.00021704074,0.00091092597,0.000004439577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023025735,0.0008268447,0.0009342798,0.0027432058,0.001786654,0.002035071,0.0071979444,0.024208002,0.0015854958,0.8332352,0.0028761046,0.12026862],"study_design_scores_gemma":[0.0007513359,0.0007033319,0.00038432222,0.00025528256,0.00012279731,0.00029280808,0.00042368367,0.0045886603,0.00014866015,0.992076,0.000050679067,0.00020247814],"about_ca_topic_score_codex":7.909251e-7,"about_ca_topic_score_gemma":5.257563e-7,"teacher_disagreement_score":0.49424246,"about_ca_system_score_codex":0.00006334351,"about_ca_system_score_gemma":0.0002712463,"threshold_uncertainty_score":0.57243913},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.044426264096525066,"score_gpt":0.2985361169041228,"score_spread":0.25410985280759774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015221827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027499627,0.00004454777,0.96082884,0.0023732558,0.00082610257,0.00006236394,4.2982037e-7,0.00001660042,0.008348241],"genre_scores_gemma":[0.9437085,0.000018506435,0.05155349,0.0007758355,0.003929653,2.6085166e-7,4.4104362e-7,0.0000021472401,0.00001119825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896693,0.000054186985,0.0003318939,0.00017450406,0.00035085066,0.000121637386],"domain_scores_gemma":[0.99899155,0.0001259423,0.00033455805,0.00006736373,0.00034558977,0.00013497271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000356801,0.00008447515,0.00020144113,0.00011227519,0.00013009341,0.000119761964,0.00038661348,0.000034834244,0.00002283057],"category_scores_gemma":[0.00010166694,0.000060319566,0.00006129666,0.00041618466,0.00017378233,0.00037514797,0.00011565498,0.0001332451,0.000018101979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009529547,0.00037040006,0.0012662577,0.000041161093,0.000034837583,0.00006685105,0.0058102217,0.014443246,0.0006597475,0.32790732,0.012977751,0.6363269],"study_design_scores_gemma":[0.0028674102,0.009477151,0.06623376,0.00013499326,0.00005157335,0.00037183892,0.00029024814,0.7816833,0.0012610024,0.11355217,0.023527702,0.0005488539],"about_ca_topic_score_codex":7.389831e-7,"about_ca_topic_score_gemma":2.0493547e-7,"teacher_disagreement_score":0.91620886,"about_ca_system_score_codex":0.000024866355,"about_ca_system_score_gemma":0.00011488776,"threshold_uncertainty_score":0.24597605},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04514012537969444,"score_gpt":0.29194074934781516,"score_spread":0.24680062396812072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117330206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019935649,0.0002609889,0.95638555,0.022928486,0.00018045177,0.00010888833,3.6617624e-7,0.000030201325,0.00016943473],"genre_scores_gemma":[0.69803697,0.000009584308,0.29997793,0.0017933425,0.00017269817,0.0000011832476,7.504663e-7,0.000002380534,0.0000051446236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910843,0.000052010193,0.00029998348,0.00015555786,0.0002659777,0.00011804542],"domain_scores_gemma":[0.9992446,0.00010384258,0.00022727714,0.00004690863,0.0002612739,0.000116112096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018436922,0.00008855676,0.0001763863,0.00006324234,0.0001362025,0.00011312336,0.0002350527,0.00004029061,0.000004316835],"category_scores_gemma":[0.000101946585,0.00006221588,0.000038574926,0.00022675106,0.000023312276,0.0002888155,0.00012409537,0.000118734395,0.0000055244795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036685326,0.00065982755,0.009773004,0.00036691182,0.00018494038,0.0006553745,0.016886186,0.39362356,0.00579078,0.06110624,0.016934939,0.49365136],"study_design_scores_gemma":[0.0008595579,0.0016842544,0.016919006,0.00013832502,0.000018907369,0.00032441557,0.00031035198,0.9459591,0.00050991704,0.03199852,0.0010503435,0.00022732638],"about_ca_topic_score_codex":0.0000021632056,"about_ca_topic_score_gemma":4.594964e-7,"teacher_disagreement_score":0.6781013,"about_ca_system_score_codex":0.000015330674,"about_ca_system_score_gemma":0.000045207307,"threshold_uncertainty_score":0.253709},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08801501108235356,"score_gpt":0.3011803870368022,"score_spread":0.21316537595444868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118093767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1706652,0.000047586596,0.82579243,0.003286961,0.00010685746,0.00004106545,2.2255442e-7,0.000008775747,0.00005090598],"genre_scores_gemma":[0.78911906,0.000036299658,0.21057169,0.0002419393,0.000028861623,1.3583211e-7,4.3306918e-7,0.0000011538484,4.0962533e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993266,0.00007191201,0.00033575983,0.00008088051,0.00013324502,0.000051611256],"domain_scores_gemma":[0.99942076,0.0000662625,0.00032073676,0.000034600525,0.00011015251,0.00004746265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016522846,0.000049538226,0.00015522107,0.00008851435,0.000022585387,0.000029418983,0.000082927996,0.000038079117,0.000008332637],"category_scores_gemma":[0.0000875624,0.000043658783,0.000033461754,0.0002476443,0.000050587016,0.00028148963,0.000024891564,0.0001228877,7.717269e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034264525,0.00022796034,0.017777577,0.00013247128,0.000065770284,0.000039667608,0.00880076,0.2285163,0.0051711756,0.33132473,0.00020517698,0.40739578],"study_design_scores_gemma":[0.00096612173,0.00048442197,0.07554845,0.00006746848,0.000009081846,0.00007650491,0.0002764236,0.75369585,0.00029115472,0.16844189,0.000035016426,0.0001076345],"about_ca_topic_score_codex":0.0000029171254,"about_ca_topic_score_gemma":5.792722e-7,"teacher_disagreement_score":0.61845386,"about_ca_system_score_codex":0.000013576551,"about_ca_system_score_gemma":0.000030618197,"threshold_uncertainty_score":0.17803535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018523427782201896,"score_gpt":0.2547389408735739,"score_spread":0.236215513091372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179134436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26244766,0.002533428,0.7332382,0.0011971667,0.00016743095,0.000022095532,2.507415e-7,0.00001626725,0.00037746914],"genre_scores_gemma":[0.9629787,0.00032743777,0.036163177,0.0004561138,0.000046537083,2.1590695e-7,0.000001023517,0.0000024118067,0.000024386845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931854,0.0000770114,0.00027256878,0.00013041584,0.00010304232,0.000098409255],"domain_scores_gemma":[0.99934214,0.00012980837,0.00023100109,0.000060804734,0.00016698457,0.00006925696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020974282,0.000081311766,0.00016927946,0.000052384195,0.00008518565,0.00008286073,0.000102160804,0.000049580114,0.0000031831432],"category_scores_gemma":[0.000045656547,0.00005546093,0.000038325743,0.00017631141,0.0000386701,0.00032288488,0.00008322056,0.0001468992,0.0000013758598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020374484,0.00014265609,0.0009680321,0.000021540756,0.000059103895,0.0003469113,0.001832344,0.0029467698,0.0016350062,0.43079802,0.00030662664,0.5609226],"study_design_scores_gemma":[0.0008894896,0.000427048,0.0086835865,0.000024199237,0.000008743209,0.0017911022,0.00031548887,0.039668158,0.0002785788,0.9473989,0.00040278974,0.00011193564],"about_ca_topic_score_codex":3.141717e-7,"about_ca_topic_score_gemma":2.2981978e-7,"teacher_disagreement_score":0.70053107,"about_ca_system_score_codex":0.000011226156,"about_ca_system_score_gemma":0.000044223132,"threshold_uncertainty_score":0.2261631},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013852064782993856,"score_gpt":0.26898394551565724,"score_spread":0.2551318807326634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240444301","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066283774,0.0006795434,0.25823358,0.00023230679,0.73968667,0.00004234136,0.0000018717319,0.000026217265,0.0010908392],"genre_scores_gemma":[0.0016005563,0.0002377414,0.0071918974,0.00005560247,0.9908319,8.1697397e-7,0.000009494448,0.000009034168,0.000062967054],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981424,0.00012346798,0.00049804896,0.00024728136,0.0008277697,0.00016098405],"domain_scores_gemma":[0.9974819,0.00056784257,0.00088429294,0.00009836545,0.00080908777,0.00015852181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004990866,0.00020193883,0.00045992696,0.00011760784,0.00009524864,0.00030042752,0.0005887708,0.00044058886,0.0000028426446],"category_scores_gemma":[0.00046825132,0.0001524503,0.00014679521,0.00017501577,0.000038880436,0.00034782474,0.0001751717,0.000807173,0.000016765254],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023976078,0.000027292896,0.0000040447158,0.0000319111,0.000032904733,0.00003031159,0.0003351727,0.00005447265,0.0000047249246,0.00229758,0.9880328,0.00912482],"study_design_scores_gemma":[0.00069751404,0.0007655411,0.000020170413,0.000060579652,0.000040695642,0.000022877175,0.00001800828,0.0021731597,0.0000039970832,0.024407113,0.9716037,0.00018664675],"about_ca_topic_score_codex":0.0000030157614,"about_ca_topic_score_gemma":6.0573797e-7,"teacher_disagreement_score":0.2511452,"about_ca_system_score_codex":0.000060142418,"about_ca_system_score_gemma":0.0004465115,"threshold_uncertainty_score":0.6216743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059345048696840964,"score_gpt":0.27733557765461564,"score_spread":0.21799052895777468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243469825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16357926,0.0003579403,0.8328636,0.0025233962,0.00033274197,0.000090569105,0.0000014613494,0.000036275633,0.00021472128],"genre_scores_gemma":[0.89193934,0.000014262178,0.10753452,0.00031045097,0.00019186494,5.6896994e-7,0.0000010176173,0.000004231654,0.000003722728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983603,0.00018500503,0.00069360697,0.00024817954,0.00035625047,0.00015668024],"domain_scores_gemma":[0.99833167,0.00029085277,0.0005463899,0.00013219644,0.0005374369,0.00016144905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283446,0.00013362848,0.00037587524,0.00009693519,0.000104022314,0.000093726056,0.00035430863,0.000059956703,0.000009844498],"category_scores_gemma":[0.00014796389,0.00011184904,0.000134276,0.00046334637,0.000083214785,0.00048631494,0.00015933227,0.00022729661,0.000002873559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010298859,0.000645521,0.014747111,0.00023107285,0.00013593335,0.00004956047,0.0045693833,0.37925354,0.0032039967,0.012912186,0.0013146395,0.58283406],"study_design_scores_gemma":[0.00092747353,0.0013567895,0.03971503,0.000031009404,0.00003649705,0.00017482581,0.00025118398,0.9060181,0.0005211163,0.05033354,0.0004235379,0.00021090981],"about_ca_topic_score_codex":0.000007401978,"about_ca_topic_score_gemma":9.533002e-7,"teacher_disagreement_score":0.7283601,"about_ca_system_score_codex":0.000039348073,"about_ca_system_score_gemma":0.00010358991,"threshold_uncertainty_score":0.45610714},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Belief revision; Library science; Operations research; Artificial intelligence; Mathematics","score_opus":0.029376725856498156,"score_gpt":0.29151167373474673,"score_spread":0.2621349478782486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253372947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006230458,0.002255037,0.98940736,0.00010949706,0.00028282928,0.00030165966,3.1523814e-7,0.000020578045,0.0013922391],"genre_scores_gemma":[0.62800926,0.00019183154,0.37140608,0.00014975457,0.00017207098,0.0000022665554,0.000002543727,0.0000049092246,0.00006127894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987568,0.00022257623,0.00045344487,0.00020272536,0.00021207471,0.00015236695],"domain_scores_gemma":[0.99875116,0.00015791506,0.00048353587,0.00010982775,0.0003859119,0.000111628375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014491824,0.00012245415,0.00037190193,0.00011484335,0.00016808804,0.00016032587,0.00021908894,0.00007212426,0.0000023895282],"category_scores_gemma":[0.00020472148,0.0000817764,0.00012411199,0.000152199,0.00002400275,0.000490791,0.000026430165,0.00011662388,0.0000013646853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030295766,0.000704763,0.00023369872,0.00013461393,0.00008104654,0.00002098384,0.0018495703,0.004995193,0.00040281622,0.2641067,0.0027354988,0.7244322],"study_design_scores_gemma":[0.0096535,0.0031235723,0.000649463,0.00010294206,0.00007620282,0.00050135644,0.00025668702,0.88886476,0.00011176172,0.09077514,0.005563673,0.0003209617],"about_ca_topic_score_codex":6.03177e-7,"about_ca_topic_score_gemma":7.430184e-8,"teacher_disagreement_score":0.8838695,"about_ca_system_score_codex":0.000029000003,"about_ca_system_score_gemma":0.00006168733,"threshold_uncertainty_score":0.3334745},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.038346205792765695,"score_gpt":0.3113974809968479,"score_spread":0.2730512752040822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385619649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070225,0.00009390067,0.92878616,0.00016564861,0.00028927717,0.0001693651,0.0000011926746,0.000038666934,0.00023081456],"genre_scores_gemma":[0.96795917,0.000029413537,0.03179875,0.00005792725,0.00006599773,0.000004087428,0.000007836524,0.000004031957,0.000072814786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990312,0.00007982295,0.00044063787,0.000111203975,0.00020097799,0.00013619708],"domain_scores_gemma":[0.9985423,0.00026319118,0.00059273205,0.00006953364,0.0004874595,0.00004476635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876857,0.00007539906,0.00022239615,0.00018206655,0.0000698868,0.00007049678,0.0001543698,0.000068820904,0.000004562076],"category_scores_gemma":[0.00019757432,0.000056174245,0.000065549895,0.0008763285,0.000015095651,0.00022406685,0.000041355066,0.000060612263,0.000004613057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013319611,0.00033036905,0.009599193,0.0003795247,0.00016793657,0.00004040809,0.0032122207,0.002889562,0.0007327079,0.9083993,0.0045236372,0.069591984],"study_design_scores_gemma":[0.0034091808,0.0008832108,0.019173851,0.000025432186,0.00003784518,0.00018906298,0.00042923924,0.39168918,0.00018806184,0.58078396,0.002978602,0.00021236298],"about_ca_topic_score_codex":0.0000025298925,"about_ca_topic_score_gemma":0.0000011813352,"teacher_disagreement_score":0.89773417,"about_ca_system_score_codex":0.000014689678,"about_ca_system_score_gemma":0.000054630083,"threshold_uncertainty_score":0.22907193},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008665284595332114,"score_gpt":0.25040322301304807,"score_spread":0.24173793841771596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411777705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03775312,0.00027140218,0.95636296,0.0026602657,0.00047105137,0.000080137426,0.0000020492519,0.000026898657,0.0023721063],"genre_scores_gemma":[0.8610445,0.000017362901,0.1382933,0.00055321015,0.00005261069,9.638142e-7,0.0000052767514,0.0000011394482,0.00003162605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911904,0.00009214933,0.00041837763,0.00009744516,0.00018280403,0.00009018122],"domain_scores_gemma":[0.9988688,0.00032439097,0.0003003427,0.000088633766,0.00037404892,0.00004376899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031245046,0.00007906456,0.00015482151,0.0001951226,0.00012613572,0.00018665132,0.00020666556,0.000052900115,0.00000569487],"category_scores_gemma":[0.00008772925,0.00006712346,0.000051943105,0.0003253319,0.000028336175,0.0012835427,0.00009983786,0.00015584883,0.0000088669385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004729968,0.00018368027,0.0061053685,0.000021077436,0.00013084438,0.000015653957,0.0036454431,0.047800828,0.00015323104,0.15810618,0.003635177,0.78015524],"study_design_scores_gemma":[0.0006414577,0.00018978078,0.11947164,0.000050876948,0.000024369556,0.00003034549,0.00014782531,0.35929447,0.000106547246,0.5190937,0.00084422383,0.0001047581],"about_ca_topic_score_codex":0.000027969627,"about_ca_topic_score_gemma":0.0000013715671,"teacher_disagreement_score":0.82329136,"about_ca_system_score_codex":0.00006994558,"about_ca_system_score_gemma":0.000103899,"threshold_uncertainty_score":0.27372155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016261159408648314,"score_gpt":0.2742188377594588,"score_spread":0.2579576783508105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414314109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04250652,0.00050363253,0.95186687,0.00036476125,0.00037686562,0.00003684233,1.5383114e-7,0.000009516509,0.0043348353],"genre_scores_gemma":[0.9740996,0.000052485884,0.025617898,0.00011045394,0.0000620734,2.3116164e-7,4.5192712e-7,0.0000010203449,0.000055796838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937856,0.00005727487,0.00029799435,0.00008000926,0.00011959432,0.00006653985],"domain_scores_gemma":[0.9992045,0.000107084445,0.00033403144,0.000054999127,0.00027259765,0.000026784948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029834025,0.000057604273,0.00015330657,0.00012501702,0.000049113012,0.000039540522,0.00015645973,0.00004560069,0.0000023380228],"category_scores_gemma":[0.000064433625,0.00004223826,0.000049127026,0.00016836116,0.000029030865,0.00019572163,0.00005308256,0.00007995281,0.0000010764094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007344769,0.0002447718,0.017861249,0.000087892775,0.000073319075,0.000018820147,0.0016280608,0.0074122953,0.001320061,0.47909045,0.0015070604,0.49068257],"study_design_scores_gemma":[0.0012036075,0.00084697996,0.12354213,0.000107457425,0.00003982307,0.00007393964,0.0001273252,0.4047555,0.0007552113,0.4677232,0.00068507274,0.00013977598],"about_ca_topic_score_codex":0.000006202452,"about_ca_topic_score_gemma":0.0000018640811,"teacher_disagreement_score":0.93159306,"about_ca_system_score_codex":0.000017679838,"about_ca_system_score_gemma":0.00006741749,"threshold_uncertainty_score":0.17224264},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field (mathematics); Association (psychology); Computational logic; Mathematical logic; Computational model; Computational complexity theory","score_opus":0.015170227867167407,"score_gpt":0.2938185786288521,"score_spread":0.27864835076168465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125986258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008292584,0.0051361443,0.97025114,0.0013521205,0.00070374453,0.00006544107,2.8531758e-7,0.000017681188,0.01418085],"genre_scores_gemma":[0.95852494,0.0004008679,0.040369835,0.00048562116,0.000069611226,0.0000013090875,0.0000010334313,0.0000019089487,0.00014486765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903995,0.00009303615,0.0003901633,0.00015912406,0.00018390895,0.00013382173],"domain_scores_gemma":[0.9991814,0.00024387041,0.0002496186,0.00005745986,0.00022055725,0.000047119902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040373328,0.000099676996,0.00021438363,0.00027085617,0.00007717344,0.000096302894,0.00024825643,0.00005217686,0.0000060241423],"category_scores_gemma":[0.00007072924,0.0000764566,0.000054133132,0.00043269404,0.000046141246,0.0005371043,0.00007827811,0.00016897601,0.000004787782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037494003,0.00018315893,0.0076329745,0.000052998705,0.000019083787,0.00007037957,0.0005967567,0.08623711,0.000019399511,0.62153155,0.0014838947,0.28213522],"study_design_scores_gemma":[0.0008521219,0.00023151517,0.02841551,0.00008800161,0.000008157979,0.000088134606,0.000117331634,0.17639999,0.000008741177,0.79194444,0.0017376217,0.000108423825],"about_ca_topic_score_codex":0.0000022543468,"about_ca_topic_score_gemma":0.000005504376,"teacher_disagreement_score":0.9502324,"about_ca_system_score_codex":0.000051441275,"about_ca_system_score_gemma":0.000116901276,"threshold_uncertainty_score":0.311781},"labels":[],"label_agreement":null}]}