{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003832071,0.008715205,0.96005565,0.0036031606,0.0013913643,0.00012776535,0.00031976862,0.00067191146,0.021283101],"genre_scores_gemma":[0.105503365,0.014203819,0.8584025,0.0018742867,0.002494012,0.00039786845,0.0004562557,0.00037157975,0.016296288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972066,0.00080975995,0.0003431701,0.00048821664,0.0009554343,0.00019682402],"domain_scores_gemma":[0.9966948,0.0018249451,0.0002882516,0.00042549876,0.00047754278,0.00028900307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004265331,0.0010153494,0.0011595788,0.0031043151,0.003155317,0.009101949,0.0028914858,0.0023938548,0.0063689123],"category_scores_gemma":[0.008932077,0.0013222925,0.0032435562,0.007160053,0.0068992497,0.012692233,0.0044314945,0.006014111,0.002243265],"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.000013850877,0.00001487,0.000066262604,0.00007745295,0.000012108587,0.00017577369,0.00020693807,0.001598277,0.00034316725,0.9797071,0.002185439,0.015598801],"study_design_scores_gemma":[0.000011833929,0.000014454266,0.000044713583,0.000073903684,0.000019492958,0.0002834731,0.000076595825,0.008150815,0.00041334814,0.9618162,0.029068716,0.000026431886],"about_ca_topic_score_codex":0.0035456123,"about_ca_topic_score_gemma":0.0024087525,"teacher_disagreement_score":0.009101949,"about_ca_system_score_codex":0.002530247,"about_ca_system_score_gemma":0.0026082252,"threshold_uncertainty_score":0.022557557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010097782,0.00024407706,0.99224925,0.0008682687,0.000053992164,0.000084209314,0.00017765436,0.00026496538,0.005047748],"genre_scores_gemma":[0.071141906,0.00083532016,0.9214252,0.0007439009,0.00019363979,0.0004732221,0.00039454136,0.00014966221,0.0046425643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964573,0.0013549082,0.00038106125,0.0006528855,0.00080856984,0.00034523793],"domain_scores_gemma":[0.9976555,0.0010603535,0.00021659542,0.0004911151,0.0003932246,0.00018322235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056545036,0.0013732924,0.00090955885,0.0021755002,0.001965329,0.00397454,0.0031864948,0.0022769968,0.0072792745],"category_scores_gemma":[0.0058259056,0.0009916051,0.003752455,0.0033821177,0.0043768124,0.0083055375,0.0031382053,0.004763677,0.0015005792],"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.000020807885,0.000020654601,0.00008664538,0.00010029678,0.000020244695,0.00010298022,0.0004017951,0.0069439434,0.0007947214,0.97587276,0.0014174636,0.01421771],"study_design_scores_gemma":[0.000037651982,0.00004718398,0.000078240315,0.00007932507,0.000045110173,0.00016482497,0.00018981898,0.03378539,0.0014402281,0.9198906,0.044201747,0.000039872546],"about_ca_topic_score_codex":0.008563264,"about_ca_topic_score_gemma":0.0077492753,"teacher_disagreement_score":0.008563264,"about_ca_system_score_codex":0.0026871087,"about_ca_system_score_gemma":0.0026418678,"threshold_uncertainty_score":0.029904187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002504976,0.00055041956,0.98808265,0.00074398605,0.00008800986,0.00021162297,0.0005085313,0.0022736941,0.0050361915],"genre_scores_gemma":[0.14846154,0.0020612304,0.8394028,0.00084307295,0.00020508499,0.0008714495,0.0027738777,0.0008131643,0.0045677572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98508954,0.0064494195,0.0012966878,0.0017510719,0.00452079,0.0008924384],"domain_scores_gemma":[0.97894233,0.014523698,0.00091041735,0.0036668207,0.0017311305,0.00022561979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009855345,0.0015894792,0.001675349,0.0031447068,0.0013263482,0.005332992,0.0042615416,0.0017485606,0.007100579],"category_scores_gemma":[0.026799979,0.0013614524,0.0047356994,0.0028960977,0.004272204,0.0073972456,0.0053177187,0.004023892,0.0017237434],"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.00018204303,0.0001314447,0.0009715414,0.0010531559,0.0003150058,0.00050202827,0.00051051093,0.08090914,0.0048534693,0.80583686,0.006834864,0.09789995],"study_design_scores_gemma":[0.0001774998,0.00006465951,0.00016900813,0.000277515,0.00012955064,0.00023237708,0.00010081922,0.19798814,0.010006679,0.75262946,0.038153134,0.000071144525],"about_ca_topic_score_codex":0.008031501,"about_ca_topic_score_gemma":0.0055989334,"teacher_disagreement_score":0.009855345,"about_ca_system_score_codex":0.0037910468,"about_ca_system_score_gemma":0.0052437396,"threshold_uncertainty_score":0.052120686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0143064335,0.00004265395,0.97458005,0.00015337706,0.00002275758,0.00010638636,0.00007141938,0.009906828,0.00081013166],"genre_scores_gemma":[0.47056434,0.00009719883,0.52302295,0.00028394323,0.00005518709,0.00044713673,0.00046562022,0.0027219483,0.0023416174],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97232765,0.013132106,0.002120666,0.004336921,0.0067017917,0.0013807513],"domain_scores_gemma":[0.90544087,0.045042824,0.0059818756,0.03863712,0.00398006,0.0009173145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019378535,0.0015826577,0.0014365593,0.0014660074,0.0010357477,0.0036745775,0.004616581,0.0019441452,0.0041294945],"category_scores_gemma":[0.06793906,0.0015390929,0.002279887,0.0009958963,0.0035757788,0.008705227,0.0064889453,0.0030102262,0.0010194844],"study_design_candidate":"bench_or_experimental","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.0020424265,0.000946586,0.013346221,0.0007600271,0.00054518593,0.0012181589,0.0018963992,0.318896,0.051123228,0.16806549,0.0069516012,0.4342086],"study_design_scores_gemma":[0.0003414405,0.00036255174,0.000748358,0.00009840174,0.00012035929,0.00037665386,0.00018351215,0.78367484,0.08886275,0.115025505,0.010091442,0.00011421086],"about_ca_topic_score_codex":0.0029575233,"about_ca_topic_score_gemma":0.003266347,"teacher_disagreement_score":0.019378535,"about_ca_system_score_codex":0.0018857655,"about_ca_system_score_gemma":0.0037138967,"threshold_uncertainty_score":0.1024847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014658448,0.00039468484,0.9483456,0.0015799948,0.00014275764,0.00016190931,0.00007762316,0.0006082451,0.03403081],"genre_scores_gemma":[0.49886727,0.00039325966,0.48629418,0.0005197884,0.00018942611,0.00053662644,0.00015967371,0.00028463497,0.012755191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913458,0.0033806674,0.00045285205,0.0013577485,0.0027074758,0.0007554771],"domain_scores_gemma":[0.9945135,0.0029753724,0.0003068234,0.0010309707,0.00081351737,0.00035979954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008158308,0.00074389635,0.00086425,0.0013627276,0.00259657,0.0039955485,0.0023147494,0.0020564888,0.0047423183],"category_scores_gemma":[0.011807071,0.00078310363,0.0023172065,0.0012505541,0.009174429,0.010228921,0.005659219,0.005217514,0.0008974685],"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.000019522287,0.000013215288,0.000081710234,0.000025229554,0.000008460438,0.000053715772,0.00061440276,0.0015149828,0.00037191276,0.99124324,0.00038479263,0.005668681],"study_design_scores_gemma":[0.000030004769,0.000023569526,0.000075888864,0.000020130497,0.000024320418,0.00007499894,0.0001520374,0.017068144,0.0009845332,0.9698711,0.011654484,0.000020696785],"about_ca_topic_score_codex":0.002980918,"about_ca_topic_score_gemma":0.0018679065,"teacher_disagreement_score":0.008158308,"about_ca_system_score_codex":0.002798608,"about_ca_system_score_gemma":0.0021093416,"threshold_uncertainty_score":0.043145776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015070598,0.0013327061,0.9508717,0.0025392256,0.0003688612,0.00023048418,0.00010404967,0.000483225,0.02899908],"genre_scores_gemma":[0.8057196,0.0011274203,0.18132524,0.0008040526,0.00038308295,0.00036485805,0.00013751522,0.000062752544,0.010075428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581957,0.0020532587,0.00020201808,0.00061151315,0.0010755424,0.00023807341],"domain_scores_gemma":[0.99223185,0.0042297198,0.0006194793,0.0013781837,0.0011684598,0.0003724067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046532187,0.00083670195,0.0011012423,0.0008588654,0.0007229997,0.0021763314,0.0017738213,0.0015511129,0.004735443],"category_scores_gemma":[0.016451834,0.00032128,0.0012044591,0.00065061747,0.0030453294,0.0026929472,0.0018667296,0.0022808576,0.0006953706],"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.000113633934,0.00007899227,0.0006093949,0.00027709242,0.00018582605,0.0001406835,0.00042728928,0.02893984,0.0013346119,0.89349985,0.003352956,0.07103969],"study_design_scores_gemma":[0.000101734775,0.00014913411,0.0003041912,0.000055896122,0.000070255555,0.00016805314,0.000069202375,0.11383613,0.0009621772,0.8729958,0.011245205,0.000042184078],"about_ca_topic_score_codex":0.0010161366,"about_ca_topic_score_gemma":0.0009593972,"teacher_disagreement_score":0.004735443,"about_ca_system_score_codex":0.0016515575,"about_ca_system_score_gemma":0.0013509529,"threshold_uncertainty_score":0.02460885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5901038,0.002081094,0.37078932,0.00470073,0.00027242565,0.00029012037,0.00093084975,0.000922395,0.029909207],"genre_scores_gemma":[0.9201797,0.0011163299,0.068653956,0.0004394876,0.00037626535,0.00025102208,0.0017014471,0.0001236126,0.00715805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997174,0.0005826687,0.0003716756,0.0008119903,0.00065086066,0.0004087317],"domain_scores_gemma":[0.9857098,0.010317172,0.001082281,0.001416738,0.00072252733,0.0007515554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035389087,0.0008182287,0.0012906061,0.0015080674,0.0016692581,0.0048854006,0.0015491423,0.002132353,0.0046147294],"category_scores_gemma":[0.013270154,0.0007394179,0.0025435647,0.001596929,0.005480119,0.018683625,0.0042113205,0.0063848263,0.00050091755],"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.00017745573,0.00013527661,0.0013255372,0.00022646599,0.000032634856,0.00037934276,0.0011806026,0.0042225756,0.0029713043,0.96856153,0.0011417134,0.0196456],"study_design_scores_gemma":[0.000051848976,0.00006825059,0.00034287,0.00002396214,0.000020602512,0.00035655915,0.00032882512,0.008836099,0.0028663697,0.98464555,0.0024331692,0.00002588685],"about_ca_topic_score_codex":0.0006631286,"about_ca_topic_score_gemma":0.00073355576,"teacher_disagreement_score":0.0048854006,"about_ca_system_score_codex":0.001796568,"about_ca_system_score_gemma":0.0012766666,"threshold_uncertainty_score":0.01871574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07638561,0.000937083,0.875986,0.0017192588,0.0001997435,0.00015221314,0.00032211383,0.0008454189,0.043452542],"genre_scores_gemma":[0.7103532,0.0005485245,0.2805574,0.0006551157,0.00015822097,0.00017308666,0.00036671394,0.0001782139,0.0070096194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761766,0.0007533799,0.0002180768,0.00050578977,0.00066403864,0.0002409488],"domain_scores_gemma":[0.99868137,0.00053714315,0.00013978367,0.000365641,0.00022160515,0.00005445583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030705973,0.00057874835,0.0005256775,0.0009137235,0.00077508256,0.0026891667,0.0016649186,0.0014594732,0.002419165],"category_scores_gemma":[0.003089683,0.0005618655,0.0013354956,0.0010131751,0.0037899378,0.006242016,0.0023511122,0.0026625418,0.00043296753],"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.000025121233,0.000015283342,0.00019643137,0.000034394994,0.000014242243,0.00019518117,0.0005871778,0.003587397,0.0024565656,0.9842391,0.000593939,0.008055149],"study_design_scores_gemma":[0.00003442912,0.000044808297,0.00023977376,0.000052393003,0.00004237722,0.0002663534,0.0002395228,0.039637774,0.004321996,0.93711495,0.017959796,0.00004588818],"about_ca_topic_score_codex":0.0021973157,"about_ca_topic_score_gemma":0.0029564828,"teacher_disagreement_score":0.0030705973,"about_ca_system_score_codex":0.002314886,"about_ca_system_score_gemma":0.00079531525,"threshold_uncertainty_score":0.016795695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007200257,0.00017560823,0.9808594,0.00059320626,0.000045007502,0.0001907153,0.00025644025,0.0011782715,0.009501108],"genre_scores_gemma":[0.14213826,0.00027548062,0.8506513,0.0004396886,0.00009989244,0.0004199913,0.00060630974,0.00021000656,0.0051590446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956577,0.0014515294,0.00034983028,0.0008989609,0.0013027667,0.00033933402],"domain_scores_gemma":[0.99375665,0.003887734,0.0002659501,0.001124014,0.0007785492,0.00018712945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045119408,0.00073537376,0.0007283193,0.0011700195,0.00090452435,0.0032634484,0.0028963883,0.0010995053,0.006406258],"category_scores_gemma":[0.011080679,0.0005948183,0.001970842,0.0011298432,0.0029990743,0.0061252043,0.003489954,0.0031456682,0.0012564666],"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.00009431049,0.00008964392,0.00038425266,0.00032858315,0.00006058905,0.00011852673,0.00039710762,0.012212549,0.00282523,0.89118695,0.0029779805,0.08932424],"study_design_scores_gemma":[0.000044499822,0.00007190738,0.00011118247,0.000059611488,0.000057689456,0.00019395359,0.00009028793,0.10058328,0.006393343,0.8703783,0.021989971,0.000025947831],"about_ca_topic_score_codex":0.0010128036,"about_ca_topic_score_gemma":0.0015162678,"teacher_disagreement_score":0.006406258,"about_ca_system_score_codex":0.0012779374,"about_ca_system_score_gemma":0.0017199699,"threshold_uncertainty_score":0.023861706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111919725,0.0011574808,0.96406853,0.0010587113,0.00029076578,0.000110904126,0.000526321,0.001347108,0.020248236],"genre_scores_gemma":[0.4520256,0.0027617705,0.5206194,0.0012214025,0.00058912014,0.0005886088,0.0009496657,0.0010099078,0.020234518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978885,0.0004466409,0.0002017594,0.00033912752,0.000835152,0.00028879344],"domain_scores_gemma":[0.9987029,0.0005116147,0.00011626183,0.0002394404,0.00033007248,0.00009969792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932557,0.0006950983,0.0008960655,0.0020274837,0.0016052275,0.0035777874,0.00205408,0.0013450141,0.004485829],"category_scores_gemma":[0.002719089,0.00083439506,0.0019316422,0.001970873,0.005370892,0.006711593,0.0037793557,0.003341449,0.0010926479],"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.000013919521,0.000009139638,0.00008849621,0.00005013463,0.0000079169195,0.00008262903,0.00022843516,0.0008640936,0.00066021754,0.9925305,0.0005895139,0.0048749503],"study_design_scores_gemma":[0.000029414174,0.000026185371,0.00020593974,0.000059369722,0.000044082397,0.00032259634,0.00011474357,0.008980948,0.0019440961,0.9296563,0.058575187,0.000041179814],"about_ca_topic_score_codex":0.003946233,"about_ca_topic_score_gemma":0.00214476,"teacher_disagreement_score":0.004485829,"about_ca_system_score_codex":0.0016733778,"about_ca_system_score_gemma":0.002187506,"threshold_uncertainty_score":0.015509069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078727774,0.0026931057,0.8647924,0.001403673,0.00029415864,0.00012110433,0.00088034,0.0010179345,0.050069567],"genre_scores_gemma":[0.6581019,0.002242036,0.32118234,0.0008908771,0.00047549416,0.00059902767,0.0013369869,0.00032607574,0.014845287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973584,0.000782626,0.00034814025,0.00057311874,0.00068435044,0.0002533998],"domain_scores_gemma":[0.9971042,0.0017058301,0.0003072829,0.00036141174,0.00037572827,0.00014548624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248997,0.0008531432,0.0007467527,0.0020477313,0.0011063056,0.005027128,0.0013159986,0.0011646037,0.0041117957],"category_scores_gemma":[0.005581349,0.00054548506,0.001152042,0.002215719,0.00472452,0.008904135,0.002097083,0.0024154258,0.0009514467],"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.000019728139,0.000006842575,0.00012978495,0.000045265995,0.000007394342,0.000065027874,0.0002925918,0.0010759248,0.00094412063,0.98913145,0.00032040212,0.007961621],"study_design_scores_gemma":[0.000015052484,0.000021791437,0.0001900044,0.000054953784,0.000021912474,0.00023669736,0.00013615948,0.009597556,0.0027271542,0.9664699,0.020505484,0.000023394325],"about_ca_topic_score_codex":0.0006883092,"about_ca_topic_score_gemma":0.0004516913,"teacher_disagreement_score":0.005027128,"about_ca_system_score_codex":0.001716864,"about_ca_system_score_gemma":0.0008173372,"threshold_uncertainty_score":0.0137553215},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09810564,0.028714398,0.33137226,0.07216232,0.0017790312,0.00014743427,0.00060055766,0.00060428045,0.46651408],"genre_scores_gemma":[0.93391263,0.004940762,0.049334973,0.0010971872,0.0009166532,0.0000864659,0.00034466805,0.00010436824,0.00926233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692047,0.0012494877,0.00023350796,0.0006035125,0.0008257098,0.00016737456],"domain_scores_gemma":[0.9937657,0.003635792,0.0004683761,0.000716186,0.00095722236,0.00045666588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036176303,0.00032311596,0.0005437528,0.0027311228,0.0020117594,0.0077938214,0.00080087385,0.0014602427,0.008130637],"category_scores_gemma":[0.012511013,0.00027264262,0.0007556828,0.0023506337,0.013023414,0.013150139,0.0033929728,0.0029771577,0.0009179264],"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.000020537687,0.000008658973,0.00028798502,0.00006598178,0.000008087245,0.000050448827,0.00061278936,0.000297432,0.0001821065,0.9854896,0.0017433285,0.011232945],"study_design_scores_gemma":[0.000004952672,0.000005531146,0.00021569213,0.000026591391,0.0000038726216,0.00005233517,0.00012420508,0.00053067674,0.000051997868,0.9930648,0.005913917,0.000005401369],"about_ca_topic_score_codex":0.0021300237,"about_ca_topic_score_gemma":0.002203868,"teacher_disagreement_score":0.008130637,"about_ca_system_score_codex":0.0035724386,"about_ca_system_score_gemma":0.002442621,"threshold_uncertainty_score":0.027199686},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33119246,0.00454795,0.30195555,0.010744777,0.0014971425,0.00019019614,0.0024283554,0.001785511,0.34565806],"genre_scores_gemma":[0.8870177,0.0010991467,0.06652857,0.0008884627,0.0007134272,0.000101009435,0.002141658,0.00037600743,0.04113396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762124,0.0004295048,0.00021740686,0.0005383715,0.00089389377,0.00029968345],"domain_scores_gemma":[0.99227387,0.0042768796,0.0004853742,0.0011529126,0.0012809046,0.0005300172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014413162,0.00047381886,0.0006545818,0.0026240405,0.0021620945,0.004258253,0.0010302651,0.0007777813,0.012173335],"category_scores_gemma":[0.010108711,0.00047017095,0.0013100585,0.0025635334,0.0032359154,0.006295663,0.0020109795,0.003770078,0.001174858],"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.00011166619,0.00004992459,0.0006887954,0.00006522668,0.000016001675,0.00015493885,0.00029054194,0.0027388723,0.00073532667,0.96583587,0.0050288835,0.024283834],"study_design_scores_gemma":[0.000012868785,0.000020932968,0.00034970362,0.000018738263,0.000009513103,0.00012432008,0.00007788913,0.004035132,0.0005358914,0.9882046,0.006598115,0.000012342104],"about_ca_topic_score_codex":0.004210367,"about_ca_topic_score_gemma":0.0042923656,"teacher_disagreement_score":0.012173335,"about_ca_system_score_codex":0.0027768803,"about_ca_system_score_gemma":0.0019546256,"threshold_uncertainty_score":0.0407238},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029367066,0.030584447,0.0020253279,0.1455982,0.7618873,0.00005732813,0.0005427884,0.00021536947,0.05879557],"genre_scores_gemma":[0.0042962804,0.012346483,0.00064673263,0.016226282,0.812843,0.000059488706,0.00037081345,0.0005271782,0.15268375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956091,0.00066992565,0.0002798567,0.00089295866,0.0021838194,0.00036432935],"domain_scores_gemma":[0.99082935,0.0026100676,0.00045215274,0.00070744846,0.0032163465,0.002184665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038260373,0.002497501,0.0029513722,0.0041775242,0.002870719,0.010371543,0.0018137058,0.0063621476,0.07231466],"category_scores_gemma":[0.013304363,0.000826703,0.0014273463,0.0022841133,0.0027706125,0.009520026,0.0035460687,0.008836147,0.02948509],"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.00001786703,0.000010834452,0.00002887631,0.00007119663,0.000007740251,0.000023912171,0.000018704995,0.00004397941,0.000073294585,0.008445066,0.9841791,0.007079493],"study_design_scores_gemma":[0.0000128220545,0.000010695588,0.00013057969,0.00006904646,0.000008866336,0.00004664664,0.000016463686,0.00013258631,0.00007010094,0.009052058,0.9904419,0.000008378682],"about_ca_topic_score_codex":0.0022832768,"about_ca_topic_score_gemma":0.003871621,"teacher_disagreement_score":0.07231466,"about_ca_system_score_codex":0.0058486685,"about_ca_system_score_gemma":0.0037437628,"threshold_uncertainty_score":0.2419166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076998253,0.00043231706,0.9779984,0.0009444866,0.00014466065,0.00008496979,0.00022335505,0.000615133,0.01185683],"genre_scores_gemma":[0.33254611,0.0007715883,0.64998245,0.0013564862,0.0002833672,0.0003475818,0.00050515734,0.00020843654,0.013998751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984798,0.00033629822,0.00014007582,0.00033225285,0.0005182798,0.00019334687],"domain_scores_gemma":[0.99875546,0.0006327893,0.00010853965,0.00011104929,0.0002817929,0.00011032821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941621,0.000730785,0.000499278,0.0012374305,0.0017788792,0.0028625028,0.0013414072,0.0012005554,0.0052716457],"category_scores_gemma":[0.0028669147,0.0004520913,0.0012787458,0.0014113104,0.0026325001,0.006612677,0.002843283,0.003353184,0.0007339393],"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.00005834732,0.0000310732,0.00009573355,0.00009717346,0.000013756127,0.00012105734,0.00025483896,0.0042052744,0.0042491076,0.9678541,0.0015697246,0.021449814],"study_design_scores_gemma":[0.000059986287,0.000049319944,0.00009897172,0.00005381466,0.00005250281,0.00021762142,0.00013372304,0.06654484,0.0062978985,0.8984457,0.028002815,0.000042756677],"about_ca_topic_score_codex":0.00362665,"about_ca_topic_score_gemma":0.0030604636,"teacher_disagreement_score":0.0052716457,"about_ca_system_score_codex":0.0024058016,"about_ca_system_score_gemma":0.002140579,"threshold_uncertainty_score":0.017635405},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5570283,0.00260536,0.20168054,0.0028535854,0.0004422426,0.000087540946,0.00026815763,0.00035670292,0.23467758],"genre_scores_gemma":[0.9726725,0.00035084778,0.014925807,0.0003175488,0.00023765984,0.000045214918,0.00013001353,0.000031050902,0.011289279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886215,0.00022151507,0.00006694068,0.00018806232,0.00049551274,0.00016589479],"domain_scores_gemma":[0.99868196,0.00045687828,0.00016958606,0.00015349519,0.00030510532,0.00023294525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007903474,0.0004076481,0.00036409547,0.00093443895,0.0013809918,0.002598779,0.0006735223,0.00059240946,0.0078094765],"category_scores_gemma":[0.0018664855,0.00020400074,0.00063950097,0.0006819642,0.0036137688,0.0056400686,0.0022079295,0.0015513838,0.0006443286],"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.000015660671,0.000010591225,0.0001575259,0.000017512844,0.0000030507965,0.00004555914,0.00014839682,0.0002882245,0.0007100096,0.99702877,0.00020239191,0.0013724057],"study_design_scores_gemma":[0.000012737064,0.000016885944,0.00018452264,0.000013859327,0.0000063723023,0.000127756,0.00016495166,0.003201936,0.0013362793,0.99000424,0.0049176295,0.000012867483],"about_ca_topic_score_codex":0.0008625544,"about_ca_topic_score_gemma":0.000745594,"teacher_disagreement_score":0.0078094765,"about_ca_system_score_codex":0.0014226666,"about_ca_system_score_gemma":0.00068422745,"threshold_uncertainty_score":0.026125371},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009667033,0.1171353,0.012556813,0.08421623,0.49060446,0.00016056777,0.0018483311,0.0009024443,0.29160917],"genre_scores_gemma":[0.014587033,0.06806312,0.004516534,0.022138953,0.58058864,0.00027865035,0.0024491115,0.0012429362,0.30613506],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962566,0.00070800656,0.00028102755,0.00077832123,0.0016781873,0.00029787628],"domain_scores_gemma":[0.99166673,0.0042079543,0.00036581085,0.0008965615,0.001958842,0.0009042122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031700435,0.0019198816,0.0023922806,0.005574525,0.0031367736,0.010289636,0.0018256832,0.004177728,0.13251412],"category_scores_gemma":[0.010602869,0.00082987105,0.0021404272,0.003776619,0.0030005106,0.008201292,0.003342319,0.008590844,0.04104669],"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.000023601771,0.000022936107,0.000118692726,0.0003258907,0.000022123126,0.000056676046,0.00008739683,0.00014904435,0.00018456881,0.04940562,0.92183936,0.027764117],"study_design_scores_gemma":[0.000008635646,0.0000163676,0.00018174917,0.00027340514,0.000010686454,0.00014788086,0.00003943841,0.00021035313,0.00007450425,0.03509081,0.96393627,0.000009824442],"about_ca_topic_score_codex":0.0010747946,"about_ca_topic_score_gemma":0.0016941315,"teacher_disagreement_score":0.13251412,"about_ca_system_score_codex":0.0049446602,"about_ca_system_score_gemma":0.003312821,"threshold_uncertainty_score":0.44330388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04143269,0.0015370045,0.94419885,0.00073683687,0.00013447698,0.000396245,0.00027338782,0.0061948462,0.005095671],"genre_scores_gemma":[0.19091268,0.0010284838,0.8031125,0.00027101606,0.00011880567,0.00027294076,0.0010013256,0.0006090646,0.0026731992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526346,0.0014479,0.00028555276,0.00041064716,0.0023419333,0.00025042662],"domain_scores_gemma":[0.98521113,0.008228414,0.0006281214,0.0038344273,0.0018735385,0.00022443567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003408751,0.0010194615,0.0008865323,0.0033340554,0.0007982586,0.0022455235,0.0022247771,0.00089521677,0.004303084],"category_scores_gemma":[0.016845167,0.0005562341,0.0013959443,0.0028508138,0.0015378916,0.004134235,0.0028406235,0.0028812976,0.0009777453],"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.00031302508,0.00029323148,0.001032684,0.00047409706,0.000111466805,0.00013279988,0.00057344115,0.071044065,0.010896555,0.10242084,0.006349431,0.80635834],"study_design_scores_gemma":[0.00016881451,0.00017778273,0.0008118864,0.00018165311,0.00010720725,0.0004237966,0.00017890186,0.7335134,0.03955893,0.20204125,0.022782888,0.000053494103],"about_ca_topic_score_codex":0.0028487674,"about_ca_topic_score_gemma":0.0026505284,"teacher_disagreement_score":0.004303084,"about_ca_system_score_codex":0.0020951699,"about_ca_system_score_gemma":0.0022306202,"threshold_uncertainty_score":0.018027365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19540781,0.002467152,0.77595204,0.0055505945,0.000063838655,0.00029412474,0.0012087139,0.0008897491,0.018166041],"genre_scores_gemma":[0.7885288,0.0012471118,0.20402233,0.00036470412,0.00018393963,0.00039919492,0.0012555609,0.000243962,0.003754491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98538244,0.0052555525,0.0011812804,0.0023762097,0.0046748244,0.0011296746],"domain_scores_gemma":[0.93537366,0.05225349,0.0025583813,0.006532725,0.0023749121,0.00090675807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009313096,0.0009769645,0.001842889,0.002541602,0.0014523565,0.0068213018,0.003155539,0.0022341763,0.0061220527],"category_scores_gemma":[0.05084435,0.001138076,0.004052565,0.0035832722,0.0048358426,0.014769871,0.00537475,0.004614362,0.00038840494],"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.00022149214,0.00009602238,0.0022140366,0.00027125856,0.00016074281,0.00030922264,0.0008329134,0.1623798,0.0015081739,0.7959473,0.0020985329,0.033960495],"study_design_scores_gemma":[0.000039999442,0.000024618139,0.0005413889,0.00003917136,0.00005826549,0.00009649031,0.00010880984,0.20634575,0.0007312076,0.7896053,0.0023734004,0.000035607674],"about_ca_topic_score_codex":0.0076673,"about_ca_topic_score_gemma":0.0054773446,"teacher_disagreement_score":0.009313096,"about_ca_system_score_codex":0.008173858,"about_ca_system_score_gemma":0.0034134407,"threshold_uncertainty_score":0.059305727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.309932,0.0027157536,0.44468567,0.004669879,0.00042352572,0.00019112187,0.00042238622,0.00070131174,0.23625854],"genre_scores_gemma":[0.93761176,0.0005119564,0.04692587,0.00065881544,0.00022685755,0.000079259145,0.00023002035,0.000054306784,0.013701081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984743,0.00046879755,0.00008332703,0.00024040483,0.0004961415,0.00023702804],"domain_scores_gemma":[0.99854064,0.0005053202,0.00018185284,0.00016869705,0.00030977104,0.00029378643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022100778,0.0003190095,0.00039195264,0.0016187755,0.0014176335,0.0026177894,0.001170238,0.00086521433,0.0055769836],"category_scores_gemma":[0.0029305874,0.00024156675,0.00078871934,0.00090312277,0.003948592,0.0054129194,0.002683626,0.0021963469,0.00059592084],"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.000008318905,0.000008766435,0.00009205076,0.000008231983,0.0000018664089,0.000022454062,0.0000883004,0.00022610853,0.0002761798,0.9979342,0.00023140521,0.0011020611],"study_design_scores_gemma":[0.000009333161,0.000010854279,0.000075165146,0.000009824539,0.0000039711044,0.00005753655,0.00009736586,0.004702676,0.00036725824,0.99112564,0.0035329054,0.000007390936],"about_ca_topic_score_codex":0.0008791454,"about_ca_topic_score_gemma":0.00069924723,"teacher_disagreement_score":0.0055769836,"about_ca_system_score_codex":0.001787092,"about_ca_system_score_gemma":0.00076695066,"threshold_uncertainty_score":0.01865691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015298344,0.007280688,0.0004563493,0.042089414,0.90924114,0.000052744417,0.00054762233,0.00023870336,0.03994027],"genre_scores_gemma":[0.0033785035,0.0138754165,0.00062287005,0.03519809,0.72109467,0.000099109464,0.0012310958,0.0004673836,0.22403294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971288,0.0003384729,0.00024109455,0.0006104065,0.0014115315,0.00026974877],"domain_scores_gemma":[0.98856586,0.0022626843,0.0005294098,0.0007543694,0.0056350445,0.0022526402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025866625,0.0013100778,0.0012553803,0.0021910237,0.0019299282,0.006754478,0.0020298131,0.003857765,0.19147888],"category_scores_gemma":[0.017501554,0.00041334095,0.0011374885,0.0010494395,0.0010889081,0.004291371,0.0018808705,0.0059520025,0.10334767],"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.000018288896,0.000006428504,0.000029276482,0.0001023946,0.0000033483054,0.000042716223,0.000015743235,0.000014740358,0.000060035134,0.000933771,0.98559606,0.013177239],"study_design_scores_gemma":[0.0000057788593,0.0000065901295,0.000067464585,0.000106122316,0.0000032372686,0.00007937075,0.000026622305,0.000017393837,0.000053941156,0.00063193793,0.9989981,0.0000032348119],"about_ca_topic_score_codex":0.00075078,"about_ca_topic_score_gemma":0.0014027007,"teacher_disagreement_score":0.19147888,"about_ca_system_score_codex":0.0016958105,"about_ca_system_score_gemma":0.0027111422,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5628402,0.00038218126,0.39206767,0.0008806618,0.000098617544,0.000108081535,0.00020351764,0.0007280181,0.042691067],"genre_scores_gemma":[0.98254895,0.000106986656,0.014604096,0.0000755718,0.000036394755,0.000056109067,0.0000744747,0.000049774582,0.0024475446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986193,0.0002918369,0.00008157801,0.00030678572,0.000477677,0.00022279091],"domain_scores_gemma":[0.99438936,0.0034443818,0.00047554795,0.00084738893,0.0005698739,0.00027345587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014447015,0.00037905504,0.0005786276,0.0016836909,0.00096023444,0.00269244,0.0008749674,0.0012249751,0.0038134851],"category_scores_gemma":[0.013428653,0.0002661897,0.0008120775,0.0009314252,0.00429078,0.0047438284,0.002292737,0.0020843947,0.00032441886],"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.000028285269,0.00001435184,0.00042256791,0.000023429931,0.0000043560885,0.0001073275,0.00015897989,0.009645709,0.0012604274,0.98258483,0.00021574325,0.0055339662],"study_design_scores_gemma":[0.000009250132,0.000032026266,0.0002225431,0.00002138147,0.0000057424154,0.00014215143,0.00004953414,0.0881672,0.0024118598,0.9076158,0.0013106592,0.000011858074],"about_ca_topic_score_codex":0.00069313723,"about_ca_topic_score_gemma":0.00040718418,"teacher_disagreement_score":0.0038134851,"about_ca_system_score_codex":0.0018117883,"about_ca_system_score_gemma":0.00073763274,"threshold_uncertainty_score":0.013145506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003226007,0.0007994525,0.98466057,0.0012931031,0.00017086463,0.00018686568,0.000090748195,0.00027515506,0.009297237],"genre_scores_gemma":[0.31499565,0.0012035,0.66925204,0.00061010016,0.00073971035,0.0009566667,0.0003189689,0.00017589242,0.011747506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9865204,0.007714651,0.0007996047,0.0016384206,0.0028046276,0.00052237604],"domain_scores_gemma":[0.97347057,0.018975452,0.0011513877,0.0034790405,0.0023911884,0.000532445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013625302,0.0014361175,0.0019230447,0.0028841128,0.0018982701,0.0068101534,0.004946152,0.002336157,0.009506044],"category_scores_gemma":[0.035897467,0.00083990954,0.003333683,0.0022927553,0.006395392,0.006980656,0.004724975,0.004135537,0.0012181428],"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.000060370203,0.000032279346,0.000223108,0.00017604446,0.00010218945,0.00008171391,0.00036273626,0.014198476,0.00030077802,0.95305943,0.0017178315,0.029685082],"study_design_scores_gemma":[0.00006657843,0.000044063447,0.00005373545,0.000050014347,0.000038110175,0.000051074923,0.00005206858,0.06357712,0.00029849855,0.93158937,0.0041532074,0.00002623046],"about_ca_topic_score_codex":0.0028398687,"about_ca_topic_score_gemma":0.0041071335,"teacher_disagreement_score":0.013625302,"about_ca_system_score_codex":0.0028522778,"about_ca_system_score_gemma":0.0033910337,"threshold_uncertainty_score":0.07205838},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072107345,0.0004876333,0.9003934,0.0012421143,0.00015563944,0.00019763036,0.00074472436,0.0013530354,0.023318578],"genre_scores_gemma":[0.68519056,0.000456222,0.30095503,0.0006268842,0.00016929557,0.00055685587,0.0010911229,0.00031031764,0.010643707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959627,0.0013692323,0.00042311675,0.0008021305,0.0011481615,0.0002946204],"domain_scores_gemma":[0.99159384,0.004678535,0.00026702497,0.002435645,0.0008009142,0.00022394655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005089387,0.00078837667,0.0013176297,0.001219166,0.0016164184,0.003445411,0.002221699,0.0012558863,0.0062479884],"category_scores_gemma":[0.0056626652,0.0010741364,0.00256201,0.0013582071,0.003915785,0.008975362,0.004324682,0.0063429717,0.000854436],"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.0000573655,0.000035695357,0.00025860468,0.00008722637,0.00002884458,0.00013270215,0.00027445806,0.006284454,0.004109655,0.9809933,0.0011283351,0.006609439],"study_design_scores_gemma":[0.000105433,0.00006282845,0.00038710362,0.000060410748,0.00007098568,0.00026576093,0.00010066073,0.061540727,0.011243849,0.9040605,0.022048077,0.00005374858],"about_ca_topic_score_codex":0.0014243672,"about_ca_topic_score_gemma":0.0023706383,"teacher_disagreement_score":0.0062479884,"about_ca_system_score_codex":0.0022527988,"about_ca_system_score_gemma":0.0014405238,"threshold_uncertainty_score":0.02691555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67868793,0.00074335706,0.25635245,0.0013417524,0.00011821442,0.00009322075,0.00050363864,0.001135932,0.06102351],"genre_scores_gemma":[0.9755263,0.00013961911,0.019663379,0.00014585925,0.000083660605,0.000048410548,0.00026178232,0.00007517275,0.0040557706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830085,0.0003534758,0.00011038953,0.0003542565,0.000677715,0.00020325051],"domain_scores_gemma":[0.9931652,0.0046801385,0.0005201475,0.0008889053,0.0005121093,0.00023357493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243313,0.0003469503,0.00056548044,0.0016884966,0.0013827151,0.0026196488,0.0010212745,0.00091764826,0.0053802156],"category_scores_gemma":[0.008485163,0.00036588724,0.00080923445,0.00092479924,0.0034895195,0.0064974665,0.0020024993,0.002980653,0.00042027424],"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.00004505939,0.000031075342,0.00044330992,0.000047989586,0.000008228447,0.00018091107,0.0003734472,0.002824821,0.0023308808,0.9876385,0.0003754808,0.0057002665],"study_design_scores_gemma":[0.000019270652,0.00003228335,0.0003591088,0.000027777643,0.000021092956,0.00018065273,0.00012806275,0.0147859305,0.0053241886,0.97565144,0.003452253,0.000018011435],"about_ca_topic_score_codex":0.0008704022,"about_ca_topic_score_gemma":0.0009203026,"teacher_disagreement_score":0.0053802156,"about_ca_system_score_codex":0.0012220744,"about_ca_system_score_gemma":0.00056105637,"threshold_uncertainty_score":0.017998636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09127474,0.00080824184,0.8105759,0.0034797324,0.0001650052,0.00008505988,0.00025287975,0.0009059886,0.09245244],"genre_scores_gemma":[0.94758594,0.0002687425,0.045326002,0.00035062464,0.000110032415,0.00008028385,0.00013962615,0.00006464155,0.0060740933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980677,0.00073878345,0.00012467458,0.0003524742,0.00050071516,0.00021567367],"domain_scores_gemma":[0.99749124,0.0012229822,0.0002472513,0.00042593337,0.00040562925,0.00020699996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022674948,0.00040320584,0.00032544206,0.0010532165,0.0015640358,0.0030231532,0.0011752482,0.0008361509,0.005441009],"category_scores_gemma":[0.0034194528,0.000306192,0.00069289916,0.0007721437,0.0066444953,0.0076842,0.0054263333,0.0020375126,0.0004878225],"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.000025075296,0.0000053033978,0.00007518483,0.000039315688,0.0000043409586,0.00006484163,0.0003284123,0.0012028225,0.0010173302,0.99399155,0.00035013963,0.0028955915],"study_design_scores_gemma":[0.00002086003,0.000025453768,0.00012429032,0.00002920586,0.000016395988,0.0001419107,0.0004668432,0.016499093,0.002738171,0.9673153,0.012606276,0.000016166674],"about_ca_topic_score_codex":0.0015439433,"about_ca_topic_score_gemma":0.0012493089,"teacher_disagreement_score":0.005441009,"about_ca_system_score_codex":0.0017222122,"about_ca_system_score_gemma":0.00086778466,"threshold_uncertainty_score":0.018202007},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019650545,0.16791947,0.05775463,0.08126727,0.21764079,0.00029827125,0.0063924333,0.0033279723,0.46343422],"genre_scores_gemma":[0.040090982,0.114579834,0.060175747,0.020742457,0.14495161,0.0006392472,0.021048516,0.006470385,0.59130126],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99425817,0.0009215887,0.00042891566,0.0009924312,0.0028918395,0.00050700654],"domain_scores_gemma":[0.9923881,0.0026108404,0.00026905807,0.0011451285,0.0027503534,0.0008365559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004909576,0.0013455598,0.0012561824,0.0051227566,0.002127529,0.011803527,0.0023364527,0.0025297406,0.10255644],"category_scores_gemma":[0.011079394,0.00080019713,0.0017596888,0.0055739675,0.0021904255,0.0089266375,0.004362432,0.0072947764,0.040489607],"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.000040767478,0.000023852572,0.00007194429,0.00037518924,0.000019342891,0.00003884607,0.0000651109,0.00038441658,0.0002844999,0.07721409,0.84458745,0.07689443],"study_design_scores_gemma":[0.000005644445,0.000006503318,0.0001414616,0.00016069371,0.0000054267707,0.00006896833,0.000017036054,0.0003615795,0.00011944989,0.020400716,0.978704,0.000008589458],"about_ca_topic_score_codex":0.003685737,"about_ca_topic_score_gemma":0.0034818936,"teacher_disagreement_score":0.10255644,"about_ca_system_score_codex":0.008301925,"about_ca_system_score_gemma":0.005251124,"threshold_uncertainty_score":0.34308547},"labels":[],"label_agreement":null}]}