{"meta":{"query_hash":"c5c6f302455f","filters":{"topic":"Logic, Reasoning, and Knowledge"},"cohort_total":835,"direct_labels_cover":0,"predictions_cover":835,"exported":835,"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/c5c6f302455f","api":"https://metacan.xera.ac/api/v1/cohort?topic=Logic%2C+Reasoning%2C+and+Knowledge"},"results":[{"id":"W110110163","doi":"","title":"An action description language for iterated belief change","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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":"Ontic; Action (physics); Iterated function; Epistemology; Computer science; Semantics (computer science); Projection (relational algebra); Sequence (biology); Philosophy of language; Cognitive science; Mathematics; Algorithm; Philosophy; Programming language; Psychology; Metaphysics","score_opus":0.26246317474050784,"score_gpt":0.38866312096590383,"score_spread":0.126199946225396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110110163","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.0017978869,0.00017212662,0.98962295,0.0007956519,0.00014424957,0.00014574965,0.00049388286,0.0019739938,0.0048535774],"genre_scores_gemma":[0.12747273,0.00047164262,0.85875887,0.00094586913,0.00018825723,0.00094721693,0.0013607715,0.00069306575,0.009161743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996219,0.0012678782,0.0006686029,0.00061219785,0.0009339507,0.00029845448],"domain_scores_gemma":[0.99589866,0.0020738805,0.00037197632,0.0006615243,0.0007735246,0.00022034161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005160301,0.0012195022,0.0010096298,0.0014529529,0.001452304,0.0040654955,0.0033878605,0.0024652937,0.0089277895],"category_scores_gemma":[0.005856892,0.0011699337,0.0030708131,0.0013005338,0.0037660934,0.008060764,0.0033636813,0.004871239,0.0018135563],"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.00006129149,0.00004058138,0.00013698608,0.00017285462,0.00002315137,0.00029119427,0.00085449655,0.009980111,0.001600392,0.9675216,0.0036021306,0.01571515],"study_design_scores_gemma":[0.00021412467,0.00010950988,0.00012033353,0.00020331968,0.00010293477,0.0005639497,0.00031417576,0.17859179,0.005750131,0.68266016,0.13122897,0.00014052082],"about_ca_topic_score_codex":0.0060228966,"about_ca_topic_score_gemma":0.0060663247,"teacher_disagreement_score":0.0089277895,"about_ca_system_score_codex":0.0026793364,"about_ca_system_score_gemma":0.0036023878,"threshold_uncertainty_score":0.029866457},"labels":[],"label_agreement":null},{"id":"W1183538153","doi":"10.71781/10757","title":"Categorical quantum computation","year":2008,"lang":"en","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Categorical quantum mechanics; Quantum computer; Mathematics; Quantum algorithm; Quantum; Algebra over a field; Quantum operation; Quantum information; Pure mathematics; Open quantum system; Quantum mechanics; Physics","score_opus":0.008268325258866413,"score_gpt":0.18622685704919062,"score_spread":0.1779585317903242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1183538153","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.017348774,0.031125313,0.096974276,0.054437235,0.009571336,0.00009870817,0.0033727784,0.0010238359,0.78604776],"genre_scores_gemma":[0.5045095,0.017076423,0.03301727,0.005106697,0.0070000994,0.0001756741,0.0027016138,0.00065539434,0.42975733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992968,0.0001524661,0.000016595692,0.00011323082,0.00031588518,0.000105042265],"domain_scores_gemma":[0.99909234,0.00022335416,0.000031533313,0.00019165114,0.00032921796,0.00013188759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008137166,0.00057508727,0.00080251554,0.001337259,0.0021141053,0.0039732624,0.0008732574,0.00076458923,0.04621113],"category_scores_gemma":[0.0023845704,0.00033290722,0.00073997333,0.0018434048,0.0031872687,0.003067882,0.0014108698,0.002115184,0.0027309216],"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.000007989979,0.000007084638,0.000067331246,0.000033561395,0.0000075818984,0.000018851639,0.00010590136,0.0002716748,0.00019077014,0.95919687,0.03248384,0.0076085585],"study_design_scores_gemma":[0.00001393175,0.0000078524545,0.00053886825,0.000038057275,0.00000939814,0.000051206098,0.00007782439,0.0014686086,0.00031555453,0.87267494,0.124787584,0.000016204249],"about_ca_topic_score_codex":0.067461446,"about_ca_topic_score_gemma":0.074960425,"teacher_disagreement_score":0.067461446,"about_ca_system_score_codex":0.00926417,"about_ca_system_score_gemma":0.004711323,"threshold_uncertainty_score":0.15459162},"labels":[],"label_agreement":null},{"id":"W119782208","doi":"10.1145/1227839.1227841","title":"Recycling computed answers in rewrite systems for abduction","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","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":"University of Alberta","funders":"","keywords":"Negation; Domain (mathematical analysis); Computation; Computer science; Class (philosophy); Encoding (memory); Theoretical computer science; Circumscription; Logic program; Logic programming; Programming language; Algorithm; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.04025305083435371,"score_gpt":0.2969539954423772,"score_spread":0.2567009446080235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119782208","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.056767054,0.00095044565,0.93058956,0.00057237217,0.00009862974,0.00039488406,0.0002075033,0.005225261,0.0051942756],"genre_scores_gemma":[0.38649377,0.00063989224,0.60531354,0.00041971062,0.000092636576,0.00030606755,0.00059313164,0.0011318643,0.0050093215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922168,0.003204951,0.00096753496,0.00102864,0.0020569689,0.00052509387],"domain_scores_gemma":[0.9815694,0.013574021,0.0005907489,0.002892465,0.0012379884,0.00013533776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065105087,0.0008559598,0.0015307923,0.0017411644,0.0015888445,0.0035690335,0.0026146525,0.002037562,0.004522557],"category_scores_gemma":[0.025689242,0.0012630594,0.002002564,0.0014382743,0.0035864334,0.0055143004,0.0032001415,0.0034952478,0.0010231775],"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.0007405947,0.0004380102,0.0021025103,0.0011598967,0.0002439792,0.0010039731,0.004083865,0.11496717,0.027907904,0.5765982,0.0037195927,0.2670343],"study_design_scores_gemma":[0.00027736422,0.0002697279,0.00056911004,0.00022601309,0.00039676164,0.00052206474,0.0005385215,0.40961328,0.039956775,0.5333414,0.014080761,0.0002082853],"about_ca_topic_score_codex":0.003659551,"about_ca_topic_score_gemma":0.004643836,"teacher_disagreement_score":0.0065105087,"about_ca_system_score_codex":0.0020681915,"about_ca_system_score_gemma":0.0015306699,"threshold_uncertainty_score":0.03443128},"labels":[],"label_agreement":null},{"id":"W1218394713","doi":"","title":"Progression of situation calculus action theories with incomplete information","year":2007,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"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 Toronto","funders":"","keywords":"Situation calculus; Focus (optics); Action (physics); Computer science; Complete information; Calculus (dental); Mechanism (biology); Artificial intelligence; Theoretical computer science; Cognitive science; Mathematical economics; Mathematics; Epistemology; Medicine; Psychology","score_opus":0.039549117897515584,"score_gpt":0.3152796743196456,"score_spread":0.27573055642213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1218394713","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.005467987,0.0001730112,0.9877843,0.00046417714,0.000067068846,0.00009627348,0.00014028295,0.00034885787,0.0054581636],"genre_scores_gemma":[0.27327156,0.00075244997,0.71491754,0.00028152243,0.00028757437,0.0006473562,0.0006629196,0.00022026047,0.008958843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99329937,0.001969021,0.000699856,0.0012370741,0.0022952638,0.00049945817],"domain_scores_gemma":[0.991146,0.005196297,0.00059902767,0.001626342,0.0010288507,0.0004033608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011672478,0.0012975835,0.0016868407,0.003116965,0.002098862,0.0053523793,0.004870777,0.0020857719,0.009606793],"category_scores_gemma":[0.01919574,0.001335327,0.003437707,0.0024817877,0.0059276037,0.020101156,0.0057791504,0.005542122,0.0012324736],"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.000028376751,0.000010525766,0.00007425112,0.00005678001,0.00001432568,0.00008668964,0.00032192463,0.0067469487,0.00027574538,0.9849068,0.00031222065,0.007165423],"study_design_scores_gemma":[0.000028955928,0.000019024637,0.000037737278,0.00003403036,0.000027938444,0.000055134675,0.000063450796,0.05442658,0.00068723294,0.9391418,0.0054522753,0.000025963973],"about_ca_topic_score_codex":0.0038696374,"about_ca_topic_score_gemma":0.0024013266,"teacher_disagreement_score":0.011672478,"about_ca_system_score_codex":0.0031578152,"about_ca_system_score_gemma":0.0033725726,"threshold_uncertainty_score":0.061730742},"labels":[],"label_agreement":null},{"id":"W1221313983","doi":"10.1613/jair.4558","title":"Belief Change with Uncertain Action Histories","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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; British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Iterated function; Sequence (biology); Generalization; Action (physics); Computer science; Perception; Formalism (music); Artificial intelligence; Mathematics; Epistemology","score_opus":0.5288386770750579,"score_gpt":0.4561122789807625,"score_spread":0.07272639809429543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1221313983","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.082927555,0.0009295441,0.90266484,0.0024104838,0.00008823172,0.00009436345,0.0003526796,0.00027990554,0.010252258],"genre_scores_gemma":[0.90704787,0.00039738603,0.0869281,0.000230815,0.0001316826,0.00016462618,0.00023149334,0.000039092898,0.0048289015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647444,0.0014383461,0.00017853272,0.0008098142,0.0007512094,0.00034761667],"domain_scores_gemma":[0.9739952,0.020264152,0.0022616743,0.0016734356,0.0011010007,0.000704496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00612537,0.00087103783,0.0010105299,0.0016261006,0.0010122196,0.0029532926,0.0024758065,0.0027705557,0.0041252375],"category_scores_gemma":[0.036039785,0.00068797474,0.0016064139,0.0013141505,0.0035095036,0.0061722873,0.0024764226,0.0028250217,0.0003822172],"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.0002338937,0.000091672795,0.0035154412,0.00015314911,0.00017200816,0.001268734,0.001268642,0.30989602,0.0009343217,0.6563142,0.0011202759,0.025031587],"study_design_scores_gemma":[0.000044401757,0.00006084747,0.0005073068,0.000022502425,0.000051529198,0.00014169901,0.00010602215,0.5645119,0.00040148073,0.43235758,0.0017558206,0.000038955157],"about_ca_topic_score_codex":0.006749735,"about_ca_topic_score_gemma":0.0041520814,"teacher_disagreement_score":0.006749735,"about_ca_system_score_codex":0.002658551,"about_ca_system_score_gemma":0.0009053887,"threshold_uncertainty_score":0.03239447},"labels":[],"label_agreement":null},{"id":"W126088545","doi":"","title":"Iterated belief change: a transition system approach","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"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":"Belief revision; Iterated function; Interpretation (philosophy); Computer science; Transition (genetics); Set (abstract data type); Operator (biology); Transition system; Artificial intelligence; Theoretical computer science; Mathematics; Programming language","score_opus":0.13737546099184317,"score_gpt":0.30236902475651123,"score_spread":0.16499356376466806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126088545","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.006406759,0.00024848952,0.9851896,0.0006264342,0.00008022116,0.00006455191,0.00006043745,0.0003080619,0.0070153587],"genre_scores_gemma":[0.61073,0.0005607928,0.3806014,0.00030657297,0.000211586,0.00032563577,0.00011508465,0.00012553336,0.0070232963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998231,0.00067300274,0.00011507879,0.00037535522,0.00043315956,0.00017243392],"domain_scores_gemma":[0.9959313,0.002835429,0.0003033778,0.0003216745,0.000424378,0.00018388356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028398267,0.000705613,0.00075258006,0.0014458693,0.0009541116,0.00262227,0.0023338476,0.001873218,0.006562362],"category_scores_gemma":[0.007862786,0.0005633112,0.002144105,0.00087831734,0.0034254377,0.0053210887,0.0019929581,0.0028732915,0.0006778377],"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.000051459163,0.000036788133,0.00065523264,0.00008256988,0.00008749735,0.0003513875,0.0006735473,0.06116478,0.0010953395,0.9188983,0.0006962269,0.016206782],"study_design_scores_gemma":[0.00004055063,0.000054061806,0.00017795901,0.000028657842,0.00006548069,0.00012439297,0.00007758588,0.2632168,0.0009214421,0.73123175,0.0040265964,0.00003475545],"about_ca_topic_score_codex":0.004539431,"about_ca_topic_score_gemma":0.003065516,"teacher_disagreement_score":0.006562362,"about_ca_system_score_codex":0.0019838475,"about_ca_system_score_gemma":0.0012889532,"threshold_uncertainty_score":0.021953285},"labels":[],"label_agreement":null},{"id":"W1275153498","doi":"","title":"First-order strong progression for local-effect basic action theories","year":2008,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":21,"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 Toronto","funders":"","keywords":"Axiom; Construct (python library); Action (physics); Situation calculus; Class (philosophy); Computer science; Set (abstract data type); Order (exchange); First order; Theoretical computer science; Algebra over a field; Artificial intelligence; Calculus (dental); Mathematics; Pure mathematics; Programming language; Applied mathematics","score_opus":0.05244309291146103,"score_gpt":0.3234355732692524,"score_spread":0.27099248035779133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1275153498","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.038704608,0.0015837516,0.9100036,0.0015495742,0.0002282048,0.00019316615,0.0009415895,0.0008151262,0.04598034],"genre_scores_gemma":[0.6530579,0.0018239834,0.3221914,0.000708079,0.00043939595,0.00053844805,0.0017982243,0.00022383414,0.019218843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769884,0.00039806587,0.00022801662,0.0005551568,0.00090422254,0.00021570564],"domain_scores_gemma":[0.9967379,0.0016717578,0.00019312996,0.0006078412,0.00058523344,0.00020418988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046962607,0.000711571,0.0009025619,0.0018925474,0.0016993693,0.0035419348,0.001540686,0.0012052624,0.0075930418],"category_scores_gemma":[0.004991495,0.0007042841,0.0025656463,0.0015703128,0.0040804627,0.011910896,0.0034164658,0.004429158,0.001269596],"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.000016141032,0.000014442051,0.00009364524,0.000053260297,0.000008455984,0.00008150757,0.00029069418,0.00083098834,0.0006099008,0.9929368,0.00036273638,0.0047014025],"study_design_scores_gemma":[0.000022106986,0.000031495514,0.00009209487,0.000030058074,0.000016955462,0.000115991286,0.000056633184,0.0052250423,0.001116152,0.98295516,0.010319146,0.000019136289],"about_ca_topic_score_codex":0.0016651613,"about_ca_topic_score_gemma":0.0016030014,"teacher_disagreement_score":0.0075930418,"about_ca_system_score_codex":0.0021027136,"about_ca_system_score_gemma":0.0018788769,"threshold_uncertainty_score":0.025401235},"labels":[],"label_agreement":null},{"id":"W12780597","doi":"10.1046/j.1463-1318.2002.00351.x","title":"ID-logic and the ramification problem for the situation calculus","year":2000,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Successor cardinal; Axiom; Negation; Mathematics; Inductive logic programming; Autoepistemic logic; Calculus (dental); Computer science; Algebra over a field; Multimodal logic; Theoretical computer science; Artificial intelligence; Description logic; Programming language; Pure mathematics","score_opus":0.07881972697231922,"score_gpt":0.2912606658914988,"score_spread":0.2124409389191796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12780597","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.039367836,0.0052740052,0.8488614,0.016541876,0.00064365065,0.00027369373,0.0010136152,0.0007861716,0.08723782],"genre_scores_gemma":[0.5540468,0.003983474,0.4148394,0.0023793057,0.0009271845,0.00050923147,0.0014492798,0.00017873064,0.021686615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955239,0.0014885729,0.0005405123,0.0006358765,0.0012047613,0.00060622726],"domain_scores_gemma":[0.99276555,0.005339926,0.00036086858,0.00057260884,0.000607259,0.00035382865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00806309,0.0010260576,0.0013022113,0.0035145713,0.004263339,0.008262356,0.0030310391,0.0029292433,0.009217083],"category_scores_gemma":[0.011097167,0.0010504804,0.0032091665,0.004105544,0.008337888,0.01869275,0.0067041996,0.0077979453,0.0013396606],"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.000013814313,0.000011032086,0.00010100934,0.00005103696,0.000010601079,0.00012766792,0.00019213575,0.0008669839,0.00006813366,0.9929628,0.0008954156,0.004699385],"study_design_scores_gemma":[0.0000108298855,0.0000044322546,0.00003161561,0.000016798884,0.000007861983,0.00008613411,0.0000686871,0.0041369023,0.00008396911,0.9920872,0.0034568887,0.000008757144],"about_ca_topic_score_codex":0.0052256505,"about_ca_topic_score_gemma":0.0035683622,"teacher_disagreement_score":0.009217083,"about_ca_system_score_codex":0.005139765,"about_ca_system_score_gemma":0.0022838525,"threshold_uncertainty_score":0.042642236},"labels":[],"label_agreement":null},{"id":"W128321172","doi":"10.1609/aaai.v25i1.8045","title":"Heuristic Planning in Adversarial Dynamic Domains","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adversarial system; Planner; Adversary; Heuristic; Computer science; Nondeterministic algorithm; Domain (mathematical analysis); Context (archaeology); Artificial intelligence; Heuristics; Automated planning and scheduling; Process (computing); Plan (archaeology); Theoretical computer science; Computer security; Mathematics","score_opus":0.08358768588845844,"score_gpt":0.29032386772501445,"score_spread":0.206736181836556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128321172","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.04622546,0.0006310987,0.94149154,0.00070026476,0.000038017857,0.00012684903,0.00016176699,0.0006223733,0.010002588],"genre_scores_gemma":[0.7148836,0.0007533962,0.2796739,0.00021332955,0.000048809154,0.0002417428,0.00030831774,0.0001132599,0.0037637134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883,0.0005474574,0.00007089508,0.00016531427,0.00021623852,0.00017016663],"domain_scores_gemma":[0.99616444,0.002958491,0.0002625001,0.0002943217,0.0001531525,0.0001670952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018304529,0.00068920583,0.0007730813,0.0008477423,0.00067071285,0.0015796857,0.0012666803,0.0010198822,0.0021155444],"category_scores_gemma":[0.005957021,0.0005592198,0.00089333626,0.00071445445,0.00302674,0.00199186,0.0019934373,0.0012905772,0.00027990766],"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.00008850964,0.000027937887,0.00050328375,0.00013814181,0.000051630366,0.00026296815,0.00022119508,0.8494293,0.00086208526,0.13111511,0.0007572901,0.016542472],"study_design_scores_gemma":[0.000023697541,0.000023835528,0.00010834735,0.00002428136,0.000013900689,0.00004946359,0.000086970904,0.85017115,0.00092416594,0.14676496,0.001793758,0.0000154624],"about_ca_topic_score_codex":0.005618156,"about_ca_topic_score_gemma":0.0066042626,"teacher_disagreement_score":0.005618156,"about_ca_system_score_codex":0.0017133532,"about_ca_system_score_gemma":0.0013362283,"threshold_uncertainty_score":0.012431264},"labels":[],"label_agreement":null},{"id":"W130180478","doi":"","title":"A generalized gelfond-lifschitz transformation for logic programs with abstract constraints","year":2007,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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 Alberta","funders":"","keywords":"Representation (politics); Abstract interpretation; Atom (system on chip); Stable model semantics; Transformation (genetics); Generalization; Set (abstract data type); Mathematics; Semantics (computer science); Computer science; Discrete mathematics; Algorithm; Algebra over a field; Programming language; Pure mathematics; Operational semantics","score_opus":0.030743909847212852,"score_gpt":0.2714562335928613,"score_spread":0.24071232374564847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130180478","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.017814146,0.00012560979,0.97300726,0.000428106,0.00004204822,0.000106578125,0.00015190351,0.00084948284,0.0074748644],"genre_scores_gemma":[0.4246904,0.00033850133,0.56500566,0.00050150685,0.00008696765,0.00055304926,0.00059197197,0.0004301434,0.00780177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984907,0.00023690921,0.00009026341,0.0003021104,0.0007202438,0.00015979908],"domain_scores_gemma":[0.9991732,0.00030832452,0.00006939257,0.0002086453,0.00019551517,0.00004488567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014294384,0.0009181328,0.0007058935,0.0017293174,0.00088895235,0.0019829462,0.001834885,0.0013139454,0.0033064256],"category_scores_gemma":[0.0026788446,0.0004837405,0.0029536604,0.0012490102,0.0028088053,0.003764253,0.002281727,0.0027991815,0.0007971784],"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.000074496464,0.000052935087,0.0003282202,0.00009877926,0.000040824434,0.00031685765,0.00040522404,0.03263437,0.009344892,0.9197088,0.0013388377,0.03565577],"study_design_scores_gemma":[0.00006138363,0.00007155439,0.000111451685,0.000031188003,0.00004439918,0.00015946396,0.00005971094,0.15069433,0.009924883,0.8268442,0.011962005,0.000035504036],"about_ca_topic_score_codex":0.003177065,"about_ca_topic_score_gemma":0.0027095967,"teacher_disagreement_score":0.0033064256,"about_ca_system_score_codex":0.0028020833,"about_ca_system_score_gemma":0.001681474,"threshold_uncertainty_score":0.020330667},"labels":[],"label_agreement":null},{"id":"W130404319","doi":"","title":"Tractable reasoning with incomplete first-order knowledge in dynamic systems with context-dependent actions","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sequence (biology); Computer science; Context (archaeology); Projection (relational algebra); Knowledge base; Action (physics); Knowledge-based systems; Order (exchange); Artificial intelligence; Base (topology); Theoretical computer science; Algorithm; Mathematics","score_opus":0.016088353028610225,"score_gpt":0.2447324675509788,"score_spread":0.22864411452236857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130404319","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.027974945,0.0008009033,0.9635878,0.0023613833,0.000036961188,0.00014193339,0.00048534735,0.00057783595,0.0040329294],"genre_scores_gemma":[0.5589627,0.0021663466,0.43113974,0.0005342481,0.00036143433,0.00040707417,0.0015836956,0.00013087761,0.004713905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930455,0.0022809948,0.0005169986,0.001355638,0.0020461052,0.0007547694],"domain_scores_gemma":[0.9764746,0.019326705,0.0011527927,0.0017457495,0.0009436344,0.00035668627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006143825,0.0013196089,0.0020527255,0.0020465592,0.0022913346,0.0063337125,0.003582072,0.0026653935,0.0031180081],"category_scores_gemma":[0.025032049,0.0015717115,0.003788417,0.003125052,0.005924733,0.017557248,0.005656348,0.006261349,0.0004716837],"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.00020178274,0.00011467132,0.00080331473,0.0005955663,0.00017414261,0.0014363069,0.0015582334,0.2274199,0.0015534069,0.72585154,0.0024803365,0.03781086],"study_design_scores_gemma":[0.00006716438,0.000024688488,0.00015368816,0.00005844515,0.00007008624,0.00019449658,0.00019412799,0.1913837,0.0015617824,0.8027746,0.003486857,0.000030335406],"about_ca_topic_score_codex":0.012888699,"about_ca_topic_score_gemma":0.01204034,"teacher_disagreement_score":0.012888699,"about_ca_system_score_codex":0.0040560057,"about_ca_system_score_gemma":0.0038555083,"threshold_uncertainty_score":0.03249204},"labels":[],"label_agreement":null},{"id":"W1315694","doi":"10.1007/978-3-319-14484-9_14","title":"Infinite States Verification in Game-Theoretic Logics: Case Studies and Implementation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; State (computer science); Exploit; Theoretical computer science; Prolog; Algorithm","score_opus":0.022704458121057623,"score_gpt":0.2949436477337804,"score_spread":0.27223918961272275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1315694","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.071351714,0.0005981921,0.8878683,0.0015366558,0.00009078543,0.00031262092,0.000116271025,0.00112054,0.037004862],"genre_scores_gemma":[0.7956852,0.00035564,0.19565426,0.00023164401,0.000037204267,0.00025179778,0.00015333209,0.00021897092,0.007412018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992762,0.0035651124,0.0005172237,0.00067709934,0.0016566446,0.00082198484],"domain_scores_gemma":[0.9638936,0.031073842,0.0005791352,0.0025478597,0.0014130997,0.00049247476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008632691,0.0007162645,0.0010026208,0.00084903766,0.0021928404,0.0061012595,0.004498128,0.002852076,0.007252594],"category_scores_gemma":[0.032323044,0.00093885104,0.0020767802,0.0011119653,0.007379969,0.011030885,0.0059017483,0.0050790827,0.00070326333],"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.00024038019,0.0002502602,0.00042776502,0.0001828554,0.00003180867,0.00019659792,0.0008800133,0.027523454,0.0015396515,0.93100405,0.0010097087,0.036713567],"study_design_scores_gemma":[0.0001354868,0.00007316964,0.00012883292,0.000088971254,0.000056546996,0.00012169723,0.00035336008,0.22720128,0.0059163133,0.76247764,0.0034098707,0.00003686404],"about_ca_topic_score_codex":0.0062540127,"about_ca_topic_score_gemma":0.0060723657,"teacher_disagreement_score":0.008632691,"about_ca_system_score_codex":0.004119261,"about_ca_system_score_gemma":0.003986488,"threshold_uncertainty_score":0.045654595},"labels":[],"label_agreement":null},{"id":"W141387592","doi":"10.1007/978-94-007-2582-9_9","title":"The Axiom of Choice in an Elementary Theory of Operations and Sets","year":2012,"lang":"en","type":"book-chapter","venue":"˜The œWestern Ontario series in philosophy of science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Axiom; Axiom of choice; Constructive set theory; Zermelo–Fraenkel set theory; Ethos; Set theory; Mathematics; Urelement; Relation (database); Function (biology); Set (abstract data type); Mathematical economics; Choice function; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Philosophy; Data mining","score_opus":0.03171846241398109,"score_gpt":0.2575778716925028,"score_spread":0.22585940927852172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141387592","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.009168974,0.015014798,0.21316448,0.010496979,0.0013636928,0.00008100601,0.000472478,0.00019924599,0.7500383],"genre_scores_gemma":[0.53419787,0.01604111,0.17647484,0.003661557,0.002362739,0.0004965881,0.00074553984,0.00038518326,0.2656346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990006,0.0002665963,0.00006300881,0.00016368557,0.0004108577,0.00009531547],"domain_scores_gemma":[0.9990895,0.00052956917,0.000027783795,0.0001607332,0.00015306874,0.00003944086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016507973,0.00054828665,0.0007155498,0.0011877794,0.002396154,0.0045002955,0.0015645198,0.0017313847,0.0074899443],"category_scores_gemma":[0.0022827033,0.00072109536,0.0008890404,0.001762139,0.015228814,0.008245748,0.0015124421,0.0045235315,0.0014464924],"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.0000019308382,0.0000010492081,0.000007769421,0.00000794342,7.0393156e-7,0.0000035144792,0.000095267824,0.000042880292,0.000025087129,0.9969779,0.0013933945,0.00144251],"study_design_scores_gemma":[0.0000036017827,0.000002147712,0.000044250475,0.000015885615,0.0000020047341,0.000012812576,0.000026759888,0.0002055423,0.000060665083,0.96257144,0.03705132,0.0000034297825],"about_ca_topic_score_codex":0.015854146,"about_ca_topic_score_gemma":0.02176374,"teacher_disagreement_score":0.015854146,"about_ca_system_score_codex":0.005000889,"about_ca_system_score_gemma":0.003932541,"threshold_uncertainty_score":0.03628415},"labels":[],"label_agreement":null},{"id":"W145848708","doi":"10.5591/978-1-57735-516-8/ijcai11-145","title":"Revising by an inconsistent set of formulas","year":2011,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Belief revision; Iterated function; Sequence (biology); Set (abstract data type); Ranking (information retrieval); Representation (politics); Computer science; State (computer science); Function (biology); Artificial intelligence; Mathematics; Theoretical computer science; Algorithm; Programming language","score_opus":0.05759725426541475,"score_gpt":0.2568479911394098,"score_spread":0.19925073687399505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W145848708","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.19205348,0.00046094798,0.7926222,0.0026227618,0.00013663358,0.00015152832,0.00015408389,0.000538377,0.011259825],"genre_scores_gemma":[0.70018715,0.00021740807,0.2954851,0.0006307371,0.00014479972,0.00022312501,0.00020526384,0.000105925814,0.002800528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98879725,0.0043561007,0.0010559638,0.0018164591,0.0034657053,0.0005085609],"domain_scores_gemma":[0.97174937,0.013688559,0.0028370223,0.00672077,0.004398049,0.0006062076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010377491,0.0006550558,0.0011487402,0.0026541285,0.0020404467,0.0043057064,0.0026619898,0.001898788,0.0024237863],"category_scores_gemma":[0.04245166,0.00073736603,0.0018607005,0.0012315079,0.0036908237,0.0091702165,0.0033536255,0.00309356,0.00028049992],"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.00026827143,0.00014350485,0.0044499673,0.00022950605,0.00022604575,0.0010037499,0.003302959,0.015467716,0.0069407686,0.8933547,0.0015608852,0.07305188],"study_design_scores_gemma":[0.00007173023,0.00013827457,0.0010443064,0.00010885005,0.00017512315,0.000673345,0.0005247891,0.10450611,0.006571814,0.8785774,0.0075405706,0.00006765811],"about_ca_topic_score_codex":0.00080827426,"about_ca_topic_score_gemma":0.00082167046,"teacher_disagreement_score":0.010377491,"about_ca_system_score_codex":0.0016259374,"about_ca_system_score_gemma":0.0016241318,"threshold_uncertainty_score":0.05488211},"labels":[],"label_agreement":null},{"id":"W147223905","doi":"","title":"Horn clause belief change: contraction functions","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":47,"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":"Negation; Contraction (grammar); Horn clause; Propositional calculus; Belief revision; Negation as failure; Mathematics; Computer science; Mathematical economics; Autoepistemic logic; Logic programming; Artificial intelligence; Linguistics; Programming language; Multimodal logic; Description logic; Philosophy","score_opus":0.05277720679870552,"score_gpt":0.25005002530806864,"score_spread":0.19727281850936312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147223905","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.047382765,0.000662175,0.9241056,0.0026278296,0.000090387955,0.00012037454,0.00011411941,0.00045800774,0.0244388],"genre_scores_gemma":[0.7773765,0.0005994977,0.2095754,0.0010582813,0.00028514268,0.00036541847,0.000252835,0.00025047918,0.010236439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620664,0.0017204296,0.00020180772,0.00053984276,0.0009638346,0.00036742925],"domain_scores_gemma":[0.9829789,0.012106981,0.0008554764,0.001862328,0.0017001145,0.0004961599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008933154,0.00064744795,0.0006422584,0.0018422928,0.0011923556,0.0027436595,0.0018292292,0.0017894922,0.0048372997],"category_scores_gemma":[0.02665304,0.0004309959,0.0013652543,0.0014982832,0.004653509,0.009771351,0.0033180998,0.003957185,0.00062088994],"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.000075775235,0.0000315534,0.00060673105,0.000052440035,0.00001988064,0.00010883437,0.0005063386,0.0045603537,0.0010064492,0.9607735,0.0010309201,0.031227246],"study_design_scores_gemma":[0.00002547229,0.000038472466,0.00033920375,0.000027611648,0.000023268021,0.00015929506,0.00015484412,0.06866537,0.0018223871,0.92376435,0.0049604536,0.00001927179],"about_ca_topic_score_codex":0.00090809417,"about_ca_topic_score_gemma":0.00044766944,"teacher_disagreement_score":0.008933154,"about_ca_system_score_codex":0.0020430018,"about_ca_system_score_gemma":0.0008753605,"threshold_uncertainty_score":0.047243595},"labels":[],"label_agreement":null},{"id":"W1478159848","doi":"10.1017/cbo9780511809835.015","title":"Models of CL","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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 Lethbridge","funders":"","keywords":"Ask price; Order (exchange); Mathematics; First order; Algebra over a field; Calculus (dental); Mathematical economics; Pure mathematics; Applied mathematics; Economics","score_opus":0.03447660044994514,"score_gpt":0.19607321882259188,"score_spread":0.16159661837264674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1478159848","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.014152977,0.0048016766,0.16582674,0.014966206,0.0006512352,0.00014933823,0.0015750766,0.0011340503,0.7967427],"genre_scores_gemma":[0.6810195,0.003516114,0.056747124,0.0051364065,0.0008479259,0.00054754724,0.003288051,0.00072460365,0.2481727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979607,0.0005386523,0.000109026856,0.00053872215,0.000564639,0.0002883869],"domain_scores_gemma":[0.99792945,0.0007146435,0.00015268323,0.00046440805,0.00052777113,0.00021118569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017444289,0.0010504794,0.0006042047,0.0020316143,0.0028577703,0.011253227,0.0020919214,0.0030336715,0.032847323],"category_scores_gemma":[0.0038604944,0.00058376545,0.0014287342,0.0018842608,0.005209452,0.015282132,0.004909998,0.0043706554,0.0063876244],"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.0000030668841,0.0000028190907,0.000025165587,0.000012773297,0.0000012610075,0.000018021621,0.00017073638,0.00007776648,0.000042750013,0.99677664,0.0015704138,0.001298476],"study_design_scores_gemma":[0.00000921785,0.000005444541,0.000030444719,0.00003205435,0.0000023611817,0.00006597461,0.00015894615,0.0008515769,0.00011582019,0.9495726,0.049148135,0.000007470219],"about_ca_topic_score_codex":0.006026003,"about_ca_topic_score_gemma":0.0044370815,"teacher_disagreement_score":0.032847323,"about_ca_system_score_codex":0.0051976657,"about_ca_system_score_gemma":0.0019799268,"threshold_uncertainty_score":0.109885216},"labels":[],"label_agreement":null},{"id":"W147871885","doi":"","title":"Mutual belief revision: semantics and computation","year":2007,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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":"Computer science; Intuition; Belief revision; Semantics (computer science); Artificial intelligence; Computation; Computational model; Computational complexity theory; Theoretical computer science; Perspective (graphical); Cognitive science; Programming language; Algorithm","score_opus":0.017617017287479757,"score_gpt":0.27607079912274196,"score_spread":0.2584537818352622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147871885","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.024501013,0.0029232656,0.9286652,0.005905342,0.0002545245,0.00012478547,0.00014190841,0.00036413604,0.03711975],"genre_scores_gemma":[0.84889,0.0011104567,0.1428869,0.00057351374,0.00048271214,0.00030471882,0.00014672313,0.00008011293,0.00552478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949062,0.0024370144,0.00031683547,0.00062632636,0.0013902683,0.00032342362],"domain_scores_gemma":[0.99458426,0.0033943886,0.00042471595,0.0008023472,0.0005838564,0.00021052653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043479623,0.00069013325,0.0010398236,0.001446843,0.001369681,0.00478887,0.0018721608,0.0020711983,0.0038536955],"category_scores_gemma":[0.011354951,0.00048762467,0.0018629701,0.0014791476,0.00600386,0.008622963,0.003189007,0.0025661392,0.00053177745],"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.000016552538,0.000011146686,0.000083271596,0.000053746346,0.000015987935,0.000044492957,0.00020365242,0.0037697232,0.00012852787,0.98900324,0.00047426825,0.006195256],"study_design_scores_gemma":[0.00001598019,0.000010956774,0.00006093966,0.000017096565,0.000009998726,0.00006799347,0.000047648013,0.021519305,0.00013032187,0.9756118,0.0024970823,0.000010897978],"about_ca_topic_score_codex":0.0013876957,"about_ca_topic_score_gemma":0.0008287371,"teacher_disagreement_score":0.00478887,"about_ca_system_score_codex":0.0023979738,"about_ca_system_score_gemma":0.0013685413,"threshold_uncertainty_score":0.022994518},"labels":[],"label_agreement":null},{"id":"W1483916154","doi":"10.1007/978-3-540-85176-9_7","title":"Information Sharing Agents in a Peer Data Exchange System","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data exchange; Peer-to-peer; Data sharing; Set (abstract data type); Information retrieval; Process (computing); Information exchange; Order (exchange); Theoretical computer science; World Wide Web; Programming language","score_opus":0.05851569643856192,"score_gpt":0.27054393559011153,"score_spread":0.2120282391515496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483916154","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.17352307,0.0005802058,0.7924226,0.0016881217,0.00023788265,0.0006635033,0.00020116534,0.0026806323,0.028002745],"genre_scores_gemma":[0.6903342,0.00035746323,0.28562,0.00019591079,0.00013462325,0.00034643372,0.0003165474,0.00021147967,0.022483278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808395,0.0007883766,0.0001888295,0.00027591846,0.00047198345,0.00019097683],"domain_scores_gemma":[0.99717975,0.0010679419,0.00014216774,0.0008309929,0.00038882907,0.00039034677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029851638,0.00040773785,0.0011483846,0.00082918146,0.0036660938,0.0040854923,0.0023665854,0.0023148607,0.0059002773],"category_scores_gemma":[0.0045260573,0.00065375236,0.0005682205,0.0014697313,0.0014091932,0.006179338,0.004471478,0.0014361044,0.0014486057],"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.0020274187,0.0009357985,0.005515888,0.00034146616,0.0002425185,0.001981484,0.0049928245,0.12921882,0.018914366,0.6527743,0.016462501,0.16659264],"study_design_scores_gemma":[0.00037157588,0.00034194323,0.00073389616,0.000055360553,0.00022621175,0.00059426524,0.0012131348,0.6821946,0.013116099,0.24055828,0.06048661,0.00010801839],"about_ca_topic_score_codex":0.0031283097,"about_ca_topic_score_gemma":0.0025941767,"teacher_disagreement_score":0.0059002773,"about_ca_system_score_codex":0.000833656,"about_ca_system_score_gemma":0.0017298738,"threshold_uncertainty_score":0.019738376},"labels":[],"label_agreement":null},{"id":"W1486588230","doi":"","title":"Belief change in the context of fallible actions and observations","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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":"Belief revision; Iterated function; Sequence (biology); Computer science; Formalism (music); Perception; Artificial intelligence; Generalization; Action (physics); Probabilistic logic; Ranking (information retrieval); Context (archaeology); Mathematics; Psychology","score_opus":0.08410657756083431,"score_gpt":0.2741123618949653,"score_spread":0.19000578433413098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486588230","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.09130649,0.0011847791,0.89315706,0.0029856656,0.00009257235,0.00009430945,0.00017564665,0.00026594594,0.010737444],"genre_scores_gemma":[0.89137465,0.00038366488,0.10468145,0.00023432195,0.00010419911,0.00011906541,0.00012034927,0.000035564386,0.0029466616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493355,0.002374019,0.00022391893,0.0010009333,0.0009417168,0.0005258371],"domain_scores_gemma":[0.9772439,0.01679493,0.0024079753,0.0017124447,0.0011175155,0.00072317006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006960605,0.00074224715,0.00091246853,0.0018063836,0.0014697383,0.0039183674,0.002363479,0.0030119265,0.0029186],"category_scores_gemma":[0.03248882,0.0006200889,0.0015866931,0.0014267021,0.006671538,0.008978705,0.0030587122,0.0036333827,0.0002685307],"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.00022791453,0.000088775276,0.002402685,0.0001551779,0.00013802058,0.0013199345,0.002768875,0.1128331,0.00193917,0.8561432,0.000755705,0.021227434],"study_design_scores_gemma":[0.000046508452,0.000079364196,0.00068702496,0.000031800384,0.00006268203,0.00016848462,0.0002994865,0.247348,0.00083847455,0.7482881,0.0020971468,0.000052857413],"about_ca_topic_score_codex":0.008510393,"about_ca_topic_score_gemma":0.005266727,"teacher_disagreement_score":0.008510393,"about_ca_system_score_codex":0.0029639641,"about_ca_system_score_gemma":0.0011537914,"threshold_uncertainty_score":0.03681159},"labels":[],"label_agreement":null},{"id":"W1488218625","doi":"10.1007/978-3-642-40624-9_20","title":"Reconfiguration of Large-Scale Surveillance Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Control reconfiguration; Computer science; Scalability; Metis; Argumentation theory; Software deployment; Hazard; Information system; Distributed computing; Computer security; Software engineering; Database; Embedded system","score_opus":0.013508632732212447,"score_gpt":0.2302827232910457,"score_spread":0.21677409055883326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488218625","genre_codex":"methods","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.27352118,0.0025802597,0.6814898,0.00084854953,0.0003045441,0.00012480206,0.0003170438,0.0047093495,0.0361044],"genre_scores_gemma":[0.979006,0.000507603,0.016126024,0.000054192515,0.00005919391,0.00004128517,0.00020271566,0.000108635504,0.0038943663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996921,0.00006820577,0.000019346266,0.00010076594,0.000056281977,0.00006336932],"domain_scores_gemma":[0.9994962,0.0001705652,0.000056370638,0.00014980235,0.000059224843,0.00006778968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031776982,0.00052141433,0.0005728621,0.0004432119,0.0004615506,0.0013604156,0.0009206583,0.00056301034,0.004394789],"category_scores_gemma":[0.0013330277,0.00032403524,0.0003397349,0.00047917478,0.0006127161,0.001637627,0.0010717446,0.000587096,0.0006258195],"study_design_candidate":"not_applicable","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.00041172814,0.00011872017,0.0020648355,0.0002327277,0.000095503834,0.0005701979,0.00036530916,0.6898633,0.04152303,0.039848212,0.0065532625,0.21835315],"study_design_scores_gemma":[0.000029131726,0.00009810257,0.0016193696,0.00001983446,0.000026222218,0.00020372098,0.00013538814,0.9512184,0.005454664,0.033638585,0.0075350646,0.00002145805],"about_ca_topic_score_codex":0.001359882,"about_ca_topic_score_gemma":0.0011099047,"teacher_disagreement_score":0.004394789,"about_ca_system_score_codex":0.00060562557,"about_ca_system_score_gemma":0.0002595024,"threshold_uncertainty_score":0.014702082},"labels":[],"label_agreement":null},{"id":"W1491260230","doi":"10.1007/978-3-642-14977-1_7","title":"Speculative Abductive Reasoning for Hierarchical Agent Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soundness; Computer science; Abductive reasoning; Completeness (order theory); Non-monotonic logic; Key (lock); Context (archaeology); Reasoning system; Artificial intelligence; Negation; Multi-agent system; Theoretical computer science; Programming language; Computer security","score_opus":0.020333590905234244,"score_gpt":0.25884820157656646,"score_spread":0.23851461067133223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491260230","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.019186867,0.0009960952,0.9653415,0.0007562775,0.00005358043,0.00009815958,0.00014684237,0.00066127523,0.012759385],"genre_scores_gemma":[0.468949,0.0008605481,0.5227599,0.00011118217,0.00007701922,0.00011494844,0.00049098436,0.00008755715,0.0065486846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988249,0.00042959675,0.00012006603,0.00010692417,0.00043041937,0.00008811126],"domain_scores_gemma":[0.9973788,0.0019282835,0.00010242168,0.00035902497,0.00017439823,0.000057137808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020835765,0.00072591554,0.0006421381,0.0008647842,0.0008591273,0.0021752403,0.0022521045,0.001109398,0.0045047775],"category_scores_gemma":[0.006038308,0.00083463284,0.0009592336,0.0008476409,0.002507392,0.0035449753,0.0023027752,0.0024787514,0.00047418888],"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.00014998349,0.000058565576,0.00073369866,0.00026280573,0.000082694656,0.00031304112,0.00065749063,0.22054066,0.0025574563,0.6892853,0.0038311428,0.08152714],"study_design_scores_gemma":[0.000022855396,0.000009812711,0.000080549566,0.000024356512,0.000019120087,0.00003307914,0.00006428657,0.49190205,0.0010037905,0.50370985,0.0031223688,0.000007869155],"about_ca_topic_score_codex":0.0061030434,"about_ca_topic_score_gemma":0.008208544,"teacher_disagreement_score":0.0061030434,"about_ca_system_score_codex":0.0014150254,"about_ca_system_score_gemma":0.0009991751,"threshold_uncertainty_score":0.015069962},"labels":[],"label_agreement":null},{"id":"W14927176","doi":"","title":"On How Agents Make Friends: Mechanisms for Trust Acquisition","year":2000,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Simple (philosophy); Cognition; Knowledge acquisition; Knowledge management; Psychology; Epistemology","score_opus":0.017539376896234186,"score_gpt":0.24171285935042058,"score_spread":0.2241734824541864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14927176","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.03341719,0.002573078,0.89528126,0.014776184,0.00032760107,0.00018813714,0.00012100071,0.0006724705,0.05264306],"genre_scores_gemma":[0.83287156,0.0028912586,0.14479357,0.0014401923,0.000391612,0.00035800162,0.00018249673,0.00023896474,0.016832406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940836,0.0029422091,0.0003475471,0.0009727813,0.001171736,0.00048213816],"domain_scores_gemma":[0.96905935,0.017651077,0.0033509694,0.0061804513,0.0024338968,0.0013243402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072146016,0.0007635357,0.0010287229,0.0019277049,0.0043498804,0.007514051,0.00301808,0.0049740574,0.0076474803],"category_scores_gemma":[0.03973332,0.0010224753,0.0014378252,0.0017104645,0.009051585,0.025099808,0.006507364,0.003871963,0.0018479712],"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.000050211172,0.000029466324,0.0008872245,0.00011980456,0.00006663761,0.00032075366,0.003412631,0.005618922,0.00082959805,0.9553376,0.0036566143,0.029670557],"study_design_scores_gemma":[0.00003944653,0.000043316766,0.00045470562,0.0000899233,0.00006656422,0.0003535511,0.0006467966,0.027125295,0.0011091371,0.9456256,0.024384947,0.000060788654],"about_ca_topic_score_codex":0.003253532,"about_ca_topic_score_gemma":0.0021283287,"teacher_disagreement_score":0.0076474803,"about_ca_system_score_codex":0.0020695245,"about_ca_system_score_gemma":0.0012190981,"threshold_uncertainty_score":0.03815496},"labels":[],"label_agreement":null},{"id":"W1492736196","doi":"10.1007/3-540-45402-0_33","title":"plp: A Generic Compiler for Ordered Logic Programs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Programming language; Computer science; Logic programming; Compiler; Answer set programming; Logic program; Stable model semantics; Set (abstract data type); Theoretical computer science; Semantics (computer science); Higher-order logic; Multimodal logic; Description logic","score_opus":0.03952314625983704,"score_gpt":0.26084834389164624,"score_spread":0.2213251976318092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492736196","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.002911028,0.00021872137,0.8780792,0.00019424729,0.0001505392,0.00018871836,0.0019944715,0.109234974,0.0070282305],"genre_scores_gemma":[0.056536302,0.0006162799,0.8824983,0.00071495003,0.000150281,0.00061673025,0.008931372,0.03665384,0.013282055],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.0001714016,0.00015540706,0.00018346493,0.00035696733,0.00016203373],"domain_scores_gemma":[0.9987047,0.00054017577,0.00007297458,0.00038303024,0.00022093208,0.00007820552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013841247,0.0015960914,0.0011067811,0.001374243,0.0007702844,0.0028306383,0.0029632992,0.001385284,0.02386798],"category_scores_gemma":[0.0036318002,0.002086257,0.0020076882,0.0015011737,0.0011847318,0.006367301,0.0040118457,0.0026392143,0.012841321],"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.000780321,0.00034913275,0.0013428336,0.0019338038,0.00011411232,0.0004914057,0.0006964944,0.013577468,0.021445833,0.17914174,0.19309413,0.5870327],"study_design_scores_gemma":[0.00077343686,0.00019656269,0.00089054304,0.00046516827,0.00020294785,0.001050184,0.00030521714,0.15602286,0.097748585,0.33470652,0.40740573,0.00023231345],"about_ca_topic_score_codex":0.0012027932,"about_ca_topic_score_gemma":0.0019493159,"teacher_disagreement_score":0.02386798,"about_ca_system_score_codex":0.00096243306,"about_ca_system_score_gemma":0.0018062724,"threshold_uncertainty_score":0.07984638},"labels":[],"label_agreement":null},{"id":"W149637118","doi":"","title":"On Probing and Multi-Threading in PLATYPUS","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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; Western University","funders":"","keywords":"Platypus; Tree traversal; Computer science; Threading (protein sequence); Theoretical computer science; Set (abstract data type); Multithreading; Variety (cybernetics); Architecture; Distributed computing; Algorithm; Artificial intelligence; Programming language; Thread (computing); Physics; Biology","score_opus":0.014381425520448753,"score_gpt":0.22918616500601913,"score_spread":0.21480473948557038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149637118","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.3839403,0.000872281,0.602404,0.0011853464,0.000101501966,0.00010870905,0.00008053478,0.0035682912,0.00773904],"genre_scores_gemma":[0.82223445,0.00019174597,0.17501698,0.00022659962,0.000038993134,0.00011050367,0.000098856864,0.00036275756,0.0017191367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830925,0.0007211369,0.00008875073,0.0003425511,0.00033006197,0.00020830451],"domain_scores_gemma":[0.9953843,0.0029449172,0.00028874422,0.00093997334,0.00023274537,0.00020942141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023054432,0.0003302116,0.000599473,0.00044584932,0.0011445562,0.0013491682,0.0012769743,0.0006572085,0.0020156635],"category_scores_gemma":[0.0063762977,0.0003908305,0.000459089,0.00078666006,0.0030987714,0.0038062078,0.0023805187,0.0015358237,0.00022471182],"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.001407994,0.00022737075,0.0071239443,0.00039117827,0.00009421905,0.00043083326,0.0031984567,0.1456971,0.047679868,0.5470483,0.0048069474,0.24189381],"study_design_scores_gemma":[0.00008327551,0.00014428486,0.0012305334,0.000036655154,0.000042655156,0.00014734306,0.00019159187,0.64459735,0.023261502,0.3200768,0.010147232,0.00004082624],"about_ca_topic_score_codex":0.0028950074,"about_ca_topic_score_gemma":0.0027966697,"teacher_disagreement_score":0.0028950074,"about_ca_system_score_codex":0.0010649982,"about_ca_system_score_gemma":0.00092474546,"threshold_uncertainty_score":0.012192547},"labels":[],"label_agreement":null},{"id":"W1498575378","doi":"10.1007/3-540-45619-8_28","title":"A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Stable model semantics; Programming language; Theoretical computer science; Mathematics; Algorithm; Algebra over a field; Multimodal logic; Description logic; Pure mathematics","score_opus":0.030304064705304896,"score_gpt":0.2536489175324722,"score_spread":0.22334485282716732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498575378","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.045625452,0.0004385389,0.9272239,0.00076800486,0.00024216062,0.00028356677,0.0005802449,0.0053291908,0.01950894],"genre_scores_gemma":[0.25625777,0.00072872953,0.71537423,0.00035296637,0.00025699052,0.00023235,0.0024916464,0.0019194374,0.022385903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983681,0.00022933824,0.000134936,0.00053727295,0.00047307106,0.00025722387],"domain_scores_gemma":[0.99658513,0.0019048003,0.0001575282,0.0006986463,0.0005237157,0.0001302313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011004433,0.00067871,0.0007765608,0.00057755667,0.0007155614,0.0019075957,0.0017715455,0.0006210743,0.02011148],"category_scores_gemma":[0.0049954965,0.00078870886,0.0017090759,0.0013681998,0.0011760192,0.005338398,0.002071771,0.0029493286,0.0060415063],"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.0009220004,0.0012727338,0.0014573383,0.0011038847,0.000080478225,0.00036518218,0.0013643883,0.029532185,0.049920805,0.34213117,0.031080576,0.5407693],"study_design_scores_gemma":[0.0005947867,0.0005943459,0.0022264465,0.0002073567,0.00034140502,0.00076619,0.0005955885,0.35955283,0.10863998,0.4354121,0.09087265,0.00019629918],"about_ca_topic_score_codex":0.004054055,"about_ca_topic_score_gemma":0.004618255,"teacher_disagreement_score":0.02011148,"about_ca_system_score_codex":0.0015150273,"about_ca_system_score_gemma":0.0019237137,"threshold_uncertainty_score":0.06727958},"labels":[],"label_agreement":null},{"id":"W1498837330","doi":"10.1007/978-3-642-17511-4_2","title":"Speed-Up Techniques for Negation in Grounding","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rewriting; Ground; Computer science; Negation; Extension (predicate logic); Algebra over a field; Task (project management); Algebraic number; Relational algebra; Theoretical computer science; Algorithm; Programming language; Relational database; Mathematics; Database; Pure mathematics; Electrical engineering","score_opus":0.021375777864465578,"score_gpt":0.2674784011797515,"score_spread":0.24610262331528596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498837330","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.013568136,0.0010541858,0.96979505,0.00076800137,0.00039166276,0.00022911924,0.00020042386,0.0042358516,0.00975754],"genre_scores_gemma":[0.15380771,0.00091478665,0.8315423,0.0005218853,0.00042373128,0.0002693169,0.00076759263,0.0015673194,0.010185464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435025,0.001322677,0.00057588285,0.0010139396,0.0020327237,0.0007044942],"domain_scores_gemma":[0.9823783,0.011077301,0.00045657408,0.004489911,0.0013676775,0.00023009846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004108618,0.0022883704,0.0020400973,0.0034750553,0.0021580872,0.0033912447,0.005109529,0.0020848082,0.02034088],"category_scores_gemma":[0.018022213,0.0020775916,0.00450345,0.0038265022,0.0037733372,0.018189453,0.009050127,0.0071858712,0.004043434],"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.0006747284,0.0003105299,0.0011447542,0.0009901021,0.0001921085,0.00030142115,0.0008268834,0.018737314,0.011496887,0.39745566,0.02114045,0.54672927],"study_design_scores_gemma":[0.00016986553,0.00012275591,0.0003016389,0.00018336337,0.00030063518,0.00035321977,0.00022641446,0.12398382,0.01467131,0.83673173,0.022879716,0.00007545368],"about_ca_topic_score_codex":0.002244354,"about_ca_topic_score_gemma":0.0053118197,"teacher_disagreement_score":0.02034088,"about_ca_system_score_codex":0.001849644,"about_ca_system_score_gemma":0.0013365034,"threshold_uncertainty_score":0.06804705},"labels":[],"label_agreement":null},{"id":"W1499053674","doi":"10.1007/s10994-011-5259-2","title":"ILP turns 20","year":2011,"lang":"en","type":"article","venue":"Machine Learning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":128,"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":"Biotechnology and Biological Sciences Research Council; Microsoft Research; University of Oxford; Imperial College London; University of New South Wales; Royal Academy of Engineering; Jawaharlal Nehru University","keywords":"Inductive logic programming; Analogy; Subject (documents); Implementation; Computer science; Artificial intelligence; Development (topology); Projection (relational algebra); Cognitive science; Machine learning; Epistemology; Psychology; Programming language; Mathematics; Algorithm; Library science","score_opus":0.02463525336756793,"score_gpt":0.22296309924810606,"score_spread":0.19832784588053815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499053674","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00356033,0.003304477,0.17635225,0.032613706,0.006245812,0.00007896914,0.0010656168,0.0014050672,0.7753738],"genre_scores_gemma":[0.3994771,0.006667782,0.090457104,0.029665152,0.010679071,0.0006771402,0.0027230517,0.0028008833,0.4568527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980147,0.000531157,0.000102708604,0.0006677974,0.00047403065,0.00020962207],"domain_scores_gemma":[0.9976108,0.0011626197,0.00012695158,0.00041632095,0.00053935515,0.00014406808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016635085,0.0011333892,0.0007582317,0.0011518345,0.002074537,0.0059264437,0.0011976116,0.001756406,0.0885513],"category_scores_gemma":[0.007198107,0.00052690605,0.0013744268,0.0007978429,0.004345189,0.00620494,0.0025092617,0.0051218625,0.02653746],"study_design_candidate":"not_applicable","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.000022760234,0.0000108893855,0.00011053102,0.000048566097,0.000010394916,0.00011180598,0.00012798049,0.00049933937,0.0001520506,0.94277865,0.041158248,0.014968766],"study_design_scores_gemma":[0.000009802128,0.0000075040653,0.00006615809,0.00004294717,0.0000073223873,0.000093111914,0.000053301916,0.0012175561,0.00028284916,0.84111357,0.15709828,0.000007616823],"about_ca_topic_score_codex":0.0016316072,"about_ca_topic_score_gemma":0.0015482184,"teacher_disagreement_score":0.0885513,"about_ca_system_score_codex":0.0027887246,"about_ca_system_score_gemma":0.0014692338,"threshold_uncertainty_score":0.2962336},"labels":[],"label_agreement":null},{"id":"W1500791855","doi":"10.1007/11564751_90","title":"Mechanism Design for Preference Aggregation over Coalitions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Impossibility; Computer science; Mechanism (biology); Preference; Mechanism design; Outcome (game theory); Rationality; Context (archaeology); Mathematical economics; Theoretical computer science; Artificial intelligence; Microeconomics; Mathematics; Economics; Epistemology","score_opus":0.04829329954142331,"score_gpt":0.2607175010341069,"score_spread":0.2124242014926836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500791855","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.0055233245,0.00018463479,0.98990995,0.0002652817,0.000039635474,0.00014070875,0.00006596623,0.00014213596,0.003728383],"genre_scores_gemma":[0.25275397,0.0005619455,0.7383501,0.00019167693,0.00013197039,0.0009113515,0.00036554303,0.00010177653,0.0066316617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908103,0.0048968224,0.0009053676,0.0011548618,0.0016262631,0.000606431],"domain_scores_gemma":[0.9920913,0.004619488,0.00054636144,0.0014984267,0.00081733405,0.00042710977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013044545,0.0011513365,0.0021861691,0.0013288119,0.0015925043,0.005335132,0.0044035586,0.0021277799,0.0060733645],"category_scores_gemma":[0.017776793,0.0015385798,0.0028718603,0.0030954324,0.002187964,0.009748032,0.0047596814,0.0034849108,0.0009356474],"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.00014284237,0.00009706915,0.00022628112,0.00028141512,0.00014513997,0.00009789561,0.00040137407,0.045327835,0.0013516321,0.9003203,0.0023375489,0.049270764],"study_design_scores_gemma":[0.00011491339,0.00008874713,0.0000609012,0.000054762568,0.000090068475,0.00015081272,0.00009414381,0.18230599,0.0012664938,0.80986965,0.005871363,0.0000322044],"about_ca_topic_score_codex":0.0008493719,"about_ca_topic_score_gemma":0.0010646898,"teacher_disagreement_score":0.013044545,"about_ca_system_score_codex":0.0021525535,"about_ca_system_score_gemma":0.0020123818,"threshold_uncertainty_score":0.06898701},"labels":[],"label_agreement":null},{"id":"W1501530641","doi":"","title":"Only-knowing: taking it beyond autoepistemic reasoning","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":21,"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 Toronto","funders":"","keywords":"Non-monotonic logic; Autoepistemic logic; Default logic; Probabilistic logic network; Computer science; Circumscription; Artificial intelligence; Connection (principal bundle); Description logic; Mathematics; Theoretical computer science; Multimodal logic","score_opus":0.019094690577552656,"score_gpt":0.262556036971545,"score_spread":0.24346134639399236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501530641","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.03668555,0.0023112416,0.89420646,0.008688755,0.00026771432,0.00010904311,0.00031811543,0.000544721,0.056868415],"genre_scores_gemma":[0.77689,0.0012573691,0.20945494,0.0024824545,0.00067082513,0.00019616782,0.00047682357,0.00020129359,0.008370147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967745,0.0011208612,0.0002137649,0.00085634243,0.0007600606,0.00027448428],"domain_scores_gemma":[0.9938113,0.0025388398,0.0004825134,0.0021270395,0.0006415037,0.00039878965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051116627,0.0007567735,0.0011519772,0.0018033844,0.0020311195,0.005817386,0.0023767168,0.0025200443,0.0030786607],"category_scores_gemma":[0.007008941,0.0005717256,0.0017849548,0.0012551544,0.010300199,0.028675795,0.0046892297,0.003993852,0.00038338918],"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.000015156969,0.000011435922,0.00023277244,0.000033255634,0.000021213573,0.00010824903,0.00047303535,0.0010426964,0.0003108379,0.991184,0.00042415498,0.0061431946],"study_design_scores_gemma":[0.0000053883987,0.000008227257,0.0001066574,0.00001669908,0.000015780006,0.00008271744,0.00008093771,0.00411629,0.00024973784,0.99176157,0.0035469916,0.000008878614],"about_ca_topic_score_codex":0.0015796428,"about_ca_topic_score_gemma":0.0019360174,"teacher_disagreement_score":0.005817386,"about_ca_system_score_codex":0.0014460434,"about_ca_system_score_gemma":0.0015423424,"threshold_uncertainty_score":0.027033389},"labels":[],"label_agreement":null},{"id":"W1501710627","doi":"10.1007/978-3-540-45072-6_22","title":"Logical Data Expiration for Fixpoint Extensions of Temporal Logics","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fixed point; Mathematics; Mathematical analysis","score_opus":0.07657877478952711,"score_gpt":0.2933293041430649,"score_spread":0.21675052935353778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501710627","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.020835651,0.0013612496,0.9614015,0.0013823796,0.00032748285,0.00016671706,0.0002773314,0.0023445426,0.011903097],"genre_scores_gemma":[0.46587512,0.0019540887,0.5113351,0.001032515,0.0007766023,0.00046275847,0.0012722103,0.0013219827,0.015969636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921583,0.0021746529,0.0012839865,0.0013841614,0.0022214705,0.0007774811],"domain_scores_gemma":[0.978642,0.013489579,0.0010841449,0.004659249,0.0015361306,0.00058894354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016411567,0.0012079385,0.0016893623,0.0024391855,0.0025187393,0.00745621,0.004617747,0.003113019,0.007951866],"category_scores_gemma":[0.029267883,0.002214605,0.0039672717,0.0025158932,0.0066334233,0.023572065,0.008987012,0.009849177,0.0014089457],"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.0003447687,0.00007313905,0.0005693066,0.00027190967,0.000052080388,0.00029777462,0.0007273998,0.0047228695,0.0017472885,0.93949497,0.0026363928,0.049061984],"study_design_scores_gemma":[0.000061634244,0.000036870904,0.00007823867,0.00006975242,0.00006595272,0.00016946162,0.00011416917,0.016216539,0.0021609345,0.9739163,0.0070682014,0.00004188597],"about_ca_topic_score_codex":0.0014131226,"about_ca_topic_score_gemma":0.0013021351,"teacher_disagreement_score":0.016411567,"about_ca_system_score_codex":0.0029692634,"about_ca_system_score_gemma":0.0022347549,"threshold_uncertainty_score":0.08679372},"labels":[],"label_agreement":null},{"id":"W1502525946","doi":"10.22329/il.v23i3.2173","title":"Three Recalcitrant Problems of Argument Identification","year":2003,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Argument (complex analysis); Wright; Identification (biology); Epistemology; Counterexample; Principal (computer security); Neglect; Sociology; Computer science; Philosophy; Psychology; Mathematics","score_opus":0.02737763397754952,"score_gpt":0.24158599261892552,"score_spread":0.214208358641376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502525946","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.018986879,0.0047933455,0.47672057,0.32224825,0.006246111,0.00058592926,0.00020797586,0.001404926,0.16880599],"genre_scores_gemma":[0.4226374,0.0024093715,0.4876999,0.036620207,0.0060900594,0.0014648334,0.00018518201,0.001060851,0.041832224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.8899398,0.06593254,0.007577046,0.0116802,0.021572689,0.0032977078],"domain_scores_gemma":[0.84736305,0.09712831,0.009176677,0.018967472,0.024231717,0.0031327594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.076014504,0.0018872593,0.0023638727,0.00880335,0.012396336,0.023204694,0.00916588,0.01328898,0.009569454],"category_scores_gemma":[0.19019261,0.0015221976,0.00260415,0.0044169836,0.050471056,0.03129808,0.018918717,0.025163889,0.0031891782],"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.000029958073,0.000026015443,0.00035218737,0.00017765447,0.000018945166,0.00015076577,0.0063745687,0.00014200543,0.00022287984,0.9541309,0.012739766,0.02563432],"study_design_scores_gemma":[0.000054552474,0.000023967692,0.00031751505,0.00035825875,0.000025394333,0.0006698084,0.0052137678,0.0018065678,0.00095223036,0.90866244,0.081854984,0.000060554892],"about_ca_topic_score_codex":0.0024503807,"about_ca_topic_score_gemma":0.0019679833,"teacher_disagreement_score":0.076014504,"about_ca_system_score_codex":0.0074550165,"about_ca_system_score_gemma":0.00624183,"threshold_uncertainty_score":0.40200794},"labels":[],"label_agreement":null},{"id":"W1502645024","doi":"10.1111/phc3.12047","title":"Belief Revision II: Ranking Theory","year":2013,"lang":"en","type":"article","venue":"Philosophy Compass","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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 Toronto","funders":"","keywords":"Doxastic logic; Belief revision; Iterated function; Ranking (information retrieval); Ideal (ethics); Epistemology; Computer science; Psychology; Artificial intelligence; Mathematics; Philosophy","score_opus":0.021134318543371937,"score_gpt":0.23543351329139703,"score_spread":0.21429919474802508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502645024","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.028882798,0.007582409,0.77764106,0.016306242,0.0009999906,0.0002476977,0.00038569086,0.00054214126,0.16741186],"genre_scores_gemma":[0.89850694,0.0021519675,0.07540772,0.00169783,0.0015946511,0.0003689246,0.0002391833,0.00009677474,0.01993608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99060845,0.005340036,0.00034514547,0.00091035926,0.0022133684,0.00058260106],"domain_scores_gemma":[0.987706,0.007792407,0.00073296187,0.0012009894,0.0021233098,0.0004443163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008014303,0.00074809964,0.0012019022,0.0018720226,0.0010158699,0.004746583,0.0016168231,0.00203339,0.011044533],"category_scores_gemma":[0.01768345,0.00039036453,0.0014014416,0.0015705895,0.0046149553,0.00433454,0.0016578174,0.00357066,0.0012662569],"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.000019929756,0.000023768684,0.00020879242,0.000104202205,0.000036796246,0.00004119114,0.000112313064,0.005267317,0.00012906434,0.9771433,0.003266968,0.013646338],"study_design_scores_gemma":[0.000023995,0.000020228375,0.00019130328,0.000026605829,0.0000139608865,0.000039752926,0.000029885021,0.021753946,0.00008115694,0.97428656,0.0035196259,0.000013049239],"about_ca_topic_score_codex":0.0016924798,"about_ca_topic_score_gemma":0.0010567387,"teacher_disagreement_score":0.011044533,"about_ca_system_score_codex":0.0031801444,"about_ca_system_score_gemma":0.0015031097,"threshold_uncertainty_score":0.042384207},"labels":[],"label_agreement":null},{"id":"W1505140006","doi":"","title":"Guest Editorial: Fifth Latin American Workshop on Non-Monotonic Reasoning 2009, (LANMR'09)","year":2010,"lang":"en","type":"editorial","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","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":"Belief revision; Argumentation theory; Computer science; Deductive reasoning; Abductive reasoning; Answer set programming; Non-monotonic logic; Knowledge representation and reasoning; Defeasible reasoning; Default logic; Presentation (obstetrics); Artificial intelligence; Logic programming; Description logic; Epistemology; Autoepistemic logic","score_opus":0.013258162665309303,"score_gpt":0.2518153702499064,"score_spread":0.23855720758459711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505140006","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.00016248172,0.012258608,0.0011115297,0.052607708,0.91977197,0.000053041058,0.00029599393,0.00021943013,0.013519293],"genre_scores_gemma":[0.0022372305,0.016818684,0.0014711425,0.033255465,0.81392145,0.00012931043,0.0006525298,0.0005207891,0.13099343],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969984,0.0004975127,0.00031953392,0.00064124493,0.001261865,0.00028137307],"domain_scores_gemma":[0.9917595,0.0018923744,0.0005314455,0.0002642659,0.0043931687,0.0011592563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044025118,0.0016970049,0.0014878453,0.00259043,0.0016582009,0.0071283877,0.0020170691,0.004485545,0.07237318],"category_scores_gemma":[0.0096827,0.0005204468,0.0017821803,0.0010964382,0.001015123,0.0041886615,0.0017350295,0.006881242,0.043965187],"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.000033815082,0.000009663389,0.000023466155,0.00014266666,0.0000068799495,0.00004051743,0.000012113649,0.000018544872,0.000108099244,0.0005690965,0.9905075,0.008527525],"study_design_scores_gemma":[0.000011217526,0.000010458577,0.000092468465,0.00017213137,0.00000915994,0.00007880974,0.0000248036,0.000048064554,0.00009731528,0.00047199725,0.9989773,0.0000064564256],"about_ca_topic_score_codex":0.0011133706,"about_ca_topic_score_gemma":0.0023515264,"teacher_disagreement_score":0.07237318,"about_ca_system_score_codex":0.00273446,"about_ca_system_score_gemma":0.0021241372,"threshold_uncertainty_score":0.2421124},"labels":[],"label_agreement":null},{"id":"W1505990740","doi":"10.1007/978-3-540-30124-0_27","title":"A Third-Order Bounded Arithmetic Theory for PSPACE","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; Mathematical proof; Bounded function; Symbol (formal); Mathematics; Discrete mathematics; Translation (biology); Computer science; Computational complexity theory; Algorithm","score_opus":0.015632170293998476,"score_gpt":0.24897506359028976,"score_spread":0.2333428932962913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505990740","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.01633469,0.0037401195,0.76412225,0.0043299654,0.00054682855,0.00008375417,0.00058217335,0.0015184481,0.2087418],"genre_scores_gemma":[0.6395244,0.004509956,0.27064663,0.002822124,0.0013868537,0.00047560138,0.001762368,0.00090005825,0.07797204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989858,0.00016942619,0.00006737561,0.00017765266,0.00043679573,0.00016280713],"domain_scores_gemma":[0.9984439,0.00085930695,0.00006530554,0.00034129564,0.00020080217,0.000089375215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294055,0.0011573491,0.0013446106,0.0022448152,0.0023046962,0.0052926936,0.0026943064,0.0016983383,0.011086747],"category_scores_gemma":[0.002595417,0.00091527443,0.0026683332,0.002932476,0.005696606,0.011351516,0.0032017315,0.008969215,0.002812815],"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.0000099824665,0.000008130888,0.000032030042,0.000030799023,0.0000037484124,0.000015886973,0.000083812854,0.00083381316,0.0001590745,0.99141085,0.0016800374,0.00573175],"study_design_scores_gemma":[0.000006501641,0.0000043777814,0.000035330057,0.000012622153,0.0000055362248,0.000022324928,0.000015654714,0.0021913443,0.00018866296,0.99195766,0.005554651,0.0000053531307],"about_ca_topic_score_codex":0.0036120757,"about_ca_topic_score_gemma":0.0030952427,"teacher_disagreement_score":0.011086747,"about_ca_system_score_codex":0.004392843,"about_ca_system_score_gemma":0.0016283466,"threshold_uncertainty_score":0.03708881},"labels":[],"label_agreement":null},{"id":"W150743059","doi":"","title":"Belief revision of logic programs under answer set semantics","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":47,"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":"Logic programming; Non-monotonic logic; Belief revision; Stable model semantics; Autoepistemic logic; Answer set programming; Circumscription; Default logic; Well-founded semantics; Computer science; Computational logic; Programming language; Intermediate logic; Higher-order logic; Dynamic logic (digital electronics); Theoretical computer science; Semantics (computer science); Zeroth-order logic; Propositional calculus; Formalism (music); Multimodal logic; Description logic; Artificial intelligence; Operational semantics; Denotational semantics","score_opus":0.05219998354239883,"score_gpt":0.27262890609559315,"score_spread":0.22042892255319432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150743059","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.08330701,0.00028887743,0.91043365,0.0009844697,0.000056920573,0.00009980197,0.000078688645,0.00050144043,0.00424922],"genre_scores_gemma":[0.76982516,0.0002467903,0.22639412,0.00036068156,0.00018589363,0.00017870382,0.00018096212,0.00008856711,0.0025391174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463177,0.0019251019,0.0003124166,0.000930669,0.001681182,0.0005187892],"domain_scores_gemma":[0.98182076,0.012481014,0.0016876428,0.0018844672,0.0016487836,0.00047733774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051888833,0.0006688202,0.0008564338,0.0015639293,0.00088307785,0.003916038,0.0018828461,0.0014612233,0.0020039263],"category_scores_gemma":[0.0258318,0.00039025917,0.001908119,0.0012550851,0.0035937733,0.007334143,0.003246965,0.0031577742,0.0002620119],"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.0003033478,0.00017470773,0.0014482558,0.0002637158,0.00012493195,0.00036395036,0.0015832277,0.0618474,0.0062620644,0.8427426,0.0012641769,0.08362161],"study_design_scores_gemma":[0.00005302537,0.00013140876,0.0003663859,0.000037750375,0.00007441324,0.00015559777,0.00016046625,0.30962455,0.004729723,0.68285704,0.0017705053,0.000039161896],"about_ca_topic_score_codex":0.0011502375,"about_ca_topic_score_gemma":0.0008838801,"teacher_disagreement_score":0.0051888833,"about_ca_system_score_codex":0.0019807797,"about_ca_system_score_gemma":0.0010895977,"threshold_uncertainty_score":0.02744174},"labels":[],"label_agreement":null},{"id":"W1507965739","doi":"10.1007/11546207_18","title":"Platypus: A Platform for Distributed Answer Set Solving","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computation; Variety (cybernetics); Set (abstract data type); Distributed computing; Theoretical computer science; Software; Scheme (mathematics); State (computer science); Distributed algorithm; Model of computation; Programming language; Artificial intelligence","score_opus":0.02499926661315623,"score_gpt":0.25511258022844263,"score_spread":0.2301133136152864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507965739","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.008512443,0.0004610729,0.8497934,0.000501604,0.00027071018,0.0004146547,0.0017655889,0.117243245,0.021037279],"genre_scores_gemma":[0.150243,0.0009967075,0.7805165,0.00080733723,0.00026042928,0.0011265249,0.011654696,0.019493269,0.03490162],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988306,0.0002525498,0.00012072543,0.00020104324,0.0004674039,0.00012771618],"domain_scores_gemma":[0.99851817,0.0006659269,0.00007443816,0.00045493306,0.00013857392,0.0001480467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015927919,0.001036689,0.0010874936,0.0009937945,0.0012947416,0.002201685,0.0042263786,0.0012079242,0.031384755],"category_scores_gemma":[0.0038958923,0.0011575382,0.0011109774,0.0014165363,0.0015254536,0.005668056,0.0047160652,0.0031835078,0.010248577],"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.0018439477,0.00042366327,0.001371804,0.0011087309,0.00016862513,0.00037327266,0.0013197028,0.017318118,0.01934017,0.29523396,0.1935673,0.46793067],"study_design_scores_gemma":[0.0007147766,0.00018299717,0.00067739224,0.00021082279,0.0001217221,0.00040917206,0.00020563252,0.24311988,0.0307262,0.47545895,0.24804913,0.00012323317],"about_ca_topic_score_codex":0.0024054744,"about_ca_topic_score_gemma":0.003183939,"teacher_disagreement_score":0.031384755,"about_ca_system_score_codex":0.00077339483,"about_ca_system_score_gemma":0.0013774439,"threshold_uncertainty_score":0.10499251},"labels":[],"label_agreement":null},{"id":"W1508622259","doi":"10.1007/978-3-540-30570-5_18","title":"Authorization Views and Conditional Query Containment","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Materialized view; Containment (computer programming); Conjunctive query; Set (abstract data type); Rewriting; Query optimization; Authorization; Sargable; Information retrieval; Query language; Database; Theoretical computer science; View; Web search query; Programming language; Relational database; Database design; Computer security; Search engine","score_opus":0.019063616121367036,"score_gpt":0.24916421490669946,"score_spread":0.23010059878533243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508622259","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.0072395387,0.0019609837,0.9563076,0.003175296,0.00023193513,0.00014851635,0.00040077398,0.0018998584,0.028635463],"genre_scores_gemma":[0.44413576,0.003499449,0.5217761,0.0021350023,0.0012589224,0.00063234416,0.0029781007,0.0012432757,0.022341061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98609924,0.005448941,0.0009238135,0.0016030684,0.004821821,0.0011030886],"domain_scores_gemma":[0.97896576,0.014334069,0.0008064475,0.0039329412,0.0015398889,0.00042096252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008891036,0.0013287384,0.0018125656,0.0024901337,0.0027292324,0.009063076,0.0037147244,0.0026603078,0.010459216],"category_scores_gemma":[0.024094004,0.0018800918,0.0021253242,0.00369669,0.008022886,0.02484279,0.0071854116,0.0077341665,0.0021287978],"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.000068174275,0.000025540938,0.00013225789,0.000066512766,0.000021558493,0.00010472892,0.00044344782,0.0024165032,0.0005526427,0.97046596,0.005170171,0.020532578],"study_design_scores_gemma":[0.00002437,0.000010722865,0.00006540173,0.000035065197,0.000032078515,0.00016048836,0.00010599109,0.019473018,0.0014715622,0.96680194,0.011795868,0.00002343814],"about_ca_topic_score_codex":0.0053315302,"about_ca_topic_score_gemma":0.0032483758,"teacher_disagreement_score":0.010459216,"about_ca_system_score_codex":0.002881033,"about_ca_system_score_gemma":0.002159962,"threshold_uncertainty_score":0.047020853},"labels":[],"label_agreement":null},{"id":"W1510238482","doi":"","title":"Situation calculus-based programs for representing and reasoning about game structures","year":2010,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":51,"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","funders":"","keywords":"Computer science; Situation calculus; Orchestration; Process calculus; Process (computing); Range (aeronautics); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.03993560723347751,"score_gpt":0.3109741735758085,"score_spread":0.271038566342331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510238482","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.0011097369,0.00013892072,0.9941549,0.00026191687,0.000033622116,0.00015250282,0.00015175002,0.0005441441,0.0034527064],"genre_scores_gemma":[0.077132225,0.0006943143,0.9168435,0.00025143282,0.000101904465,0.000920621,0.0006013467,0.00020076046,0.0032538848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969927,0.0011278809,0.00031948424,0.00035785727,0.0009029938,0.00029908505],"domain_scores_gemma":[0.99533975,0.003120077,0.00038962558,0.00056245853,0.00041694997,0.00017115526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045816386,0.001607632,0.0010467307,0.0025357082,0.0018865266,0.004907275,0.003460895,0.0016704784,0.0062440513],"category_scores_gemma":[0.008935239,0.0012141464,0.0037867797,0.0026512344,0.004289821,0.006445955,0.0026312247,0.0058229985,0.0011713951],"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.000028290448,0.000052058913,0.00022510532,0.00020229256,0.000040846433,0.00015950533,0.0004602886,0.029953318,0.00072985026,0.9482303,0.0015822536,0.018335829],"study_design_scores_gemma":[0.00005606856,0.00004309878,0.00012299333,0.00012606154,0.00010252719,0.00013924403,0.00017256403,0.1965405,0.002183335,0.7711054,0.02936399,0.000044173546],"about_ca_topic_score_codex":0.010498415,"about_ca_topic_score_gemma":0.0134848915,"teacher_disagreement_score":0.010498415,"about_ca_system_score_codex":0.0031464114,"about_ca_system_score_gemma":0.0042762225,"threshold_uncertainty_score":0.024230361},"labels":[],"label_agreement":null},{"id":"W151038448","doi":"","title":"Weak conditional logics of normality","year":2003,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Defeasible estate; Interpretation (philosophy); Defeasible reasoning; Inference; Property (philosophy); Computer science; Intuition; Modus ponens; Rule of inference; Theoretical computer science; Mathematics; Default rule; Conditional probability; Mathematical economics; Artificial intelligence; Epistemology; Cognitive science; Psychology","score_opus":0.02153221824207839,"score_gpt":0.2448701571014615,"score_spread":0.22333793885938313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151038448","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.044334833,0.0018547642,0.7962296,0.0066039152,0.00035579898,0.00017345748,0.0011130368,0.0015354275,0.14779924],"genre_scores_gemma":[0.84308714,0.0014301197,0.12501122,0.0020875412,0.0005759427,0.00031631096,0.0009452831,0.00020386805,0.02634255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979298,0.000740826,0.00015923587,0.00039607412,0.0005704566,0.00020359122],"domain_scores_gemma":[0.9973043,0.0014186999,0.00018373695,0.00039495298,0.00048115235,0.00021721823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034118644,0.000557979,0.00053441036,0.0015411847,0.0014948396,0.003539766,0.0012157197,0.0010619917,0.0052991845],"category_scores_gemma":[0.00603834,0.0003957406,0.0009933212,0.0010823703,0.006531621,0.006718622,0.0031949177,0.002788783,0.00089126383],"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.000007844632,0.000003299236,0.000047732326,0.000015491081,0.0000026331813,0.000023523742,0.00009435259,0.00035579663,0.00021623388,0.9961365,0.0005491906,0.0025473307],"study_design_scores_gemma":[0.000006743359,0.000005528072,0.000051724306,0.000010473004,0.0000058047235,0.000033704,0.000032010405,0.0042130025,0.0003330894,0.98955834,0.005743943,0.000005526243],"about_ca_topic_score_codex":0.0025790122,"about_ca_topic_score_gemma":0.0018186737,"teacher_disagreement_score":0.0052991845,"about_ca_system_score_codex":0.0029501056,"about_ca_system_score_gemma":0.0015173163,"threshold_uncertainty_score":0.021404564},"labels":[],"label_agreement":null},{"id":"W1511105359","doi":"10.1007/10719619_13","title":"Reactivity in a Logic-Based Robot Programming Framework","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Nondeterministic algorithm; Computer science; Logic programming; Robot; Programming language; Plan (archaeology); Domain (mathematical analysis); Event (particle physics); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02164202486557408,"score_gpt":0.25898707278403615,"score_spread":0.23734504791846206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511105359","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.008021295,0.00017272594,0.97964567,0.0003879644,0.0000540961,0.000056612593,0.000046181798,0.0011626802,0.010452797],"genre_scores_gemma":[0.33203167,0.00045432133,0.65000415,0.0003231954,0.00015622644,0.000280933,0.00018655749,0.00054951734,0.016013363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.0003023247,0.00006675113,0.00021320266,0.0002923641,0.00016154628],"domain_scores_gemma":[0.99926597,0.00037820972,0.000060086593,0.0001340664,0.00008042607,0.00008134656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015362332,0.0007442945,0.0006355806,0.00056708726,0.0011908114,0.0027692572,0.0030407652,0.0012648333,0.004881003],"category_scores_gemma":[0.0018577785,0.0007576134,0.0017781791,0.000499802,0.002687698,0.003939707,0.002636714,0.002578725,0.0009172187],"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.000058769132,0.000041637642,0.00014441172,0.0000799961,0.000020701606,0.0001439132,0.00026991655,0.04426779,0.0031277116,0.934438,0.0012050641,0.016202075],"study_design_scores_gemma":[0.00003875285,0.000049424045,0.00008998295,0.000027890228,0.000047579306,0.000105179555,0.00006495789,0.24793325,0.0033976086,0.7343474,0.013863069,0.00003492085],"about_ca_topic_score_codex":0.002189195,"about_ca_topic_score_gemma":0.002617671,"teacher_disagreement_score":0.004881003,"about_ca_system_score_codex":0.0011276777,"about_ca_system_score_gemma":0.001011076,"threshold_uncertainty_score":0.016328573},"labels":[],"label_agreement":null},{"id":"W1511767298","doi":"10.1023/a:1026761331498","title":"Ability and Knowing How in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Executable; Computer science; Plan (archaeology); Frame (networking); Artificial intelligence; Programming language; Software engineering","score_opus":0.021415281865026514,"score_gpt":0.2447857400587642,"score_spread":0.2233704581937377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511767298","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.17750554,0.0046297666,0.53877324,0.016040891,0.00038717486,0.00018542816,0.00056631863,0.00067235396,0.2612393],"genre_scores_gemma":[0.94415927,0.0014213214,0.044775058,0.0003991975,0.00026149894,0.00011037812,0.0003218178,0.000072396295,0.008478992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99542063,0.0019912624,0.0004261378,0.00072554935,0.00077794597,0.0006584333],"domain_scores_gemma":[0.99014753,0.0073874705,0.0004098125,0.0010119103,0.0004530431,0.0005902187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005652686,0.0009459452,0.001425222,0.0024832792,0.0035978802,0.010255695,0.002523483,0.0031387394,0.008535618],"category_scores_gemma":[0.011998529,0.000987481,0.002636734,0.0023400323,0.014962475,0.031434044,0.0054758172,0.007215521,0.0007990165],"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.000013617509,0.000013545958,0.00013572138,0.000019667832,0.000009898156,0.00005013131,0.0005233359,0.00070465804,0.000058789363,0.9961345,0.0002026312,0.002133477],"study_design_scores_gemma":[0.000006730367,0.0000028369311,0.00005640225,0.000005968117,0.000009516372,0.000022925262,0.000079695266,0.0012674776,0.000057163837,0.99761814,0.00086605304,0.0000070727706],"about_ca_topic_score_codex":0.0054113483,"about_ca_topic_score_gemma":0.002691613,"teacher_disagreement_score":0.010255695,"about_ca_system_score_codex":0.0022510847,"about_ca_system_score_gemma":0.0018716573,"threshold_uncertainty_score":0.02989459},"labels":[],"label_agreement":null},{"id":"W1512250334","doi":"10.22329/il.v28i4.2855","title":"Logic as (Normative) Inference Theory: Formal vs. Non-formal Theories of Inference Goodness","year":2009,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Normative; Inference; Epistemology; Criticism; sort; Philosophy of logic; Philosophy; Cognitive science; Computer science; Psychology; Law","score_opus":0.016190786395965957,"score_gpt":0.27531697826798207,"score_spread":0.25912619187201613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512250334","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.046914633,0.013658797,0.53966963,0.084555924,0.001141478,0.00011493948,0.00032975513,0.00058041577,0.31303445],"genre_scores_gemma":[0.93566394,0.002627818,0.045190368,0.0047950116,0.0014344265,0.00028537182,0.00016126983,0.00025582415,0.009585999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99169123,0.0051775305,0.0003342036,0.0006587264,0.0016590485,0.00047918406],"domain_scores_gemma":[0.9848733,0.010244231,0.0010460006,0.0020860205,0.0010801464,0.0006703156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011862909,0.0006234037,0.0010453709,0.0038850948,0.0020029405,0.011832184,0.0023525378,0.004339828,0.005220933],"category_scores_gemma":[0.017059673,0.0004969446,0.0011345866,0.0027660078,0.029005308,0.022544,0.004205937,0.0047564297,0.0009579203],"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.0000043717077,0.000003890726,0.000043937795,0.000010087032,0.0000027123438,0.0000050440617,0.00013905994,0.00013128515,0.000014990511,0.9986307,0.0002728182,0.0007410615],"study_design_scores_gemma":[0.0000052062487,0.0000033964952,0.000059046277,0.000012552092,0.000003290097,0.000010471794,0.000062370054,0.00073428033,0.00002718675,0.99676883,0.0023112826,0.0000020896343],"about_ca_topic_score_codex":0.0013245001,"about_ca_topic_score_gemma":0.0008356877,"teacher_disagreement_score":0.011862909,"about_ca_system_score_codex":0.0049323956,"about_ca_system_score_gemma":0.0020517616,"threshold_uncertainty_score":0.06273776},"labels":[],"label_agreement":null},{"id":"W1519624057","doi":"10.1007/978-3-540-87603-8_31","title":"Dynamic Resource Configuration &amp; Management for Distributed Information Fusion in Maritime Surveillance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Focus (optics); Resource (disambiguation); Architecture; Set (abstract data type); Sensor fusion; Volume (thermodynamics); Resource management (computing); Multitude; Computer network; Artificial intelligence; Database","score_opus":0.010485194834694182,"score_gpt":0.22616071719096983,"score_spread":0.21567552235627566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519624057","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.046318017,0.0023799182,0.94246316,0.0006806999,0.00015387699,0.00008066666,0.00009688726,0.0011064045,0.0067204204],"genre_scores_gemma":[0.9272736,0.0005382857,0.06993032,0.00008239636,0.000097582786,0.000057117526,0.00007940987,0.00005294329,0.0018883743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994654,0.00012716504,0.000042258394,0.0001395588,0.0001238281,0.00010184103],"domain_scores_gemma":[0.99948007,0.00023619307,0.00006368306,0.00008533634,0.000097641256,0.00003715649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013103393,0.00060196815,0.0011078629,0.0006187957,0.0010064173,0.0018625055,0.0015618898,0.0007910591,0.0021502196],"category_scores_gemma":[0.0019524503,0.00033999683,0.00034675558,0.000803219,0.00069105136,0.0031292231,0.0013892091,0.00097357953,0.00035368316],"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.00043161077,0.00019317164,0.0010748527,0.0001362984,0.00008363958,0.00017250252,0.00034370032,0.54410946,0.024902508,0.022686029,0.0060415356,0.39982474],"study_design_scores_gemma":[0.0000136179115,0.000045720888,0.0003634404,0.000011366023,0.000022563072,0.000057935962,0.00007395276,0.97968984,0.0050904895,0.012917958,0.0016941804,0.000018902598],"about_ca_topic_score_codex":0.0036266064,"about_ca_topic_score_gemma":0.0047086542,"teacher_disagreement_score":0.0036266064,"about_ca_system_score_codex":0.00096493546,"about_ca_system_score_gemma":0.0007501824,"threshold_uncertainty_score":0.0072110295},"labels":[],"label_agreement":null},{"id":"W1521777945","doi":"10.22329/il.v22i1.2570","title":"The 'Most Important and Fundamental' Distinction in Logic","year":2001,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Appeal; Epistemology; Foundation (evidence); Philosophy; Deductive reasoning; Computer science; Law; Political science","score_opus":0.0161589188497874,"score_gpt":0.24121651909642502,"score_spread":0.22505760024663762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521777945","genre_codex":"commentary","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.016812153,0.035863273,0.3123785,0.3742048,0.006682319,0.00009625859,0.0003307306,0.00046620276,0.25316575],"genre_scores_gemma":[0.7700631,0.012679772,0.11727929,0.057013817,0.01710901,0.00045735177,0.00024130942,0.00048867095,0.024667637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98448074,0.008480616,0.00076361257,0.0018287794,0.0034173185,0.0010288958],"domain_scores_gemma":[0.9837863,0.010709887,0.00089341536,0.0023783052,0.0014552809,0.0007768704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019108055,0.00082803966,0.0012998377,0.0021876155,0.004677203,0.0123325335,0.0036851694,0.0066084056,0.004349806],"category_scores_gemma":[0.01769186,0.00072722003,0.0013396466,0.0013268263,0.045636263,0.028396485,0.006740707,0.012058448,0.0017540985],"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.0000095788755,0.000005564884,0.00004758638,0.000035728932,0.000003061061,0.000011412043,0.0003435171,0.00004853285,0.00006672294,0.99560463,0.0017112516,0.0021125374],"study_design_scores_gemma":[0.0000105594145,0.000007836695,0.00007359721,0.00004905129,0.0000045359593,0.000048005535,0.0001412915,0.00019593365,0.00013514889,0.97634107,0.022986399,0.0000066440066],"about_ca_topic_score_codex":0.0008000527,"about_ca_topic_score_gemma":0.000617108,"teacher_disagreement_score":0.019108055,"about_ca_system_score_codex":0.0042495923,"about_ca_system_score_gemma":0.0027518196,"threshold_uncertainty_score":0.10105425},"labels":[],"label_agreement":null},{"id":"W1523358274","doi":"10.5555/1838206.1838246","title":"A logical framework for prioritized goal change","year":2010,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Computer science; Goal orientation; Work (physics); Logical framework; Management science; Psychology; Engineering","score_opus":0.042925413271582315,"score_gpt":0.30149299566689647,"score_spread":0.25856758239531413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523358274","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.01119454,0.00087915186,0.9054198,0.0097663095,0.0003978201,0.0002429496,0.00022758167,0.0007106673,0.07116104],"genre_scores_gemma":[0.6389924,0.00074641715,0.3401072,0.0030611565,0.00076163554,0.0008072433,0.0003435987,0.0002713544,0.014908887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925075,0.0032322346,0.0006254462,0.0013683448,0.0015364948,0.0007300184],"domain_scores_gemma":[0.9900333,0.0047367914,0.0010776178,0.0017480941,0.0017754006,0.0006286738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012702461,0.0010181565,0.0007689957,0.002804492,0.0036931478,0.0057592113,0.0034829276,0.0033762178,0.0077243494],"category_scores_gemma":[0.012072771,0.0009748557,0.0027155834,0.001558306,0.013602487,0.016518708,0.005919635,0.006321244,0.0010723746],"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.000009012998,0.00001131892,0.000096128824,0.000024496807,0.000006906104,0.000050213588,0.00031191073,0.0008890722,0.0001353435,0.9956298,0.00049665134,0.0023391787],"study_design_scores_gemma":[0.000034265493,0.000025202331,0.000096367294,0.000026312962,0.000019872845,0.00009728673,0.00014778975,0.008105705,0.00035559564,0.9814249,0.009646266,0.000020402425],"about_ca_topic_score_codex":0.0035492377,"about_ca_topic_score_gemma":0.0027596978,"teacher_disagreement_score":0.012702461,"about_ca_system_score_codex":0.00448164,"about_ca_system_score_gemma":0.003273267,"threshold_uncertainty_score":0.06717783},"labels":[],"label_agreement":null},{"id":"W152378237","doi":"","title":"Planning with qualitative temporal preferences","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":94,"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 Toronto","funders":"","keywords":"Planner; Computer science; Preference; Semantics (computer science); Situation calculus; Markov decision process; Theoretical computer science; Forward chaining; Chaining; Artificial intelligence; Bounded function; Markov process; Programming language; Mathematics; Expert system","score_opus":0.03629015454195903,"score_gpt":0.30038045848939,"score_spread":0.26409030394743094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152378237","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.0083848545,0.00009109827,0.9877297,0.00023423042,0.000014799117,0.00007726545,0.00014189394,0.00034474916,0.0029813286],"genre_scores_gemma":[0.31172717,0.000356919,0.68391967,0.00016364639,0.000022942146,0.00041001607,0.00033767975,0.00011453781,0.0029473782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768126,0.0011029489,0.0001742509,0.00022947855,0.0006684353,0.00014364182],"domain_scores_gemma":[0.9950015,0.003401835,0.00037397532,0.00052904704,0.00052231806,0.00017128092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039961725,0.0006206456,0.00041284712,0.0009210676,0.0006602609,0.0020852974,0.0011759519,0.00061259227,0.0032941112],"category_scores_gemma":[0.011197433,0.0005200342,0.0010527646,0.00082970504,0.0017502493,0.004226222,0.001612156,0.0011921874,0.00050507655],"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.00016283039,0.00006623185,0.0008367076,0.00031441383,0.00005843285,0.0002986994,0.0009433773,0.1890511,0.00478947,0.7434161,0.0015016298,0.058561113],"study_design_scores_gemma":[0.00007197972,0.00009053179,0.00019960795,0.00010171291,0.000047107143,0.00018778419,0.00033162447,0.45062068,0.007983139,0.52461493,0.015702367,0.000048476802],"about_ca_topic_score_codex":0.0029598891,"about_ca_topic_score_gemma":0.0056717093,"teacher_disagreement_score":0.0039961725,"about_ca_system_score_codex":0.001611454,"about_ca_system_score_gemma":0.0022111991,"threshold_uncertainty_score":0.021134079},"labels":[],"label_agreement":null},{"id":"W1524832982","doi":"10.1007/3-540-45486-1_35","title":"Considerations on Compositional Update Operators","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjunction (astronomy); Computer science; Sentence; Operator (biology); Syntax; Knowledge base; Prime (order theory); Belief revision; Base (topology); Natural language processing; Programming language; Artificial intelligence; Arithmetic; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.015682770503936235,"score_gpt":0.24064001481095298,"score_spread":0.22495724430701675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524832982","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.02102243,0.0018060618,0.62482035,0.01269433,0.001226897,0.00019200976,0.00022624947,0.000800788,0.3372109],"genre_scores_gemma":[0.58319926,0.0020656388,0.3230786,0.005876533,0.0026221136,0.0007569276,0.00042988406,0.0013212903,0.080649756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404186,0.0024702358,0.0004009137,0.00084309856,0.0015789913,0.00066492945],"domain_scores_gemma":[0.9871187,0.00847916,0.00027644218,0.0026298107,0.0011194082,0.00037639865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007973992,0.0011115061,0.0012204279,0.0011555969,0.0036402785,0.0068083443,0.0031300026,0.00513819,0.02313418],"category_scores_gemma":[0.02360726,0.0015809813,0.002024469,0.0013376978,0.007974362,0.031999625,0.0049553798,0.007009644,0.0027223742],"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.000012028173,0.0000070777783,0.000018332661,0.000014737886,0.0000019494935,0.000032536795,0.0001017866,0.00017004985,0.000109038,0.99633384,0.00081551174,0.0023830733],"study_design_scores_gemma":[0.000012006015,0.000008277276,0.00002199675,0.0000178856,0.000008608294,0.00010082411,0.000066525354,0.0020365077,0.00042005238,0.98957217,0.00772934,0.0000057660122],"about_ca_topic_score_codex":0.0013456785,"about_ca_topic_score_gemma":0.0019797864,"teacher_disagreement_score":0.02313418,"about_ca_system_score_codex":0.0014369778,"about_ca_system_score_gemma":0.0012948681,"threshold_uncertainty_score":0.077391505},"labels":[],"label_agreement":null},{"id":"W1526184744","doi":"10.1007/3-540-44583-8_25","title":"Uses, Improvements, and Extensions of Prolog+CG: Case Studies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Prolog; Computer science; Programming language; Logic programming; Java; Expressive power; Object-oriented programming; Object (grammar); Horn clause; Software engineering; Artificial intelligence","score_opus":0.03132705726177794,"score_gpt":0.2780674808548078,"score_spread":0.2467404235930299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526184744","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90966254,0.014460345,0.011504355,0.002227772,0.000052477088,0.0002916268,0.0003457752,0.00018025078,0.061274827],"genre_scores_gemma":[0.9694351,0.0050633484,0.021242913,0.00018426737,0.00003878592,0.00009909793,0.00018467553,0.000114097784,0.0036376284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99021673,0.0067620506,0.00040278723,0.000309475,0.0016965958,0.00061236095],"domain_scores_gemma":[0.9485741,0.04248886,0.0020347235,0.004289583,0.0019898177,0.0006229021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010156941,0.00056631403,0.0004567106,0.0023431412,0.001261619,0.0024301151,0.0020158188,0.001899512,0.0024300064],"category_scores_gemma":[0.033409767,0.00044790385,0.0005205257,0.0045570545,0.0028430545,0.0058355746,0.0022278395,0.0017610422,0.00047792195],"study_design_candidate":"not_applicable","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.006320928,0.005650753,0.04422465,0.0022546842,0.0001295572,0.006859137,0.026637092,0.00776097,0.003958489,0.06251259,0.009855736,0.82383555],"study_design_scores_gemma":[0.002075435,0.015898526,0.1475078,0.004603423,0.0021320195,0.05809142,0.11025577,0.07497605,0.056428026,0.16227391,0.36526862,0.00048897986],"about_ca_topic_score_codex":0.004545844,"about_ca_topic_score_gemma":0.008105092,"teacher_disagreement_score":0.010156941,"about_ca_system_score_codex":0.0013092863,"about_ca_system_score_gemma":0.0008279928,"threshold_uncertainty_score":0.053715706},"labels":[],"label_agreement":null},{"id":"W1526752423","doi":"10.1007/978-3-540-28645-5_13","title":"Is Plausible Reasoning a Sensible Alternative for Inductive-Statistical Reasoning?","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Cegep Edouard Montpetit","funders":"","keywords":"Inductive reasoning; Computer science; Deductive reasoning; Artificial intelligence; Representation (politics); Field (mathematics); Knowledge representation and reasoning; Task (project management); Management science; Epistemology; Mathematics; Philosophy","score_opus":0.026652128850588465,"score_gpt":0.28132042809383956,"score_spread":0.2546682992432511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526752423","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.0045004543,0.0028130887,0.9114761,0.035729397,0.0011483126,0.0000987067,0.000473248,0.0005554607,0.043205313],"genre_scores_gemma":[0.5023793,0.0038276392,0.46334884,0.009755036,0.0049134665,0.0006460382,0.0012468054,0.0005468735,0.013335994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9828892,0.009154624,0.001135589,0.0021083043,0.003997977,0.00071436353],"domain_scores_gemma":[0.94344425,0.040661562,0.0022688613,0.010000771,0.002714868,0.00090963964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020170305,0.0017353477,0.0029584514,0.0044861077,0.0029301778,0.011200692,0.010276316,0.007694187,0.022005253],"category_scores_gemma":[0.07880213,0.0014392115,0.0036839112,0.0038204216,0.016844567,0.031126238,0.005361587,0.009733061,0.005327849],"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.000029985467,0.000021764605,0.00014525844,0.00010114973,0.00003692485,0.000050354465,0.000108779546,0.0006988542,0.00006059866,0.9873531,0.0018469205,0.009546308],"study_design_scores_gemma":[0.00001080902,0.0000046563114,0.000023848828,0.000015676253,0.0000065433906,0.00004295345,0.000033145257,0.0017745898,0.00006376389,0.9961039,0.0019126512,0.000007474141],"about_ca_topic_score_codex":0.001269671,"about_ca_topic_score_gemma":0.0013220167,"teacher_disagreement_score":0.022005253,"about_ca_system_score_codex":0.002215286,"about_ca_system_score_gemma":0.0020647843,"threshold_uncertainty_score":0.10667205},"labels":[],"label_agreement":null},{"id":"W1530485504","doi":"10.1007/3-540-45490-x_3","title":"From Computational Intelligence to Web Intelligence: An Ensemble from Potpourri","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Humanity; World Wide Web; Potpourri; Artificial intelligence; Political science; Law","score_opus":0.02761721328561722,"score_gpt":0.2759463979112331,"score_spread":0.24832918462561587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530485504","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.023535993,0.12308317,0.50736135,0.059222996,0.0041007195,0.0002080153,0.0008628518,0.0014297508,0.28019512],"genre_scores_gemma":[0.3418364,0.11467009,0.39853436,0.010170568,0.009168634,0.0004023837,0.0029702487,0.001667178,0.120580174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.0002695989,0.00008252807,0.0002750912,0.00031143124,0.00006754051],"domain_scores_gemma":[0.998343,0.00083605206,0.000042095726,0.00040734868,0.00026329857,0.00010819312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015749157,0.0008939834,0.0013895255,0.003916181,0.0018584932,0.006464739,0.0014989154,0.0015475956,0.0060098246],"category_scores_gemma":[0.003981349,0.0006681701,0.0007934285,0.00485144,0.0037632822,0.019217428,0.0046585333,0.0043953424,0.0031563742],"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.000088467656,0.00010108066,0.0011609857,0.0005149647,0.00007291517,0.0002813909,0.0015078608,0.0032733476,0.0005370476,0.6305724,0.053118736,0.3087708],"study_design_scores_gemma":[0.0000105283225,0.00002845471,0.000694108,0.00020210506,0.00003172442,0.00032077634,0.00034395282,0.014794073,0.0009580727,0.80682486,0.17576332,0.000028098912],"about_ca_topic_score_codex":0.0019228425,"about_ca_topic_score_gemma":0.0024546187,"teacher_disagreement_score":0.006464739,"about_ca_system_score_codex":0.0012516946,"about_ca_system_score_gemma":0.0010904709,"threshold_uncertainty_score":0.020104825},"labels":[],"label_agreement":null},{"id":"W1530557229","doi":"10.1007/11546207_29","title":"Application of Smodels in Quartet Based Phylogeny Construction","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Consistency (knowledge bases); Computer science; Set (abstract data type); Dynamic programming; Taxon; Phylogenetics; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Paleontology; Biology","score_opus":0.012189819203859623,"score_gpt":0.2321604293070798,"score_spread":0.2199706101032202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530557229","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.013552121,0.00008974791,0.98328096,0.000083462684,0.00005286242,0.000058560814,0.0000951991,0.0010729317,0.0017140857],"genre_scores_gemma":[0.09459699,0.00009671746,0.90218294,0.00008149734,0.000040894323,0.00010646808,0.0005519629,0.00051846204,0.0018240799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.00031656196,0.000083859944,0.00025776392,0.00022217652,0.00006933839],"domain_scores_gemma":[0.9976051,0.001202955,0.00012309803,0.0005900246,0.00037584428,0.00010305393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018636528,0.0005714135,0.0013963399,0.0016245455,0.001446828,0.001282948,0.0019327962,0.0013391797,0.006097989],"category_scores_gemma":[0.005015664,0.00082056754,0.0015830307,0.001599405,0.0010845977,0.001966871,0.0026157831,0.002234796,0.0019642904],"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.00022597636,0.0002933737,0.00319548,0.0004162996,0.00015155118,0.00023502228,0.00071350246,0.15922368,0.013393342,0.1432202,0.0065952367,0.6723364],"study_design_scores_gemma":[0.000034383833,0.00010572701,0.00052037684,0.00005154743,0.000038506638,0.00010273578,0.00009932579,0.8162359,0.0043576434,0.17173535,0.0066960985,0.000022510108],"about_ca_topic_score_codex":0.0013804777,"about_ca_topic_score_gemma":0.0027422796,"teacher_disagreement_score":0.006097989,"about_ca_system_score_codex":0.00054643844,"about_ca_system_score_gemma":0.00080859853,"threshold_uncertainty_score":0.020399868},"labels":[],"label_agreement":null},{"id":"W1531333150","doi":"10.1007/3-540-36494-3_42","title":"The Complexity of Resolution with Generalized Symmetry Rules","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphism; Homogeneous space; Injective function; Resolution (logic); Symmetry (geometry); Mathematical proof; Pure mathematics; Mathematics; Discrete mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.03060092413681015,"score_gpt":0.24401040600607196,"score_spread":0.2134094818692618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531333150","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.26239255,0.008470741,0.48924646,0.028468393,0.0007273434,0.0003467892,0.002521965,0.0014636744,0.20636201],"genre_scores_gemma":[0.8769639,0.004015843,0.09622848,0.0010408821,0.0012608367,0.00037024583,0.0019236834,0.0005033182,0.017692693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99034834,0.0032611906,0.0006204818,0.0011795834,0.0036247442,0.0009656273],"domain_scores_gemma":[0.95614326,0.03560919,0.0014673659,0.0048208814,0.001265442,0.00069391076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005786786,0.0009892201,0.0028114214,0.0023009025,0.0033703088,0.011581254,0.0052573397,0.0037796954,0.020606475],"category_scores_gemma":[0.036718335,0.0017308053,0.0036524138,0.005320183,0.0069173924,0.04015521,0.0066431644,0.00822093,0.0020847924],"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.00016726751,0.00007432579,0.000587853,0.00020545001,0.00006873724,0.00013866261,0.00037625717,0.013191328,0.00035614715,0.95679736,0.0061409846,0.021895505],"study_design_scores_gemma":[0.000029098597,0.000004658236,0.00008174348,0.000012045062,0.000019462588,0.000050966824,0.000043619602,0.015325238,0.00018478185,0.98297936,0.001258067,0.000010994212],"about_ca_topic_score_codex":0.003521867,"about_ca_topic_score_gemma":0.0022153482,"teacher_disagreement_score":0.020606475,"about_ca_system_score_codex":0.003598636,"about_ca_system_score_gemma":0.0026066555,"threshold_uncertainty_score":0.06893557},"labels":[],"label_agreement":null},{"id":"W1531985259","doi":"10.1007/3-540-45757-7_38","title":"An Infinite-Valued Semantics for Logic Programs with Negation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Negation; Uncountable set; Countable set; Zero (linguistics); Mathematics; Discrete mathematics; Truth value; Element (criminal law); Denotational semantics; Set (abstract data type); Semantics (computer science); Computer science; Operational semantics; Programming language; Linguistics","score_opus":0.02987368681877527,"score_gpt":0.25726529892290917,"score_spread":0.2273916121041339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531985259","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.010258853,0.0007626365,0.96530914,0.0013701887,0.000319605,0.00007276867,0.00022203491,0.0009726202,0.020712221],"genre_scores_gemma":[0.40157717,0.0009871013,0.58059424,0.0010887516,0.00056122197,0.00038366896,0.0007054324,0.00051508157,0.0135873305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.0005220298,0.00025591895,0.0003158095,0.00048329475,0.00017980576],"domain_scores_gemma":[0.99810153,0.0010096206,0.000121329926,0.0002440208,0.00034391356,0.00017961969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002621775,0.0010822729,0.0010272284,0.0015300004,0.0019084458,0.006030509,0.0029204644,0.0018980588,0.0036203538],"category_scores_gemma":[0.0036959525,0.0010104054,0.001858144,0.0013195913,0.005372441,0.013488692,0.003973283,0.0052058725,0.0008821763],"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.000026375514,0.000019872481,0.000051690415,0.000050659557,0.00000660078,0.00006253253,0.00030107092,0.00097067544,0.0007529552,0.9870302,0.0008415317,0.00988583],"study_design_scores_gemma":[0.000019223964,0.000010814233,0.000023138558,0.000027500237,0.000011344476,0.000068740264,0.00005856275,0.007218227,0.0005370976,0.98407894,0.007933952,0.000012432727],"about_ca_topic_score_codex":0.00103713,"about_ca_topic_score_gemma":0.0011663879,"teacher_disagreement_score":0.006030509,"about_ca_system_score_codex":0.0016779692,"about_ca_system_score_gemma":0.0014303412,"threshold_uncertainty_score":0.013865411},"labels":[],"label_agreement":null},{"id":"W1534140321","doi":"10.1007/3-540-36388-2_12","title":"Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Heuristics; Set (abstract data type); Extant taxon; Solver; Genetic programming; Phylogenetic tree; Tree (set theory); Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Combinatorics; Evolutionary biology","score_opus":0.03310432674882285,"score_gpt":0.24182502912031723,"score_spread":0.20872070237149437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534140321","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.65577525,0.0027041144,0.24271722,0.0052339574,0.00014438003,0.00006726747,0.0014583645,0.0008054768,0.09109391],"genre_scores_gemma":[0.91834974,0.000758161,0.07433152,0.00021310664,0.000041451884,0.000039879473,0.0009756199,0.0003973277,0.004893144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939084,0.00026388981,0.000033375298,0.00014642102,0.00007080182,0.00009469452],"domain_scores_gemma":[0.9974119,0.0015290518,0.00025855968,0.00037643325,0.0003098343,0.00011414636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015245767,0.00037323838,0.00034990849,0.0024740961,0.0014241821,0.0032541521,0.0012177873,0.0009903074,0.0077887564],"category_scores_gemma":[0.007245361,0.00051856466,0.0006134482,0.0034318424,0.0023767406,0.00652406,0.0018849326,0.0020574958,0.00064635696],"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.00030467595,0.0001000875,0.024703985,0.00022824857,0.00012097925,0.0007531704,0.006844735,0.032708257,0.0031939617,0.76301616,0.0046725734,0.16335335],"study_design_scores_gemma":[0.00006540988,0.000046748642,0.022897853,0.0002555447,0.00012033803,0.0005929598,0.004613321,0.095986284,0.0024304234,0.8163388,0.0565733,0.000079168596],"about_ca_topic_score_codex":0.005949211,"about_ca_topic_score_gemma":0.010472841,"teacher_disagreement_score":0.0077887564,"about_ca_system_score_codex":0.0017523742,"about_ca_system_score_gemma":0.0008602791,"threshold_uncertainty_score":0.026055932},"labels":[],"label_agreement":null},{"id":"W1534941349","doi":"10.1007/978-3-540-75560-9_10","title":"The Semantics of Consistency and Trust in Peer Data Exchange Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data exchange; Peer-to-peer; Pairwise comparison; Semantics (computer science); Consistency (knowledge bases); Theoretical computer science; Set (abstract data type); Data consistency; Information retrieval; Database; Programming language; Distributed computing; Artificial intelligence","score_opus":0.052474154124825576,"score_gpt":0.2795058890128403,"score_spread":0.2270317348880147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534941349","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.017738482,0.0022590933,0.9551343,0.0050975713,0.00050138985,0.00021993228,0.00024875006,0.000571477,0.018228998],"genre_scores_gemma":[0.70390564,0.0025250665,0.2797051,0.0010993496,0.0012399617,0.00082861166,0.00061899127,0.0003742157,0.009703087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98377824,0.006767259,0.0022670848,0.0014083721,0.0047461265,0.0010329087],"domain_scores_gemma":[0.9759068,0.0132943215,0.0015934603,0.005659186,0.0027837937,0.00076235214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011072662,0.0010363375,0.0017657048,0.0019369086,0.0037164576,0.013742858,0.004544796,0.0060293917,0.0036227542],"category_scores_gemma":[0.03768867,0.0019447764,0.0016383819,0.00373847,0.011139616,0.028735025,0.0055790627,0.008670168,0.0009917289],"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.000052703086,0.000019494808,0.00011980572,0.000069008725,0.0000166872,0.00007700065,0.00059091765,0.0037325034,0.00030782877,0.9862982,0.0011802664,0.0075355726],"study_design_scores_gemma":[0.000037993377,0.00001954117,0.000055155342,0.00004383186,0.000025730516,0.000121812795,0.00016366522,0.015230811,0.000632471,0.9751188,0.008527845,0.00002232074],"about_ca_topic_score_codex":0.0030139734,"about_ca_topic_score_gemma":0.0013362399,"teacher_disagreement_score":0.013742858,"about_ca_system_score_codex":0.0035706768,"about_ca_system_score_gemma":0.0033522868,"threshold_uncertainty_score":0.058558524},"labels":[],"label_agreement":null},{"id":"W1535866878","doi":"10.1007/3-540-47922-8_21","title":"An Efficient Compositional Semantics for Natural-Language Database Queries with Arbitrarily-Nested Quantification and Negation","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Negation; Programming language; Semantics (computer science); Natural language processing; Artificial intelligence","score_opus":0.014838123771695022,"score_gpt":0.24858257800142836,"score_spread":0.23374445422973333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535866878","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.00720544,0.00011985063,0.98593044,0.00029406606,0.000081614504,0.00021270174,0.00018833567,0.0036909766,0.0022766385],"genre_scores_gemma":[0.13753098,0.00015696045,0.8573381,0.00033743848,0.00010937111,0.0003292551,0.00050577795,0.000890269,0.0028018637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942931,0.0013605591,0.00065973355,0.0008199319,0.002310651,0.0005560663],"domain_scores_gemma":[0.99548846,0.0021536052,0.00023434024,0.001080413,0.0008241597,0.0002189432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052078953,0.0011740783,0.001831171,0.0013417592,0.001953256,0.0055507147,0.0038494603,0.0020806934,0.0062811277],"category_scores_gemma":[0.009236245,0.0018350641,0.002714456,0.0016859608,0.0040265606,0.012202338,0.0075035356,0.0035282031,0.0017730633],"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.00057183753,0.00034588506,0.00056036556,0.00042332473,0.00007650263,0.00031430364,0.0013166019,0.016423177,0.01888666,0.8481584,0.007695819,0.10522705],"study_design_scores_gemma":[0.00022809464,0.00011554115,0.00015463225,0.00008158997,0.00016536623,0.00035346457,0.00026456828,0.22299282,0.020139676,0.73414505,0.021238115,0.00012110607],"about_ca_topic_score_codex":0.0036650805,"about_ca_topic_score_gemma":0.005560549,"teacher_disagreement_score":0.0062811277,"about_ca_system_score_codex":0.0018357865,"about_ca_system_score_gemma":0.0028793267,"threshold_uncertainty_score":0.027542293},"labels":[],"label_agreement":null},{"id":"W1537230380","doi":"10.1017/cbo9780511676277","title":"Logical Foundations of Proof Complexity","year":2010,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Proof complexity; Complexity class; Structural proof theory; Soundness; PH; Mathematics; Proof theory; Structural complexity theory; Discrete mathematics; Mathematical proof; Descriptive complexity theory; Propositional calculus; Hierarchy; Polynomial hierarchy; Algebra over a field; Computer science; Time complexity; Quantum complexity theory; Pure mathematics","score_opus":0.04752521863913661,"score_gpt":0.2337792296146979,"score_spread":0.1862540109755613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537230380","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.0029156154,0.034224883,0.18669324,0.018281966,0.0014493059,0.000099718214,0.00045449694,0.0007176135,0.75516313],"genre_scores_gemma":[0.32685688,0.0817169,0.21024196,0.010145636,0.0080780145,0.00095617975,0.0020629426,0.0011231562,0.35881838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848926,0.00033956318,0.00009675971,0.00020322007,0.00073830015,0.00013284213],"domain_scores_gemma":[0.99695945,0.0020191565,0.00013793338,0.00035211875,0.00042724327,0.00010405831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013646341,0.0007362731,0.00061566225,0.0016325659,0.0021290176,0.006462173,0.0013473385,0.0013517464,0.016905623],"category_scores_gemma":[0.005041806,0.0007246413,0.0010737455,0.0017574815,0.0072723553,0.01001661,0.0023825772,0.005710397,0.0054224594],"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.0000018965561,0.000003215189,0.000021389025,0.000055407534,0.000002918011,0.0000141059445,0.00009429742,0.00025403526,0.00006138901,0.9843196,0.0070839245,0.00808787],"study_design_scores_gemma":[0.0000029889698,0.0000028355998,0.000056491277,0.00006927386,0.0000026321754,0.000047349233,0.00003383881,0.00063918816,0.00008158128,0.90854424,0.0905154,0.0000041956314],"about_ca_topic_score_codex":0.0016107515,"about_ca_topic_score_gemma":0.001088625,"teacher_disagreement_score":0.016905623,"about_ca_system_score_codex":0.0047255266,"about_ca_system_score_gemma":0.0024738242,"threshold_uncertainty_score":0.056554973},"labels":[],"label_agreement":null},{"id":"W1537741773","doi":"10.1007/978-3-642-04238-6_61","title":"Using Answer Set Programming to Enhance Operating System Discovery","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Answer set programming; Set (abstract data type); Programming language; Theoretical computer science","score_opus":0.02440303175057502,"score_gpt":0.2845097389681351,"score_spread":0.2601067072175601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537741773","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.008272482,0.000173751,0.97781575,0.00058037514,0.00008413965,0.0001248212,0.00023337424,0.0067831893,0.005932174],"genre_scores_gemma":[0.09755469,0.00018548152,0.8960188,0.0002665374,0.000097053235,0.00012426019,0.0010761687,0.0010138035,0.0036632228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932167,0.0019218863,0.0005284477,0.0010885481,0.0028066891,0.00043776276],"domain_scores_gemma":[0.9800408,0.013940336,0.0007666567,0.0030692967,0.0017539953,0.00042903825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062725535,0.0009322934,0.001232375,0.0033764697,0.0014552771,0.005190538,0.004544996,0.001748469,0.011711638],"category_scores_gemma":[0.025537722,0.0011039854,0.0023122742,0.0026422245,0.0015501316,0.011859428,0.0041007414,0.004173634,0.0028946537],"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.00060559745,0.0008629504,0.0042590597,0.00072361314,0.00022963253,0.00041827786,0.0012684495,0.030555168,0.013888394,0.20849502,0.019475127,0.71921873],"study_design_scores_gemma":[0.00010560222,0.00011935162,0.0005992698,0.0001487951,0.00015539615,0.00039617324,0.00028236196,0.52241665,0.025429247,0.41805097,0.03221917,0.00007693224],"about_ca_topic_score_codex":0.0015349765,"about_ca_topic_score_gemma":0.0036982445,"teacher_disagreement_score":0.011711638,"about_ca_system_score_codex":0.0010162441,"about_ca_system_score_gemma":0.001798821,"threshold_uncertainty_score":0.039179325},"labels":[],"label_agreement":null},{"id":"W1539123322","doi":"10.1613/jair.2539","title":"Compositional Belief Update","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Operator (biology); Sentence; Hierarchy; Core (optical fiber); Dual (grammatical number); Belief revision; Semantics (computer science); Class (philosophy)","score_opus":0.19611251418010606,"score_gpt":0.4013635257268115,"score_spread":0.20525101154670544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539123322","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.012574961,0.00037602326,0.97044957,0.000696197,0.00014625676,0.0001591058,0.000096611024,0.0006309685,0.0148702655],"genre_scores_gemma":[0.4145225,0.00048514918,0.57177204,0.0005753874,0.0003000202,0.00033350984,0.00023415386,0.00016374412,0.0116135385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621236,0.0012641163,0.00022814312,0.00078658614,0.0012773959,0.00023150656],"domain_scores_gemma":[0.99419653,0.0030324387,0.00039595022,0.0011382945,0.0010374371,0.00019934517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00428034,0.00083476765,0.0006692883,0.0012564451,0.0011069509,0.002212001,0.001769271,0.0011429541,0.0062883343],"category_scores_gemma":[0.013646966,0.0003832936,0.0012315712,0.00080447947,0.0030033647,0.006624643,0.0028750163,0.0020187537,0.000846021],"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.00009551124,0.00006501001,0.00047583572,0.0002113901,0.000062538114,0.00015132992,0.000981892,0.007348304,0.003007941,0.8940115,0.0024247726,0.09116401],"study_design_scores_gemma":[0.00005228888,0.0001292862,0.00028300117,0.00007065912,0.00010144046,0.00029092625,0.00025128192,0.12166121,0.006223639,0.8438657,0.027017485,0.000053152948],"about_ca_topic_score_codex":0.0014837274,"about_ca_topic_score_gemma":0.0017080194,"teacher_disagreement_score":0.0062883343,"about_ca_system_score_codex":0.0011700941,"about_ca_system_score_gemma":0.001247085,"threshold_uncertainty_score":0.02263689},"labels":[],"label_agreement":null},{"id":"W1541070567","doi":"10.1007/978-3-642-04238-6_68","title":"What Next for ASP? (A Not-Entirely-Well-Informed Opinion)","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Answer set programming; Computer science; Stable model semantics; Non-monotonic logic; Semantics (computer science); Set (abstract data type); Circumscription; Default logic; Logic programming; Programming language; Description logic; Operational semantics","score_opus":0.031548426491185874,"score_gpt":0.2755483100393093,"score_spread":0.2439998835481234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541070567","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007169632,0.050713,0.011320522,0.8782563,0.017861849,0.0000143823845,0.00025313627,0.000115094794,0.040748786],"genre_scores_gemma":[0.057809323,0.16988745,0.03347197,0.6203065,0.043693442,0.00011028804,0.0007674191,0.0006621007,0.073291525],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970078,0.00090987154,0.00027801722,0.00060700695,0.00090690615,0.0002904039],"domain_scores_gemma":[0.99080443,0.0047850567,0.00038983324,0.0008535721,0.0022216763,0.0009453797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007996418,0.0006623126,0.0010464012,0.0016253431,0.0023621293,0.01145691,0.002864981,0.0104560135,0.012328986],"category_scores_gemma":[0.013504749,0.00047209352,0.00084301294,0.003001746,0.005871044,0.042170748,0.0038849174,0.015649246,0.008264623],"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.000036622878,0.00002432742,0.00019768708,0.00047747372,0.000022695294,0.00012142582,0.0009467744,0.00023283095,0.00023592406,0.42387155,0.46815932,0.105673335],"study_design_scores_gemma":[0.000009702952,0.000009187702,0.00017256793,0.0009055583,0.000014584234,0.00022360423,0.0010577723,0.00033191172,0.0002006699,0.20638683,0.7906662,0.000021423433],"about_ca_topic_score_codex":0.007327022,"about_ca_topic_score_gemma":0.00663545,"teacher_disagreement_score":0.012328986,"about_ca_system_score_codex":0.0027678749,"about_ca_system_score_gemma":0.0054568443,"threshold_uncertainty_score":0.042289615},"labels":[],"label_agreement":null},{"id":"W1542582773","doi":"10.1109/icips.1997.669172","title":"Logic programming without default negation revisited","year":2002,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Negation; Logic programming; Negation as failure; Programming language; Computer science; Autoepistemic logic; Default logic; Formalism (music); Horn clause; Logic program; Predicate functor logic; Higher-order logic; Multimodal logic; Description logic","score_opus":0.03147015772001108,"score_gpt":0.252991922301098,"score_spread":0.22152176458108694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542582773","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.01905329,0.0019390609,0.9260019,0.006984627,0.0003998493,0.00008135312,0.0001472338,0.0005002188,0.044892408],"genre_scores_gemma":[0.60207105,0.0019084506,0.37739447,0.0025501067,0.0005758756,0.0001948486,0.00018248732,0.00020300834,0.014919671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755067,0.0008872182,0.00012977819,0.0004757141,0.00068191724,0.0002747538],"domain_scores_gemma":[0.99830353,0.0007887133,0.00013607711,0.00030506853,0.0003321204,0.00013445252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029076599,0.0005469942,0.00067981536,0.0006472446,0.0009943845,0.002773937,0.0019051298,0.0013150771,0.0027059026],"category_scores_gemma":[0.0042114183,0.00039311903,0.0012211878,0.0009783487,0.004329296,0.0072002066,0.0021312363,0.004345038,0.0005759178],"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.000016049407,0.000015876425,0.00004917774,0.00003256379,0.0000055340997,0.00007213061,0.00014992565,0.0018103381,0.0003989257,0.9894769,0.00080971856,0.0071626585],"study_design_scores_gemma":[0.00002481775,0.000015752436,0.000035019773,0.000017868957,0.000011860482,0.00010104685,0.00003895257,0.014949915,0.00061736983,0.9752955,0.008883392,0.000008579517],"about_ca_topic_score_codex":0.003027629,"about_ca_topic_score_gemma":0.0021649522,"teacher_disagreement_score":0.003027629,"about_ca_system_score_codex":0.0024332358,"about_ca_system_score_gemma":0.0021078445,"threshold_uncertainty_score":0.017654479},"labels":[],"label_agreement":null},{"id":"W1544144575","doi":"10.1007/3-540-44652-4_45","title":"On Computing Solutions to Belief Change Scenarios","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Axiom; Computer science; Belief structure; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.040444093220440715,"score_gpt":0.2623968201497717,"score_spread":0.22195272692933102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544144575","genre_codex":"methods","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.048905503,0.0020792421,0.9060627,0.0048110844,0.00032784208,0.0007268277,0.0013605243,0.002360812,0.033365417],"genre_scores_gemma":[0.386696,0.0013496813,0.5997443,0.0006978991,0.0002625779,0.00060562865,0.002915762,0.00031343833,0.0074147116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702686,0.0011007547,0.00028092688,0.00063192396,0.0005965007,0.00036296976],"domain_scores_gemma":[0.98939383,0.008177064,0.00035913876,0.0010910188,0.00065081636,0.00032809915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033741966,0.0017087717,0.00197612,0.0033662205,0.0023331717,0.0058521824,0.0039923843,0.0035478366,0.018625066],"category_scores_gemma":[0.026988365,0.0009792588,0.0023893374,0.004649958,0.003978542,0.014954839,0.006508153,0.003323306,0.0017629033],"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.00069850235,0.00026463062,0.0017635658,0.00058466225,0.00014858518,0.00018863672,0.00086572324,0.18206772,0.0008804032,0.56519675,0.017176112,0.2301647],"study_design_scores_gemma":[0.00004822938,0.000036278176,0.00014755824,0.00006006154,0.000037158294,0.000052517164,0.00024788704,0.21710922,0.00040603816,0.77908874,0.0027505076,0.0000158756],"about_ca_topic_score_codex":0.0057489136,"about_ca_topic_score_gemma":0.007781291,"teacher_disagreement_score":0.018625066,"about_ca_system_score_codex":0.00225969,"about_ca_system_score_gemma":0.0014891877,"threshold_uncertainty_score":0.062307},"labels":[],"label_agreement":null},{"id":"W1545002266","doi":"10.1007/978-1-4615-1567-8_5","title":"The Role of Default Logic in Knowledge Representation","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"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; Computer science; Representation (politics); Business; Artificial intelligence; Autoepistemic logic; Description logic; Political science; Multimodal logic","score_opus":0.019898627787502295,"score_gpt":0.25855428823804305,"score_spread":0.23865566045054076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545002266","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.0045193867,0.07753296,0.46744645,0.019639384,0.0010658294,0.000088457535,0.00045663863,0.0006953472,0.4285555],"genre_scores_gemma":[0.3353514,0.088681825,0.43437952,0.006484319,0.00338362,0.00049790094,0.0014159955,0.00048752013,0.12931785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987759,0.0004255061,0.000095605705,0.00020860511,0.0004284393,0.00006602864],"domain_scores_gemma":[0.9974764,0.0019669065,0.00006218843,0.00025220498,0.00017641504,0.00006577498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021166762,0.0007029189,0.0009676094,0.0017663117,0.0010495735,0.006723668,0.002802847,0.0021919631,0.011961064],"category_scores_gemma":[0.0049935416,0.0007174494,0.0007702642,0.002602147,0.006801238,0.016853461,0.0017264812,0.00455713,0.0027105361],"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.000007963244,0.000009358078,0.000035923164,0.00012709513,0.0000067278543,0.000026582775,0.00017160192,0.00046413584,0.00011809526,0.95262897,0.009331366,0.037072293],"study_design_scores_gemma":[0.000003835197,0.0000023946116,0.000031019845,0.00006918595,0.0000044712583,0.00004921455,0.000034994828,0.0015070736,0.00009391495,0.9748741,0.023325475,0.0000043596083],"about_ca_topic_score_codex":0.0021733297,"about_ca_topic_score_gemma":0.0021021513,"teacher_disagreement_score":0.011961064,"about_ca_system_score_codex":0.0029199424,"about_ca_system_score_gemma":0.0012382782,"threshold_uncertainty_score":0.04001379},"labels":[],"label_agreement":null},{"id":"W1545257085","doi":"10.1007/11499107_3","title":"Substitutional Definition of Satisfiability in Classical Propositional Logic","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Propositional variable; Satisfiability; Well-formed formula; Zeroth-order logic; Propositional calculus; Autoepistemic logic; Propositional formula; Mathematics; Intermediate logic; Discrete mathematics; Computer science; Calculus (dental); Theoretical computer science; Description logic; Multimodal logic","score_opus":0.026191688043510904,"score_gpt":0.24930910968585182,"score_spread":0.2231174216423409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545257085","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.019042855,0.009680704,0.76881444,0.0079349335,0.0016529448,0.000120541175,0.00054705027,0.00039793708,0.19180864],"genre_scores_gemma":[0.5896979,0.0067990124,0.35620177,0.0047370987,0.0025372496,0.0004651493,0.0012904424,0.00036055016,0.037910767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969311,0.0012126159,0.00029755253,0.00042626698,0.00090530433,0.00022704554],"domain_scores_gemma":[0.99790597,0.001249193,0.000078878686,0.00026505027,0.0004298393,0.000071126524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164405,0.0009650389,0.0010724973,0.0026387246,0.0016703297,0.0043897117,0.0027001346,0.002062196,0.006865309],"category_scores_gemma":[0.004293207,0.0012360775,0.0017591277,0.0032966656,0.010351388,0.010475728,0.0025382314,0.007740228,0.001505279],"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.0000065688896,0.0000063094785,0.000024450042,0.00003525675,0.0000052311902,0.000016800617,0.0001111972,0.00025362504,0.00016038287,0.9952258,0.00089936913,0.0032550183],"study_design_scores_gemma":[0.0000059715335,0.000007680108,0.00003178281,0.000027218559,0.000012242793,0.00005337334,0.000040271563,0.0018196005,0.0003107531,0.99055636,0.0071275267,0.000007228961],"about_ca_topic_score_codex":0.0014934813,"about_ca_topic_score_gemma":0.0014744429,"teacher_disagreement_score":0.006865309,"about_ca_system_score_codex":0.0022527904,"about_ca_system_score_gemma":0.0016096957,"threshold_uncertainty_score":0.022966802},"labels":[],"label_agreement":null},{"id":"W1546042720","doi":"10.1007/978-3-642-16248-0_43","title":"A Belief Structure for Reasoning about Knowledge","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Regina","funders":"","keywords":"Computer science; Knowledge representation and reasoning; Kripke structure; Modal logic; Representation (politics); Belief structure; Artificial intelligence; Modal; Belief revision; Epistemic modal logic; Normal modal logic; Measure (data warehouse); Natural language processing; Multimodal logic; Theoretical computer science; Description logic; Temporal logic; Data mining","score_opus":0.01351968386930969,"score_gpt":0.25562435839438813,"score_spread":0.24210467452507844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546042720","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.00220483,0.0010125069,0.9835587,0.0016886086,0.00013059517,0.00007328241,0.00043964665,0.00033012184,0.010561623],"genre_scores_gemma":[0.19824934,0.0018565241,0.7875002,0.00086937303,0.00056341547,0.00055402215,0.0012620902,0.00015759353,0.008987488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666387,0.0012128666,0.0004097687,0.00058447657,0.0009249831,0.00020407427],"domain_scores_gemma":[0.994132,0.004126992,0.00027919456,0.0007020115,0.00056514906,0.00019464822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004188375,0.0014131705,0.0013557154,0.0030667023,0.0020280057,0.0064246804,0.0038898308,0.0034868708,0.009776145],"category_scores_gemma":[0.012107245,0.0014611245,0.0031400824,0.0034716786,0.0044694683,0.015901497,0.003801703,0.006324299,0.0023525087],"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.000038578324,0.000022003183,0.00012220803,0.0001734695,0.000048001657,0.00007817161,0.00046828503,0.0039759153,0.00035737606,0.9619199,0.002484465,0.030311601],"study_design_scores_gemma":[0.000014080191,0.000012611295,0.000049010974,0.000056576362,0.000031297935,0.000044828506,0.000057349436,0.018192573,0.00024618674,0.97654486,0.004736826,0.000013889025],"about_ca_topic_score_codex":0.0051232576,"about_ca_topic_score_gemma":0.004592575,"teacher_disagreement_score":0.009776145,"about_ca_system_score_codex":0.0024918397,"about_ca_system_score_gemma":0.0013411549,"threshold_uncertainty_score":0.032704473},"labels":[],"label_agreement":null},{"id":"W1549792078","doi":"","title":"A tractability result for reasoning with incomplete first-order knowledge bases","year":2003,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"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 Toronto","funders":"","keywords":"Undecidable problem; Joins; Extension (predicate logic); Computer science; Logical consequence; Scheme (mathematics); Theoretical computer science; Description logic; Conservative extension; Artificial intelligence; Decidability; Mathematics; Programming language","score_opus":0.023498537126153737,"score_gpt":0.2571593573054058,"score_spread":0.23366082017925205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549792078","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.017179582,0.0011837954,0.9576147,0.003725164,0.00013051719,0.0003068355,0.0006707074,0.0009878405,0.018200887],"genre_scores_gemma":[0.4663787,0.00346829,0.5071924,0.0020467597,0.0008375851,0.0016056861,0.0035546378,0.0006275266,0.014288468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902604,0.0027775727,0.00076613936,0.0016970972,0.003556003,0.0009428102],"domain_scores_gemma":[0.92625487,0.06278666,0.0016324641,0.0063759102,0.0023454167,0.0006047593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012215276,0.0020949116,0.0026483967,0.0031088076,0.0032424447,0.008288043,0.0046868958,0.004564569,0.0105552785],"category_scores_gemma":[0.05678887,0.0016337843,0.007916757,0.0040875534,0.007097998,0.024522837,0.0069366507,0.010458629,0.002150143],"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.00041245925,0.00029162248,0.0013020479,0.0011200893,0.00042798184,0.00077503273,0.000909076,0.15313925,0.0035243712,0.76655555,0.007720683,0.06382198],"study_design_scores_gemma":[0.000053067608,0.00005445668,0.00023397786,0.000119519915,0.00010282392,0.0001977431,0.00005001488,0.15121515,0.002359224,0.84154075,0.004036603,0.000036738915],"about_ca_topic_score_codex":0.005784959,"about_ca_topic_score_gemma":0.006060302,"teacher_disagreement_score":0.012215276,"about_ca_system_score_codex":0.0055828704,"about_ca_system_score_gemma":0.0037485068,"threshold_uncertainty_score":0.0646013},"labels":[],"label_agreement":null},{"id":"W1552562496","doi":"","title":"Decision-Theoretic, High-Level Agent Programming in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":195,"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 Toronto","funders":"","keywords":"Markov decision process; Computer science; Situation calculus; Interpreter; Domain (mathematical analysis); Programming language; Programming domain; Symbolic programming; Artificial intelligence; Inductive programming; Logic programming; Partially observable Markov decision process; Process calculus; Theoretical computer science; Markov process; Programming paradigm; Markov chain; Machine learning; Mathematics; Markov model","score_opus":0.022068105315379873,"score_gpt":0.2568810325249191,"score_spread":0.23481292720953925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552562496","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.0044459794,0.00024512014,0.9862949,0.0006967667,0.00003436234,0.000045701174,0.00006224553,0.0002857103,0.007889142],"genre_scores_gemma":[0.23834136,0.0006023596,0.7540221,0.00029320148,0.000101975886,0.00025826765,0.00013063791,0.00011147421,0.006138597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882466,0.00051110337,0.00007259087,0.00013951604,0.00030141269,0.00015068112],"domain_scores_gemma":[0.9990422,0.00056817645,0.00008260546,0.00013160419,0.00007349619,0.00010179227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024698784,0.0006401483,0.00058567413,0.0006314011,0.0010784977,0.0035714286,0.0019959395,0.0011471163,0.0035549623],"category_scores_gemma":[0.0024647345,0.00067356817,0.0015122261,0.0008389078,0.0043987655,0.0046801073,0.0021010162,0.0030442497,0.00070307974],"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.000008916802,0.00001325059,0.00005923485,0.00002513892,0.000005981686,0.000053781398,0.00017630661,0.011408712,0.00034816514,0.9834978,0.0003601879,0.0040424108],"study_design_scores_gemma":[0.000020923148,0.000016397114,0.000038684688,0.000019795378,0.00001414929,0.000046562396,0.000053455733,0.081472576,0.0006622191,0.90929025,0.008351909,0.000013087628],"about_ca_topic_score_codex":0.0035740277,"about_ca_topic_score_gemma":0.004691287,"teacher_disagreement_score":0.0035740277,"about_ca_system_score_codex":0.0018974926,"about_ca_system_score_gemma":0.002075329,"threshold_uncertainty_score":0.013767362},"labels":[],"label_agreement":null},{"id":"W1552675516","doi":"","title":"Precondition control and the Progression algorithm","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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 Toronto","funders":"","keywords":"Precondition; Situation calculus; Computer science; Prefix; Algorithm; Backward chaining; Action (physics); Chaining; Control (management); Plan (archaeology); Theoretical computer science; Artificial intelligence; Programming language; Inference","score_opus":0.005427705629162018,"score_gpt":0.22883109028712362,"score_spread":0.2234033846579616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552675516","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.01333701,0.00016825364,0.9720962,0.0006038363,0.00004844512,0.000110427434,0.0000912975,0.0020229302,0.01152166],"genre_scores_gemma":[0.31781384,0.00043248694,0.6721306,0.00025884339,0.00007223075,0.00024385369,0.00039153738,0.00030433087,0.008352188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986078,0.0004208154,0.00007878705,0.0002827175,0.00040248645,0.00020744068],"domain_scores_gemma":[0.99777824,0.0011955189,0.00016129734,0.00040517404,0.00034584166,0.0001139495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029296833,0.00045623217,0.0004388999,0.00087327865,0.00079276453,0.0016393743,0.001238194,0.00092852593,0.010583393],"category_scores_gemma":[0.00843368,0.00048060884,0.00078606093,0.00067597075,0.0032443146,0.0044543194,0.0024111646,0.002253217,0.0017755749],"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.0001422929,0.00006582491,0.0004703747,0.00017327743,0.000018297475,0.00015918764,0.00043763765,0.044033904,0.0033415132,0.8278419,0.0028133576,0.12050249],"study_design_scores_gemma":[0.00013308568,0.00012342325,0.00021323407,0.0001050083,0.00003390804,0.00010170419,0.00015020328,0.29743728,0.009519422,0.6758698,0.016278451,0.000034506484],"about_ca_topic_score_codex":0.004379246,"about_ca_topic_score_gemma":0.003924687,"teacher_disagreement_score":0.010583393,"about_ca_system_score_codex":0.001131114,"about_ca_system_score_gemma":0.0028662495,"threshold_uncertainty_score":0.03540498},"labels":[],"label_agreement":null},{"id":"W1552977268","doi":"10.1007/11916277_31","title":"Constructing Camin-Sokal Phylogenies Via Answer Set Programming","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Set (abstract data type); Phylogenetic tree; Phylogenetics; Binary number; Theoretical computer science; Cladistics; Programming language; Biology; Mathematics","score_opus":0.014646635969426846,"score_gpt":0.23403365947712865,"score_spread":0.2193870235077018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552977268","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.0127215125,0.00018315813,0.98021334,0.00053584215,0.00006904281,0.00006663266,0.0005093673,0.002056544,0.0036445323],"genre_scores_gemma":[0.13378932,0.000249137,0.85978436,0.0003792511,0.00010382684,0.00023082116,0.0021676065,0.0009307418,0.002364867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976241,0.0008345403,0.00017216791,0.00061852176,0.0005225119,0.00022810938],"domain_scores_gemma":[0.99057287,0.0074385083,0.00031701557,0.0010196388,0.00045628284,0.00019566502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047407993,0.0012563624,0.0019730427,0.0042413375,0.0022214623,0.0036296938,0.0041516614,0.002313392,0.010253856],"category_scores_gemma":[0.0207536,0.001439315,0.003980022,0.0029369884,0.0032098484,0.0076770475,0.00526227,0.0051074014,0.0020708474],"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.00035035046,0.00020507853,0.0035052057,0.00069906464,0.00028062018,0.00029199896,0.0010920839,0.125671,0.0036143905,0.6111084,0.011666052,0.24151577],"study_design_scores_gemma":[0.000057348258,0.000026118665,0.00024316557,0.00006888863,0.00007686452,0.000060374707,0.000109083485,0.15848118,0.0017310632,0.8342135,0.0049072993,0.00002511168],"about_ca_topic_score_codex":0.0014236605,"about_ca_topic_score_gemma":0.0038450947,"teacher_disagreement_score":0.010253856,"about_ca_system_score_codex":0.001622689,"about_ca_system_score_gemma":0.0013256996,"threshold_uncertainty_score":0.034302533},"labels":[],"label_agreement":null},{"id":"W1554100114","doi":"10.1007/978-3-642-02846-5_17","title":"Merging Logic Programs under Answer Set Semantics","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Multiset; Logic programming; Answer set programming; Stable model semantics; Logic program; Theoretical computer science; Programming language; Formalism (music); Semantics (computer science); Set (abstract data type); Well-founded semantics; Description logic; Operational semantics; Mathematics; Denotational semantics; Discrete mathematics","score_opus":0.029611324319468488,"score_gpt":0.2624571032124359,"score_spread":0.23284577889296743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554100114","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.022071235,0.00049499044,0.9562932,0.0010257751,0.00016125148,0.00018272933,0.00039250863,0.005384071,0.01399422],"genre_scores_gemma":[0.23743267,0.00060263014,0.7484311,0.0006121856,0.0002449082,0.00026430996,0.0024737306,0.0017528048,0.008185686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937716,0.0017877031,0.0005931135,0.00087995967,0.002416535,0.0005511265],"domain_scores_gemma":[0.9909956,0.005763059,0.00035050436,0.0015593498,0.0011043155,0.00022721654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004891569,0.0008837685,0.0013178613,0.002256068,0.0016039754,0.0045452723,0.0039256937,0.002127866,0.008367395],"category_scores_gemma":[0.015582558,0.0013062124,0.002334153,0.0030410904,0.0025162245,0.014578261,0.0067610745,0.0033586079,0.0021529028],"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.0005125351,0.00024743978,0.00085022685,0.0005371281,0.00017010409,0.00044503796,0.0016718075,0.013822926,0.011701396,0.68573177,0.010818504,0.2734911],"study_design_scores_gemma":[0.00009744931,0.00007923819,0.00025426663,0.00009808219,0.00019553224,0.0002237141,0.00026789837,0.049112935,0.020833803,0.9047398,0.024045547,0.00005178367],"about_ca_topic_score_codex":0.0010980892,"about_ca_topic_score_gemma":0.0012775565,"teacher_disagreement_score":0.008367395,"about_ca_system_score_codex":0.0012711224,"about_ca_system_score_gemma":0.00141449,"threshold_uncertainty_score":0.027991712},"labels":[],"label_agreement":null},{"id":"W1556569091","doi":"10.1086/667998","title":"Essay Review: <i>The Laws of Belief</i>","year":2012,"lang":"en","type":"article","venue":"Philosophy of Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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 Toronto","funders":"","keywords":"Content (measure theory); Computer science; Epistemology; Law; Internet privacy; Mathematics; Political science; Philosophy","score_opus":0.025672534559261898,"score_gpt":0.2673366815430879,"score_spread":0.241664146983826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556569091","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002110332,0.18602662,0.0017240536,0.6654729,0.046486054,0.0000144921805,0.00030420255,0.000051590367,0.09780976],"genre_scores_gemma":[0.27780837,0.23486379,0.0024324805,0.15697543,0.14896119,0.00012362252,0.00091497257,0.0002402948,0.1776799],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997792,0.0009173466,0.00008898519,0.00027974075,0.0008016462,0.00012026568],"domain_scores_gemma":[0.9842106,0.009952423,0.0007189888,0.00059663795,0.004024261,0.0004969887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032448792,0.00038109766,0.0004481571,0.0019852037,0.0015956523,0.004495167,0.0009020018,0.0031455995,0.010911711],"category_scores_gemma":[0.023622412,0.00020014471,0.00034091732,0.0015438382,0.005345943,0.004063002,0.0010417005,0.0052944315,0.003650523],"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.000011580572,0.000005087622,0.00013643265,0.00033835342,0.00001243769,0.000034744982,0.00043605058,0.00009543956,0.00009405404,0.09342897,0.8828065,0.022600492],"study_design_scores_gemma":[0.0000069835523,0.00000978553,0.001213331,0.0012292893,0.000012597601,0.00011296407,0.0005478271,0.00014031281,0.0001243252,0.053755265,0.9428338,0.000013595454],"about_ca_topic_score_codex":0.004763204,"about_ca_topic_score_gemma":0.0051544127,"teacher_disagreement_score":0.010911711,"about_ca_system_score_codex":0.0044262363,"about_ca_system_score_gemma":0.0030812365,"threshold_uncertainty_score":0.036503255},"labels":[],"label_agreement":null},{"id":"W1557447656","doi":"10.1007/978-3-540-24840-8_60","title":"Extending Montague Semantics for Use in Natural-Language Database-Query Processing","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Computational semantics; Natural language processing; Natural language; Syntax; Artificial intelligence; Linguistics; Operational semantics","score_opus":0.023782945619373927,"score_gpt":0.2711180010463937,"score_spread":0.24733505542701978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557447656","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.007885242,0.00019356453,0.9802203,0.00035872098,0.00008984083,0.000119669196,0.00017430937,0.0042380095,0.006720306],"genre_scores_gemma":[0.25319827,0.0002997866,0.7361779,0.0005015243,0.00021097028,0.00036569822,0.00082670746,0.0013983801,0.007020807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967007,0.0010643291,0.0004166029,0.0005416481,0.0009012691,0.00037551357],"domain_scores_gemma":[0.99593264,0.0017678409,0.0002481713,0.0011408799,0.000718687,0.00019193585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042460486,0.0009764099,0.0014035312,0.0023600063,0.0024053783,0.0060644103,0.0032871081,0.0013962446,0.0085300105],"category_scores_gemma":[0.010227332,0.0009820506,0.0020817977,0.0027445664,0.0032762433,0.012690913,0.0053625763,0.0024788019,0.00206167],"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.00029882602,0.00022488098,0.0007479958,0.00021123113,0.000050469567,0.00027839202,0.0013594528,0.0077575687,0.0044966694,0.85916597,0.0077261315,0.117682435],"study_design_scores_gemma":[0.000091355614,0.0000924041,0.00012638337,0.0000751316,0.00008089978,0.0002897591,0.0002798381,0.0841276,0.008486928,0.8691482,0.037139665,0.00006172464],"about_ca_topic_score_codex":0.006305422,"about_ca_topic_score_gemma":0.008759024,"teacher_disagreement_score":0.0085300105,"about_ca_system_score_codex":0.0013728106,"about_ca_system_score_gemma":0.0015648246,"threshold_uncertainty_score":0.028535783},"labels":[],"label_agreement":null},{"id":"W1561859406","doi":"10.1007/978-3-540-27836-8_96","title":"Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PSPACE; Equivalence (formal languages); True quantified Boolean formula; Mathematics; Discrete mathematics; Two-element Boolean algebra; Boolean expression; Characterization (materials science); Boolean circuit; Boolean function; Algebra over a field; Computational complexity theory; Algorithm; Pure mathematics","score_opus":0.021019765403745044,"score_gpt":0.24657812451281902,"score_spread":0.22555835910907399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561859406","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.016678626,0.0043865913,0.9031752,0.0044794953,0.00041129038,0.00007853254,0.00030981764,0.0007633695,0.06971702],"genre_scores_gemma":[0.51339245,0.006358547,0.44465637,0.00176684,0.0010058692,0.00021949499,0.0016453273,0.0004462185,0.030508978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741083,0.0008708813,0.00019586172,0.00040467296,0.00087721634,0.00024053753],"domain_scores_gemma":[0.9954294,0.0036919978,0.00016274059,0.0003574769,0.00025560628,0.00010284212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024091501,0.0010556037,0.00093986647,0.0013626375,0.0011681942,0.005161824,0.002659578,0.0016850422,0.009276252],"category_scores_gemma":[0.009345691,0.0009773732,0.0017615712,0.0026150942,0.0035859651,0.011869233,0.0027186791,0.005116935,0.0012283155],"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.00006634527,0.000053321004,0.00017215186,0.00031397934,0.000041179785,0.0001246866,0.00029716452,0.008970316,0.0008982728,0.9338908,0.006811502,0.048360296],"study_design_scores_gemma":[0.00001861514,0.0000097283255,0.000050529918,0.00006629135,0.000023141167,0.00006857587,0.00006488214,0.017387984,0.0012882224,0.97512937,0.0058841533,0.00000839495],"about_ca_topic_score_codex":0.0016756506,"about_ca_topic_score_gemma":0.001979402,"teacher_disagreement_score":0.009276252,"about_ca_system_score_codex":0.0020160165,"about_ca_system_score_gemma":0.0010015554,"threshold_uncertainty_score":0.031032145},"labels":[],"label_agreement":null},{"id":"W1562472473","doi":"","title":"Semantics for a useful fragment of the situation calculus","year":2005,"lang":"en","type":"article","venue":"RWTH Publications (RWTH Aachen)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"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 Toronto","funders":"","keywords":"Situation calculus; Fragment (logic); Calculus (dental); Modal logic; Computer science; Semantics (computer science); Modal operator; First-order logic; Modal; Programming language; Multimodal logic; Description logic","score_opus":0.024171617964306103,"score_gpt":0.26231836870913755,"score_spread":0.23814675074483144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562472473","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.019660635,0.0012682251,0.90591216,0.0044336934,0.0004719439,0.0001830092,0.00052136305,0.0014735588,0.06607542],"genre_scores_gemma":[0.587734,0.0012684988,0.39012572,0.0013054265,0.00050200446,0.0004612303,0.0006945976,0.00030217512,0.017606372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982174,0.0004881609,0.00015186255,0.00030861236,0.00057584833,0.000258075],"domain_scores_gemma":[0.99907756,0.00037324624,0.00008180918,0.00015690106,0.0002074884,0.000103030594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023233062,0.0007279911,0.00066880975,0.0012495344,0.002389277,0.003865928,0.0016459024,0.0015281885,0.006268723],"category_scores_gemma":[0.0021026875,0.0004965258,0.001975102,0.0011593297,0.0053126113,0.0076681315,0.002883493,0.0037900168,0.0010038405],"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.000005305535,0.0000042423517,0.000014321653,0.000018352646,0.0000030524154,0.0000494547,0.0002496808,0.000357326,0.0003468105,0.9969939,0.00035656337,0.0016009652],"study_design_scores_gemma":[0.000019938427,0.000013960769,0.00004557662,0.00001657696,0.00001180029,0.0001356545,0.00013722017,0.004211002,0.00075764104,0.9624017,0.032231674,0.00001724721],"about_ca_topic_score_codex":0.0029731789,"about_ca_topic_score_gemma":0.0020067024,"teacher_disagreement_score":0.006268723,"about_ca_system_score_codex":0.0025367325,"about_ca_system_score_gemma":0.001786221,"threshold_uncertainty_score":0.02097094},"labels":[],"label_agreement":null},{"id":"W1562987626","doi":"10.1023/a:1025697810124","title":"A Formal Approach to Agent Design: An Overview of Constraint-Based Agents","year":2003,"lang":"en","type":"article","venue":"Constraints","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Constraint (computer-aided design); Computer science; Automaton; Formal verification; Formal specification; Constraint logic programming; Constraint satisfaction problem; Theoretical computer science; Constraint graph; Constraint satisfaction; Programming language; Artificial intelligence; Mathematics","score_opus":0.1476368975762101,"score_gpt":0.3154502977111036,"score_spread":0.16781340013489351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562987626","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.0004910159,0.006303927,0.9813874,0.0022267497,0.00010095584,0.00014054398,0.00010422849,0.00018883064,0.009056393],"genre_scores_gemma":[0.030325972,0.012736339,0.9516595,0.0005847343,0.0002359543,0.0005873832,0.00028578533,0.000109857945,0.0034745543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555486,0.0017139253,0.0005920951,0.00051582634,0.0014071146,0.00021625812],"domain_scores_gemma":[0.99523646,0.0027578026,0.00034770832,0.0005746453,0.0008384911,0.00024499357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051393015,0.001656989,0.0019058797,0.0027116127,0.0023635027,0.009499891,0.0061058616,0.00354682,0.0049178274],"category_scores_gemma":[0.0075440803,0.0018688295,0.0024127697,0.004258336,0.007115834,0.008676819,0.003695006,0.0053759147,0.0018131532],"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.000018407025,0.00007887993,0.00016634984,0.00075590966,0.000063532316,0.00011085084,0.00038476626,0.020055048,0.0005625294,0.9342941,0.0041483203,0.03936135],"study_design_scores_gemma":[0.000030685085,0.000026215128,0.00007811642,0.0004338804,0.000051451898,0.00018050044,0.00018528063,0.05786831,0.0011015735,0.84259653,0.09739847,0.000049046557],"about_ca_topic_score_codex":0.00882475,"about_ca_topic_score_gemma":0.009914643,"teacher_disagreement_score":0.009499891,"about_ca_system_score_codex":0.0037781317,"about_ca_system_score_gemma":0.0058889636,"threshold_uncertainty_score":0.027412355},"labels":[],"label_agreement":null},{"id":"W156399817","doi":"","title":"Plan Understanding: Inferring Implicit Dependencies from Explicit Elements in Multi-Agent Plan Representations.","year":2004,"lang":"en","type":"article","venue":"","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":"Lockheed Martin (Canada)","funders":"","keywords":"Plan (archaeology); Interdependence; Computer science; Representation (politics); Management science; Artificial intelligence; Engineering","score_opus":0.13565038249852612,"score_gpt":0.30947640307059615,"score_spread":0.17382602057207003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156399817","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.035126198,0.00030062697,0.95835876,0.0009765879,0.000030009945,0.00015000653,0.0008650971,0.0013710961,0.00282169],"genre_scores_gemma":[0.45145363,0.000444615,0.5436888,0.00018425036,0.000027979328,0.00018470426,0.0028061208,0.0001569707,0.001053016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990783,0.00042243738,0.00007711447,0.0001395476,0.00022972233,0.000052942156],"domain_scores_gemma":[0.9942198,0.0038956185,0.00066195393,0.000767196,0.00034731667,0.0001081914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002086702,0.00064737606,0.0003501669,0.0015994865,0.0006299345,0.0022212924,0.0012815924,0.0013307356,0.0029509962],"category_scores_gemma":[0.015123823,0.00067285856,0.0010220099,0.0012294474,0.0011127897,0.0060577574,0.0022725316,0.0024936397,0.00039183776],"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.0004258316,0.00035911013,0.0082906755,0.0006642131,0.00024286164,0.00076739653,0.0035155679,0.34629065,0.008717589,0.22075194,0.010119856,0.3998543],"study_design_scores_gemma":[0.00002438494,0.000047558216,0.0009998531,0.00013723498,0.00007760398,0.00009889615,0.00033761942,0.8504992,0.0041350345,0.13756974,0.006039051,0.000033827157],"about_ca_topic_score_codex":0.0062052812,"about_ca_topic_score_gemma":0.01098587,"teacher_disagreement_score":0.0062052812,"about_ca_system_score_codex":0.0008840844,"about_ca_system_score_gemma":0.001295386,"threshold_uncertainty_score":0.01233834},"labels":[],"label_agreement":null},{"id":"W1564382958","doi":"10.1007/11546207_21","title":"Lookahead in Smodels Compared to Local Consistencies in CSP","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Local consistency; Solver; Set (abstract data type); Answer set programming; Constraint satisfaction problem; Consistency (knowledge bases); Constraint (computer-aided design); Constraint programming; Theoretical computer science; Algorithm; Mathematical optimization; Programming language; Artificial intelligence; Mathematics","score_opus":0.02586779464168893,"score_gpt":0.25176848063844814,"score_spread":0.22590068599675922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564382958","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.4104766,0.002291751,0.56053734,0.0014404905,0.0002754963,0.00016018034,0.0003885623,0.004821114,0.019608464],"genre_scores_gemma":[0.91206557,0.00034149634,0.08243979,0.00014676682,0.00007677959,0.00008730138,0.0003198521,0.0004502798,0.004072238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718446,0.001458769,0.0001332348,0.00032019542,0.000530721,0.0003725342],"domain_scores_gemma":[0.9800869,0.015585426,0.0006486958,0.0020485823,0.00095440255,0.0006759677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051887557,0.0007366455,0.0019024486,0.00091058516,0.00112928,0.0022627434,0.0021040956,0.0012523303,0.011089618],"category_scores_gemma":[0.014193379,0.0007316599,0.0007222914,0.0016907791,0.0018139172,0.007572796,0.0023306778,0.002798814,0.0008550203],"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.005766552,0.000567706,0.002184178,0.00044832856,0.00012368335,0.00010494648,0.00038140014,0.6337645,0.0030481839,0.19422153,0.008258479,0.15113042],"study_design_scores_gemma":[0.00011246339,0.00027998904,0.00019852075,0.00002571617,0.000046838497,0.000019623625,0.00006003627,0.9166924,0.0012836106,0.08060863,0.0006567246,0.000015470863],"about_ca_topic_score_codex":0.0033573362,"about_ca_topic_score_gemma":0.005579047,"teacher_disagreement_score":0.011089618,"about_ca_system_score_codex":0.0013370846,"about_ca_system_score_gemma":0.002143806,"threshold_uncertainty_score":0.037098467},"labels":[],"label_agreement":null},{"id":"W1565284509","doi":"","title":"Abstraction, Reformulation, and Approximation: 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings","year":2002,"lang":"en","type":"book","venue":"Medical Entomology and Zoology","topic":"Logic, Reasoning, and Knowledge","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":"","keywords":"Computer science; Abstraction; Reinforcement learning; Theoretical computer science; Artificial intelligence","score_opus":0.008987607095220694,"score_gpt":0.22416622195474273,"score_spread":0.21517861485952203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565284509","genre_codex":"methods","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.0076591517,0.225745,0.6515637,0.014328078,0.007134442,0.00021185503,0.0017418155,0.008027932,0.08358804],"genre_scores_gemma":[0.071052395,0.16469322,0.43545082,0.001978048,0.0048962617,0.00046479853,0.0072757457,0.0038685459,0.31032017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998359,0.00034927993,0.00014188701,0.0003474252,0.0006107535,0.0001916497],"domain_scores_gemma":[0.9969537,0.0012246424,0.00008090779,0.00050382095,0.0009918066,0.00024511013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043568,0.0027924771,0.0025551005,0.0021236502,0.001343048,0.007482784,0.0028291836,0.0019157698,0.05756124],"category_scores_gemma":[0.0056779413,0.0019364983,0.0020464913,0.0041357176,0.0030280307,0.007329215,0.0023893553,0.0049064974,0.014056865],"study_design_candidate":"not_applicable","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.00056028477,0.000221937,0.0007546585,0.0010580043,0.00014630727,0.00019866074,0.0005110843,0.015867027,0.0025530616,0.070766754,0.40200138,0.5053608],"study_design_scores_gemma":[0.00016721383,0.00014569843,0.0022800025,0.0011352206,0.00024202559,0.0006102191,0.0006947132,0.10595838,0.0034583514,0.11423102,0.7709665,0.000110643705],"about_ca_topic_score_codex":0.07152352,"about_ca_topic_score_gemma":0.07157244,"teacher_disagreement_score":0.07152352,"about_ca_system_score_codex":0.00976678,"about_ca_system_score_gemma":0.006678155,"threshold_uncertainty_score":0.19256157},"labels":[],"label_agreement":null},{"id":"W1567578637","doi":"10.1007/978-3-540-72200-7_30","title":"On the Effectiveness of Looking Ahead in Search for Answer Sets","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"DPLL algorithm; Overhead (engineering); Computer science; Constraint (computer-aided design); Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Programming language; Phase-locked loop","score_opus":0.03066738780843587,"score_gpt":0.2926294402534919,"score_spread":0.26196205244505605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567578637","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.70668846,0.023938375,0.18071373,0.011006911,0.00086647883,0.0004342168,0.0019173047,0.004233037,0.070201606],"genre_scores_gemma":[0.9160301,0.0026077079,0.073116,0.0011124035,0.0004906729,0.00011004023,0.001809435,0.00058021257,0.0041435068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98699784,0.0068854312,0.0008179654,0.0012830059,0.0032075013,0.0008083109],"domain_scores_gemma":[0.647219,0.33596665,0.0033100524,0.008334258,0.003162118,0.0020078837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018811157,0.0014817219,0.0030105237,0.0037112741,0.0018829206,0.0044686957,0.0037868351,0.005934633,0.011856249],"category_scores_gemma":[0.14524159,0.0010098134,0.0015514473,0.0047650966,0.0031794824,0.018542191,0.0037822598,0.004287599,0.0016818679],"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.018068738,0.0025681937,0.028914696,0.0013449285,0.00052956346,0.00026579868,0.0011891823,0.15429099,0.0045002424,0.05939284,0.030421564,0.69851315],"study_design_scores_gemma":[0.0011984044,0.0020760205,0.0069480306,0.00035258805,0.0006022009,0.00038240507,0.00080811797,0.8174619,0.0043010954,0.16284996,0.002898973,0.00012020574],"about_ca_topic_score_codex":0.009137252,"about_ca_topic_score_gemma":0.0059695374,"teacher_disagreement_score":0.018811157,"about_ca_system_score_codex":0.0019245461,"about_ca_system_score_gemma":0.0021062244,"threshold_uncertainty_score":0.099484086},"labels":[],"label_agreement":null},{"id":"W1572665084","doi":"","title":"Intelligent agent control using simple logic-based hierarchical planning","year":2009,"lang":"en","type":"article","venue":"International Conference on System of Systems Engineering","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":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Planner; Computer science; Situation calculus; Simple (philosophy); Task (project management); Logic programming; Artificial intelligence; Intelligent control; Control (management); Robot; Hierarchical control system; Automated planning and scheduling; Engineering","score_opus":0.055131152608560406,"score_gpt":0.28857258579653017,"score_spread":0.23344143318796975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572665084","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.021413013,0.00010505854,0.96659684,0.00028396878,0.000029877934,0.00012893062,0.0000650742,0.0008748223,0.0105024045],"genre_scores_gemma":[0.63355094,0.0001764347,0.3624636,0.00012287256,0.000021297972,0.00019518423,0.0001103156,0.00008637821,0.003272993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994135,0.00020496188,0.000043588327,0.000081434955,0.00017971196,0.00007684707],"domain_scores_gemma":[0.99937683,0.00033295943,0.000062754596,0.00009763825,0.0000651252,0.000064642176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010653924,0.00056974846,0.00040544372,0.00044702258,0.0008670152,0.001750386,0.0011498738,0.00074817485,0.002374624],"category_scores_gemma":[0.0020851148,0.00033069518,0.00072489935,0.0004931248,0.0020160684,0.001648676,0.0018432102,0.00081748277,0.0003273648],"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.00015554954,0.00010065449,0.00048039385,0.00015566556,0.0000518122,0.0004967432,0.000665154,0.5798134,0.010886718,0.35695404,0.0014049922,0.048834868],"study_design_scores_gemma":[0.000055610177,0.000052900043,0.000078165765,0.000014591058,0.00001909439,0.00004431208,0.000043327884,0.8548566,0.0022679162,0.13951516,0.0030369645,0.00001537689],"about_ca_topic_score_codex":0.006225389,"about_ca_topic_score_gemma":0.0087561505,"teacher_disagreement_score":0.006225389,"about_ca_system_score_codex":0.0013310906,"about_ca_system_score_gemma":0.0015414424,"threshold_uncertainty_score":0.012378275},"labels":[],"label_agreement":null},{"id":"W1574178290","doi":"10.1007/978-3-540-70525-3_4","title":"A Tableaux System for Deontic Action Logic","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Action (physics); Computer science; Epistemology; Programming language; Philosophy; Physics","score_opus":0.03535596432300425,"score_gpt":0.25830683493351886,"score_spread":0.2229508706105146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574178290","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.0038624264,0.00035201464,0.9600575,0.0003091773,0.0002594811,0.0002120426,0.0023067812,0.016784338,0.015856229],"genre_scores_gemma":[0.10548648,0.00062398816,0.85605633,0.00040617978,0.00023130185,0.00043863844,0.0054039317,0.0029877916,0.028365338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989041,0.0002356195,0.00012531142,0.00029316638,0.00034713614,0.00009466528],"domain_scores_gemma":[0.99899274,0.0005502902,0.000036563604,0.00020497644,0.00015228198,0.000063133484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862424,0.0009943045,0.0014211161,0.0013157016,0.0014544402,0.005002968,0.0028607708,0.001306338,0.02938062],"category_scores_gemma":[0.0027089498,0.0012428713,0.0017107535,0.0015363562,0.0018314046,0.004224296,0.0025556353,0.002391392,0.009433682],"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.00025939348,0.00012538055,0.00030611892,0.00032874965,0.00005192616,0.0003212351,0.0006570336,0.008828968,0.00851559,0.78962296,0.029896325,0.16108625],"study_design_scores_gemma":[0.00021055435,0.00007843792,0.00017823189,0.00009373172,0.00010313874,0.0002703569,0.0001356478,0.093982175,0.012517766,0.74172103,0.15062751,0.000081395476],"about_ca_topic_score_codex":0.004146063,"about_ca_topic_score_gemma":0.0056227897,"teacher_disagreement_score":0.02938062,"about_ca_system_score_codex":0.0016259792,"about_ca_system_score_gemma":0.0018483654,"threshold_uncertainty_score":0.09828794},"labels":[],"label_agreement":null},{"id":"W1574220574","doi":"10.5591/978-1-57735-516-8/ijcai11-439","title":"A correctness result for reasoning about one-dimensional planning problems","year":2010,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Plan (archaeology); Domain (mathematical analysis); Semantics (computer science); Representation (politics); Class (philosophy); Planner; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.026406608823461904,"score_gpt":0.2718747890836058,"score_spread":0.2454681802601439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574220574","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.027377794,0.00019619748,0.96327734,0.001294633,0.000054673044,0.00013432231,0.00019028576,0.0016596947,0.005815064],"genre_scores_gemma":[0.521356,0.00042128682,0.47393495,0.00062125945,0.00012811889,0.00028383484,0.0007377262,0.00039978148,0.0021171172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99448675,0.0012663546,0.00050820876,0.00097231916,0.0021884704,0.0005779199],"domain_scores_gemma":[0.9843705,0.010755132,0.0007147531,0.0023536936,0.0014536076,0.00035232265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004447636,0.0008998626,0.0009094211,0.0012521418,0.0015397297,0.0030630075,0.002415828,0.0019383543,0.003225883],"category_scores_gemma":[0.020022927,0.00081806566,0.0033575532,0.0009728627,0.007743496,0.0062580802,0.0046900753,0.004299694,0.00066086045],"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.00015696563,0.00010316897,0.002043914,0.0004278993,0.00011410522,0.00055689015,0.0009192019,0.11325095,0.0071039526,0.82772535,0.0021415062,0.04545615],"study_design_scores_gemma":[0.00005730605,0.000066297194,0.0003965355,0.00007746774,0.00007222895,0.00028132703,0.00015114338,0.20561756,0.00891412,0.7788437,0.0054746517,0.000047554753],"about_ca_topic_score_codex":0.0045179822,"about_ca_topic_score_gemma":0.0027812333,"teacher_disagreement_score":0.0045179822,"about_ca_system_score_codex":0.0023201692,"about_ca_system_score_gemma":0.0030171834,"threshold_uncertainty_score":0.023521662},"labels":[],"label_agreement":null},{"id":"W1576724046","doi":"10.1023/a:1010624702918","title":"Current Trends in Logical Frameworks and Metalanguages","year":2001,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mathematics","score_opus":0.015101783410440592,"score_gpt":0.29959176747971816,"score_spread":0.28448998406927756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576724046","genre_codex":"review","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.015395355,0.7716403,0.086564325,0.07235564,0.0019238698,0.000059238908,0.0002736383,0.0011208865,0.050666798],"genre_scores_gemma":[0.14429726,0.68007743,0.14034176,0.014544889,0.009088909,0.00024008397,0.0010221289,0.0005064586,0.009881182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940205,0.0019789902,0.0006256489,0.0012606771,0.0015686777,0.00054550765],"domain_scores_gemma":[0.9602022,0.028858436,0.0020008618,0.0023101596,0.004798582,0.0018296841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014397917,0.0007213053,0.0015149876,0.005495085,0.0014225229,0.013315466,0.0056476737,0.0042277253,0.016445084],"category_scores_gemma":[0.0205578,0.0010753097,0.0011284617,0.008113937,0.011417316,0.035837602,0.003723242,0.004889223,0.0038767129],"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.00023132612,0.0001689119,0.001518283,0.0021727453,0.000036895985,0.000077738725,0.0009326454,0.0011134783,0.001125957,0.5906273,0.017137967,0.38485667],"study_design_scores_gemma":[0.00006568553,0.000107041764,0.0008158229,0.0015473827,0.000056385747,0.0005826221,0.0016665562,0.0041675507,0.0009363567,0.4618733,0.5281164,0.00006491198],"about_ca_topic_score_codex":0.0020584136,"about_ca_topic_score_gemma":0.002175674,"teacher_disagreement_score":0.016445084,"about_ca_system_score_codex":0.0034213332,"about_ca_system_score_gemma":0.0053001572,"threshold_uncertainty_score":0.0761444},"labels":[],"label_agreement":null},{"id":"W1578792929","doi":"10.1007/978-3-540-27775-0_22","title":"Arc-Consistency + Unit Propagation = Lookahead","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Consistency (knowledge bases); Local consistency; Arc (geometry); Algorithm; Artificial intelligence; Mathematics; Geometry","score_opus":0.022267474842993674,"score_gpt":0.24346801506990604,"score_spread":0.22120054022691235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578792929","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.010752548,0.0015529505,0.8767301,0.0034342438,0.0017192808,0.0005220757,0.0028691692,0.028082447,0.07433714],"genre_scores_gemma":[0.21168649,0.001796917,0.7049178,0.0020093466,0.00073322875,0.00036538747,0.003629559,0.012033692,0.06282755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718094,0.0006980873,0.00019564726,0.0006363484,0.00089234795,0.00039657264],"domain_scores_gemma":[0.9900866,0.0035418067,0.00036733778,0.0048315288,0.0010170606,0.00015572977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002863141,0.0017657671,0.0014341255,0.001235183,0.0013579517,0.0033398725,0.0041631986,0.0019668776,0.06486081],"category_scores_gemma":[0.010491254,0.0016308818,0.0023162751,0.002270768,0.0019906075,0.011420207,0.0036388503,0.0043091155,0.013481835],"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.00093279115,0.00034838796,0.0011304306,0.0023051007,0.00019389443,0.0002395904,0.00022192665,0.035560474,0.010235123,0.27669325,0.11660733,0.5555318],"study_design_scores_gemma":[0.00031937534,0.00013223285,0.0006152775,0.00025300233,0.00037809965,0.0006526366,0.00014048863,0.11647085,0.038666353,0.76161236,0.08060396,0.00015548406],"about_ca_topic_score_codex":0.004989698,"about_ca_topic_score_gemma":0.007244411,"teacher_disagreement_score":0.06486081,"about_ca_system_score_codex":0.0012466434,"about_ca_system_score_gemma":0.0026356822,"threshold_uncertainty_score":0.21698105},"labels":[],"label_agreement":null},{"id":"W1581922034","doi":"10.1007/978-3-642-04238-6_30","title":"A General Approach to the Verification of Cryptographic Protocols Using Answer Set Programming","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Programming language; Executable; Protocol (science); Cryptographic protocol; Compiler; Theoretical computer science; Set (abstract data type); Modular design; Cryptography; Logic programming; Answer set programming; Algorithm","score_opus":0.043648287231606804,"score_gpt":0.28828919690571825,"score_spread":0.24464090967411145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581922034","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.0008638671,0.0001909484,0.99332654,0.0005385678,0.00008522176,0.00019340978,0.00008667542,0.0006873209,0.004027431],"genre_scores_gemma":[0.058497537,0.0008777577,0.929908,0.000869186,0.00042824086,0.0006851363,0.000583962,0.00039559527,0.0077545363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880619,0.0030187252,0.0011152935,0.0019142563,0.0048513846,0.0010384035],"domain_scores_gemma":[0.9924406,0.0043320167,0.0002499396,0.002056091,0.00073691196,0.00018438953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008492078,0.0024659648,0.0030212454,0.003506875,0.0027669535,0.007867151,0.010547552,0.00535614,0.012199056],"category_scores_gemma":[0.012983713,0.002175936,0.009252198,0.0037522395,0.008666939,0.014525582,0.009901915,0.011351007,0.0034999528],"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.000055892986,0.00008439129,0.00009849326,0.00033539438,0.00008879399,0.00010635127,0.00027024615,0.014139712,0.0019485865,0.94449097,0.0027558338,0.035625257],"study_design_scores_gemma":[0.000043728687,0.000032419386,0.000044055523,0.00006435773,0.000073959105,0.000080069665,0.000035355675,0.05373698,0.0023262636,0.9326965,0.0108357305,0.000030491177],"about_ca_topic_score_codex":0.0019447644,"about_ca_topic_score_gemma":0.0019532915,"teacher_disagreement_score":0.012199056,"about_ca_system_score_codex":0.0029237666,"about_ca_system_score_gemma":0.003575794,"threshold_uncertainty_score":0.044910967},"labels":[],"label_agreement":null},{"id":"W1583108239","doi":"10.1007/11562931_18","title":"Reducing Inductive Definitions to Propositional Satisfiability","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Propositional calculus; Satisfiability; Answer set programming; Reduction (mathematics); Programming language; Theoretical computer science; Well-formed formula; Semantics (computer science); Boolean satisfiability problem; Logic programming; Extension (predicate logic); Inductive logic programming; Class (philosophy); Knowledge representation and reasoning; Intermediate logic; Propositional variable; Mathematics; Description logic; Artificial intelligence","score_opus":0.029715358049574044,"score_gpt":0.2555019588503248,"score_spread":0.22578660080075075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583108239","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.015553373,0.0015525497,0.91495115,0.0037032997,0.0007176394,0.000120547076,0.000267698,0.0010010352,0.06213274],"genre_scores_gemma":[0.3606683,0.0034959917,0.5941016,0.0029473559,0.0017721158,0.0006177905,0.0021325168,0.0016437955,0.032620545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946727,0.0022590805,0.00036367442,0.0005644161,0.0016046222,0.00053543824],"domain_scores_gemma":[0.98498267,0.011577663,0.00033885278,0.0015412502,0.001341589,0.00021786494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00408326,0.001039321,0.0011503401,0.002484124,0.0019933034,0.0050182324,0.0055033625,0.0017329702,0.009748966],"category_scores_gemma":[0.022498136,0.0017918719,0.0030854484,0.0030750379,0.0067621437,0.012698215,0.010358459,0.01191372,0.002245436],"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.00002579143,0.000054984313,0.00015743365,0.00014951832,0.00002223142,0.000109748566,0.0006949204,0.0022164767,0.0005075961,0.9599374,0.0063965186,0.029727474],"study_design_scores_gemma":[0.0000119387105,0.0000065201234,0.00005207945,0.00003833526,0.000018190352,0.000046797737,0.00014265325,0.005450592,0.0008387772,0.9835687,0.009815329,0.000010002219],"about_ca_topic_score_codex":0.0020207951,"about_ca_topic_score_gemma":0.0025453654,"teacher_disagreement_score":0.009748966,"about_ca_system_score_codex":0.0027174475,"about_ca_system_score_gemma":0.0013826558,"threshold_uncertainty_score":0.032613516},"labels":[],"label_agreement":null},{"id":"W1588067599","doi":"10.22329/il.v22i1.2571","title":"Are Some Modus Ponens Arguments Deductively Invalid?","year":2001,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Modus ponens; Defeasible estate; Epistemology; Mathematics; Philosophy; Calculus (dental); Inference; Medicine","score_opus":0.03863751782486054,"score_gpt":0.2567885819345742,"score_spread":0.2181510641097137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588067599","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.13897392,0.009941214,0.1711183,0.2861624,0.004233813,0.00025300897,0.0009863945,0.00096185534,0.3873691],"genre_scores_gemma":[0.9233884,0.0033188032,0.030627321,0.025655583,0.0028852501,0.00019477471,0.0006361143,0.00044992458,0.012843876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97920734,0.009111729,0.0013867782,0.0029617376,0.005924936,0.0014075056],"domain_scores_gemma":[0.9194573,0.05777,0.0073706666,0.008255657,0.006202573,0.00094370166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020720543,0.0011324497,0.0021163588,0.0034604394,0.0064400123,0.009998696,0.005088542,0.010169619,0.009847573],"category_scores_gemma":[0.09634676,0.0014005676,0.002841676,0.0030799415,0.022713216,0.01991488,0.0057122465,0.011505773,0.00301962],"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.00013665015,0.00005877435,0.0014559566,0.00028561938,0.00018929504,0.0008922129,0.002851964,0.0005314637,0.00027482235,0.9689191,0.0073144007,0.017089661],"study_design_scores_gemma":[0.000051483144,0.000013276841,0.00039466852,0.00011304316,0.000042001044,0.00033164767,0.0005045707,0.0009922544,0.0006361899,0.97448015,0.02242172,0.000018931338],"about_ca_topic_score_codex":0.00094529346,"about_ca_topic_score_gemma":0.0009106541,"teacher_disagreement_score":0.020720543,"about_ca_system_score_codex":0.0032236944,"about_ca_system_score_gemma":0.0020106635,"threshold_uncertainty_score":0.10958201},"labels":[],"label_agreement":null},{"id":"W1589528070","doi":"10.1023/a:1020116927466","title":"SLT-Resolution for the Well-Founded Semantics","year":2002,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Prolog; Computer science; Resolution (logic); Computation; Semantics (computer science); Programming language; Algorithm; Extension (predicate logic); Theoretical computer science","score_opus":0.023214735034764365,"score_gpt":0.2570563489167325,"score_spread":0.23384161388196814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589528070","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.0066939997,0.0012655886,0.9550756,0.003521285,0.0005648657,0.00010014107,0.00037753457,0.0012827829,0.031118175],"genre_scores_gemma":[0.31456134,0.0018000033,0.6508754,0.0019519527,0.0011434656,0.00030187648,0.0017671325,0.0009504058,0.026648477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99341476,0.0023776342,0.0007289262,0.0010892571,0.0018240074,0.0005654956],"domain_scores_gemma":[0.99166554,0.004604621,0.00030986188,0.0016874115,0.0014141895,0.00031837568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072915275,0.00094595744,0.0017210082,0.0029410277,0.0028367701,0.006643513,0.003368,0.0031449029,0.017356688],"category_scores_gemma":[0.016492806,0.0011498086,0.0044002193,0.0030324245,0.0044393274,0.020817118,0.0072027636,0.008047134,0.003614385],"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.00006380359,0.00004163392,0.00013695416,0.00014443904,0.000055987868,0.000110952875,0.00022836831,0.0027942418,0.000566291,0.96124804,0.005212476,0.029396769],"study_design_scores_gemma":[0.000018405328,0.000007642818,0.000027966105,0.000024857185,0.000031445717,0.00006634521,0.000048466707,0.010714915,0.00087354466,0.9820957,0.0060763927,0.0000143101815],"about_ca_topic_score_codex":0.0020840971,"about_ca_topic_score_gemma":0.0028835738,"teacher_disagreement_score":0.017356688,"about_ca_system_score_codex":0.0022995642,"about_ca_system_score_gemma":0.0027161387,"threshold_uncertainty_score":0.058063924},"labels":[],"label_agreement":null},{"id":"W1590016351","doi":"","title":"Bounded Situation Calculus Action Theories and Decidable Verification.","year":2012,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":53,"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","funders":"","keywords":"Decidability; Bounded function; Situation calculus; Action theory (sociology); Action (physics); Class (philosophy); Domain (mathematical analysis); Mathematics; Set (abstract data type); Computer science; Calculus (dental); Discrete mathematics; Algebra over a field; Pure mathematics; Epistemology; Artificial intelligence","score_opus":0.05868037768211146,"score_gpt":0.3142990142891721,"score_spread":0.25561863660706063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590016351","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.008379589,0.0019664501,0.94723016,0.0030483466,0.00029051738,0.00015485985,0.00029752878,0.0009775253,0.037654966],"genre_scores_gemma":[0.4976623,0.0021983543,0.48419076,0.0015016034,0.0006187216,0.0007501537,0.0009322525,0.0003007516,0.011845065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949602,0.001833293,0.00036248504,0.0007054257,0.0015300231,0.000608613],"domain_scores_gemma":[0.99040765,0.0066051194,0.00069445797,0.0013600122,0.00058819406,0.00034462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055699777,0.0011820039,0.000853303,0.0018468994,0.0021800261,0.0040476085,0.0034319807,0.0020520994,0.0061387],"category_scores_gemma":[0.0145203015,0.0009975677,0.0031716921,0.001742827,0.00941399,0.011289783,0.004236173,0.005522926,0.0011414721],"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.000013646112,0.0000130661665,0.000076633834,0.000049807037,0.000011349668,0.00012708765,0.00022204299,0.0026101563,0.00020737559,0.9911144,0.0007946578,0.0047595785],"study_design_scores_gemma":[0.00001404381,0.000006658767,0.00003602828,0.000025814215,0.00001216115,0.000058309535,0.00003853999,0.010240702,0.00046535546,0.98419845,0.0048950445,0.000008905344],"about_ca_topic_score_codex":0.0054370207,"about_ca_topic_score_gemma":0.0035112214,"teacher_disagreement_score":0.0061387,"about_ca_system_score_codex":0.0037980478,"about_ca_system_score_gemma":0.0031398972,"threshold_uncertainty_score":0.029457211},"labels":[],"label_agreement":null},{"id":"W1590508207","doi":"10.22329/il.v23i1.2154","title":"A Dialectical Tier Within Reason","year":2004,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rationality; Dialectic; Epistemology; Core (optical fiber); Product (mathematics); Ecological rationality; Sociology; Philosophy; Computer science; Mathematics","score_opus":0.017520099801488904,"score_gpt":0.24203986795852422,"score_spread":0.2245197681570353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590508207","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.04112519,0.0036008384,0.65687686,0.014314171,0.000313171,0.00010581337,0.00016006854,0.000572408,0.28293145],"genre_scores_gemma":[0.91609794,0.000842789,0.06624364,0.0014155802,0.00015724663,0.00014438792,0.00010201317,0.00018396937,0.014812414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99429613,0.002473475,0.00030906792,0.0009005793,0.0014681008,0.0005525473],"domain_scores_gemma":[0.99563366,0.0020397105,0.00023016188,0.0012502789,0.0005101271,0.0003360625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006121916,0.00051059603,0.0007665929,0.0017568733,0.0023702902,0.010275141,0.0010569149,0.002581875,0.0036659422],"category_scores_gemma":[0.0050312444,0.0005856356,0.0011349942,0.0014063783,0.023745602,0.017214326,0.0056460965,0.0044684093,0.0010135],"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.0000042734696,0.0000021289718,0.00006639252,0.0000065813833,0.0000023787868,0.0000059357735,0.00048034536,0.00016188288,0.00007933416,0.99810815,0.0001246813,0.0009578853],"study_design_scores_gemma":[0.0000049230252,0.0000049575788,0.00006622345,0.000013450482,0.000004244504,0.000019685998,0.00018046713,0.00083220063,0.00014750187,0.9898655,0.008856483,0.000004469421],"about_ca_topic_score_codex":0.0029335204,"about_ca_topic_score_gemma":0.0025951096,"teacher_disagreement_score":0.010275141,"about_ca_system_score_codex":0.006218581,"about_ca_system_score_gemma":0.0044031804,"threshold_uncertainty_score":0.045119166},"labels":[],"label_agreement":null},{"id":"W1591526886","doi":"10.1145/2499937.2499942","title":"Extensional Higher-Order Logic Programming","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","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":"University of Victoria","funders":"European Social Fund","keywords":"Stable model semantics; Extensional definition; Logic programming; Mathematics; Semantics (computer science); Tuple; Well-founded semantics; Higher-order logic; Programming language; Operator (biology); Resolution (logic); First-order logic; Algorithm; Computer science; Algebra over a field; Discrete mathematics; Theoretical computer science; Operational semantics; Denotational semantics; Description logic; Pure mathematics","score_opus":0.03172090831785155,"score_gpt":0.2671615229607867,"score_spread":0.23544061464293517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591526886","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.008124014,0.0003911356,0.9773008,0.0008235613,0.00011608123,0.00007668747,0.0001408054,0.00039118392,0.012635643],"genre_scores_gemma":[0.32491308,0.0006463734,0.6635606,0.00070343725,0.00030600568,0.00020172601,0.00034312985,0.00012690974,0.009198715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732333,0.0009055228,0.00022456725,0.0004350783,0.0009138098,0.00019771759],"domain_scores_gemma":[0.9980367,0.0008338887,0.00015356755,0.00050001533,0.00034589166,0.00012994747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003933516,0.0007212754,0.00062738475,0.0014049133,0.00086288323,0.0031863826,0.0026837436,0.00081934663,0.0046333913],"category_scores_gemma":[0.0032352682,0.00042320704,0.0018407694,0.0013112675,0.0029774706,0.006940446,0.0034914732,0.0028902132,0.0006777627],"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.0000140507545,0.00003394812,0.00010510154,0.00007487217,0.000013723894,0.000084572115,0.00016232311,0.0027582285,0.0008053364,0.9809622,0.0005704876,0.014415221],"study_design_scores_gemma":[0.000026143363,0.00003305562,0.00009205905,0.000031104126,0.000020497413,0.00018599987,0.000055449684,0.025738437,0.0013638091,0.95624274,0.01619409,0.000016539676],"about_ca_topic_score_codex":0.0005341259,"about_ca_topic_score_gemma":0.0010216224,"teacher_disagreement_score":0.0046333913,"about_ca_system_score_codex":0.0013530679,"about_ca_system_score_gemma":0.0011591486,"threshold_uncertainty_score":0.020802677},"labels":[],"label_agreement":null},{"id":"W1591780081","doi":"10.2178/bsl/1182353933","title":"Solomon Feferman. <i>Computation on abstract data types. The extensional approach, with an application to streams</i>. <b>Annals of pure and applied logic</b>, vol. 81 (1996), pp. 75–113.","year":2002,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","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":"McMaster University","funders":"","keywords":"Annals; Extensional definition; STREAMS; Computer science; Computation; Mathematics; Discrete mathematics; Arithmetic; Algorithm; Classics; Biology; History; Computer network","score_opus":0.05652480084469567,"score_gpt":0.2702466826500361,"score_spread":0.21372188180534044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591780081","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059064655,0.3106797,0.48561132,0.05062622,0.007679255,0.00015375855,0.0018269599,0.003725156,0.13379118],"genre_scores_gemma":[0.23041563,0.27534267,0.3314021,0.013798552,0.013420593,0.0007181727,0.0031583349,0.0028242553,0.12891974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881685,0.0002554689,0.00013335061,0.000281786,0.00040643063,0.00010624867],"domain_scores_gemma":[0.99661887,0.0023057484,0.00015317356,0.00040342336,0.00040239334,0.00011643032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022983765,0.0016948389,0.0014649553,0.0049268403,0.0023956753,0.0027382947,0.002439646,0.0032208473,0.024304554],"category_scores_gemma":[0.008099577,0.0017210706,0.0016945604,0.007187187,0.0046571055,0.02097151,0.002577429,0.0038560668,0.0098544005],"study_design_candidate":"not_applicable","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.00012087221,0.000046412955,0.00034826985,0.00059040723,0.000057004585,0.00027000514,0.00051722635,0.0017725854,0.00045270208,0.61985636,0.2411115,0.13485657],"study_design_scores_gemma":[0.000030089333,0.000014049214,0.00026131884,0.00023152868,0.000032086948,0.00017462857,0.00006611682,0.002135173,0.0008786644,0.8622603,0.13387294,0.00004309683],"about_ca_topic_score_codex":0.0069450545,"about_ca_topic_score_gemma":0.0062653315,"teacher_disagreement_score":0.024304554,"about_ca_system_score_codex":0.0031593945,"about_ca_system_score_gemma":0.0009795864,"threshold_uncertainty_score":0.081306756},"labels":[],"label_agreement":null},{"id":"W1596277605","doi":"10.1007/978-3-540-30227-8_36","title":"Two Approaches to Merging Knowledge Bases","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Merge (version control); Computer science; Knowledge base; Consistency (knowledge bases); Logical consequence; Operator (biology); Theoretical computer science; Algorithm; Artificial intelligence; Information retrieval","score_opus":0.05988864282738988,"score_gpt":0.26055056243839625,"score_spread":0.20066191961100638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596277605","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.0030547916,0.0012968787,0.9851665,0.0009992548,0.00018985085,0.00038205128,0.00033340335,0.0021457598,0.0064315484],"genre_scores_gemma":[0.020317664,0.0006783711,0.9720088,0.00032400535,0.000104963365,0.00024943604,0.0010557375,0.00044067667,0.00482047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98846775,0.0031283582,0.0012462656,0.0018982016,0.0044917814,0.0007676614],"domain_scores_gemma":[0.97259575,0.010431552,0.0009429943,0.010264088,0.0049579954,0.0008076041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01088605,0.0016876566,0.0022571965,0.010202917,0.0031012811,0.012674899,0.010058145,0.0049569667,0.015429101],"category_scores_gemma":[0.04459657,0.0033407947,0.003906404,0.012328729,0.0047031823,0.023977922,0.016805569,0.006236452,0.0043215496],"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.00037041504,0.00031501212,0.0009777517,0.00089605787,0.00032279376,0.00034632915,0.003660029,0.0061374996,0.0046795453,0.30935115,0.01575737,0.65718603],"study_design_scores_gemma":[0.0002661565,0.0002462231,0.0012407801,0.00071577664,0.0009732482,0.0014287402,0.0019907537,0.09337257,0.025150917,0.71052593,0.1638117,0.0002771615],"about_ca_topic_score_codex":0.0054305634,"about_ca_topic_score_gemma":0.011951269,"teacher_disagreement_score":0.015429101,"about_ca_system_score_codex":0.0018939009,"about_ca_system_score_gemma":0.0035931908,"threshold_uncertainty_score":0.05757159},"labels":[],"label_agreement":null},{"id":"W1599133695","doi":"10.1007/3-540-40006-0_26","title":"A Compilation of Brewka and Eiter’s Approach to Prioritization","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Logic programming; Encoding (memory); Logic program; Programming language; Circumscription; Prioritization; Prolog; Theoretical computer science; Software engineering; Artificial intelligence","score_opus":0.01558282523001391,"score_gpt":0.23094744911761309,"score_spread":0.21536462388759917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599133695","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.0019303237,0.00076175266,0.94867647,0.00091918086,0.00080005,0.00018608647,0.0003016791,0.0024227782,0.04400165],"genre_scores_gemma":[0.04215841,0.0016625549,0.91775143,0.00090466137,0.00054293324,0.00027661564,0.0006259681,0.00233725,0.033740174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970402,0.0005370225,0.00023684363,0.00058087404,0.0013313203,0.00027364385],"domain_scores_gemma":[0.9970516,0.0007715664,0.000065625994,0.001094376,0.00089355855,0.00012320704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023248729,0.0013083584,0.0015225245,0.0034348934,0.0017202123,0.0037329297,0.0036219505,0.0010438134,0.020934705],"category_scores_gemma":[0.008629198,0.0013341366,0.0026930727,0.004538093,0.0025558067,0.006232523,0.004728652,0.004203158,0.0073939404],"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.00007725431,0.00020277967,0.0002730461,0.00037214675,0.00010441659,0.00023905707,0.0009294353,0.0087548,0.0027070728,0.6712152,0.030215433,0.2849095],"study_design_scores_gemma":[0.00005154122,0.00003854601,0.0003397448,0.00015721186,0.00013969225,0.00036703615,0.00019090224,0.027756719,0.0032269396,0.7539348,0.21370545,0.0000913844],"about_ca_topic_score_codex":0.010403502,"about_ca_topic_score_gemma":0.012825644,"teacher_disagreement_score":0.020934705,"about_ca_system_score_codex":0.0022787948,"about_ca_system_score_gemma":0.0031634083,"threshold_uncertainty_score":0.07003355},"labels":[],"label_agreement":null},{"id":"W1602008100","doi":"10.1007/11564751_27","title":"2 -Way vs.d -Way Branching for CSP","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backtracking; Branching (polymer chemistry); Mathematics; Exponential function; Search tree; Tree (set theory); Branching process; Computer science; Combinatorics; Algorithm; Discrete mathematics; Search algorithm; Chemistry","score_opus":0.017049597193305812,"score_gpt":0.24662395629981837,"score_spread":0.22957435910651255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602008100","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.022364495,0.0043449877,0.9073576,0.0022699789,0.00030912246,0.00011239213,0.00051702996,0.002278117,0.06044629],"genre_scores_gemma":[0.51386034,0.0043748384,0.45627275,0.0009496054,0.00051297987,0.00027967195,0.00092604646,0.0013077749,0.021515984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983688,0.0005438251,0.00015726776,0.00028575864,0.00037324656,0.0002711687],"domain_scores_gemma":[0.9963446,0.0023521928,0.00016564039,0.0007842403,0.00014174232,0.00021150483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021126703,0.00086939015,0.0009477869,0.0010118166,0.0011069999,0.0040721213,0.0015284088,0.002203218,0.014954305],"category_scores_gemma":[0.0045470507,0.0007548383,0.0014575036,0.0028173313,0.0028172627,0.009579936,0.0028247973,0.004158366,0.0029039308],"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.0002475251,0.00004037955,0.0002469093,0.00023259397,0.000013984573,0.000070618284,0.00026845545,0.01000142,0.002164082,0.9034062,0.004392568,0.07891526],"study_design_scores_gemma":[0.00004411557,0.00003279742,0.00009602208,0.00004180632,0.000016692837,0.0001102281,0.000040684874,0.026961448,0.0013352073,0.96214044,0.009159188,0.000021354554],"about_ca_topic_score_codex":0.0019825688,"about_ca_topic_score_gemma":0.0026500786,"teacher_disagreement_score":0.014954305,"about_ca_system_score_codex":0.0014799132,"about_ca_system_score_gemma":0.0012641299,"threshold_uncertainty_score":0.050027132},"labels":[],"label_agreement":null},{"id":"W1603082394","doi":"10.1007/3-540-45628-7_1","title":"A Portrait of a Scientist as a Computational Logician","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Portrait; Cognitive science; Computer science; Epistemology; Artificial intelligence; Psychology; Philosophy; Art history; Art","score_opus":0.018014468622178856,"score_gpt":0.24421494223212478,"score_spread":0.22620047360994594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603082394","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.0047478573,0.014509292,0.048467945,0.109449536,0.0022952217,0.000051819254,0.00019389394,0.00021836997,0.82006603],"genre_scores_gemma":[0.54484874,0.022968361,0.058448114,0.044763386,0.0069596614,0.00047073644,0.00030904595,0.0010091454,0.32022285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802303,0.0010784548,0.000054612396,0.0002959284,0.00040749882,0.00014050533],"domain_scores_gemma":[0.99779797,0.0013146793,0.00010283104,0.000239346,0.0002917343,0.00025342422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765566,0.00063113635,0.00052247825,0.0026570219,0.0056780674,0.0107207345,0.0016740598,0.004820858,0.009436098],"category_scores_gemma":[0.004130328,0.000501734,0.0005159122,0.0019666306,0.02835359,0.01649605,0.0030275183,0.009906876,0.0030498842],"study_design_candidate":"not_applicable","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.0000042566053,0.0000037907087,0.000029228604,0.000011702324,0.0000011900486,0.000019015026,0.0016058619,0.00007346879,0.000031606884,0.991384,0.005095596,0.0017402773],"study_design_scores_gemma":[0.000007738468,0.00000635267,0.000048042162,0.000036594556,0.0000021164835,0.000056028257,0.0007410062,0.00027791364,0.000041698935,0.8185142,0.18026255,0.0000057072293],"about_ca_topic_score_codex":0.0034460612,"about_ca_topic_score_gemma":0.0045454274,"teacher_disagreement_score":0.0107207345,"about_ca_system_score_codex":0.0032987485,"about_ca_system_score_gemma":0.00317317,"threshold_uncertainty_score":0.031566918},"labels":[],"label_agreement":null},{"id":"W1603421361","doi":"10.1007/978-3-642-16242-8_43","title":"PBINT, A Logic for Modelling Search Problems Involving Arithmetic","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Arithmetic function; Computer science; Disjoint sets; Presburger arithmetic; Binary number; Theoretical computer science; Constraint (computer-aided design); Arithmetic; Algorithm; Mathematics; Discrete mathematics; Decidability","score_opus":0.04708642937666076,"score_gpt":0.2631873979677397,"score_spread":0.21610096859107897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603421361","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.003209996,0.0011577313,0.9585852,0.0009401478,0.0002576732,0.00015407312,0.0011614902,0.0021361832,0.03239751],"genre_scores_gemma":[0.1595352,0.0027684753,0.7922582,0.0013670591,0.00045875585,0.00072770397,0.003033216,0.0009342193,0.038917147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990305,0.00023460729,0.00010660911,0.00019905697,0.00031788016,0.00011142034],"domain_scores_gemma":[0.9992607,0.0003648058,0.000065771776,0.00013800991,0.00011078256,0.000059918446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011512784,0.0012867956,0.0007388266,0.0016914329,0.0014755445,0.0050968025,0.0031775893,0.0015912107,0.01156458],"category_scores_gemma":[0.0044540255,0.0009811013,0.0018540166,0.002302579,0.0027037517,0.010631797,0.0029861531,0.004136621,0.0026271683],"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.00007111083,0.0000247018,0.00021862189,0.00030087042,0.000019019639,0.00015097525,0.00023525629,0.0065452075,0.0010959994,0.93638325,0.009079186,0.04587581],"study_design_scores_gemma":[0.000026552934,0.000022253445,0.0001019936,0.00007841472,0.00003913386,0.00023786296,0.00008810378,0.03079154,0.0014728506,0.902926,0.06419115,0.000024083338],"about_ca_topic_score_codex":0.0044885804,"about_ca_topic_score_gemma":0.0060711685,"teacher_disagreement_score":0.01156458,"about_ca_system_score_codex":0.00166264,"about_ca_system_score_gemma":0.0016974153,"threshold_uncertainty_score":0.038687408},"labels":[],"label_agreement":null},{"id":"W1604488814","doi":"","title":"Iterated belief contraction from first principles","year":2007,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Iterated function; Contraction (grammar); Lexicographical order; Belief revision; Mathematics; Contraction mapping; Computer science; Mathematical economics; Algorithm; Discrete mathematics; Artificial intelligence; Combinatorics; Philosophy","score_opus":0.021307769534350582,"score_gpt":0.24000432636020153,"score_spread":0.21869655682585093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604488814","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.047755633,0.0012110514,0.84512734,0.008004992,0.0002609493,0.00019105886,0.0001159996,0.0003003528,0.09703265],"genre_scores_gemma":[0.84205276,0.0005762584,0.14441232,0.0011681085,0.00038248807,0.0005275359,0.000104693245,0.00016129823,0.010614542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99128073,0.0040186686,0.0004084529,0.0012933748,0.0023595453,0.00063938345],"domain_scores_gemma":[0.9849508,0.009057226,0.0008340251,0.0027375936,0.0019333869,0.00048709792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008756023,0.00055269094,0.0008983082,0.0011398102,0.0017137807,0.0036548856,0.0014191105,0.00204064,0.0044096066],"category_scores_gemma":[0.021419805,0.0005053337,0.0020097757,0.0006314116,0.009297592,0.007413786,0.0042855255,0.0050165565,0.00058983784],"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.000009720767,0.0000074770055,0.00008561698,0.000028820394,0.000010177041,0.000040163093,0.00032113152,0.0014819645,0.00020731358,0.9932996,0.00033368872,0.0041742926],"study_design_scores_gemma":[0.000012212965,0.0000142521885,0.000062926134,0.000013768279,0.000004958808,0.00003968005,0.000043327393,0.0063247653,0.0001660991,0.99092126,0.0023897237,0.0000069890125],"about_ca_topic_score_codex":0.0010596133,"about_ca_topic_score_gemma":0.00072631275,"teacher_disagreement_score":0.008756023,"about_ca_system_score_codex":0.0025726242,"about_ca_system_score_gemma":0.0018512732,"threshold_uncertainty_score":0.04630685},"labels":[],"label_agreement":null},{"id":"W1604736485","doi":"10.1002/9781119960027.ch3","title":"When OCD Begins","year":2011,"lang":"en","type":"other","venue":"","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":"Institut universitaire en santé mentale de Montréal","funders":"","keywords":"Focus (optics); Epistemology; Psychology; Reasonable doubt; Philosophy; Law; Political science; Physics","score_opus":0.022686039283133213,"score_gpt":0.22265327647562747,"score_spread":0.19996723719249426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604736485","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.05718009,0.021409396,0.0028875326,0.13465711,0.013147994,0.00031460187,0.0014477082,0.0005873625,0.76836824],"genre_scores_gemma":[0.52313226,0.018416896,0.0036083315,0.078163795,0.0036247799,0.0004056223,0.0016965726,0.0007940999,0.3701576],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977416,0.00022369852,0.00010147669,0.00014804391,0.0007937062,0.000991597],"domain_scores_gemma":[0.9968669,0.0006394295,0.0002115025,0.00011517718,0.0010838283,0.0010831442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866608,0.00039324592,0.0005627638,0.0015923837,0.0046013747,0.0065329676,0.000755681,0.002753809,0.053797886],"category_scores_gemma":[0.008559528,0.00034155074,0.0006202325,0.00092146033,0.0028772329,0.0058729225,0.0043775435,0.006667734,0.0077611604],"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.00018923922,0.00024116338,0.018211948,0.0003695924,0.000026621106,0.010101333,0.03717975,0.000053798325,0.00090026576,0.124788016,0.5635561,0.24438214],"study_design_scores_gemma":[0.00003734745,0.000057203673,0.0166841,0.0018405209,0.000026573576,0.008002687,0.07509077,0.000051042265,0.0006200911,0.04407915,0.85342395,0.0000866179],"about_ca_topic_score_codex":0.024491033,"about_ca_topic_score_gemma":0.038501903,"teacher_disagreement_score":0.053797886,"about_ca_system_score_codex":0.0050766063,"about_ca_system_score_gemma":0.0069464194,"threshold_uncertainty_score":0.17997187},"labels":[],"label_agreement":null},{"id":"W1604784155","doi":"10.1007/978-3-540-27775-0_28","title":"Adding Domain Dependent Knowledge into Answer Set Programs for Planning","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Domain knowledge; Benchmark (surveying); Coding (social sciences); Set (abstract data type); Scheme (mathematics); Class (philosophy); Answer set programming; Artificial intelligence; Theoretical computer science; Programming language; Mathematics","score_opus":0.028130201251539526,"score_gpt":0.28244283631865824,"score_spread":0.2543126350671187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604784155","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.0063483054,0.0001635859,0.9844248,0.0003254886,0.000043298758,0.00009664333,0.00015058472,0.0026422255,0.0058050905],"genre_scores_gemma":[0.1479455,0.0003209492,0.8443224,0.00028412338,0.00006413997,0.00024559943,0.00074636133,0.0006358092,0.005435153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852955,0.00044428775,0.00012486058,0.0002211197,0.00055878103,0.0001214388],"domain_scores_gemma":[0.99661475,0.0025981886,0.00009879341,0.00042557006,0.00019928784,0.00006339926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021222045,0.00078669714,0.00063539227,0.0010220595,0.00069677725,0.0016261627,0.0027496323,0.0014996814,0.006431048],"category_scores_gemma":[0.007229471,0.0010690353,0.0016259406,0.0011139474,0.0018499531,0.0047291433,0.0034317672,0.0041027553,0.001365727],"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.00035524013,0.00034437983,0.000931902,0.00077865476,0.00015827722,0.00033796733,0.0015489137,0.15006644,0.010375047,0.34121186,0.012034464,0.48185688],"study_design_scores_gemma":[0.00006880211,0.00009248205,0.0002247465,0.00014444355,0.00015274216,0.00009968748,0.00011847307,0.4268799,0.015690595,0.53403574,0.02244774,0.00004462375],"about_ca_topic_score_codex":0.0021534704,"about_ca_topic_score_gemma":0.0051384433,"teacher_disagreement_score":0.006431048,"about_ca_system_score_codex":0.0009195681,"about_ca_system_score_gemma":0.0007483927,"threshold_uncertainty_score":0.021513999},"labels":[],"label_agreement":null},{"id":"W1605983610","doi":"","title":"Theorem proving in higher order logics : 21st international conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008, proceedings","year":2008,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"HOL; Automated theorem proving; Computer science; Proof assistant; Programming language; Automated proof checking; Mathematical proof; Soundness; Theoretical computer science; Calculus (dental); Discrete mathematics; Mathematics","score_opus":0.030249421834490267,"score_gpt":0.22445650253607688,"score_spread":0.1942070807015866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605983610","genre_codex":"methods","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.011017086,0.116365165,0.7144484,0.018712187,0.008138785,0.00036849495,0.0032315583,0.01578555,0.111932784],"genre_scores_gemma":[0.077136196,0.09928994,0.5215978,0.002917191,0.004519014,0.00038050048,0.013737221,0.004978003,0.27544412],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980755,0.00034864835,0.00011259546,0.00032249987,0.0009673627,0.0001735031],"domain_scores_gemma":[0.99552804,0.0020893165,0.00012306255,0.0006569206,0.0012982367,0.00030441282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056073,0.0011860032,0.0015912357,0.0019145792,0.001402871,0.007234767,0.0029901962,0.00093293196,0.040488217],"category_scores_gemma":[0.00498006,0.001264802,0.0015006184,0.00415097,0.0030785862,0.0061297836,0.002080638,0.0029969653,0.0059597604],"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.00015648834,0.00016245682,0.0005436334,0.0007396193,0.00007373026,0.00011057252,0.000393349,0.004523169,0.002354402,0.08190124,0.478468,0.43057343],"study_design_scores_gemma":[0.00013303602,0.000082018436,0.0022752762,0.0008450029,0.00011099243,0.00041909638,0.00034137542,0.045851354,0.0053671617,0.15294382,0.7915587,0.00007218889],"about_ca_topic_score_codex":0.10292902,"about_ca_topic_score_gemma":0.10978478,"teacher_disagreement_score":0.10292902,"about_ca_system_score_codex":0.010814352,"about_ca_system_score_gemma":0.015180934,"threshold_uncertainty_score":0.20465982},"labels":[],"label_agreement":null},{"id":"W1607463045","doi":"10.22329/il.v25i1.1042","title":"Revisiting Deep Disagreement","year":2005,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Argument (complex analysis); Context (archaeology); Epistemology; Resolution (logic); Philosophy; Law and economics; Positive economics; Political science; Sociology; Economics; Computer science; History; Artificial intelligence; Archaeology","score_opus":0.016928815428571078,"score_gpt":0.24567812148776666,"score_spread":0.22874930605919558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607463045","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.06690376,0.008525915,0.3950745,0.07316737,0.0013701965,0.00013638592,0.00029030666,0.00028771773,0.45424387],"genre_scores_gemma":[0.94718355,0.0015536591,0.031628117,0.0047361474,0.0006310886,0.0001289589,0.00012497407,0.00014830258,0.013865221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9845195,0.009565313,0.0005724431,0.0015319298,0.0028111052,0.0009996985],"domain_scores_gemma":[0.9851643,0.009195639,0.0009451791,0.00264989,0.0015268426,0.0005181961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013103494,0.00070685137,0.0009045195,0.003056272,0.0053356783,0.011387995,0.0024867994,0.005335023,0.007015535],"category_scores_gemma":[0.021997543,0.0005112577,0.0013365542,0.0022374943,0.028991368,0.022206116,0.010123868,0.009155212,0.0011369728],"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.000005325304,0.000004458667,0.000076128665,0.000022777758,0.0000030811675,0.00003093919,0.0016155016,0.00015049517,0.000057501657,0.9952382,0.00048978126,0.0023057049],"study_design_scores_gemma":[0.000006237025,0.0000040467758,0.00005998852,0.000046640358,0.0000037787208,0.000022083448,0.0005213327,0.0005678291,0.000059004833,0.98357403,0.015130742,0.000004300423],"about_ca_topic_score_codex":0.0026052191,"about_ca_topic_score_gemma":0.002480937,"teacher_disagreement_score":0.013103494,"about_ca_system_score_codex":0.0069985446,"about_ca_system_score_gemma":0.0031554818,"threshold_uncertainty_score":0.069298744},"labels":[],"label_agreement":null},{"id":"W1608057897","doi":"","title":"Integrating Abstract State Machines and Interpreted Systems for Situation Analysis decision support design","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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":"Computer science; Executable; Traceability; Decision support system; Intelligent decision support system; Management science; Software engineering; Artificial intelligence; Programming language; Engineering","score_opus":0.03126501942797347,"score_gpt":0.27602991378563163,"score_spread":0.24476489435765816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608057897","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.0036513724,0.00014114227,0.9932041,0.0004296789,0.000032651875,0.00006579318,0.000016390059,0.00022209286,0.0022367737],"genre_scores_gemma":[0.17125206,0.00026731254,0.8267843,0.00017826547,0.00006255332,0.00041715856,0.00007404731,0.000060020837,0.0009043291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99287015,0.004499038,0.0006222968,0.00048542878,0.001333964,0.00018916403],"domain_scores_gemma":[0.99136716,0.0055787587,0.00069974543,0.0013309402,0.0007483034,0.0002750912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058720405,0.0008088602,0.000657009,0.0013215842,0.00066372834,0.004539608,0.0018695927,0.0012858637,0.0030841113],"category_scores_gemma":[0.012497329,0.0007520674,0.0013171906,0.0008574267,0.004646142,0.0062900004,0.003251468,0.0032271992,0.00046505255],"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.000055476004,0.00008025373,0.00046862933,0.00017253413,0.000062241845,0.00020504689,0.0010921536,0.063671894,0.0020561302,0.90130144,0.00060978055,0.030224469],"study_design_scores_gemma":[0.00004857121,0.00009360713,0.00015175501,0.0001861213,0.000053838237,0.000096392934,0.00024315734,0.32418075,0.002776318,0.6581809,0.013943926,0.000044661523],"about_ca_topic_score_codex":0.001439034,"about_ca_topic_score_gemma":0.001459738,"teacher_disagreement_score":0.0058720405,"about_ca_system_score_codex":0.0015839535,"about_ca_system_score_gemma":0.0020978604,"threshold_uncertainty_score":0.031054676},"labels":[],"label_agreement":null},{"id":"W1621236257","doi":"10.1007/978-3-7908-1769-0_16","title":"Two Values, Three Values, Many Values, No Values","year":2003,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Logic, Reasoning, and Knowledge","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":"University of Victoria","funders":"","keywords":"Truth value; Probabilistic logic; Semantics (computer science); Extension (predicate logic); Formal semantics (linguistics); Computer science; Mathematics; Artificial intelligence; Theoretical computer science; Calculus (dental); Algebra over a field; Programming language; Pure mathematics","score_opus":0.045492910508149,"score_gpt":0.2958905929386955,"score_spread":0.2503976824305465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621236257","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.013505906,0.0057883295,0.35634822,0.010669867,0.0014959265,0.00009744809,0.00043630498,0.0007197426,0.6109382],"genre_scores_gemma":[0.5954176,0.005556556,0.18160002,0.0039463746,0.0006174672,0.00027365627,0.00064644683,0.0005718099,0.21137004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915695,0.00026409392,0.000060476174,0.00020519987,0.00023867727,0.00007452287],"domain_scores_gemma":[0.9991543,0.00043593295,0.00005261297,0.00012214395,0.00016792263,0.00006703022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012409379,0.0007029213,0.0004786772,0.0011043515,0.0016659208,0.004712088,0.0010262917,0.0013321165,0.007274214],"category_scores_gemma":[0.0026045179,0.00037330596,0.00072029105,0.0012095735,0.009949275,0.011188989,0.0014373433,0.002677413,0.001823749],"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.0000048659886,0.0000027939425,0.000029369829,0.000019869229,0.0000020582838,0.000013244889,0.0001954184,0.00009421246,0.00014916268,0.9912282,0.0022265515,0.0060342113],"study_design_scores_gemma":[0.000004608756,0.000008705831,0.00006643205,0.000043099186,0.0000056454905,0.00011534744,0.00016478806,0.00078393065,0.00034084966,0.92971385,0.06874407,0.000008678327],"about_ca_topic_score_codex":0.0016424694,"about_ca_topic_score_gemma":0.0019098823,"teacher_disagreement_score":0.007274214,"about_ca_system_score_codex":0.0023247015,"about_ca_system_score_gemma":0.0013613657,"threshold_uncertainty_score":0.02433467},"labels":[],"label_agreement":null},{"id":"W1625990916","doi":"10.2178/jsl.7803120","title":"Failure of Interpolation in Constant Domain Intuitionistic Logic","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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 Toronto","funders":"","keywords":"Interpolation (computer graphics); Constant (computer programming); Intuitionistic logic; Domain (mathematical analysis); Property (philosophy); Algebra over a field","score_opus":0.012990061448293426,"score_gpt":0.23976073363406117,"score_spread":0.22677067218576774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625990916","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.37801534,0.0016986224,0.50482255,0.010244429,0.0005858777,0.00010794593,0.0007226556,0.0025715786,0.101230934],"genre_scores_gemma":[0.981639,0.0002950155,0.015373753,0.00044216993,0.00012009685,0.000027900898,0.00014695669,0.00008513154,0.0018700088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918441,0.0020242792,0.00066109083,0.0012144257,0.0029198367,0.0013362173],"domain_scores_gemma":[0.9720643,0.018569384,0.0012629913,0.004553371,0.0026277187,0.0009222212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009303541,0.00067880476,0.0016368383,0.002129745,0.0028876693,0.004604071,0.004080554,0.003000823,0.0050550844],"category_scores_gemma":[0.025001414,0.0009928845,0.002116229,0.002015483,0.012615852,0.015662672,0.0068029165,0.007232689,0.0007042432],"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.00025458937,0.000043826647,0.001219044,0.00020376456,0.000047220583,0.0004296624,0.0005399236,0.0055450364,0.0014649259,0.982633,0.0014628819,0.0061561326],"study_design_scores_gemma":[0.000045272205,0.000044933815,0.00027346177,0.000046924186,0.00003406269,0.00023908033,0.00017288631,0.016682643,0.0032382244,0.9759913,0.0031867558,0.00004440367],"about_ca_topic_score_codex":0.0028365918,"about_ca_topic_score_gemma":0.0013767823,"teacher_disagreement_score":0.009303541,"about_ca_system_score_codex":0.0029801994,"about_ca_system_score_gemma":0.002052698,"threshold_uncertainty_score":0.049202383},"labels":[],"label_agreement":null},{"id":"W162685467","doi":"","title":"From Foundations to Current Work in a One Quarter Course on Artificial Intelligence","year":2008,"lang":"en","type":"article","venue":"","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":"Course (navigation); Quarter (Canadian coin); Artificial intelligence; Computer science; Knowledge representation and reasoning; Work (physics); Cognitive science; Data science; Engineering; Psychology","score_opus":0.09823557903079075,"score_gpt":0.31735247581194165,"score_spread":0.2191168967811509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162685467","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.013216661,0.04852077,0.1090268,0.18804364,0.01690924,0.00015876986,0.00042491488,0.0007062177,0.62299293],"genre_scores_gemma":[0.42505583,0.076927476,0.10879733,0.033336375,0.020599026,0.00067862304,0.0017103727,0.0007551892,0.33213976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846613,0.00042203264,0.00009367669,0.00026566559,0.0004912433,0.00026134012],"domain_scores_gemma":[0.99755114,0.00091374136,0.00012170025,0.00018022773,0.00046714785,0.0007661151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030931896,0.0007273906,0.00059643394,0.0013155988,0.0021965024,0.008319,0.0015141857,0.0027575477,0.032646958],"category_scores_gemma":[0.005206359,0.0004950513,0.0006369244,0.001439823,0.0045815012,0.0083805565,0.00442911,0.005879508,0.01127675],"study_design_candidate":"not_applicable","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.000054683736,0.00014698438,0.00045038018,0.00024278482,0.000008369006,0.00008698991,0.00058633613,0.00081124937,0.0004978928,0.8034289,0.103035554,0.09064998],"study_design_scores_gemma":[0.000012509124,0.00005980075,0.00047712497,0.00070133124,0.0000066977204,0.00010088293,0.00040796903,0.0010873678,0.0003182101,0.6593899,0.33741993,0.000018225157],"about_ca_topic_score_codex":0.000864208,"about_ca_topic_score_gemma":0.0009063166,"teacher_disagreement_score":0.032646958,"about_ca_system_score_codex":0.004386758,"about_ca_system_score_gemma":0.0030280394,"threshold_uncertainty_score":0.10921496},"labels":[],"label_agreement":null},{"id":"W1642340034","doi":"10.3233/fun-2001-48404","title":"Non-Clausal Reasoning with Definite Theories","year":2001,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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","funders":"","keywords":"Calculus (dental); Mathematics; Computer science; Epistemology; Algebra over a field; Pure mathematics; Philosophy","score_opus":0.010190278672589034,"score_gpt":0.226365688647173,"score_spread":0.21617540997458395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642340034","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.008031219,0.0006510681,0.9816554,0.00070869917,0.00012250707,0.00009470387,0.00008412605,0.00060130865,0.008050908],"genre_scores_gemma":[0.24529944,0.0008084663,0.74602616,0.0005267721,0.00021927177,0.00015166885,0.0004460279,0.00013175936,0.006390514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941189,0.0020040665,0.00040073993,0.0007487457,0.0023592694,0.0003681628],"domain_scores_gemma":[0.9946267,0.0031860224,0.00035963036,0.00091589754,0.0007568264,0.00015490522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072431182,0.0009226481,0.0009270029,0.0021731404,0.0017567154,0.0034602913,0.00392075,0.0013548273,0.0044017257],"category_scores_gemma":[0.0097425515,0.0008177738,0.0022784532,0.001351214,0.0039827563,0.0073577277,0.0040400475,0.003310125,0.000839154],"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.000035064026,0.00004557511,0.00018570604,0.0001908318,0.000036310565,0.00022209555,0.0003966235,0.00546049,0.0010830356,0.9632146,0.0012070774,0.02792253],"study_design_scores_gemma":[0.00004090814,0.000026570358,0.000090704336,0.000049681545,0.00003747857,0.00016183525,0.00012016602,0.050653327,0.004306484,0.9290176,0.015469308,0.000025956464],"about_ca_topic_score_codex":0.002289784,"about_ca_topic_score_gemma":0.0031109035,"teacher_disagreement_score":0.0072431182,"about_ca_system_score_codex":0.0016645795,"about_ca_system_score_gemma":0.0015720932,"threshold_uncertainty_score":0.0383057},"labels":[],"label_agreement":null},{"id":"W164558080","doi":"10.1007/1-4020-4054-7_8","title":"Empirical Negation in Intuitionistic Logic","year":2006,"lang":"en","type":"book-chapter","venue":"˜The œWestern Ontario series in philosophy of science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Negation; Intuitionistic logic; Negation as failure; Mathematics; Computer science; Autoepistemic logic; Discrete mathematics; Artificial intelligence; Programming language; Multimodal logic; Propositional calculus; Description logic","score_opus":0.037525826800423,"score_gpt":0.26033268964077555,"score_spread":0.22280686284035256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164558080","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.021792881,0.040755205,0.23327324,0.024120506,0.0018549528,0.00006374187,0.00021171966,0.0003204591,0.67760736],"genre_scores_gemma":[0.8504058,0.01817814,0.054606684,0.0038703033,0.002718651,0.00015503285,0.00027424793,0.00018178356,0.06960931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861896,0.00067366695,0.000066857014,0.00011470554,0.0004587784,0.00006693037],"domain_scores_gemma":[0.9975702,0.001853531,0.00007002281,0.00017755375,0.00027856193,0.00005009753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030132672,0.0005252936,0.0006372444,0.0010636233,0.0014815687,0.0044947234,0.0011159016,0.0015148369,0.004960157],"category_scores_gemma":[0.0063370387,0.0005440185,0.00042034878,0.0013961031,0.010479648,0.007918915,0.001257477,0.0037149042,0.00065351126],"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.0000064451942,0.0000050628437,0.00005822712,0.000030400191,0.0000017202786,0.000020707397,0.00025214435,0.0001367039,0.000043106917,0.991856,0.002537905,0.0050515756],"study_design_scores_gemma":[0.000003156384,0.0000014771429,0.000052878826,0.00002283052,0.0000014502864,0.000019066827,0.000038673512,0.00044220567,0.000033584718,0.99065876,0.008723759,0.0000022048607],"about_ca_topic_score_codex":0.005017128,"about_ca_topic_score_gemma":0.0054682945,"teacher_disagreement_score":0.005017128,"about_ca_system_score_codex":0.0036971346,"about_ca_system_score_gemma":0.0017042697,"threshold_uncertainty_score":0.026824772},"labels":[],"label_agreement":null},{"id":"W1652372935","doi":"10.48550/arxiv.1109.1317","title":"Lifted Unit Propagation for Effective Grounding","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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":"Ground; Key (lock); Computer science; Domain (mathematical analysis); Unit (ring theory); Algorithm; Calculus (dental); Mathematical optimization; Mathematics; Engineering; Electrical engineering; Mathematical analysis","score_opus":0.09784830538333082,"score_gpt":0.20220946159292927,"score_spread":0.10436115620959845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1652372935","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.012623605,0.00025731872,0.97102994,0.00052072946,0.00014569655,0.00015788327,0.0006033233,0.005582138,0.009079383],"genre_scores_gemma":[0.24116012,0.0003984788,0.74696374,0.00065300334,0.00019030231,0.0004043303,0.0020065312,0.001641186,0.0065823286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958176,0.0008912419,0.00030771075,0.0007638329,0.0015692522,0.000650397],"domain_scores_gemma":[0.9930057,0.003619129,0.00024335123,0.002090892,0.0008759947,0.0001649023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021508879,0.0012963982,0.0012204604,0.002435311,0.001219447,0.0030825268,0.0031829844,0.0015180461,0.015022725],"category_scores_gemma":[0.012259733,0.001052878,0.0026893779,0.0022651895,0.0030329016,0.007386854,0.0072839484,0.0054323687,0.0030031262],"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.00038019186,0.00028597438,0.0010445167,0.00073680124,0.00012156287,0.00045442622,0.0006245647,0.05982588,0.014054989,0.51676303,0.022699485,0.3830086],"study_design_scores_gemma":[0.000069654816,0.000069776885,0.00020317397,0.00010104712,0.00009185951,0.00014836584,0.00012358125,0.24237163,0.020382123,0.718459,0.017931318,0.000048485614],"about_ca_topic_score_codex":0.0032878877,"about_ca_topic_score_gemma":0.004041744,"teacher_disagreement_score":0.015022725,"about_ca_system_score_codex":0.0017782511,"about_ca_system_score_gemma":0.0017465492,"threshold_uncertainty_score":0.050256014},"labels":[],"label_agreement":null},{"id":"W1658744261","doi":"10.22329/il.v33i1.3493","title":"The Irrelevance of Relevance","year":2013,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Relevance (law); Criticism; Relevance theory; Epistemology; State (computer science); Psychology; Computer science; Philosophy; Political science; Cognition; Algorithm; Law","score_opus":0.011024363025027918,"score_gpt":0.22095443507664947,"score_spread":0.20993007205162156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658744261","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.0427359,0.013709615,0.25550285,0.1749676,0.0021462063,0.00015493392,0.00034423286,0.0007393556,0.5096993],"genre_scores_gemma":[0.938669,0.0028330672,0.02514716,0.012249802,0.0030259264,0.00028205663,0.00015655816,0.0003652901,0.017271124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9507263,0.022068705,0.002651117,0.0087555805,0.013802728,0.0019955307],"domain_scores_gemma":[0.9192719,0.0552377,0.0029946452,0.012550745,0.008313165,0.0016318694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033665884,0.0008239072,0.00214085,0.003935002,0.0066062054,0.012664664,0.0030845234,0.006664315,0.008836039],"category_scores_gemma":[0.09835794,0.0011041884,0.002232845,0.0015632451,0.05744782,0.028525194,0.011897806,0.013385468,0.0019219411],"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.000015583662,0.000007960061,0.0001244407,0.00005388732,0.000012390916,0.00004744097,0.000656802,0.00016917204,0.00009902089,0.9942193,0.0016003161,0.0029937287],"study_design_scores_gemma":[0.000008097673,0.0000053117838,0.00005362947,0.000027147526,0.000005466977,0.000034983063,0.00007892906,0.00023080104,0.00007485014,0.9937477,0.005726604,0.000006443006],"about_ca_topic_score_codex":0.0019935416,"about_ca_topic_score_gemma":0.0010753506,"teacher_disagreement_score":0.033665884,"about_ca_system_score_codex":0.0065109567,"about_ca_system_score_gemma":0.00320213,"threshold_uncertainty_score":0.17804432},"labels":[],"label_agreement":null},{"id":"W1668764360","doi":"10.1109/sfcs.1991.185389","title":"A new characterization of Mehlhorn's polynomial time functionals","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"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 Toronto","funders":"","keywords":"Generalization; Class (philosophy); Characterization (materials science); Computer science; Time complexity; Discrete mathematics; Theoretical computer science; Mathematics; Algebra over a field; Artificial intelligence; Algorithm; Pure mathematics","score_opus":0.014041933700016657,"score_gpt":0.1925929111645612,"score_spread":0.17855097746454454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668764360","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.12320311,0.00230151,0.7253937,0.0052153454,0.00041832266,0.00020333749,0.0007740653,0.00045705625,0.14203367],"genre_scores_gemma":[0.8118217,0.0011393498,0.15079555,0.0009424918,0.00075683335,0.0003203146,0.00053425774,0.00036545718,0.03332413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835557,0.0003040032,0.000097149496,0.0004421394,0.0005697614,0.00023141461],"domain_scores_gemma":[0.99632806,0.00221129,0.00027151685,0.0004114019,0.00056061114,0.00021709294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017415218,0.0004783392,0.00053313177,0.0020892066,0.001767914,0.0019797573,0.0016229021,0.0010868307,0.0065611717],"category_scores_gemma":[0.005513921,0.00043285405,0.0012104696,0.0020435709,0.0037661272,0.009958133,0.002229955,0.0039879233,0.00076589093],"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.000016560512,0.000008959921,0.00021895817,0.000028023034,0.0000028788918,0.000037055586,0.0001972375,0.000559707,0.00096825213,0.99287415,0.0006193378,0.0044688494],"study_design_scores_gemma":[0.000011878665,0.00004514796,0.0005058572,0.0000355755,0.00000957845,0.00022465183,0.00011717594,0.013050885,0.0025157963,0.95951426,0.023940112,0.000029014094],"about_ca_topic_score_codex":0.0011663162,"about_ca_topic_score_gemma":0.00069650874,"teacher_disagreement_score":0.0065611717,"about_ca_system_score_codex":0.0017428825,"about_ca_system_score_gemma":0.0010801649,"threshold_uncertainty_score":0.021949291},"labels":[],"label_agreement":null},{"id":"W1675171940","doi":"10.1016/j.eswa.2015.08.019","title":"On the soundness, completeness and applicability of the logic of knowledge and communicative commitments in multi-agent systems","year":2015,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Soundness; Modal logic; Axiom; Completeness (order theory); Computer science; Modal operator; Mathematical proof; Multimodal logic; Dynamic logic (digital electronics); Mathematics; Modal; Artificial intelligence; Theoretical computer science; Calculus (dental); Description logic; Programming language","score_opus":0.09074671861996333,"score_gpt":0.30645385999881797,"score_spread":0.21570714137885463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1675171940","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.07463603,0.004138946,0.8539754,0.02231564,0.0005628164,0.00047549405,0.0006958423,0.00044479826,0.042755038],"genre_scores_gemma":[0.80155253,0.0028686249,0.18399347,0.0024292953,0.0013115917,0.0006294616,0.0006730037,0.00024302465,0.0062989676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9710391,0.014807783,0.002426387,0.0030661041,0.006420655,0.0022399316],"domain_scores_gemma":[0.7429807,0.21972919,0.0049568308,0.014749516,0.014892042,0.0026917458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03349949,0.0016028457,0.0034170013,0.004313062,0.005403529,0.0097688595,0.0068868985,0.0070567885,0.006856744],"category_scores_gemma":[0.13651317,0.0024782773,0.0043010726,0.004072398,0.025072146,0.033702318,0.011304588,0.015034196,0.0009950242],"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.00017841427,0.00009473839,0.00053720473,0.00024315555,0.00007788583,0.00016799259,0.0010960131,0.016758123,0.00045886892,0.9661184,0.0012708332,0.012998255],"study_design_scores_gemma":[0.00003907938,0.0000247758,0.00010072271,0.00003674387,0.000026994709,0.000026786754,0.00011622016,0.023351833,0.00022064599,0.9752686,0.00077095063,0.000016706083],"about_ca_topic_score_codex":0.01156796,"about_ca_topic_score_gemma":0.0056876563,"teacher_disagreement_score":0.03349949,"about_ca_system_score_codex":0.0058668763,"about_ca_system_score_gemma":0.009056932,"threshold_uncertainty_score":0.17716438},"labels":[],"label_agreement":null},{"id":"W168837927","doi":"10.1007/bfb0028175","title":"$$\\mathcal{R}\\mathcal{E}\\mathcal{S}$$ : A formalism for reasoning with relative-strength defaults","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Formalism (music); Combinatorics; Consistency (knowledge bases); Physics; Mathematics; Discrete mathematics","score_opus":0.015698362619593356,"score_gpt":0.24448246209623148,"score_spread":0.22878409947663814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168837927","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.0017321677,0.0005487196,0.9525348,0.002105417,0.00030896754,0.000096958356,0.0011198486,0.004142162,0.037411004],"genre_scores_gemma":[0.09181888,0.0013488384,0.8679948,0.001701401,0.0004526867,0.00041896093,0.001842139,0.0028851044,0.031537198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981376,0.00070093415,0.00019213639,0.0003841251,0.0004475727,0.00013754015],"domain_scores_gemma":[0.99829775,0.00077722064,0.00013546544,0.00047149538,0.00023027473,0.00008780027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035204461,0.0015352088,0.0014158982,0.002689832,0.0025313257,0.007922276,0.0054265214,0.003572294,0.034363117],"category_scores_gemma":[0.0049406732,0.0022766676,0.0030263367,0.00272312,0.0051627057,0.019304605,0.00541266,0.006838536,0.009788122],"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.000016950498,0.000011318484,0.000043528806,0.00006875553,0.000007840937,0.000043824002,0.00019963647,0.00058109965,0.0003691965,0.97137547,0.0109473895,0.016335038],"study_design_scores_gemma":[0.00001548848,0.0000053496287,0.000034683406,0.000056573845,0.00001553601,0.0001180617,0.000059846167,0.007922849,0.0008703315,0.9373528,0.053519823,0.00002866752],"about_ca_topic_score_codex":0.0044058464,"about_ca_topic_score_gemma":0.0069348277,"teacher_disagreement_score":0.034363117,"about_ca_system_score_codex":0.0025308887,"about_ca_system_score_gemma":0.0017825817,"threshold_uncertainty_score":0.11495608},"labels":[],"label_agreement":null},{"id":"W1705435008","doi":"10.3233/fi-2010-286","title":"Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs","year":2010,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint (computer-aided design); Loop (graph theory); Aggregate (composite); Mathematics; Computer science; Algebra over a field; Algorithm; Theoretical computer science; Pure mathematics; Combinatorics; Geometry; Materials science","score_opus":0.06131650265581724,"score_gpt":0.2707485198897412,"score_spread":0.20943201723392396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1705435008","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.1062785,0.00011206725,0.8799995,0.0006051326,0.00004059206,0.00014244812,0.00033349046,0.0008001073,0.011688044],"genre_scores_gemma":[0.72627145,0.00019104377,0.26624817,0.00045653133,0.00008968604,0.00035004123,0.00070525514,0.00026707773,0.00542079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814963,0.00036211617,0.00014234593,0.0003052281,0.0008150952,0.00022568011],"domain_scores_gemma":[0.9954521,0.0029402038,0.0003675202,0.00035912936,0.000767332,0.00011373818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015916321,0.00047728754,0.0003774918,0.0014616289,0.00057616184,0.0021445784,0.0011482615,0.0008771506,0.0046624774],"category_scores_gemma":[0.00787722,0.00028989208,0.0012022428,0.0010863453,0.0018176576,0.0058531784,0.0017641716,0.0020623165,0.00040720534],"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.00006881207,0.000088724606,0.0011782277,0.00012452157,0.000021769312,0.00020038229,0.000652797,0.010316587,0.0048611285,0.9443048,0.0011330753,0.0370492],"study_design_scores_gemma":[0.000029120129,0.00006288491,0.00036634487,0.000027921751,0.000043517703,0.00016790688,0.00020680176,0.11989746,0.009060268,0.8658452,0.0042688292,0.000023769357],"about_ca_topic_score_codex":0.0011725147,"about_ca_topic_score_gemma":0.001366589,"teacher_disagreement_score":0.0046624774,"about_ca_system_score_codex":0.0016884129,"about_ca_system_score_gemma":0.00093664904,"threshold_uncertainty_score":0.015597582},"labels":[],"label_agreement":null},{"id":"W173884984","doi":"10.5591/978-1-57735-516-8/ijcai11-437","title":"Finite Model Computation via Answer Set Programming","year":2011,"lang":"en","type":"article","venue":"Griffith Research Online (Griffith University, Queensland, Australia)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computation; Computer science; Solver; Answer set programming; Set (abstract data type); Domain (mathematical analysis); Extension (predicate logic); Theoretical computer science; Finite set; Programming paradigm; Model of computation; Mathematical optimization; Algorithm; Programming language; Mathematics","score_opus":0.2646177938064794,"score_gpt":0.36803641695952083,"score_spread":0.10341862315304146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173884984","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.0055695577,0.0001275762,0.9874774,0.0004878889,0.000044195996,0.00007620059,0.00016317758,0.0021981755,0.0038557884],"genre_scores_gemma":[0.16158693,0.00028386616,0.832963,0.00032125355,0.00008622189,0.0002888869,0.0008483525,0.000581339,0.0030400641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954787,0.0016450047,0.00030873105,0.0007510823,0.001365933,0.00045058946],"domain_scores_gemma":[0.9913067,0.0065941643,0.00028503363,0.00113252,0.00053528335,0.00014621568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039335685,0.0011689506,0.0012123112,0.0017442171,0.0012744028,0.004222445,0.0034080371,0.001643713,0.009834089],"category_scores_gemma":[0.014077955,0.000801692,0.0034736143,0.0016610356,0.0036174206,0.008101402,0.005114479,0.004165817,0.0015277861],"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.00013186202,0.00018021613,0.0007361932,0.00048069,0.000115118084,0.0002642041,0.0006528524,0.09766558,0.0032903752,0.77510154,0.00596873,0.11541263],"study_design_scores_gemma":[0.000037201367,0.000026513546,0.000053776712,0.000057274174,0.000039450515,0.000073498086,0.000063176616,0.31725875,0.005378305,0.66796774,0.009020811,0.00002352263],"about_ca_topic_score_codex":0.0024512832,"about_ca_topic_score_gemma":0.0036468287,"teacher_disagreement_score":0.009834089,"about_ca_system_score_codex":0.0020231265,"about_ca_system_score_gemma":0.0025781437,"threshold_uncertainty_score":0.032898307},"labels":[],"label_agreement":null},{"id":"W1739817710","doi":"10.3233/ifs-2008-00377","title":"Fusion devices and changes of belief","year":2008,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","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":"York University","funders":"","keywords":"State (computer science); Fusion; Sensor fusion; Sentence; Computer science; Artificial intelligence; Belief revision; Intelligent agent; Dempster–Shafer theory; Algorithm; Linguistics","score_opus":0.03219423435690279,"score_gpt":0.24728815972590346,"score_spread":0.21509392536900068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1739817710","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.055447355,0.0010742099,0.9139096,0.0017528328,0.00017242061,0.00014381544,0.00014488785,0.0006560044,0.026698869],"genre_scores_gemma":[0.7620164,0.0006646129,0.2307816,0.00040485334,0.00016786667,0.00024886694,0.00013843567,0.00008157796,0.0054958225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948231,0.0016057374,0.0004293266,0.0012918516,0.0014752734,0.000374665],"domain_scores_gemma":[0.9932681,0.0036410326,0.00078749534,0.0012073115,0.00081632216,0.0002796938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056779683,0.000701665,0.00087666645,0.0022006868,0.001346497,0.0045725945,0.0016716134,0.0017254,0.0038273095],"category_scores_gemma":[0.01664636,0.0006505223,0.0012331494,0.0014669326,0.004656135,0.007346237,0.0036746995,0.0024066428,0.00058611814],"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.00016567062,0.000042864227,0.00128448,0.00013103723,0.00010110586,0.00032751955,0.002152008,0.01785961,0.0060190167,0.9076739,0.0012434165,0.06299935],"study_design_scores_gemma":[0.00008618864,0.00024690834,0.0019757792,0.00013831112,0.00018394925,0.0005541937,0.0010118526,0.16615504,0.013344703,0.7967561,0.019428685,0.00011834732],"about_ca_topic_score_codex":0.0011300816,"about_ca_topic_score_gemma":0.00060046744,"teacher_disagreement_score":0.0056779683,"about_ca_system_score_codex":0.0014527204,"about_ca_system_score_gemma":0.0007522825,"threshold_uncertainty_score":0.030028343},"labels":[],"label_agreement":null},{"id":"W1740547630","doi":"10.22329/il.v26i2.444","title":"Formal Logic for Informal Logicians","year":2008,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Counterintuitive; Argumentation theory; Argument (complex analysis); Epistemology; Informal logic; Modal logic; Argument map; Philosophy; Computer science; Philosophy of logic; Calculus (dental); Modal","score_opus":0.03675715526480909,"score_gpt":0.25258832785109453,"score_spread":0.21583117258628542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1740547630","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.00496442,0.055412658,0.7224747,0.03106472,0.0029648459,0.0002171366,0.0012677859,0.00196369,0.17967011],"genre_scores_gemma":[0.3104651,0.040615708,0.5711634,0.01189193,0.009563868,0.001420848,0.003168609,0.001110879,0.050599683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676454,0.0015202705,0.00033534295,0.00049960945,0.0006931345,0.00018718836],"domain_scores_gemma":[0.99474335,0.0034464165,0.00027250857,0.00079765037,0.000551005,0.00018899028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005545379,0.0015508374,0.0011871317,0.0031549942,0.0022328089,0.007161734,0.0015061192,0.002123628,0.015601953],"category_scores_gemma":[0.0072097094,0.00086010614,0.0014207013,0.0033521517,0.007937067,0.012095473,0.0034231741,0.008303903,0.0053109983],"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.0000051042357,0.000010720739,0.00004681943,0.000100465426,0.000008305339,0.000049643724,0.00028038153,0.00032166694,0.00020123184,0.98137707,0.005964859,0.011633679],"study_design_scores_gemma":[0.000010832883,0.000005535529,0.00004657452,0.00009205615,0.000005064769,0.00007373382,0.00005024902,0.00096418837,0.00008822131,0.9337627,0.06489362,0.000007075709],"about_ca_topic_score_codex":0.0016935235,"about_ca_topic_score_gemma":0.0010273444,"teacher_disagreement_score":0.015601953,"about_ca_system_score_codex":0.004420785,"about_ca_system_score_gemma":0.0023826156,"threshold_uncertainty_score":0.05219376},"labels":[],"label_agreement":null},{"id":"W1743668334","doi":"10.1007/s11225-015-9625-0","title":"A Logical Theory of Localization","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Robot; Domain (mathematical analysis); Task (project management); Logical conjunction; Theoretical computer science; Mathematics; Programming language; Machine learning; Engineering","score_opus":0.056637439952223326,"score_gpt":0.2683891055608521,"score_spread":0.2117516656086288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1743668334","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.016505873,0.0073075015,0.7202633,0.023644656,0.00062698487,0.00005659695,0.0005326909,0.00060069835,0.23046167],"genre_scores_gemma":[0.78787917,0.004695557,0.16106036,0.0044156066,0.0019511159,0.0002958069,0.0008770013,0.0002821939,0.03854321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804085,0.00089678966,0.000117018535,0.0004371185,0.0003474039,0.00016079465],"domain_scores_gemma":[0.9966348,0.0018078546,0.00019850257,0.0006162088,0.000552522,0.0001901134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003122654,0.0007297251,0.00094722013,0.0032969085,0.0033393707,0.006886105,0.0018793178,0.0024392202,0.012284142],"category_scores_gemma":[0.0060068974,0.0007682102,0.001619689,0.002584357,0.014306262,0.020139767,0.004142892,0.005079941,0.0020308518],"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.0000019341846,0.0000022358586,0.000024299858,0.000007809601,0.0000019419065,0.000008820462,0.000068239155,0.000080358,0.000029468267,0.9980413,0.0006441779,0.0010894206],"study_design_scores_gemma":[0.000005063258,0.0000024196943,0.000028685667,0.000007823445,0.000003303692,0.000021094515,0.000043583394,0.00044354063,0.000041109997,0.99433434,0.0050665042,0.0000026430444],"about_ca_topic_score_codex":0.001987852,"about_ca_topic_score_gemma":0.0013728301,"teacher_disagreement_score":0.012284142,"about_ca_system_score_codex":0.0028909168,"about_ca_system_score_gemma":0.0015289176,"threshold_uncertainty_score":0.041094482},"labels":[],"label_agreement":null},{"id":"W1745228384","doi":"10.1007/s10992-015-9370-x","title":"Natural Deduction for the Sheffer Stroke and Peirce’s Arrow (and any Other Truth-Functional Connective)","year":2015,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Natural deduction; Arrow; Absurdity; Simple (philosophy); Classical logic; Calculus (dental); Propositional calculus; Natural number","score_opus":0.060282583258138275,"score_gpt":0.2709156767648104,"score_spread":0.2106330935066721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1745228384","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.05072696,0.0038721662,0.6793233,0.0140666785,0.0028626185,0.00010931099,0.00033205462,0.00048059336,0.24822634],"genre_scores_gemma":[0.74834615,0.0017552747,0.20162319,0.0025661767,0.0010596114,0.00014830724,0.0003600913,0.00014873302,0.04399249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994516,0.00018983228,0.0000481032,0.00011081217,0.00013810843,0.00006156191],"domain_scores_gemma":[0.99901116,0.00053835346,0.00004226095,0.00013295987,0.00021228922,0.000062908905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021507607,0.0003592467,0.00040081277,0.0014891175,0.0017891506,0.0017226344,0.00086239085,0.0015702576,0.0076659475],"category_scores_gemma":[0.004232148,0.00030554636,0.0011997574,0.0008465137,0.0038886375,0.009920135,0.0019381617,0.0028678048,0.0011356923],"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.00000883426,0.0000075468874,0.000042257987,0.000020869165,0.0000039191586,0.00002980824,0.00011074323,0.000113424365,0.00009167707,0.9930862,0.0014553814,0.0050293184],"study_design_scores_gemma":[0.000006415732,0.0000039322736,0.00004192154,0.000008728091,0.0000042486804,0.000035448258,0.000020316465,0.0006036074,0.00022352386,0.99244905,0.006597386,0.0000054343004],"about_ca_topic_score_codex":0.001594133,"about_ca_topic_score_gemma":0.001818665,"teacher_disagreement_score":0.0076659475,"about_ca_system_score_codex":0.0013137951,"about_ca_system_score_gemma":0.0013049671,"threshold_uncertainty_score":0.025645196},"labels":[],"label_agreement":null},{"id":"W1763963671","doi":"10.1007/s11225-015-9626-z","title":"Progression and Verification of Situation Calculus Agents with Bounded Beliefs","year":2015,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Provincia autonoma di Bolzano - Alto Adige; European Commission","keywords":"Decidability; Situation calculus; Bounded function; Action (physics); Domain (mathematical analysis); Action theory (sociology); Computer science; Mathematics; Calculus (dental); Theoretical computer science; Artificial intelligence; Epistemology","score_opus":0.04576077388929656,"score_gpt":0.290040312828687,"score_spread":0.24427953893939042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763963671","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.15652008,0.00025140384,0.8342321,0.0010129937,0.000045284352,0.00019888229,0.0003264876,0.001946203,0.0054666563],"genre_scores_gemma":[0.8372851,0.00022864057,0.15876509,0.00016798907,0.000058355323,0.00021437457,0.00058101607,0.00015266344,0.00254668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901231,0.002766004,0.0006806112,0.0017011922,0.0033633274,0.0013658217],"domain_scores_gemma":[0.9720091,0.020034982,0.0023443573,0.0024269351,0.0023679328,0.0008166345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009139575,0.0011001686,0.0010816086,0.002250607,0.0017574498,0.0039743343,0.0030914124,0.0016035577,0.0032361231],"category_scores_gemma":[0.0374341,0.000993422,0.0031432572,0.0012509986,0.0060404236,0.009147213,0.004672834,0.004026777,0.0004459203],"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.00046269223,0.00019731502,0.004120662,0.00026329316,0.00019753721,0.0016037452,0.0031037112,0.14229977,0.010373061,0.8089967,0.0007087696,0.0276728],"study_design_scores_gemma":[0.000109851,0.000105033,0.00040240728,0.00006487004,0.000095918425,0.00012584285,0.00023175542,0.46848714,0.009198273,0.5188406,0.0022765324,0.0000617423],"about_ca_topic_score_codex":0.013647038,"about_ca_topic_score_gemma":0.0076332497,"teacher_disagreement_score":0.013647038,"about_ca_system_score_codex":0.003643123,"about_ca_system_score_gemma":0.0044345083,"threshold_uncertainty_score":0.048335314},"labels":[],"label_agreement":null},{"id":"W1769115041","doi":"10.1007/s11229-015-0773-6","title":"Logics of temporal-epistemic actions","year":2015,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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 Victoria","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Temporal logic; Action (physics); Kripke structure; Computer science; Epistemic modal logic; Philosophy of science; Modal logic; Linear temporal logic; Computation tree logic; Philosophy of language; Epistemology; Kripke semantics; Multimodal logic; Artificial intelligence; Cognitive science; Theoretical computer science; Metaphysics; Description logic; Philosophy; Modal; Psychology","score_opus":0.0800660039964839,"score_gpt":0.28883538500117084,"score_spread":0.20876938100468695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769115041","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.0076658656,0.0011502072,0.9340091,0.0028011356,0.00023800491,0.000098161676,0.00059533556,0.00060780504,0.05283435],"genre_scores_gemma":[0.49379045,0.0019508239,0.48114085,0.0014176395,0.0005349424,0.0005055321,0.0012467545,0.00022332098,0.019189656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966838,0.001314577,0.00032038862,0.0006369168,0.0007373215,0.0003068775],"domain_scores_gemma":[0.995858,0.0020815344,0.00049661007,0.0007365477,0.00046637005,0.00036102682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038738982,0.0009483443,0.0005164805,0.0017809498,0.0017912007,0.004880051,0.0017949885,0.001453932,0.0075764414],"category_scores_gemma":[0.005949605,0.000674348,0.0017618245,0.0018982901,0.0048867157,0.011372635,0.004094145,0.003875811,0.0011011258],"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.0000074576146,0.0000059995555,0.000035308825,0.00002519813,0.00000511605,0.000037098136,0.00013244264,0.0011186306,0.00012366033,0.99529195,0.0004033366,0.0028136482],"study_design_scores_gemma":[0.000014354178,0.000009549213,0.00003066114,0.00003136808,0.000014417232,0.00006235016,0.00007764281,0.0087594045,0.00039904294,0.9719535,0.01863717,0.000010631747],"about_ca_topic_score_codex":0.0033924426,"about_ca_topic_score_gemma":0.00323899,"teacher_disagreement_score":0.0075764414,"about_ca_system_score_codex":0.0035214184,"about_ca_system_score_gemma":0.0017751246,"threshold_uncertainty_score":0.02554977},"labels":[],"label_agreement":null},{"id":"W1793586388","doi":"10.1007/978-3-540-74282-1_148","title":"Human-Like Learning Methods for a \"Conscious\" Agent","year":2007,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Autonomy; Unconscious mind; Cognitive science; Computer science; Cognition; Artificial intelligence; Psychology; Neuroscience","score_opus":0.10401151902575473,"score_gpt":0.39940874880379185,"score_spread":0.2953972297780371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793586388","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.0021669825,0.00021691999,0.98660165,0.000525031,0.00004353262,0.000027973492,0.00001388446,0.00035986272,0.010044154],"genre_scores_gemma":[0.13827728,0.0003361427,0.84475696,0.00023931843,0.000072878305,0.00014821532,0.000053458414,0.00013503141,0.015980761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995004,0.00020655822,0.000028449209,0.000103504564,0.00013424731,0.000026783657],"domain_scores_gemma":[0.9989033,0.00058002735,0.000044674987,0.00028118433,0.00013981647,0.00005106395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013613007,0.0004742601,0.00041901533,0.00043559613,0.00059167476,0.0016339127,0.0017793552,0.0011375063,0.0073826625],"category_scores_gemma":[0.0031852361,0.00029059438,0.0005321139,0.00034370163,0.0027570468,0.0036095302,0.0016607312,0.001569336,0.0011622144],"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.000025430892,0.000038455753,0.00016872403,0.00010351456,0.000025883799,0.000021521237,0.00030177954,0.017808301,0.0009975412,0.8771506,0.0043750457,0.09898314],"study_design_scores_gemma":[0.000015512653,0.000024346757,0.00007779692,0.000024233064,0.00001123654,0.00005086107,0.00004709675,0.13760124,0.0014809675,0.84435207,0.01630174,0.000012914998],"about_ca_topic_score_codex":0.0009925918,"about_ca_topic_score_gemma":0.0017781553,"teacher_disagreement_score":0.0073826625,"about_ca_system_score_codex":0.0007549652,"about_ca_system_score_gemma":0.0009633816,"threshold_uncertainty_score":0.024697483},"labels":[],"label_agreement":null},{"id":"W180392473","doi":"","title":"Prolegomenon to a theory of conservative belief revision","year":2003,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Belief revision; Proposition; Intuition; Belief system; Epistemology; Computer science; State (computer science); Artificial intelligence; Mathematics; Mathematical economics; Algorithm; Philosophy","score_opus":0.021024202981544553,"score_gpt":0.25152315553560345,"score_spread":0.2304989525540589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180392473","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.019556012,0.0017760803,0.80816525,0.011295631,0.0005037053,0.00010162775,0.00019641755,0.0003758365,0.1580294],"genre_scores_gemma":[0.82521576,0.0010159952,0.14077401,0.003223508,0.0010727749,0.00039870263,0.00018054609,0.00015904914,0.02795961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969158,0.001381281,0.00014512702,0.0005645645,0.0007675257,0.0002256883],"domain_scores_gemma":[0.9956779,0.0023528603,0.000384469,0.00082527695,0.0005580688,0.00020140344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272742,0.0005663043,0.0006450317,0.0011215572,0.0017368285,0.004293476,0.0014124023,0.0018178532,0.007339063],"category_scores_gemma":[0.0085948985,0.0004169265,0.0010358978,0.0009375616,0.0076804557,0.005602314,0.0028361024,0.0044028647,0.0010373342],"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.0000071869645,0.000004730876,0.00003491366,0.000012193034,0.000005661426,0.000027598653,0.00014496685,0.0005313551,0.00006194899,0.9968009,0.00038719497,0.001981256],"study_design_scores_gemma":[0.000010464062,0.0000062592135,0.000027973147,0.0000075608036,0.000003841881,0.000025840038,0.000018812156,0.002723285,0.000064817476,0.9939766,0.003131058,0.0000034494806],"about_ca_topic_score_codex":0.0009445646,"about_ca_topic_score_gemma":0.0008663718,"teacher_disagreement_score":0.007339063,"about_ca_system_score_codex":0.002514771,"about_ca_system_score_gemma":0.0013942032,"threshold_uncertainty_score":0.02455163},"labels":[],"label_agreement":null},{"id":"W1806267199","doi":"","title":"On the Concepts of Logical Fallacy and Logical Error","year":2003,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Fallacy; Truth table; Non-classical logic; Computer science; Logical consequence; Epistemology; Mathematics; Philosophy; Algorithm","score_opus":0.036685371555816644,"score_gpt":0.24716596437190538,"score_spread":0.21048059281608875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806267199","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.038726017,0.012695704,0.62296474,0.11111256,0.0029606742,0.00020197147,0.0003895245,0.00047444677,0.21047428],"genre_scores_gemma":[0.81489235,0.0070741833,0.14673613,0.0099354265,0.0036883287,0.0005903628,0.0004802262,0.00043345825,0.016169555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97545314,0.013804132,0.0021999672,0.002965917,0.004393697,0.0011832041],"domain_scores_gemma":[0.8496186,0.128363,0.003902515,0.010361548,0.0062285457,0.0015258031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03163917,0.0013623826,0.0026086385,0.007195205,0.0065955743,0.012373711,0.0038155974,0.0104143275,0.008687657],"category_scores_gemma":[0.12103019,0.0019302195,0.0022029874,0.005472248,0.071661636,0.05700778,0.0119653195,0.016652035,0.0014440508],"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.00002203994,0.000009728414,0.00012963639,0.00002750855,0.000008063539,0.000040927152,0.00042309682,0.000263909,0.000023754323,0.9950334,0.00098932,0.0030286936],"study_design_scores_gemma":[0.000009124169,0.0000031147722,0.000033712604,0.000018837329,0.0000050062695,0.000025161837,0.00006970075,0.0004324359,0.000024886103,0.99785197,0.0015208699,0.0000051853026],"about_ca_topic_score_codex":0.0047230204,"about_ca_topic_score_gemma":0.0026287583,"teacher_disagreement_score":0.03163917,"about_ca_system_score_codex":0.005503999,"about_ca_system_score_gemma":0.003984436,"threshold_uncertainty_score":0.16732591},"labels":[],"label_agreement":null},{"id":"W1814275833","doi":"10.1007/978-3-642-14052-5_27","title":"On the Formalization of the Lebesgue Integration Theory in HOL","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Lebesgue integration; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.012409064469060387,"score_gpt":0.2241418883832711,"score_spread":0.2117328239142107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814275833","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.02843676,0.008289541,0.70156395,0.007231639,0.001080509,0.000087609886,0.0003366983,0.00057226367,0.25240102],"genre_scores_gemma":[0.7750868,0.005743812,0.16217911,0.0022498453,0.0022459824,0.0002669735,0.0005688779,0.00069354725,0.050965033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998953,0.0003913174,0.00006965639,0.00013310908,0.00032358663,0.0001293328],"domain_scores_gemma":[0.99854654,0.0008364498,0.00008248703,0.0002384266,0.00019994452,0.000096058386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023261805,0.00074800913,0.001206673,0.0020721683,0.002083512,0.004719249,0.0016018503,0.0014888403,0.006871131],"category_scores_gemma":[0.0029656896,0.0006391004,0.00158628,0.001969401,0.008979915,0.011126482,0.0031242233,0.006322088,0.001135011],"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.000003990093,0.0000036415888,0.000014031699,0.000010337913,0.0000019455993,0.000010572114,0.000051287807,0.00019910636,0.000057875273,0.9979327,0.0003716969,0.0013427464],"study_design_scores_gemma":[0.0000040589875,0.000003423164,0.00003105645,0.000010329098,0.0000020276198,0.000014674953,0.000018195022,0.0011798242,0.00007552509,0.99542,0.00323701,0.0000038155463],"about_ca_topic_score_codex":0.0015942947,"about_ca_topic_score_gemma":0.0014403324,"teacher_disagreement_score":0.006871131,"about_ca_system_score_codex":0.0028770182,"about_ca_system_score_gemma":0.0009127903,"threshold_uncertainty_score":0.022986233},"labels":[],"label_agreement":null},{"id":"W1830646994","doi":"10.1007/978-3-642-29485-3_14","title":"Combining Epistemic Logic and Hennessy-Milner Logic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Philosophy of logic; Completeness (order theory); Modulo; Dynamic logic (digital electronics); Computer science; Epistemic modal logic; Equivalence (formal languages); Multimodal logic; Class (philosophy); Calculus (dental); Many-valued logic; State (computer science); Theoretical computer science; Programming language; Mathematics; Discrete mathematics; Artificial intelligence; Description logic; Physics; Quantum mechanics","score_opus":0.024871371004859345,"score_gpt":0.24494435771506404,"score_spread":0.2200729867102047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830646994","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.009314707,0.002430837,0.8791257,0.0025995304,0.00049038924,0.000062311396,0.000096542644,0.0006739448,0.105206065],"genre_scores_gemma":[0.50064963,0.0045529506,0.44211245,0.0019697435,0.0017153961,0.00028490872,0.00062898337,0.0007384405,0.04734761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969297,0.0012969946,0.00020641046,0.00044737072,0.0008099937,0.0003095171],"domain_scores_gemma":[0.9980081,0.0011284994,0.000092693444,0.00038600876,0.0002625657,0.00012222833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043583824,0.0014609541,0.0015394079,0.003402664,0.002015344,0.0065477397,0.0023929214,0.0023943365,0.011334292],"category_scores_gemma":[0.0060714707,0.0009863747,0.002476684,0.0025130084,0.004339997,0.021253625,0.0070034843,0.0044538565,0.0024760657],"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.000029292105,0.000028896391,0.000052719755,0.0000648043,0.00002611438,0.00005549988,0.00011869187,0.0013413354,0.00047686393,0.9767213,0.0014189723,0.019665493],"study_design_scores_gemma":[0.0000070663255,0.000007740187,0.000019156127,0.000025406078,0.000017658766,0.000028260825,0.000025979461,0.004349076,0.00048751367,0.9897385,0.0052821925,0.000011292084],"about_ca_topic_score_codex":0.0007409659,"about_ca_topic_score_gemma":0.0011400752,"teacher_disagreement_score":0.011334292,"about_ca_system_score_codex":0.0019987642,"about_ca_system_score_gemma":0.001554965,"threshold_uncertainty_score":0.037917018},"labels":[],"label_agreement":null},{"id":"W1831107993","doi":"10.4230/lipics.cpm.2017.28","title":"A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Campus France; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Answer set programming; Computer science; Set (abstract data type); Consistency (knowledge bases); Reduction (mathematics); Constraint (computer-aided design); Constraint programming; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Programming language","score_opus":0.044955361795787255,"score_gpt":0.2560029167852465,"score_spread":0.21104755498945926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831107993","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.015721017,0.0004512475,0.96364933,0.004700735,0.00017142866,0.00017337251,0.0009097794,0.0005606137,0.013662429],"genre_scores_gemma":[0.16586159,0.0006317886,0.8247149,0.0012125071,0.00024970487,0.00038945008,0.0017455308,0.0002030204,0.0049914643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827445,0.00061186595,0.000103078244,0.00036002742,0.00047771295,0.0001729467],"domain_scores_gemma":[0.995811,0.003098689,0.00021039418,0.00025531172,0.0004792389,0.00014546697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022931625,0.0008941052,0.00092478155,0.0012612969,0.0012444272,0.0026663877,0.0022814102,0.0024012786,0.011806588],"category_scores_gemma":[0.013291605,0.00065414654,0.002035955,0.002191563,0.0018584277,0.0037265935,0.0026709996,0.003757266,0.0011588859],"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.00022074893,0.00026125062,0.00097170717,0.0008986141,0.00012404581,0.0006500665,0.00047773737,0.1331919,0.0037771566,0.6799213,0.022899497,0.156606],"study_design_scores_gemma":[0.00010342254,0.000048885326,0.00018267016,0.00008484927,0.000042846223,0.00028191155,0.00014450923,0.27036387,0.0016803602,0.71712065,0.00991824,0.000027710283],"about_ca_topic_score_codex":0.0025937092,"about_ca_topic_score_gemma":0.0045035225,"teacher_disagreement_score":0.011806588,"about_ca_system_score_codex":0.0012777098,"about_ca_system_score_gemma":0.0022428157,"threshold_uncertainty_score":0.03949696},"labels":[],"label_agreement":null},{"id":"W1838030265","doi":"10.1023/a:1026153912205","title":"Database Repairs and Analytic Tableaux","year":2003,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relational database; Computer science; Data integrity; Set (abstract data type); Closing (real estate); Relational model; Basis (linear algebra); Deductive database; Functional dependency; Database; Information retrieval; Theoretical computer science; Data mining; Programming language; Mathematics","score_opus":0.13024555120690365,"score_gpt":0.3348983845880137,"score_spread":0.20465283338111004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838030265","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.07910758,0.0064111827,0.8565843,0.0070152935,0.0006267277,0.00017643678,0.001159217,0.002006711,0.046912577],"genre_scores_gemma":[0.7052689,0.0031392695,0.2659493,0.0007177302,0.00040132191,0.0001587109,0.0010383942,0.0003827759,0.022943608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687946,0.0009887995,0.00038433375,0.0004891655,0.0009679507,0.00029032942],"domain_scores_gemma":[0.98301816,0.012029054,0.00091528095,0.0025077395,0.0012168434,0.00031292366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004396267,0.0005232742,0.0011529773,0.0018528452,0.0019386534,0.0059732026,0.0026344352,0.0018695927,0.008712645],"category_scores_gemma":[0.023676815,0.0010160587,0.0014920748,0.0028697583,0.004417162,0.01006126,0.0024824834,0.0034027954,0.0010774964],"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.00007553552,0.00002461478,0.00030059725,0.00008473966,0.000017845561,0.00013086876,0.0003335098,0.007459843,0.00040329527,0.9672094,0.0030473727,0.02091252],"study_design_scores_gemma":[0.00001977441,0.000008024259,0.0000502249,0.000020119995,0.000016711318,0.00008853651,0.000076724624,0.012651037,0.00054345705,0.9801035,0.006409168,0.000012542389],"about_ca_topic_score_codex":0.0034048334,"about_ca_topic_score_gemma":0.0033249424,"teacher_disagreement_score":0.008712645,"about_ca_system_score_codex":0.0027924983,"about_ca_system_score_gemma":0.0015495701,"threshold_uncertainty_score":0.02914673},"labels":[],"label_agreement":null},{"id":"W1849885691","doi":"10.5555/1220075.1220082","title":"Natural Frames and Self-dual Logics","year":2001,"lang":"en","type":"article","venue":"Deontic Logic in Computer Science","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":"Interpretation (philosophy); Dual (grammatical number); Duality (order theory); Class (philosophy); Computer science; Notice; Natural (archaeology); Modal logic; Semantic interpretation; Modal; Theoretical computer science; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics; Philosophy; Programming language; Linguistics","score_opus":0.01304448418705483,"score_gpt":0.2427163240922049,"score_spread":0.22967183990515005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849885691","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.17903881,0.0067969547,0.4834845,0.01699603,0.0006398726,0.000105346604,0.00019450873,0.0003279746,0.31241608],"genre_scores_gemma":[0.94598424,0.0012510418,0.039171547,0.0007048236,0.00031736563,0.00005825038,0.00009200807,0.00003973494,0.012380998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985304,0.0006592864,0.000060248283,0.00021341484,0.00034165513,0.0001950472],"domain_scores_gemma":[0.999033,0.0003717137,0.0001484514,0.00016674072,0.00015338814,0.00012663184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019332774,0.0003528861,0.0003133878,0.0016250615,0.0019588415,0.003211507,0.0009150686,0.0012267078,0.002683418],"category_scores_gemma":[0.0015658068,0.0003577174,0.0006829551,0.0010245845,0.0078056124,0.0069216657,0.0025671937,0.002587054,0.00028098706],"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.0000023945413,0.0000034196553,0.000021814434,0.0000032604885,8.0034175e-7,0.000009273469,0.00010125521,0.0001392914,0.00004595516,0.9988783,0.000101361686,0.00069281255],"study_design_scores_gemma":[0.0000045567745,0.000005059687,0.000034265428,0.0000075829757,0.0000016796017,0.000024450264,0.000096569594,0.0016134068,0.00015229275,0.9928421,0.0052147484,0.0000032047767],"about_ca_topic_score_codex":0.0020318485,"about_ca_topic_score_gemma":0.0020054395,"teacher_disagreement_score":0.0035971934,"about_ca_system_score_codex":0.0035971934,"about_ca_system_score_gemma":0.001113024,"threshold_uncertainty_score":0.026099622},"labels":[],"label_agreement":null},{"id":"W186029108","doi":"10.1007/978-3-642-24364-6_18","title":"A Semantic Account for Modularity in Multi-language Modelling of Search Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Monotonic function; Modularity (biology); Expressive power; Theoretical computer science; Operator (biology); Scheduling (production processes); Programming language; Property (philosophy); Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.07514873948279129,"score_gpt":0.27947157520041577,"score_spread":0.2043228357176245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186029108","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.018686168,0.00049484323,0.9614536,0.0018608139,0.000060270504,0.000060439615,0.00015091982,0.00037258485,0.016860297],"genre_scores_gemma":[0.6201911,0.0005315655,0.37159634,0.000409191,0.00021068873,0.00026571853,0.00032718581,0.0003445931,0.0061235353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655485,0.0018474078,0.00029787087,0.00037627335,0.00062033796,0.00030329832],"domain_scores_gemma":[0.98993474,0.0067013665,0.00048705333,0.0017927134,0.0006939907,0.00039013659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045272713,0.0007674153,0.0011167864,0.0024251633,0.0020397205,0.0047058477,0.0034348462,0.00297588,0.008738579],"category_scores_gemma":[0.017135326,0.0012303612,0.0031263297,0.0028111008,0.0066070003,0.018145718,0.0051996657,0.0037502456,0.0009105804],"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.000014212987,0.000011771467,0.000118372736,0.000035397094,0.000012245948,0.00005941657,0.0003920933,0.0055056573,0.00024602507,0.9895141,0.00034920793,0.003741384],"study_design_scores_gemma":[0.0000082892275,0.0000051553775,0.000034826706,0.000010928391,0.00001208468,0.000051435993,0.00004859154,0.028943945,0.00014376975,0.9695515,0.0011817699,0.000007589653],"about_ca_topic_score_codex":0.0024492934,"about_ca_topic_score_gemma":0.0026124388,"teacher_disagreement_score":0.008738579,"about_ca_system_score_codex":0.0017722449,"about_ca_system_score_gemma":0.0014874727,"threshold_uncertainty_score":0.029233456},"labels":[],"label_agreement":null},{"id":"W1865029539","doi":"10.1007/978-1-4615-1567-8_3","title":"Two Approaches to Efficient Open-World Reasoning","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Computer science; Word (group theory); Artificial intelligence; Natural language processing; Epistemology; Linguistics; Philosophy","score_opus":0.10249101895990864,"score_gpt":0.2629422765639934,"score_spread":0.16045125760408474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1865029539","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.0016217863,0.0008218554,0.96048963,0.0023164977,0.00022016729,0.000117323485,0.00018709872,0.0006968454,0.03352877],"genre_scores_gemma":[0.08615171,0.0016098253,0.87356627,0.00094313466,0.00052664435,0.00045891592,0.0008134382,0.00061467715,0.035315346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934964,0.0015598254,0.00037418873,0.00095612055,0.0029958372,0.0006176765],"domain_scores_gemma":[0.9907278,0.0039782217,0.00026860743,0.003651229,0.0010375892,0.00033663414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035949056,0.0015310848,0.001815046,0.0036927757,0.0027026127,0.011222285,0.0080583235,0.0042244145,0.028064108],"category_scores_gemma":[0.01701634,0.0017560073,0.003233964,0.0045268927,0.0067921737,0.026582118,0.011399521,0.008405233,0.0065238774],"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.000046532186,0.00007105427,0.000060977924,0.00010214237,0.000015224661,0.000032913355,0.00026956628,0.001854902,0.0003105394,0.93653125,0.007050765,0.05365413],"study_design_scores_gemma":[0.000032231925,0.000011692503,0.000057032423,0.000045762594,0.000021039443,0.00009801364,0.000103520666,0.022462398,0.0009639387,0.95347446,0.02271264,0.000017403263],"about_ca_topic_score_codex":0.0024747362,"about_ca_topic_score_gemma":0.0030869115,"teacher_disagreement_score":0.028064108,"about_ca_system_score_codex":0.0026027719,"about_ca_system_score_gemma":0.0023910473,"threshold_uncertainty_score":0.09388375},"labels":[],"label_agreement":null},{"id":"W1884573419","doi":"10.1007/978-3-540-30597-2_1","title":"Introduction to Inconsistency Tolerance","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Brainstorming; Artificial intelligence; Robotics; Negotiation; Robot","score_opus":0.011692352911035032,"score_gpt":0.23116659555782829,"score_spread":0.21947424264679324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884573419","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.0012244764,0.021453807,0.80318034,0.0073724026,0.0025446701,0.00035588144,0.001447328,0.004723085,0.15769808],"genre_scores_gemma":[0.049176183,0.02354406,0.8012627,0.0060690013,0.0034137159,0.0008748973,0.003704691,0.004072472,0.10788241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610054,0.0006837918,0.00040306244,0.0010340414,0.0015419219,0.00023675404],"domain_scores_gemma":[0.9951131,0.0026052846,0.00015244572,0.0011761935,0.00082196353,0.00013110835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033163226,0.00221362,0.002458034,0.004045514,0.0021413055,0.006360797,0.0059405966,0.0028119616,0.057976782],"category_scores_gemma":[0.010450499,0.0023049135,0.0031391121,0.0054435306,0.004488327,0.012061675,0.0055286693,0.0092620645,0.017491216],"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.000056539615,0.00008323,0.00015117445,0.0007933981,0.00006423492,0.00017896255,0.00057824445,0.0028604502,0.0010307869,0.5954458,0.09707918,0.30167794],"study_design_scores_gemma":[0.000020528181,0.000016878714,0.00010677363,0.0003218721,0.000031055068,0.00033246112,0.00007243024,0.00343062,0.0007929868,0.7153066,0.27953297,0.000034852008],"about_ca_topic_score_codex":0.002035397,"about_ca_topic_score_gemma":0.0020063156,"teacher_disagreement_score":0.057976782,"about_ca_system_score_codex":0.0023991992,"about_ca_system_score_gemma":0.002188111,"threshold_uncertainty_score":0.19395167},"labels":[],"label_agreement":null},{"id":"W189221645","doi":"","title":"Improved Inclusion-Exclusion for Valuations on Distributive Lattices.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Distributive property; Mathematics; Inclusion–exclusion principle; Inclusion (mineral); Pure mathematics; Social psychology; Psychology; Political science","score_opus":0.025633382983119634,"score_gpt":0.2662825039226755,"score_spread":0.24064912093955587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189221645","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.056958444,0.0014380661,0.87819964,0.0016527605,0.0008640455,0.00019401676,0.0006856166,0.0014888669,0.05851844],"genre_scores_gemma":[0.6551533,0.00074937916,0.31510788,0.00062100653,0.000674769,0.00022028976,0.0011926134,0.00065663876,0.025624141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962341,0.0011686436,0.00033815615,0.0004930933,0.0012515908,0.0005144472],"domain_scores_gemma":[0.99326575,0.003662309,0.00030535707,0.0013005906,0.00091939484,0.000546504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042914567,0.0007399713,0.0016874381,0.0016140031,0.0024401115,0.0046171574,0.0022776653,0.0010183419,0.010108974],"category_scores_gemma":[0.012434333,0.000555446,0.0017111965,0.0017882234,0.0034117184,0.011833951,0.005983849,0.0037666662,0.0020020162],"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.00024216787,0.0000970636,0.0004556207,0.0001309305,0.000027957249,0.000114363094,0.00026168613,0.0042865984,0.0013738179,0.9518679,0.005009812,0.03613202],"study_design_scores_gemma":[0.000041324947,0.000036516438,0.00015847712,0.000026238169,0.000025779802,0.00009736908,0.00007171143,0.019017816,0.0012778295,0.9705029,0.008721095,0.000022873577],"about_ca_topic_score_codex":0.0023121631,"about_ca_topic_score_gemma":0.0038622408,"teacher_disagreement_score":0.010108974,"about_ca_system_score_codex":0.0017921355,"about_ca_system_score_gemma":0.0017259044,"threshold_uncertainty_score":0.033817887},"labels":[],"label_agreement":null},{"id":"W1898747386","doi":"","title":"Only-knowing meets nonmonotonic modal logic","year":2012,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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 Toronto","funders":"","keywords":"Non-monotonic logic; Autoepistemic logic; Default logic; Rotation formalisms in three dimensions; Multimodal logic; Dynamic logic (digital electronics); Modal logic; Axiom; Circumscription; Normal modal logic; Computer science; Default; Accessibility relation; Artificial intelligence; Theoretical computer science; Modal operator; Modal; Description logic; Mathematics","score_opus":0.04601614073732518,"score_gpt":0.3090084260364157,"score_spread":0.2629922852990905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898747386","genre_codex":"methods","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.07372421,0.0027595335,0.6590946,0.008726518,0.00046965719,0.0002311285,0.0009116514,0.0010753666,0.2530074],"genre_scores_gemma":[0.8724671,0.0010733713,0.106355615,0.0012987835,0.00055247144,0.00017283825,0.00046924746,0.00010295301,0.017507521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981482,0.0004480064,0.0001574518,0.00049936085,0.0005117875,0.00023525851],"domain_scores_gemma":[0.99808973,0.0010136723,0.00013587902,0.00022920435,0.0004059365,0.00012557086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015803297,0.00055593037,0.00067415263,0.0008926041,0.0016650781,0.00247685,0.00092118647,0.0014488215,0.0043972083],"category_scores_gemma":[0.002180936,0.0004196149,0.00076518033,0.0006909733,0.0032563459,0.007912167,0.0020687527,0.0025646153,0.0006975719],"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.000016605092,0.0000114393615,0.00008396842,0.000037545873,0.0000067941774,0.0001372495,0.00018902663,0.00049023936,0.00063884864,0.99238366,0.0007857717,0.0052188444],"study_design_scores_gemma":[0.000010945747,0.0000120758905,0.00008705767,0.00000926812,0.000009623242,0.00015247337,0.00006197198,0.0068563176,0.000843179,0.982736,0.009210306,0.000010727661],"about_ca_topic_score_codex":0.0014478437,"about_ca_topic_score_gemma":0.0014459079,"teacher_disagreement_score":0.0043972083,"about_ca_system_score_codex":0.002066178,"about_ca_system_score_gemma":0.0010325708,"threshold_uncertainty_score":0.014991283},"labels":[],"label_agreement":null},{"id":"W19153916","doi":"10.1080/00048670802607154","title":"A framework for representing and solving NP search problems","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":91,"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":"Constraint satisfaction problem; Answer set programming; Constraint programming; Parameterized complexity; Computer science; Constraint satisfaction; Extension (predicate logic); Satisfiability; Boolean satisfiability problem; Set (abstract data type); Theoretical computer science; Solver; Strengths and weaknesses; Backtracking; Constraint (computer-aided design); Mathematical optimization; Programming language; Mathematics; Artificial intelligence; Algorithm; Stochastic programming","score_opus":0.20830229007824574,"score_gpt":0.3866366578885083,"score_spread":0.17833436781026257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19153916","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.0007786952,0.0005127194,0.9909423,0.0009927464,0.000063488675,0.00018246875,0.00017407074,0.0004901338,0.005863363],"genre_scores_gemma":[0.022389874,0.0008916196,0.97189856,0.00019811945,0.00008707107,0.00066580443,0.0004542288,0.00010909146,0.0033056175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600667,0.0017220571,0.0006417679,0.00047821147,0.0008550359,0.00029636908],"domain_scores_gemma":[0.99665654,0.0019815539,0.0002210736,0.0005954347,0.00040007438,0.00014536489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00543383,0.0021221763,0.0014822213,0.0028945394,0.0021357017,0.007674553,0.0061670803,0.0035607456,0.0111092925],"category_scores_gemma":[0.014259403,0.0010495131,0.0045598457,0.0037760788,0.0053040506,0.009001701,0.0056486027,0.004562002,0.0026875099],"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.000026689284,0.00003489647,0.00023967268,0.00034807043,0.00004682766,0.00017030707,0.0006262401,0.04760859,0.0003431354,0.8910618,0.0040566507,0.055437174],"study_design_scores_gemma":[0.000030968713,0.000026881024,0.00005751279,0.00016388277,0.000027003198,0.00013286472,0.00028260786,0.13214609,0.00027690278,0.82496816,0.041860156,0.000026954467],"about_ca_topic_score_codex":0.014509305,"about_ca_topic_score_gemma":0.01389455,"teacher_disagreement_score":0.014509305,"about_ca_system_score_codex":0.0025702862,"about_ca_system_score_gemma":0.004506437,"threshold_uncertainty_score":0.03716427},"labels":[],"label_agreement":null},{"id":"W1919787233","doi":"10.1007/978-3-540-89982-2_33","title":"Lparse Programs Revisited: Semantics and Representation of Aggregates","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Semantics (computer science); Well-founded semantics; Programming language; Stable model semantics; Representation (politics); Class (philosophy); Theoretical computer science; Operational semantics; Logic program; Formal semantics (linguistics); Program transformation; Logic programming; Denotational semantics; Artificial intelligence","score_opus":0.02597617840637696,"score_gpt":0.25780163860386535,"score_spread":0.2318254601974884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919787233","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.027589664,0.003062783,0.93967915,0.0035661752,0.00025714212,0.000050012506,0.00039817646,0.0012194719,0.02417743],"genre_scores_gemma":[0.48548016,0.0036147658,0.4834634,0.0011011782,0.00081146683,0.00025332923,0.001143572,0.0009120239,0.023220187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982577,0.0005509987,0.00018784958,0.00031872056,0.0005299434,0.00015472127],"domain_scores_gemma":[0.99746394,0.0009385388,0.00021346321,0.0008184879,0.00043939624,0.00012625392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147318,0.0005842424,0.0010961023,0.0013425141,0.0013200092,0.0087219365,0.0034541436,0.0021714442,0.005949216],"category_scores_gemma":[0.006059216,0.0007813169,0.0010804109,0.0043451353,0.004551196,0.015234666,0.0034747485,0.005709117,0.0010584192],"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.000021307802,0.000010702207,0.00008766519,0.000044196757,0.00000643978,0.000052788746,0.00040690321,0.0011827863,0.00040721474,0.981948,0.0016953711,0.0141366245],"study_design_scores_gemma":[0.000008419849,0.000009364024,0.00007103221,0.00003347443,0.000017572069,0.00010074401,0.00019472065,0.015680138,0.0008721961,0.9691739,0.013827766,0.000010613268],"about_ca_topic_score_codex":0.001999611,"about_ca_topic_score_gemma":0.0018603348,"teacher_disagreement_score":0.0087219365,"about_ca_system_score_codex":0.0014476107,"about_ca_system_score_gemma":0.0012307973,"threshold_uncertainty_score":0.01990217},"labels":[],"label_agreement":null},{"id":"W1931779745","doi":"","title":"Belief revision with sensing and fallible actions","year":2012,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto; Simon Fraser University","funders":"","keywords":"Belief revision; Action (physics); Relation (database); Computer science; Extension (predicate logic); Epistemology; State (computer science); Situation calculus; Complete information; Artificial intelligence; Cognitive science; Mathematical economics; Mathematics; Algorithm; Psychology; Philosophy; Data mining","score_opus":0.02700548499915358,"score_gpt":0.25307885274023767,"score_spread":0.22607336774108408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931779745","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.039580118,0.0014431424,0.9296212,0.003939356,0.00025044344,0.0001338131,0.00016335488,0.00049304776,0.02437551],"genre_scores_gemma":[0.86283314,0.00057631603,0.13026235,0.00049859734,0.00033228475,0.00017435956,0.00012298136,0.00005698139,0.0051429137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99129665,0.004024897,0.00059489213,0.0015116151,0.0018790568,0.0006928626],"domain_scores_gemma":[0.9804683,0.011937293,0.0018103606,0.0034913388,0.0016233323,0.00066942064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008663675,0.0011522131,0.0011828853,0.0019266272,0.0013049913,0.0043817353,0.002253576,0.0025185188,0.0039298767],"category_scores_gemma":[0.026133718,0.0008334717,0.0025059185,0.0011117158,0.0069883093,0.007674585,0.003974327,0.0042295023,0.00040620004],"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.00009049907,0.00002806663,0.00058840954,0.00012386282,0.00008532523,0.00033632916,0.0010898229,0.023519313,0.00058411947,0.95809406,0.00071858824,0.014741535],"study_design_scores_gemma":[0.00004026864,0.000033708944,0.00022747583,0.000031286112,0.00004280279,0.000117725125,0.0000952512,0.07209241,0.00036855388,0.9250017,0.0019147521,0.000033977212],"about_ca_topic_score_codex":0.0038898608,"about_ca_topic_score_gemma":0.0030495392,"teacher_disagreement_score":0.008663675,"about_ca_system_score_codex":0.0028825568,"about_ca_system_score_gemma":0.0015282553,"threshold_uncertainty_score":0.04581839},"labels":[],"label_agreement":null},{"id":"W1948672577","doi":"10.1109/cdc.1989.70090","title":"Classical and logic based regulator design and its complexity for partially observed automata","year":2003,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Canadian Institute for Advanced Research","funders":"","keywords":"Controllability; Finite-state machine; Automaton; State (computer science); Observability; Dynamical systems theory; Computer science; Mathematics; Terminal (telecommunication); Finite state; Algebra over a field; Theoretical computer science; Discrete mathematics; Algorithm; Applied mathematics; Pure mathematics","score_opus":0.16292171923187362,"score_gpt":0.2833770004477087,"score_spread":0.12045528121583507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948672577","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.028854439,0.0001790062,0.9659186,0.0005209107,0.000021422795,0.000046481866,0.00007587548,0.00019849528,0.004184731],"genre_scores_gemma":[0.87587565,0.00027519686,0.117731765,0.00018429737,0.00007441034,0.00025312748,0.00017777468,0.000044851276,0.0053828442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802566,0.00055365573,0.00011458514,0.00048983673,0.000650419,0.00016589944],"domain_scores_gemma":[0.9915366,0.0066247266,0.00061232486,0.00052882265,0.00055699854,0.00014054496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025013017,0.00046616746,0.0008136756,0.00046938373,0.0005771814,0.0025686522,0.0014640947,0.0011680529,0.0031388362],"category_scores_gemma":[0.008384013,0.0005396385,0.00087104854,0.0003913241,0.0021789176,0.00323201,0.001406566,0.0016605804,0.00023935849],"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.00017111273,0.000060218037,0.0006991169,0.00019283762,0.000051937088,0.00019089824,0.00025634668,0.3420126,0.004433557,0.6265856,0.00082428404,0.024521478],"study_design_scores_gemma":[0.000021454765,0.00002925597,0.00008304965,0.000008789723,0.000013900844,0.000025873636,0.000016423903,0.83408433,0.0012958404,0.16380982,0.00060129823,0.000010042814],"about_ca_topic_score_codex":0.002240365,"about_ca_topic_score_gemma":0.002258234,"teacher_disagreement_score":0.0031388362,"about_ca_system_score_codex":0.0025433819,"about_ca_system_score_gemma":0.001504006,"threshold_uncertainty_score":0.018453538},"labels":[],"label_agreement":null},{"id":"W1952406403","doi":"10.5555/2371116.2371126","title":"Towards an Ontology of Approximate Reason","year":2002,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"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 Manitoba","funders":"","keywords":"Assertion; Ontology; Context (archaeology); Object (grammar); Computer science; A priori and a posteriori; Mathematics; Epistemology; Artificial intelligence; Philosophy","score_opus":0.03307718618616286,"score_gpt":0.2549486071848239,"score_spread":0.22187142099866108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952406403","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.005919097,0.0017011676,0.9059964,0.006529739,0.00042196168,0.000094351846,0.00019249353,0.000275673,0.078869194],"genre_scores_gemma":[0.3385433,0.0035514033,0.63047016,0.0028513814,0.00089957076,0.0006107372,0.00069650734,0.0004432737,0.021933647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942275,0.002478765,0.00039953843,0.000670931,0.0018503388,0.0003729055],"domain_scores_gemma":[0.9960471,0.0016254593,0.00027098143,0.0009914471,0.0008146016,0.00025050744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063994713,0.00064499455,0.0009908029,0.0027054069,0.0030706981,0.006947275,0.0024391226,0.002989308,0.0042108707],"category_scores_gemma":[0.007562318,0.00084471045,0.002389726,0.0022452008,0.014459896,0.017756797,0.0054486804,0.0069780913,0.0010205057],"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.000002302656,0.0000040357218,0.000029375136,0.000012553189,0.0000022403535,0.000012861655,0.00027144657,0.00048002278,0.000058248308,0.9972819,0.0002929648,0.001552014],"study_design_scores_gemma":[0.0000048757556,0.000005287442,0.000059849204,0.000027886746,0.000004442908,0.000036194084,0.0002200129,0.004880843,0.000105414154,0.95822287,0.036425155,0.000007102475],"about_ca_topic_score_codex":0.0051687043,"about_ca_topic_score_gemma":0.002840059,"teacher_disagreement_score":0.006947275,"about_ca_system_score_codex":0.0047730156,"about_ca_system_score_gemma":0.0032340242,"threshold_uncertainty_score":0.034630835},"labels":[],"label_agreement":null},{"id":"W196063391","doi":"","title":"Knowledge Equivalence in Combined Action Theories.","year":2002,"lang":"en","type":"article","venue":"Edinburgh Research Explorer (University of Edinburgh)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":35,"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 Toronto","funders":"","keywords":"Correctness; Computer science; Equivalence (formal languages); Action (physics); Construct (python library); ENCODE; Knowledge representation and reasoning; Set (abstract data type); Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Discrete mathematics; Programming language","score_opus":0.16117341179951547,"score_gpt":0.329530641193846,"score_spread":0.16835722939433054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196063391","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.036035497,0.0014080849,0.87758505,0.0036709628,0.00023746687,0.00019740274,0.00024445594,0.0005142487,0.080106795],"genre_scores_gemma":[0.78768814,0.00075802486,0.20059507,0.0009101887,0.00027382458,0.00037808192,0.000528665,0.00015775776,0.008710269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9881579,0.0046275365,0.0007566204,0.001673539,0.0038530328,0.0009313787],"domain_scores_gemma":[0.988436,0.00780856,0.00074271456,0.0014969275,0.0011384696,0.00037731702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006940147,0.00075084297,0.00086710026,0.0033738648,0.0021912532,0.0045360434,0.0026040545,0.00253131,0.006872055],"category_scores_gemma":[0.016415492,0.00084384717,0.0032511249,0.0019821057,0.011531976,0.016022531,0.006813773,0.004781701,0.0007815068],"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.000011119462,0.000016906892,0.00015260412,0.000033326825,0.00002009287,0.00007961327,0.00033757786,0.001455454,0.00013045453,0.9922511,0.00025828058,0.005253517],"study_design_scores_gemma":[0.000012444272,0.000014355543,0.000096802796,0.00001866164,0.000021035059,0.000052228712,0.00008339616,0.0069421087,0.0003227394,0.989412,0.003016644,0.000007561716],"about_ca_topic_score_codex":0.003840841,"about_ca_topic_score_gemma":0.002409439,"teacher_disagreement_score":0.006940147,"about_ca_system_score_codex":0.0035436652,"about_ca_system_score_gemma":0.0016730679,"threshold_uncertainty_score":0.036703408},"labels":[],"label_agreement":null},{"id":"W1964362679","doi":"10.1016/j.jal.2015.02.004","title":"Robot location estimation in the situation calculus","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Formalism (music); Computer science; Situation calculus; Extension (predicate logic); Probability distribution; Robot; Artificial intelligence; Mathematics; Programming language; Statistics","score_opus":0.03803709147389608,"score_gpt":0.273853608544731,"score_spread":0.23581651707083492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964362679","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.02267075,0.00043139764,0.9671794,0.0008046099,0.00006451386,0.00003702381,0.00012686056,0.00031829602,0.008367138],"genre_scores_gemma":[0.7335306,0.0007331629,0.25903246,0.00017247415,0.00019205057,0.0000891526,0.00022268061,0.00010089238,0.005926544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972783,0.0007767228,0.00024604067,0.00055148377,0.0007968807,0.0003505561],"domain_scores_gemma":[0.9970041,0.0017702291,0.00024511036,0.00037037078,0.0004365291,0.00017366199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034679526,0.0006846253,0.0012494029,0.0019197619,0.0017218728,0.005373735,0.003001859,0.001607025,0.0038580857],"category_scores_gemma":[0.009690761,0.00096523843,0.0020780049,0.0020634248,0.0034971982,0.00949583,0.0037920862,0.002375687,0.000704555],"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.000101403006,0.000043269367,0.0006777918,0.000074417185,0.000049862043,0.00030204596,0.00040790226,0.046648733,0.0006311306,0.92907757,0.00097496464,0.021010851],"study_design_scores_gemma":[0.000019326219,0.000014803379,0.00011393181,0.00001805533,0.00004120144,0.00007901654,0.00007555532,0.1917299,0.00044234443,0.8058893,0.0015521214,0.000024552366],"about_ca_topic_score_codex":0.011858707,"about_ca_topic_score_gemma":0.0074535743,"teacher_disagreement_score":0.011858707,"about_ca_system_score_codex":0.0021791852,"about_ca_system_score_gemma":0.0019458252,"threshold_uncertainty_score":0.023579359},"labels":[],"label_agreement":null},{"id":"W1964542244","doi":"10.1007/s10601-008-9050-3","title":"Expressive power and abstraction in Essence","year":2008,"lang":"en","type":"article","venue":"Constraints","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abstraction; Expressive power; Power (physics); Computer science; Programming language; Epistemology; Philosophy; Physics","score_opus":0.015790789642622698,"score_gpt":0.23206316584982903,"score_spread":0.21627237620720632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964542244","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.029057764,0.006988967,0.79591256,0.0182049,0.00061960984,0.00008115686,0.00042993185,0.00059891475,0.14810623],"genre_scores_gemma":[0.80911714,0.0033050214,0.15953101,0.0033210304,0.0013266297,0.00035446935,0.00057598256,0.00037033283,0.022098348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945697,0.0020213933,0.0004375701,0.00095858815,0.0015766871,0.0004360018],"domain_scores_gemma":[0.9891214,0.0059220116,0.00041753412,0.0033660794,0.0008339596,0.00033896597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058149872,0.000832549,0.0012413971,0.0019326067,0.0021980926,0.008868664,0.0023922224,0.00240849,0.0068986285],"category_scores_gemma":[0.016986018,0.0009929333,0.0015724307,0.0017387749,0.018887006,0.02559199,0.006801116,0.007373695,0.0009669974],"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.0000066601333,0.0000044159337,0.00004666703,0.000024244804,0.000005306803,0.00001300077,0.00020515548,0.00028882571,0.00009442332,0.9964051,0.00040945684,0.002496774],"study_design_scores_gemma":[0.0000055008513,0.0000022328486,0.000023030492,0.000010779433,0.0000053496274,0.00002174285,0.000040178842,0.00061446405,0.00009468264,0.99520457,0.003973984,0.0000035069731],"about_ca_topic_score_codex":0.0022330275,"about_ca_topic_score_gemma":0.0014352669,"teacher_disagreement_score":0.008868664,"about_ca_system_score_codex":0.002248124,"about_ca_system_score_gemma":0.0014112407,"threshold_uncertainty_score":0.030752957},"labels":[],"label_agreement":null},{"id":"W1965788386","doi":"","title":"Actions and resources in epistemic logic","year":2006,"lang":"en","type":"dissertation","venue":"ePrints Soton (University of Southampton)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Soundness; Epistemic modal logic; Dynamic logic (digital electronics); Multimodal logic; Proof calculus; Computer science; Sequent; Modal logic; Modal operator; Sequent calculus; Epistemology; Description logic; Calculus (dental); Natural deduction; Mathematics; Theoretical computer science; Programming language; Modal; Mathematical proof; Philosophy; Medicine","score_opus":0.014953256844352088,"score_gpt":0.21801015107146615,"score_spread":0.20305689422711407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965788386","genre_codex":"methods","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.036486484,0.006753905,0.8155504,0.01315841,0.00048675213,0.00012235342,0.0003103897,0.00059731124,0.12653396],"genre_scores_gemma":[0.7903868,0.004635224,0.18352464,0.0021955029,0.0011076434,0.0003465825,0.00034434104,0.00016054073,0.0172988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550325,0.0020708046,0.00034126444,0.00066834054,0.0010504881,0.00036583745],"domain_scores_gemma":[0.9952172,0.0032416217,0.00029148857,0.0005409577,0.00048113547,0.00022763283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051030177,0.0008051444,0.00065058493,0.002410372,0.0026912726,0.00611658,0.0013958513,0.0022060291,0.0036971187],"category_scores_gemma":[0.0058261016,0.00063239207,0.001771361,0.0019198131,0.014865743,0.015043957,0.0039162575,0.0045099985,0.00069420825],"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.0000035456,0.000003821501,0.000029275621,0.000016374373,0.0000032041298,0.000025180763,0.00016772716,0.00067737955,0.00007997707,0.9977344,0.00016831234,0.0010907478],"study_design_scores_gemma":[0.000004528973,0.0000043659,0.000019056146,0.000012940252,0.0000047960784,0.000017019085,0.000046664343,0.002118625,0.0001111649,0.99409926,0.0035562138,0.0000053154777],"about_ca_topic_score_codex":0.0038640387,"about_ca_topic_score_gemma":0.0016730074,"teacher_disagreement_score":0.00611658,"about_ca_system_score_codex":0.0043377127,"about_ca_system_score_gemma":0.0023524102,"threshold_uncertainty_score":0.031472445},"labels":[],"label_agreement":null},{"id":"W1966325497","doi":"10.1023/a:1026520223346","title":"Remarks on the Modal Logic of Henry Bradford Smith","year":2000,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Modal logic; Possible world; Modality (human–computer interaction); Modal; Philosophy; Epistemology; S5; Beneficiary; Philosophical logic; Accessibility relation; Computer science; Artificial intelligence; Law; Political science","score_opus":0.03128535650661957,"score_gpt":0.25749640876098606,"score_spread":0.2262110522543665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966325497","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026359458,0.032752406,0.009363064,0.76631004,0.020985112,0.000017656099,0.00021176884,0.00015206834,0.16757192],"genre_scores_gemma":[0.16716585,0.033885315,0.0120519465,0.48283604,0.08923145,0.00013409027,0.00016670648,0.0003530284,0.21417561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982108,0.0006991516,0.00006556565,0.00030725976,0.00054307206,0.00017418253],"domain_scores_gemma":[0.99456656,0.0038615454,0.00014292257,0.00029999326,0.00084547093,0.000283614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046606082,0.0005535513,0.00093389733,0.0013527271,0.0041913814,0.0033847338,0.0015347594,0.0041614296,0.013193214],"category_scores_gemma":[0.011352907,0.00055818114,0.0006465751,0.0011401735,0.008647831,0.00997171,0.0020244238,0.011504288,0.0032858881],"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.000038457212,0.00001681767,0.00006747333,0.000054615783,0.000011481623,0.000053315867,0.00027248525,0.00019841429,0.00007428525,0.7252501,0.2669158,0.00704654],"study_design_scores_gemma":[0.000031348038,0.0000087360495,0.00020390312,0.00011543815,0.0000111738755,0.000043132957,0.00021869637,0.00020787907,0.00020357563,0.52900463,0.46992147,0.000030040983],"about_ca_topic_score_codex":0.014506006,"about_ca_topic_score_gemma":0.009236943,"teacher_disagreement_score":0.014506006,"about_ca_system_score_codex":0.004611787,"about_ca_system_score_gemma":0.0015512569,"threshold_uncertainty_score":0.04413569},"labels":[],"label_agreement":null},{"id":"W1968226057","doi":"10.1016/j.jlamp.2016.02.003","title":"Relational and algebraic methods in computer science","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rotation formalisms in three dimensions; Algebraic number; Computer science; Categorical variable; Computation; Algebra over a field; Modal; Theoretical computer science; Mathematics; Programming language; Pure mathematics","score_opus":0.06523853055516791,"score_gpt":0.37848797629667275,"score_spread":0.3132494457415048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968226057","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.0071707885,0.083286636,0.8045093,0.025024084,0.004421042,0.00010038618,0.00036938238,0.0005311786,0.074587114],"genre_scores_gemma":[0.28525966,0.067999475,0.5963473,0.0042442814,0.012612215,0.0005645092,0.0006758385,0.00040822968,0.031888414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942842,0.0026087943,0.0006089384,0.0006423815,0.0016796539,0.00017590933],"domain_scores_gemma":[0.98400253,0.01178405,0.00051362807,0.0019248136,0.0014398134,0.00033509848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007471891,0.000938281,0.0014989768,0.0033647746,0.002081023,0.008437741,0.0018821321,0.001903619,0.010462212],"category_scores_gemma":[0.01883166,0.0007171083,0.0012930182,0.004135635,0.010155838,0.017115092,0.0032834026,0.006468642,0.0018123826],"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.0000049797136,0.000011655889,0.00009522404,0.000088506175,0.000010933145,0.000014913853,0.00014290705,0.0002565071,0.000050358893,0.9860941,0.0025187468,0.010711229],"study_design_scores_gemma":[0.000009645869,0.000006228363,0.00006768427,0.00005297139,0.0000094871975,0.000041117473,0.000061976854,0.0016678794,0.00007365425,0.975206,0.022795508,0.000007773591],"about_ca_topic_score_codex":0.0023591106,"about_ca_topic_score_gemma":0.0017452161,"teacher_disagreement_score":0.010462212,"about_ca_system_score_codex":0.0025288549,"about_ca_system_score_gemma":0.0029218325,"threshold_uncertainty_score":0.039515615},"labels":[],"label_agreement":null},{"id":"W1971508608","doi":"10.1016/j.artint.2004.11.004","title":"Partition-based logical reasoning for first-order and propositional theories","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Soundness; Axiom; Computer science; Theoretical computer science; Completeness (order theory); Propositional calculus; Propositional formula; Automated reasoning; Satisfiability; Propositional variable; Mathematics; Algorithm; Description logic; Intermediate logic; Programming language","score_opus":0.0351189575418359,"score_gpt":0.2849085808585126,"score_spread":0.2497896233166767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971508608","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.022487162,0.0011755353,0.9627589,0.0013419869,0.00015112918,0.00015543732,0.0004877635,0.0005780978,0.010863933],"genre_scores_gemma":[0.43393305,0.0011833393,0.55518764,0.0005448168,0.00025946554,0.00031971023,0.002289212,0.00020846783,0.006074312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485636,0.0019477882,0.0003563121,0.0006024324,0.0018140249,0.00042306632],"domain_scores_gemma":[0.9829474,0.012798232,0.00064163696,0.0019402802,0.001253648,0.00041872638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051815338,0.0010986667,0.0019019924,0.0039124554,0.0028109418,0.0065982332,0.004096502,0.0020405971,0.008725577],"category_scores_gemma":[0.024413288,0.0012499706,0.004454459,0.0037351751,0.0046337717,0.015418579,0.0053529483,0.0052304515,0.0009243296],"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.00015500374,0.000063918684,0.00057962746,0.0002084453,0.00012995972,0.00009022751,0.0006294482,0.02083847,0.000395898,0.93872625,0.003897667,0.034285147],"study_design_scores_gemma":[0.000025229449,0.000009629832,0.00010599833,0.000031634227,0.000050521998,0.00004185654,0.000093327384,0.049256623,0.00050185446,0.94754434,0.002326966,0.000012013561],"about_ca_topic_score_codex":0.008237594,"about_ca_topic_score_gemma":0.011433064,"teacher_disagreement_score":0.008725577,"about_ca_system_score_codex":0.0036053038,"about_ca_system_score_gemma":0.0020589689,"threshold_uncertainty_score":0.029190004},"labels":[],"label_agreement":null},{"id":"W1972571280","doi":"10.1016/j.ijar.2011.06.009","title":"Abnormality and randomness","year":2011,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Rotation formalisms in three dimensions; Property (philosophy); Class (philosophy); Circumscription; Certainty; Epistemology; Inference; Mathematical economics; Abnormality; Computer science; Mathematics; Artificial intelligence; Philosophy; Psychology; Statistics; Social psychology","score_opus":0.023255332823229283,"score_gpt":0.25086980010823196,"score_spread":0.22761446728500268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972571280","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.2849082,0.0060975566,0.6016383,0.0174688,0.0008046871,0.00012134467,0.00078496773,0.0008703751,0.087305665],"genre_scores_gemma":[0.96465755,0.0009933966,0.025350306,0.00061695196,0.0006364298,0.000085878135,0.00035525655,0.0001505411,0.0071537616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99389136,0.002037232,0.00046569083,0.0012552936,0.001804619,0.00054577703],"domain_scores_gemma":[0.9656982,0.023488596,0.0024493097,0.0052523576,0.0021673187,0.0009442254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043160054,0.000583368,0.0023840975,0.0032965105,0.002085619,0.0055097104,0.0020481318,0.0029308468,0.005973438],"category_scores_gemma":[0.038580976,0.0006103651,0.0020418637,0.002112584,0.011368819,0.01033214,0.0045127585,0.005194698,0.0006104317],"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.000078100195,0.000015871861,0.0020186286,0.000044753513,0.00003647276,0.00018527996,0.00017603324,0.0071900063,0.00040212626,0.98128766,0.0011409164,0.0074242153],"study_design_scores_gemma":[0.00001370977,0.000014562275,0.00042698762,0.000009144363,0.000015566215,0.00022093827,0.000048127084,0.012664487,0.00020876405,0.98505265,0.0013095604,0.000015547846],"about_ca_topic_score_codex":0.0012862387,"about_ca_topic_score_gemma":0.0008033384,"teacher_disagreement_score":0.005973438,"about_ca_system_score_codex":0.0018609284,"about_ca_system_score_gemma":0.0011270258,"threshold_uncertainty_score":0.02282548},"labels":[],"label_agreement":null},{"id":"W197285568","doi":"","title":"Bounded epistemic situation calculus theories","year":2013,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"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","funders":"","keywords":"Bounded function; Situation calculus; Decidability; Class (philosophy); Action theory (sociology); Mathematics; Domain (mathematical analysis); Epistemic modal logic; Calculus (dental); Discrete mathematics; Computer science; Epistemology; Theoretical computer science; Multimodal logic; Philosophy; Artificial intelligence; Mathematical analysis","score_opus":0.035395854363774425,"score_gpt":0.2861536901411145,"score_spread":0.2507578357773401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197285568","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.017343469,0.0013570826,0.90209544,0.0018469088,0.00020052641,0.00014489566,0.0003687162,0.000612481,0.0760305],"genre_scores_gemma":[0.6933082,0.0016152465,0.28895718,0.00092583423,0.00043083445,0.00055341085,0.0007213992,0.00013552542,0.013352422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995152,0.0015667339,0.00040515143,0.00071682193,0.0014742969,0.0006849621],"domain_scores_gemma":[0.99049056,0.0058490373,0.0006653425,0.0013027253,0.0011319735,0.000560368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004335545,0.001024791,0.0008190532,0.0022393474,0.0021724447,0.005136939,0.0024286278,0.0017284943,0.0055298023],"category_scores_gemma":[0.010981882,0.00064074126,0.0018062253,0.0016359035,0.0054893736,0.009251132,0.004180465,0.004069343,0.0010284724],"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.000008106967,0.000008393851,0.00006348758,0.000019725598,0.0000057987177,0.00005722212,0.0001589458,0.0017287127,0.00015199887,0.99539304,0.00034007567,0.0020644767],"study_design_scores_gemma":[0.00001488673,0.000007675641,0.000049426806,0.000027125194,0.000012039958,0.000053942473,0.00006680409,0.014401915,0.00037724574,0.9771309,0.007847558,0.000010540358],"about_ca_topic_score_codex":0.0034598098,"about_ca_topic_score_gemma":0.0016242107,"teacher_disagreement_score":0.0055298023,"about_ca_system_score_codex":0.0023324448,"about_ca_system_score_gemma":0.0020086495,"threshold_uncertainty_score":0.022928774},"labels":[],"label_agreement":null},{"id":"W1972866855","doi":"10.1007/s10472-011-9237-y","title":"Weight constraint programs with evaluable functions","year":2010,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stable model semantics; Answer set programming; Constraint programming; Constraint logic programming; Constraint satisfaction; Semantics (computer science); Computer science; Context (archaeology); Logic programming; Constraint (computer-aided design); Programming language; Set (abstract data type); Constraint satisfaction problem; Domain (mathematical analysis); Theoretical computer science; Mathematical optimization; Operational semantics; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.10151281518515387,"score_gpt":0.31877689055681596,"score_spread":0.2172640753716621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972866855","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.034363277,0.00030203568,0.93636024,0.0011900214,0.00012347018,0.00013070408,0.0002751682,0.0006211067,0.026633987],"genre_scores_gemma":[0.5020003,0.0006541316,0.46426514,0.0004391257,0.00030330778,0.0004101131,0.0006994082,0.00047993832,0.030748645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716276,0.0010075221,0.0001608221,0.00037634387,0.0009317541,0.0003608552],"domain_scores_gemma":[0.9935389,0.0045960485,0.00033358452,0.0005972465,0.0006910931,0.00024306707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035731767,0.0010268487,0.00081606786,0.0015496992,0.0008483766,0.0034373165,0.0020968586,0.001340503,0.007340689],"category_scores_gemma":[0.016343057,0.0007085179,0.0009776661,0.0025676726,0.0023260985,0.007843645,0.0028655708,0.003422974,0.0008112044],"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.000109905544,0.00008244186,0.00030917246,0.000104110375,0.000036382182,0.00009134083,0.00016787882,0.024164034,0.0010580985,0.92912614,0.0026297783,0.042120706],"study_design_scores_gemma":[0.000034492517,0.000018315519,0.00006918813,0.00002481057,0.000028327184,0.000034490608,0.00003451624,0.10446663,0.0012135643,0.889397,0.0046644486,0.000014155889],"about_ca_topic_score_codex":0.0027703347,"about_ca_topic_score_gemma":0.0042554075,"teacher_disagreement_score":0.007340689,"about_ca_system_score_codex":0.0016920721,"about_ca_system_score_gemma":0.001385224,"threshold_uncertainty_score":0.024557114},"labels":[],"label_agreement":null},{"id":"W1973144381","doi":"10.1007/s11245-006-9005-5","title":"Abductive reasoning in neural-symbolic systems","year":2007,"lang":"en","type":"article","venue":"Topoi","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Abductive reasoning; Computer science; Artificial intelligence; Artificial neural network; Connectionism; Deductive reasoning; Machine learning","score_opus":0.013499558192329498,"score_gpt":0.2532723034401351,"score_spread":0.23977274524780562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973144381","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.059230275,0.0025680843,0.9157963,0.0029676293,0.00009670346,0.00006080919,0.0002804868,0.00090192823,0.018097833],"genre_scores_gemma":[0.8398116,0.0014776376,0.15367901,0.0002266077,0.000109218294,0.00007554919,0.0003653791,0.00004706169,0.0042078784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871194,0.00046365568,0.00011627452,0.00017090008,0.00042484712,0.00011245504],"domain_scores_gemma":[0.9949818,0.0039103134,0.00020854089,0.0004354684,0.00036953142,0.00009437525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001976025,0.00040994695,0.0006977112,0.0010652042,0.00082595064,0.0032539293,0.0018079507,0.0011786636,0.0046479926],"category_scores_gemma":[0.010025022,0.00047244196,0.0007665776,0.0012694909,0.003563784,0.0062555154,0.0019763224,0.0022358745,0.0004091817],"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.00018656524,0.00009793587,0.0014256116,0.00042982196,0.0001336869,0.00028606344,0.00069626974,0.15856059,0.0015216524,0.70999104,0.0024670772,0.12420373],"study_design_scores_gemma":[0.000016555055,0.000005732645,0.00011101936,0.000024463496,0.000018676346,0.000030815063,0.000055929824,0.21466877,0.0007143052,0.7832031,0.0011426485,0.00000802775],"about_ca_topic_score_codex":0.0067046415,"about_ca_topic_score_gemma":0.007219088,"teacher_disagreement_score":0.0067046415,"about_ca_system_score_codex":0.0016004079,"about_ca_system_score_gemma":0.0013148823,"threshold_uncertainty_score":0.015549123},"labels":[],"label_agreement":null},{"id":"W1975880448","doi":"10.1145/502090.502100","title":"Logics with aggregate operators","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":74,"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 Toronto; Bell (Canada)","funders":"","keywords":"Aggregate (composite); Rotation formalisms in three dimensions; Computer science; Class (philosophy); Query language; Set (abstract data type); Theoretical computer science; Relation (database); Deductive database; Mathematics; Programming language; Database; Artificial intelligence","score_opus":0.018722680616357477,"score_gpt":0.2368956651088596,"score_spread":0.2181729844925021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975880448","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.025920669,0.0008149419,0.9394845,0.0016813958,0.0001585314,0.00013143092,0.00032462322,0.0009415688,0.030542348],"genre_scores_gemma":[0.43729764,0.0013000469,0.5461806,0.0017450186,0.0007502301,0.0003418438,0.0006140641,0.00025237506,0.011518159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958884,0.0011259172,0.00040805835,0.0008175395,0.0013036827,0.00045647577],"domain_scores_gemma":[0.9938075,0.0036623885,0.00067407225,0.0009211595,0.00057022274,0.00036463118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039052314,0.0010156177,0.0007517916,0.0018730351,0.0021095523,0.004282627,0.002292642,0.0012470025,0.004313672],"category_scores_gemma":[0.008460006,0.0008420833,0.00299367,0.0029226453,0.0045084674,0.013112376,0.0048596053,0.003951532,0.0007612943],"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.00003540987,0.00003409162,0.00033009046,0.00010473845,0.00003010762,0.00014578109,0.000379855,0.0049909884,0.001344933,0.973257,0.0012151044,0.018131811],"study_design_scores_gemma":[0.000026253409,0.000044331893,0.00014542094,0.000033780132,0.000071898365,0.00021417857,0.00011287988,0.024153672,0.0022160262,0.95274955,0.020207051,0.000025018277],"about_ca_topic_score_codex":0.002966114,"about_ca_topic_score_gemma":0.002415497,"teacher_disagreement_score":0.004313672,"about_ca_system_score_codex":0.002341091,"about_ca_system_score_gemma":0.0012542928,"threshold_uncertainty_score":0.020653129},"labels":[],"label_agreement":null},{"id":"W1976132254","doi":"10.1145/937555.937556","title":"A dynamic approach to characterizing termination of general logic programs","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":23,"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; University of Alberta","funders":"","keywords":"Prolog; Computer science; Dynamic logic (digital electronics); Logic program; Key (lock); Theoretical computer science; Programming language; Logic programming; Tree (set theory); Algorithm; Mathematics","score_opus":0.030589214255365874,"score_gpt":0.2715346414251692,"score_spread":0.24094542716980333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976132254","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.032530617,0.00030215795,0.9600396,0.00024433306,0.00001954878,0.00009409571,0.00017289199,0.00038915506,0.0062075085],"genre_scores_gemma":[0.59720534,0.0005872936,0.39587766,0.00027232582,0.00015938203,0.0003911329,0.0007236552,0.0003774174,0.0044058003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613994,0.00079313107,0.00035162317,0.00075606536,0.0015193338,0.00043992736],"domain_scores_gemma":[0.99260783,0.0037005676,0.0009702536,0.0012278062,0.0011043551,0.00038922857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033035085,0.00094199023,0.00082230644,0.003238733,0.0013092845,0.0020399457,0.0022766471,0.0012602973,0.0023596303],"category_scores_gemma":[0.008243034,0.0006653008,0.0013553294,0.0018982955,0.0046673813,0.007413414,0.003443817,0.0035099823,0.0003602813],"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.0001742777,0.000119263976,0.004104764,0.00028962287,0.00005879783,0.0005551823,0.000952236,0.085297555,0.019529203,0.8302246,0.0013262223,0.057368282],"study_design_scores_gemma":[0.000033511325,0.00010183149,0.0009435399,0.00006227821,0.000054528722,0.00049102254,0.00013214469,0.3041022,0.008047829,0.6755745,0.010399201,0.00005740227],"about_ca_topic_score_codex":0.0015540954,"about_ca_topic_score_gemma":0.0012947287,"teacher_disagreement_score":0.0033035085,"about_ca_system_score_codex":0.0026071277,"about_ca_system_score_gemma":0.0012005852,"threshold_uncertainty_score":0.01891607},"labels":[],"label_agreement":null},{"id":"W1976639815","doi":"10.1016/s0004-3702(00)00049-7","title":"Expressing preferences in default logic","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"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; Default; Default rule; Non-monotonic logic; Preference; Computer science; Context (archaeology); Mathematical economics; Representation (politics); Artificial intelligence; Mathematics; Economics; Multimodal logic; Autoepistemic logic; Microeconomics; Finance","score_opus":0.07587255919728449,"score_gpt":0.30667607919206763,"score_spread":0.23080351999478316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976639815","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.06952889,0.0010218752,0.8812259,0.0038975894,0.00021403731,0.00009734021,0.00058980315,0.00058618176,0.042838488],"genre_scores_gemma":[0.7949466,0.0007553194,0.19555561,0.0008126902,0.00021751071,0.00012930503,0.0006662,0.00011428293,0.0068024048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996403,0.0018626646,0.00028681994,0.00040707953,0.0007383859,0.000302107],"domain_scores_gemma":[0.9957318,0.0027721506,0.0002464471,0.0005676368,0.0004635515,0.00021851188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059821303,0.00048171653,0.0006324466,0.00095404877,0.0010609799,0.0043431427,0.0016334048,0.0014842906,0.004883415],"category_scores_gemma":[0.010887323,0.0005368625,0.0008819414,0.0013270268,0.002133853,0.010001212,0.0022045875,0.0026174022,0.0008328981],"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.00014779698,0.000052410243,0.00046099845,0.00007553757,0.000026442041,0.00014371992,0.000444326,0.005038447,0.000971017,0.96615523,0.0028404554,0.023643626],"study_design_scores_gemma":[0.00002392762,0.000010929182,0.000063588355,0.000020512865,0.00001625765,0.000056594967,0.00008831738,0.022831876,0.0005851555,0.97358197,0.0027103608,0.000010469875],"about_ca_topic_score_codex":0.0013559937,"about_ca_topic_score_gemma":0.0022975893,"teacher_disagreement_score":0.0059821303,"about_ca_system_score_codex":0.0016689913,"about_ca_system_score_gemma":0.00076219183,"threshold_uncertainty_score":0.031636894},"labels":[],"label_agreement":null},{"id":"W1977208552","doi":"10.1145/383779.383780","title":"On knowledge-based programming with sensing in the situation calculus","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":88,"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 Toronto","funders":"","keywords":"Axiom; Computer science; Interpreter; Situation calculus; Modality (human–computer interaction); Artificial intelligence; Programming language; Mathematics","score_opus":0.029458100788382326,"score_gpt":0.2759510668570427,"score_spread":0.24649296606866036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977208552","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.010945709,0.00044993902,0.9678861,0.0015591499,0.000085733096,0.00014577321,0.00010769267,0.0008766289,0.017943293],"genre_scores_gemma":[0.3524406,0.0010907184,0.6324988,0.0010232739,0.0003144611,0.00064818375,0.0003076454,0.00042903353,0.011247322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975038,0.0009829958,0.00013901325,0.0003688802,0.00062509486,0.00038015007],"domain_scores_gemma":[0.9976265,0.0015713106,0.00018094749,0.00027278514,0.00015765731,0.00019069189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032240546,0.0012682152,0.0008777254,0.0011191815,0.0016439963,0.0040639513,0.0026520642,0.0017986901,0.0050006136],"category_scores_gemma":[0.0058759693,0.0008270426,0.0024063932,0.0015687615,0.009181267,0.008354681,0.0046421937,0.0041133035,0.0008704437],"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.00004494725,0.00004188645,0.00015736232,0.00008450749,0.00001659175,0.00017871392,0.00065224495,0.0137362685,0.0005670081,0.9735171,0.0007514671,0.0102518005],"study_design_scores_gemma":[0.00003004145,0.00003156699,0.00007121809,0.00004094409,0.000022849972,0.00008899376,0.00008458213,0.041550376,0.0007819063,0.9497699,0.0075065726,0.000021002577],"about_ca_topic_score_codex":0.005060987,"about_ca_topic_score_gemma":0.0047918796,"teacher_disagreement_score":0.005060987,"about_ca_system_score_codex":0.0023253872,"about_ca_system_score_gemma":0.002148293,"threshold_uncertainty_score":0.017050683},"labels":[],"label_agreement":null},{"id":"W1981270069","doi":"10.1016/j.artint.2015.02.005","title":"Semantical considerations on multiagent only knowing","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Non-monotonic logic; Propositional calculus; Fragment (logic); Semantics (computer science); Autoepistemic logic; Monotonic function; Artificial intelligence; Knowledge base; Theoretical computer science; Description logic; Algorithm; Mathematics; Programming language; Multimodal logic","score_opus":0.15193001930258454,"score_gpt":0.33450861366739076,"score_spread":0.18257859436480622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981270069","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.040080633,0.0037725843,0.3472319,0.050574277,0.0009258744,0.00015225947,0.00051679695,0.00019363049,0.5565521],"genre_scores_gemma":[0.91762316,0.0014245982,0.05773327,0.0036299943,0.0014279436,0.00027123292,0.00036366694,0.00009689119,0.017429188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99465203,0.0021669439,0.0004514936,0.00090448983,0.0012838694,0.0005410841],"domain_scores_gemma":[0.9890515,0.0064246305,0.0004931754,0.0022318223,0.0012597874,0.00053898164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006665824,0.0006347434,0.0012307644,0.0023912962,0.0051083756,0.007967342,0.0026471247,0.006148888,0.010495894],"category_scores_gemma":[0.012187776,0.0009179845,0.002197093,0.0016224928,0.013184148,0.027178561,0.0051863687,0.0074923118,0.001044178],"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.0000036157842,0.00000459077,0.00001678667,0.000008569746,0.0000025968518,0.000019217949,0.000055786502,0.00014281602,0.000014855963,0.998985,0.00024506697,0.0005010757],"study_design_scores_gemma":[0.0000040287123,0.000002528438,0.000018596611,0.000007519796,0.0000040158316,0.000025868005,0.000031848667,0.0006906903,0.000034843815,0.9978206,0.0013569742,0.0000025790403],"about_ca_topic_score_codex":0.0028192208,"about_ca_topic_score_gemma":0.0029457314,"teacher_disagreement_score":0.010495894,"about_ca_system_score_codex":0.0036123728,"about_ca_system_score_gemma":0.0016840853,"threshold_uncertainty_score":0.03525269},"labels":[],"label_agreement":null},{"id":"W1982395595","doi":"10.1007/s11229-009-9552-6","title":"Dynamic epistemic logic with branching temporal structures","year":2009,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Epistemic modal logic; Dynamic logic (digital electronics); Multimodal logic; Philosophy of language; Extension (predicate logic); Computer science; Epistemology; Philosophy of science; Temporal logic; Modal logic; Doxastic logic; Philosophy of logic; Description logic; Metaphysics; Artificial intelligence; Philosophy; Programming language","score_opus":0.008880271397147341,"score_gpt":0.23740698648945543,"score_spread":0.2285267150923081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982395595","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.015291816,0.0010714063,0.933665,0.002834858,0.00017438614,0.00007292327,0.0003683708,0.0006702701,0.04585096],"genre_scores_gemma":[0.52667236,0.001392629,0.45341298,0.0005838285,0.00031012457,0.00019577505,0.0010601248,0.00031874437,0.016053416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725455,0.0009892507,0.00025928332,0.0005870103,0.0007121155,0.0001977577],"domain_scores_gemma":[0.9920542,0.005570574,0.00041195427,0.0010573334,0.0006161998,0.00028987683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041349027,0.0009016293,0.0007876468,0.0020767162,0.0017386235,0.0054945354,0.0019700318,0.0019726183,0.012175181],"category_scores_gemma":[0.014379976,0.000970055,0.0016492859,0.0022009632,0.0047038696,0.016343271,0.0045341384,0.004234649,0.0015597028],"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.000033474895,0.000018303588,0.00006769005,0.000049216833,0.000010465635,0.00007211207,0.00015330814,0.0039976235,0.000411895,0.9864094,0.0007802805,0.007996215],"study_design_scores_gemma":[0.000013151447,0.0000039105516,0.000011177861,0.00001902797,0.000009293358,0.00003046457,0.000030754116,0.011531745,0.0004989504,0.9848098,0.0030358771,0.0000059378026],"about_ca_topic_score_codex":0.0013794117,"about_ca_topic_score_gemma":0.0015291781,"teacher_disagreement_score":0.012175181,"about_ca_system_score_codex":0.0032903526,"about_ca_system_score_gemma":0.0020774603,"threshold_uncertainty_score":0.04073},"labels":[],"label_agreement":null},{"id":"W1984275625","doi":"10.1007/s11098-005-2982-1","title":"General Terms as Rigid Designators","year":2006,"lang":"en","type":"article","venue":"Philosophical Studies","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Philosophy of language; Philosophy of mind; Philosophy; Metaphysics; Epistemology; Economics","score_opus":0.040939549697687795,"score_gpt":0.2923552745027171,"score_spread":0.2514157248050293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984275625","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.024417419,0.008268978,0.7906627,0.016429652,0.00072251697,0.0002111802,0.00056493306,0.0009574337,0.15776509],"genre_scores_gemma":[0.6725889,0.005841655,0.27430815,0.003458811,0.0011794611,0.00089890335,0.0011538428,0.0013259944,0.039244253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98727125,0.0076201614,0.0010992666,0.0016583367,0.001626671,0.00072434853],"domain_scores_gemma":[0.9811131,0.009523621,0.0011213046,0.006009363,0.0016767313,0.00055596896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009376149,0.0012534471,0.0015122549,0.0035867111,0.0039974595,0.011674052,0.0033662461,0.004671016,0.012334299],"category_scores_gemma":[0.024060784,0.001874429,0.0019746658,0.0035755,0.027861254,0.03710908,0.0076420256,0.008752128,0.0037507976],"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.0000046024684,0.0000017739155,0.00002439689,0.000020312698,0.000002385146,0.0000075654407,0.0002933486,0.00008939634,0.00005582975,0.9979001,0.00039287543,0.0012072966],"study_design_scores_gemma":[0.000004273563,0.0000022562015,0.000014834375,0.000013347685,0.000005843519,0.000015023229,0.00008092388,0.00026867335,0.00007189636,0.99324167,0.006277638,0.0000036823062],"about_ca_topic_score_codex":0.0014665031,"about_ca_topic_score_gemma":0.0013160312,"teacher_disagreement_score":0.012334299,"about_ca_system_score_codex":0.0035963627,"about_ca_system_score_gemma":0.0019005012,"threshold_uncertainty_score":0.049586415},"labels":[],"label_agreement":null},{"id":"W1984778493","doi":"10.1016/j.datak.2010.01.005","title":"The consistency extractor system: Answer set programs for consistent query answering in databases","year":2010,"lang":"en","type":"article","venue":"Data & Knowledge Engineering","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Datalog; Answer set programming; Database theory; Consistency (knowledge bases); Extractor; Programming language; Relational database; Deductive database; Set (abstract data type); Information retrieval; Database; Artificial intelligence","score_opus":0.055622060533341455,"score_gpt":0.2879527423906523,"score_spread":0.23233068185731087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984778493","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.00322614,0.00017481594,0.9799968,0.00045840518,0.000030370806,0.00017760006,0.00066135486,0.014592692,0.00068192923],"genre_scores_gemma":[0.075745046,0.00035356008,0.91466457,0.00066744536,0.00013718671,0.00049894326,0.0028572853,0.0028106878,0.0022653602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923626,0.0024571433,0.00076646794,0.0010325984,0.002982114,0.00039904678],"domain_scores_gemma":[0.98650163,0.009328169,0.000618442,0.0020974213,0.0012432856,0.00021106686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010010423,0.0013638715,0.0022853294,0.0024639326,0.0012071696,0.004572512,0.005496748,0.0027415676,0.008407577],"category_scores_gemma":[0.0319539,0.0019208282,0.0021670319,0.0021616009,0.002805467,0.009835663,0.00582619,0.0046742735,0.0022660238],"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.0016901261,0.0006278694,0.0043836236,0.0015299949,0.00043470095,0.0005523483,0.0014852867,0.041137077,0.017221224,0.21854225,0.06872012,0.64367545],"study_design_scores_gemma":[0.0007000509,0.00027331267,0.0009731199,0.00027715354,0.00048975984,0.00042243622,0.00035018005,0.60529876,0.054335535,0.2889946,0.04770012,0.0001849462],"about_ca_topic_score_codex":0.0031389706,"about_ca_topic_score_gemma":0.0036620395,"teacher_disagreement_score":0.010010423,"about_ca_system_score_codex":0.0010650404,"about_ca_system_score_gemma":0.003533918,"threshold_uncertainty_score":0.052940786},"labels":[],"label_agreement":null},{"id":"W1985147723","doi":"10.1007/s001990100194","title":"Minimal belief change, Pareto-optimality and logical consequence","year":2002,"lang":"en","type":"article","venue":"Economic Theory","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Axiom; Representation theorem; Mathematical economics; Identity (music); Belief structure; Mathematics; Non-monotonic logic; Computer science; Epistemology; Artificial intelligence; Discrete mathematics; Philosophy","score_opus":0.04916453395114777,"score_gpt":0.23722459207810215,"score_spread":0.18806005812695437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985147723","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.16162612,0.0056443466,0.67909133,0.026919825,0.00036373024,0.00024379055,0.00056118955,0.00032537413,0.12522435],"genre_scores_gemma":[0.9189425,0.0009922556,0.07150183,0.001244034,0.0002476818,0.00023553475,0.00030130384,0.000064638225,0.006470304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99166566,0.0037182136,0.00046205698,0.0013715276,0.0019449447,0.0008376384],"domain_scores_gemma":[0.9784629,0.015917005,0.0012383853,0.0017909493,0.0018774304,0.00071332447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009204425,0.0007275212,0.0016744672,0.0018242681,0.0027434467,0.004992568,0.0019005049,0.0031120395,0.0048650573],"category_scores_gemma":[0.026943415,0.0008928537,0.002204173,0.0019132029,0.013060025,0.008231355,0.004163102,0.005678988,0.0004947633],"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.000067621186,0.000060892886,0.00052869826,0.000094757655,0.000059694554,0.00007778557,0.00043169473,0.003358157,0.0002490254,0.9863083,0.0011580007,0.0076053743],"study_design_scores_gemma":[0.0000136450935,0.0000055508262,0.00011338453,0.0000067478763,0.000009040651,0.000016364418,0.000038012688,0.0022830605,0.00005857451,0.9970849,0.00036665538,0.000004010009],"about_ca_topic_score_codex":0.004556144,"about_ca_topic_score_gemma":0.0054992377,"teacher_disagreement_score":0.009204425,"about_ca_system_score_codex":0.0050600967,"about_ca_system_score_gemma":0.002426346,"threshold_uncertainty_score":0.04867828},"labels":[],"label_agreement":null},{"id":"W1986060337","doi":"10.1006/jcss.2001.1810","title":"Aggregate Operators in Constraint Query Languages","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Constraint (computer-aided design); Aggregate (composite); Computer science; Class (philosophy); Closure (psychology); Dimension (graph theory); Query language; Theoretical computer science; Set (abstract data type); Computation; Datalog; Range (aeronautics); Mathematics; Algorithm; Programming language; Artificial intelligence; Database; Combinatorics","score_opus":0.019816982670070694,"score_gpt":0.24449189325280507,"score_spread":0.22467491058273437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986060337","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.02268262,0.0009246379,0.96326435,0.0016615086,0.00011560184,0.00017831489,0.0008630446,0.0025375567,0.0077722915],"genre_scores_gemma":[0.3761123,0.00146548,0.6071015,0.0012724542,0.00041271182,0.00046801867,0.002012497,0.0014289632,0.009726016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99327165,0.0023434558,0.00088884286,0.0007918616,0.002178362,0.0005258235],"domain_scores_gemma":[0.98825806,0.008462891,0.0005461373,0.0014195989,0.0010333466,0.0002799603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074952627,0.0007818976,0.0018749713,0.0021089392,0.0020491632,0.0075677014,0.002645022,0.0018543784,0.00664397],"category_scores_gemma":[0.01607978,0.0016468758,0.0017119258,0.0051655523,0.003973885,0.018062793,0.004059179,0.004344778,0.0011257549],"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.00030762996,0.00007481242,0.00072375825,0.0002385112,0.00006055323,0.00016994077,0.0013283532,0.0096238805,0.0016830156,0.9287456,0.008285547,0.048758294],"study_design_scores_gemma":[0.00010390145,0.000042368145,0.00019237155,0.00008014109,0.00011444472,0.0001670561,0.00044160066,0.07048155,0.0032464482,0.9032498,0.021809518,0.00007092338],"about_ca_topic_score_codex":0.0081304135,"about_ca_topic_score_gemma":0.009689904,"teacher_disagreement_score":0.0081304135,"about_ca_system_score_codex":0.0024723338,"about_ca_system_score_gemma":0.0024908087,"threshold_uncertainty_score":0.039639235},"labels":[],"label_agreement":null},{"id":"W1986563142","doi":"10.1007/s10472-010-9176-z","title":"A description logic based situation calculus","year":2010,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Situation calculus; Decidability; Axiom; Operator (biology); Projection (relational algebra); Calculus (dental); Fragment (logic); Description logic; Mathematics; Computer science; Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.14122521408593885,"score_gpt":0.3337764627817117,"score_spread":0.19255124869577284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986563142","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.005294488,0.00081769517,0.9504388,0.0020067971,0.00029921182,0.0001597581,0.00041182182,0.0009461822,0.03962526],"genre_scores_gemma":[0.29423293,0.0013371716,0.67857474,0.00092516706,0.0004109607,0.00036371136,0.000827289,0.00028489638,0.023043174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973579,0.0007562794,0.0002602072,0.0004368644,0.0009255478,0.00026308346],"domain_scores_gemma":[0.9976441,0.0012550234,0.00009123892,0.0003911182,0.0003883716,0.00023006955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032688766,0.00079030904,0.0012293824,0.0019090315,0.0021333394,0.00719451,0.0033391628,0.0018814382,0.011040347],"category_scores_gemma":[0.0049851686,0.0011183231,0.0025015124,0.0020847565,0.0041294377,0.009975867,0.0044394326,0.0042108227,0.0024043224],"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.000020412288,0.000029491519,0.000053803324,0.000036687914,0.000010152494,0.00009881648,0.00016689324,0.001955798,0.00035907954,0.9844215,0.0015172308,0.01133015],"study_design_scores_gemma":[0.00004163173,0.000013588556,0.00003705544,0.000026403244,0.000031611788,0.00011970167,0.00005088563,0.025345122,0.0006685062,0.95361274,0.02002849,0.000024297959],"about_ca_topic_score_codex":0.0029408939,"about_ca_topic_score_gemma":0.002429647,"teacher_disagreement_score":0.011040347,"about_ca_system_score_codex":0.0020905333,"about_ca_system_score_gemma":0.0024764554,"threshold_uncertainty_score":0.03693366},"labels":[],"label_agreement":null},{"id":"W1991850485","doi":"10.1016/j.jal.2015.03.001","title":"Reflecting rules: A note on generalizing the deduction theorem","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Killam Trusts","keywords":"Generalization; Mathematics; Rule of inference; Fundamental theorem; Object (grammar); Automated theorem proving; Compactness theorem; Discrete mathematics; Natural deduction; Calculus (dental); Computer science; Algorithm; Fixed-point theorem; Artificial intelligence; Mathematical analysis","score_opus":0.07179899582884149,"score_gpt":0.3140917748543214,"score_spread":0.2422927790254799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991850485","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.0038192864,0.0020779055,0.95144945,0.0049258093,0.001366374,0.0001861439,0.00024119222,0.0007148007,0.035219006],"genre_scores_gemma":[0.14112929,0.006874296,0.81860536,0.007147492,0.0042635384,0.0005775831,0.00083093194,0.0011190933,0.019452365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901281,0.0031040611,0.0010323358,0.0025292132,0.0026679726,0.0005382911],"domain_scores_gemma":[0.97653687,0.0127410805,0.00050651166,0.0076027378,0.002250829,0.0003619701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016814979,0.0016741833,0.002485696,0.0028386577,0.0023728465,0.008654968,0.009240911,0.005138894,0.009398657],"category_scores_gemma":[0.03149031,0.0014899842,0.0067954944,0.0027843348,0.011110575,0.026416156,0.009110916,0.0128172,0.0034748523],"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.000044418994,0.00003970124,0.0002057756,0.00019411302,0.000055071374,0.00015675004,0.00046271618,0.001980474,0.0006263225,0.95966,0.0048627723,0.031711858],"study_design_scores_gemma":[0.000019987716,0.000015274074,0.000058750695,0.000038650247,0.00003299732,0.00009569413,0.000039060073,0.0035440174,0.0007576883,0.9815958,0.013780219,0.000021783495],"about_ca_topic_score_codex":0.0035739972,"about_ca_topic_score_gemma":0.001770084,"teacher_disagreement_score":0.016814979,"about_ca_system_score_codex":0.002007734,"about_ca_system_score_gemma":0.0020938711,"threshold_uncertainty_score":0.08892715},"labels":[],"label_agreement":null},{"id":"W1995153384","doi":"10.48550/arxiv.1105.3414","title":"Relating Weight Constraint and Aggregate Programs: Semantics and Representation","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Well-founded semantics; Stable model semantics; Semantics (computer science); Constraint (computer-aided design); Computer science; Operational semantics; Representation (politics); Programming language; Set (abstract data type); Aggregate (composite); Theoretical computer science; Mathematics; Denotational semantics","score_opus":0.08438083615240821,"score_gpt":0.1983672698113765,"score_spread":0.1139864336589683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995153384","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.018825332,0.00015302536,0.97402996,0.0006397732,0.000037521622,0.00011742511,0.00022179948,0.0005582679,0.005416889],"genre_scores_gemma":[0.42837548,0.00076415885,0.5599308,0.0007411573,0.00019992753,0.000779335,0.0013530914,0.00070894626,0.007147165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952108,0.0013892982,0.00037460233,0.0007932668,0.0018619918,0.00036989822],"domain_scores_gemma":[0.99369967,0.0035106067,0.0007507242,0.0008952614,0.0009715302,0.0001722765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031777492,0.0008719064,0.0006249764,0.002039839,0.00084008573,0.004544241,0.002074401,0.0017678711,0.0040150234],"category_scores_gemma":[0.013442096,0.00054357224,0.0015630012,0.003016945,0.004189481,0.009887069,0.0035840452,0.0028055282,0.00051576074],"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.00006598918,0.00006363019,0.0006189493,0.00015226303,0.000032308733,0.00017837634,0.0009984492,0.01514532,0.002564287,0.9402904,0.0009800076,0.038910013],"study_design_scores_gemma":[0.000018446684,0.000043036427,0.0002609623,0.00005445282,0.00003611696,0.0001475879,0.00025853323,0.075043105,0.004494852,0.90987355,0.009739613,0.000029686453],"about_ca_topic_score_codex":0.0031464428,"about_ca_topic_score_gemma":0.0015713313,"teacher_disagreement_score":0.004544241,"about_ca_system_score_codex":0.0016492249,"about_ca_system_score_gemma":0.0020697953,"threshold_uncertainty_score":0.016805708},"labels":[],"label_agreement":null},{"id":"W1997583348","doi":"10.5555/777092.777267","title":"Speech web: a web of natural-language speech applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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 Windsor","funders":"","keywords":"Computer science; Hyperlink; Domain (mathematical analysis); Natural language; Executable; Semantics (computer science); Programming language; Natural language processing; Artificial intelligence; Web page; World Wide Web","score_opus":0.013096898965925061,"score_gpt":0.24071262397073348,"score_spread":0.22761572500480842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997583348","genre_codex":"software","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.021335263,0.0010145577,0.30699965,0.00090676843,0.00047851016,0.0017079379,0.08264538,0.53442365,0.050488237],"genre_scores_gemma":[0.15016238,0.001936836,0.30459192,0.0018823057,0.0004142864,0.00399874,0.3575573,0.048054818,0.13140142],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907196,0.00023233035,0.00012452873,0.00015521634,0.0003562156,0.000059664468],"domain_scores_gemma":[0.9975267,0.0011812438,0.00013151711,0.00041263562,0.00040482398,0.0003431433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011579787,0.0013566312,0.0007135464,0.0015443813,0.0006844756,0.0023759492,0.0015562322,0.0013740491,0.029250853],"category_scores_gemma":[0.0038661757,0.0009085299,0.00072567415,0.0012643334,0.0006585421,0.004579043,0.0021894532,0.0013718316,0.019055266],"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.0018967891,0.0005784196,0.0023050462,0.002230104,0.00019315151,0.0024100267,0.0024552105,0.005221304,0.03815441,0.03280222,0.66134727,0.25040612],"study_design_scores_gemma":[0.00031656137,0.00019433953,0.0033682778,0.00018618167,0.000057565387,0.0008304549,0.00050875,0.03514843,0.023591097,0.020053197,0.91551656,0.00022848512],"about_ca_topic_score_codex":0.0039567207,"about_ca_topic_score_gemma":0.0053200545,"teacher_disagreement_score":0.029250853,"about_ca_system_score_codex":0.0006556513,"about_ca_system_score_gemma":0.0011481319,"threshold_uncertainty_score":0.0978539},"labels":[],"label_agreement":null},{"id":"W1997780525","doi":"10.1007/s10817-007-9082-1","title":"Inferring Phylogenetic Trees Using Answer Set Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Austrian Science Fund; National Science Foundation","keywords":"Cladistics; Phylogenetic tree; Computer science; Taxon; Set (abstract data type); Formalism (music); Phylogenetics; Theoretical computer science; Representation (politics); Artificial intelligence; Programming language; Biology; Paleontology","score_opus":0.023768570543806867,"score_gpt":0.2980693273525292,"score_spread":0.27430075680872235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997780525","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.04854298,0.0006743657,0.94127196,0.0016063628,0.00009566109,0.00018357218,0.001411837,0.0024408097,0.003772531],"genre_scores_gemma":[0.26465127,0.00049791334,0.72824365,0.00034666664,0.00013596677,0.00016445972,0.0041628988,0.0003134766,0.0014836563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953216,0.0019327194,0.00044975293,0.00096145226,0.0010127965,0.00032158487],"domain_scores_gemma":[0.9723697,0.02367097,0.00086292415,0.0015093934,0.0011651627,0.00042193636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045078453,0.0012373839,0.0017229541,0.005232298,0.002132079,0.004928645,0.004071549,0.0029095197,0.008023235],"category_scores_gemma":[0.028897833,0.0012156055,0.0036830644,0.003398301,0.0022806462,0.011313519,0.0035788245,0.0032575268,0.0012129482],"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.00080713985,0.001123748,0.017005414,0.0015183401,0.0008391638,0.0016189689,0.0018045916,0.16652025,0.006872475,0.35408342,0.015564728,0.4322417],"study_design_scores_gemma":[0.00007777247,0.000044235174,0.00068905804,0.000092129165,0.00017693362,0.00019327561,0.0003228677,0.32741794,0.00255205,0.6640773,0.0043175397,0.00003895102],"about_ca_topic_score_codex":0.0037986506,"about_ca_topic_score_gemma":0.008281637,"teacher_disagreement_score":0.008023235,"about_ca_system_score_codex":0.0013486024,"about_ca_system_score_gemma":0.0016598484,"threshold_uncertainty_score":0.026840389},"labels":[],"label_agreement":null},{"id":"W1998008572","doi":"10.1007/s11225-005-0496-7","title":"Gricean Belief Change","year":2005,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computational linguistics; Linguistics; Natural language processing; Computer science; Mathematics; Philosophy","score_opus":0.0446859907884477,"score_gpt":0.2604042263466005,"score_spread":0.21571823555815278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998008572","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.055904772,0.0062501184,0.4575361,0.062223427,0.0011352922,0.00017378831,0.0006957349,0.0004059103,0.41567487],"genre_scores_gemma":[0.9066115,0.0019057919,0.048866693,0.0032878343,0.00069089554,0.00020226177,0.00040642897,0.0001028529,0.03792567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535275,0.0019499649,0.00019013067,0.0011186872,0.0010298961,0.00035859062],"domain_scores_gemma":[0.9868025,0.007479594,0.00068097253,0.0023710069,0.0021954263,0.00047045792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059394613,0.00071663526,0.0009639316,0.0019632482,0.0025017443,0.004474092,0.0016822497,0.0030476437,0.013711708],"category_scores_gemma":[0.028997842,0.0005136291,0.0014076353,0.0012969942,0.008611471,0.010052567,0.003097084,0.008009921,0.0018472845],"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.000029470435,0.000016375383,0.00017510225,0.000020528973,0.000018175611,0.000036024834,0.00024017163,0.00032922975,0.00007228301,0.9919836,0.0013203344,0.0057588057],"study_design_scores_gemma":[0.000010842315,0.0000050686176,0.000095583186,0.0000076023175,0.0000088203315,0.000037370777,0.000043068998,0.0011275418,0.000079099606,0.9958645,0.002716434,0.000003985482],"about_ca_topic_score_codex":0.0025326768,"about_ca_topic_score_gemma":0.0019315787,"teacher_disagreement_score":0.013711708,"about_ca_system_score_codex":0.0040614796,"about_ca_system_score_gemma":0.0015623738,"threshold_uncertainty_score":0.045870304},"labels":[],"label_agreement":null},{"id":"W1998261607","doi":"10.1016/j.apal.2004.06.004","title":"Dynamic topological logic","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Topological space; Topological dynamics; Topology (electrical circuits); Mathematics; Topological vector space; Topological entropy in physics; Topological algebra; Topological quantum number; Context (archaeology); Category of topological spaces; Connected space; Zero-dimensional space; Topological manifold; Topological tensor product; Pure mathematics; Physics; Combinatorics","score_opus":0.03988905272719816,"score_gpt":0.29429667275519206,"score_spread":0.2544076200279939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998261607","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.029412406,0.013433638,0.2478905,0.022877662,0.0019090356,0.00005201001,0.0011069389,0.0006297525,0.68268806],"genre_scores_gemma":[0.76817495,0.0077513237,0.050326865,0.0026090222,0.002296155,0.00013962307,0.0013444743,0.00033009466,0.1670276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999329,0.00019472647,0.000032048112,0.00018158033,0.00020466915,0.00005804868],"domain_scores_gemma":[0.9990552,0.00030793317,0.00006241144,0.00023032026,0.0002273176,0.00011677418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095854886,0.00052422873,0.00061391643,0.001857402,0.0018162652,0.004702372,0.00071567495,0.0010705609,0.014333992],"category_scores_gemma":[0.002147745,0.0003417621,0.00058085326,0.0014542463,0.004475961,0.0072843176,0.0018453571,0.0032085977,0.0021726133],"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.0000030574472,0.000002145618,0.000018740375,0.000005471686,0.0000013079227,0.0000059532167,0.000032683856,0.00010298618,0.0000556647,0.9957853,0.0017790371,0.0022076883],"study_design_scores_gemma":[0.0000029716539,0.0000030532624,0.000038559127,0.000007037108,0.0000030924339,0.000031158692,0.000034534885,0.00073153345,0.0000920392,0.96864736,0.030405711,0.0000030094222],"about_ca_topic_score_codex":0.0012598993,"about_ca_topic_score_gemma":0.0012342276,"teacher_disagreement_score":0.014333992,"about_ca_system_score_codex":0.0025900134,"about_ca_system_score_gemma":0.0010751694,"threshold_uncertainty_score":0.047951996},"labels":[],"label_agreement":null},{"id":"W2000760706","doi":"10.3166/ria.18.261-298","title":"Programmation bayésienne des robots","year":2004,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.06938033144524185,"score_gpt":0.2833472566051876,"score_spread":0.21396692515994575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000760706","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.0045940815,0.00025195643,0.9845168,0.0005817124,0.00012780007,0.000074354764,0.00011769217,0.00067676196,0.009058823],"genre_scores_gemma":[0.15502417,0.0017136495,0.8217388,0.000545318,0.0004214737,0.0008240423,0.0005441785,0.000504027,0.018684367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478936,0.0021553778,0.00018232438,0.00091824535,0.0016805137,0.00027418017],"domain_scores_gemma":[0.99783105,0.0013660959,0.00013641958,0.00031227554,0.00025945273,0.000094721174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004252979,0.0018687902,0.001357689,0.0016538721,0.0016459791,0.005698754,0.0016421168,0.00225088,0.0062213806],"category_scores_gemma":[0.009782993,0.001192397,0.0028133045,0.0011820991,0.0069891266,0.005113637,0.0024018772,0.008301646,0.0020595794],"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.00007662944,0.000038181777,0.00029293125,0.00015983761,0.000046360434,0.00011366614,0.00040198347,0.027875789,0.001910945,0.9216728,0.00242334,0.044987347],"study_design_scores_gemma":[0.00018717998,0.000096577285,0.00043861984,0.00012267078,0.000042150874,0.00024270755,0.00017827332,0.32571435,0.005410904,0.5852417,0.082241125,0.00008373434],"about_ca_topic_score_codex":0.009161685,"about_ca_topic_score_gemma":0.0057219747,"teacher_disagreement_score":0.009161685,"about_ca_system_score_codex":0.0037760248,"about_ca_system_score_gemma":0.0025728778,"threshold_uncertainty_score":0.027397156},"labels":[],"label_agreement":null},{"id":"W2001364423","doi":"10.1111/j.1368-0005.2004.00066.x","title":"Symmetry in Structure Building","year":2004,"lang":"en","type":"article","venue":"Syntax","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Specifier; Complement (music); Selection (genetic algorithm); Locality; Head (geology); Computer science; Repertoire; Symmetry (geometry); Composition (language); Mathematics; Theoretical computer science; Artificial intelligence; Physics; Linguistics; Philosophy; Geometry","score_opus":0.00782222753060681,"score_gpt":0.2343997856214841,"score_spread":0.22657755809087732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001364423","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.08446816,0.001097481,0.7144267,0.003616521,0.00028533218,0.00030771428,0.00057970104,0.0020703524,0.19314805],"genre_scores_gemma":[0.78957856,0.0004929983,0.18693893,0.0005581892,0.0001280669,0.00026428667,0.0009044035,0.0005501537,0.020584302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973937,0.0010860948,0.00017040112,0.00059552205,0.0004753713,0.00027888874],"domain_scores_gemma":[0.99736434,0.00082351005,0.00022930789,0.0012110252,0.00023747438,0.00013440265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021190776,0.00042714048,0.00069085154,0.0015102144,0.002412742,0.0034844177,0.0016468798,0.0010964647,0.015796449],"category_scores_gemma":[0.0058571175,0.00052240206,0.0015431738,0.001183358,0.007229385,0.0071505234,0.0051860805,0.0019474993,0.002677292],"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.000013652679,0.000008129336,0.00020034741,0.00003757379,0.00000824629,0.000069362985,0.0003311494,0.0013135044,0.00044167318,0.983733,0.0011567717,0.012686709],"study_design_scores_gemma":[0.000007925303,0.000008901603,0.00009186462,0.000015362926,0.00000626226,0.00005749799,0.00008406761,0.0036713306,0.00071959186,0.98523384,0.010097065,0.000006291316],"about_ca_topic_score_codex":0.0020891053,"about_ca_topic_score_gemma":0.0021871189,"teacher_disagreement_score":0.015796449,"about_ca_system_score_codex":0.0021005145,"about_ca_system_score_gemma":0.0016311489,"threshold_uncertainty_score":0.052844405},"labels":[],"label_agreement":null},{"id":"W2001413564","doi":"10.1109/coginf.2010.5599734","title":"A solution to commutativity problems found in iterated belief revision","year":2010,"lang":"en","type":"article","venue":"","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":"Western University","funders":"","keywords":"Commutative property; Iterated function; Belief revision; Selection (genetic algorithm); State (computer science); Mathematics; Intrusion; Computer science; Mathematical economics; Algorithm; Epistemology; Artificial intelligence; Discrete mathematics; Philosophy","score_opus":0.01852901958799889,"score_gpt":0.26840164083789275,"score_spread":0.24987262124989387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001413564","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.018699411,0.00032316666,0.9567392,0.003502165,0.00017467742,0.00011175858,0.00009135877,0.0003388176,0.020019477],"genre_scores_gemma":[0.7211363,0.000253468,0.2704061,0.0011042699,0.00030467036,0.0004344174,0.000113733586,0.00012500356,0.006122153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9860977,0.0068462216,0.0011796781,0.003130148,0.0019549914,0.0007912721],"domain_scores_gemma":[0.9734162,0.012402642,0.0019959568,0.0091008805,0.0025003362,0.0005839627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02157455,0.0007575719,0.0013773744,0.0011256556,0.002707711,0.0034205643,0.0033860288,0.003790485,0.007488491],"category_scores_gemma":[0.044246417,0.0008842587,0.0026477894,0.0009701054,0.009651507,0.013242635,0.006115001,0.0049695023,0.0008342452],"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.000024065948,0.000010190921,0.0001880771,0.00004546854,0.000018717734,0.000094041556,0.00053051,0.0011087982,0.00031344013,0.9916632,0.0003700653,0.005633372],"study_design_scores_gemma":[0.000024720548,0.000024095929,0.00006652364,0.00001480108,0.0000138612995,0.00008628328,0.000077032964,0.009876703,0.00045636907,0.9874614,0.0018822695,0.000015954774],"about_ca_topic_score_codex":0.0015223767,"about_ca_topic_score_gemma":0.00097640755,"teacher_disagreement_score":0.02157455,"about_ca_system_score_codex":0.0030279213,"about_ca_system_score_gemma":0.002496096,"threshold_uncertainty_score":0.11409843},"labels":[],"label_agreement":null},{"id":"W2001560360","doi":"10.1145/2480759.2480766","title":"A Model-Theoretic Approach to Belief Change in Answer Set Programming","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Deutsche Forschungsgemeinschaft; Technische Universitat Wien","keywords":"Belief revision; Autoepistemic logic; Interpretation (philosophy); Zeroth-order logic; Logic programming; Stable model semantics; Non-monotonic logic; Answer set programming; Propositional calculus; Intermediate logic; Set (abstract data type); Circumscription; Mathematics; Semantics (computer science); Dynamic logic (digital electronics); Operator (biology); Computer science; Logic program; Abstract model theory; Default logic; Theoretical computer science; Discrete mathematics; Artificial intelligence; Multimodal logic; Programming language; Description logic","score_opus":0.06109427292373652,"score_gpt":0.28454418585789804,"score_spread":0.2234499129341615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001560360","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.005535049,0.00032309804,0.9876788,0.0018916972,0.000062574574,0.000049955976,0.000038762464,0.000116122435,0.004304032],"genre_scores_gemma":[0.4394409,0.00066714664,0.5522982,0.0012191514,0.0006492948,0.00046396148,0.00016065441,0.00013860376,0.0049620816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907403,0.0042187683,0.0003941997,0.0013842239,0.002583305,0.0006791102],"domain_scores_gemma":[0.9833408,0.011650545,0.001234889,0.002102823,0.0011533594,0.0005176094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009516712,0.00095056515,0.0011873398,0.0023637312,0.0016474137,0.0049061435,0.0045715114,0.0029874924,0.004758446],"category_scores_gemma":[0.02388286,0.0009191079,0.0033306822,0.002268821,0.006972685,0.010738009,0.0055350806,0.00741719,0.000509895],"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.00002511839,0.00005731235,0.00022370342,0.0000728384,0.000044375614,0.000064366825,0.00049655914,0.018746527,0.0007869315,0.9658424,0.00066958455,0.012970349],"study_design_scores_gemma":[0.000017256936,0.000049496706,0.000085394764,0.000028599161,0.000029473527,0.00005778088,0.00008958098,0.099339314,0.000750033,0.8961928,0.0033384145,0.000021921778],"about_ca_topic_score_codex":0.0014622193,"about_ca_topic_score_gemma":0.0012107175,"teacher_disagreement_score":0.009516712,"about_ca_system_score_codex":0.0038779317,"about_ca_system_score_gemma":0.0015216578,"threshold_uncertainty_score":0.050329804},"labels":[],"label_agreement":null},{"id":"W2001917952","doi":"10.1007/s10992-007-9062-2","title":"SYNONYMOUS LOGICS: A CORRECTION","year":2007,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University","funders":"","keywords":"Modal; Mathematical economics; Computer science; Accessibility relation; Mathematics; Modal logic; Epistemology; Discrete mathematics; Philosophy","score_opus":0.026437651428603073,"score_gpt":0.2751352111698898,"score_spread":0.24869755974128674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001917952","genre_codex":"commentary","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.009528862,0.004827792,0.0696764,0.40954697,0.4065648,0.00011768394,0.0028875857,0.0035625868,0.09328737],"genre_scores_gemma":[0.36317596,0.008215059,0.06622078,0.17974843,0.15009363,0.00034191433,0.0032938814,0.0039383047,0.22497202],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99129933,0.002164737,0.0011848998,0.0014740587,0.003251788,0.00062523613],"domain_scores_gemma":[0.93943083,0.02441235,0.0019348534,0.009964783,0.022850597,0.0014066721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069130342,0.001137119,0.0012310582,0.0067216777,0.0051151416,0.0042370055,0.0033510479,0.004714781,0.037154183],"category_scores_gemma":[0.06932379,0.00077320286,0.0016280969,0.0048996573,0.006074634,0.0076303356,0.004097078,0.010455865,0.011721672],"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.00016849926,0.00003467853,0.00097550545,0.00026002008,0.000082723345,0.0011644204,0.00077034824,0.00010803737,0.000398748,0.21058892,0.73785216,0.04759602],"study_design_scores_gemma":[0.00015372864,0.000030513676,0.0012212162,0.0003776655,0.00020679033,0.0032038153,0.00067126803,0.0016635597,0.0021867082,0.2148095,0.77537596,0.00009926281],"about_ca_topic_score_codex":0.00396227,"about_ca_topic_score_gemma":0.00501813,"teacher_disagreement_score":0.037154183,"about_ca_system_score_codex":0.0028858837,"about_ca_system_score_gemma":0.0039856625,"threshold_uncertainty_score":0.12429309},"labels":[],"label_agreement":null},{"id":"W2002154970","doi":"10.1017/s1471068410000281","title":"A program-level approach to revising logic programs under the answer set semantics","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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":"Simon Fraser University","funders":"","keywords":"Stable model semantics; Set (abstract data type); Answer set programming; Computer science; Logic program; Analogy; Semantics (computer science); Circumscription; Logic programming; Discrete mathematics; Belief revision; Preference; Programming language; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Operational semantics; Epistemology; Philosophy","score_opus":0.06849882632326876,"score_gpt":0.3296679072681382,"score_spread":0.26116908094486946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002154970","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.0103751095,0.00012477815,0.9827915,0.00059377484,0.000046150002,0.00012948916,0.0000613099,0.00062417524,0.0052537345],"genre_scores_gemma":[0.33761376,0.00022751262,0.653991,0.0005477861,0.0002459937,0.0003555244,0.00022582995,0.0002910598,0.0065015242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995739,0.0016616932,0.00029906357,0.00056591985,0.0013442949,0.00039013667],"domain_scores_gemma":[0.9946637,0.0023519078,0.00034825504,0.0010515128,0.0013846533,0.00019985696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00480348,0.00048100646,0.00067284674,0.0015855771,0.0009626546,0.004258991,0.0023359025,0.0012459306,0.0041384934],"category_scores_gemma":[0.008819259,0.000519192,0.0017052249,0.000967531,0.0034638415,0.0050379657,0.0027520368,0.003225233,0.00051250524],"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.000076442484,0.000103962266,0.0005318735,0.00014499872,0.000042740554,0.00020921993,0.0011484437,0.02281742,0.0062662996,0.9112102,0.0011550725,0.056293443],"study_design_scores_gemma":[0.000044407458,0.000118544514,0.00025273993,0.00006696589,0.00008867201,0.00016309682,0.00022191281,0.19018508,0.009543041,0.78108966,0.018176591,0.000049196686],"about_ca_topic_score_codex":0.0023848042,"about_ca_topic_score_gemma":0.002107355,"teacher_disagreement_score":0.00480348,"about_ca_system_score_codex":0.0020986213,"about_ca_system_score_gemma":0.001625528,"threshold_uncertainty_score":0.0254035},"labels":[],"label_agreement":null},{"id":"W2004768245","doi":"10.1142/s0218001402002118","title":"ESTABLISHING MUTUAL-BELIEF AMONG COOPERATIVE AGENTS","year":2002,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","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 Victoria","funders":"","keywords":"Cheating; Premise; Honesty; Computer science; Mutual information; Artificial intelligence; Mutual aid; Computer security; Epistemology; Psychology; Social psychology; Law; Philosophy; Political science","score_opus":0.1086197213650704,"score_gpt":0.2971176588509392,"score_spread":0.1884979374858688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004768245","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.034381498,0.0001664636,0.9489607,0.0015614941,0.00006279416,0.00019629288,0.000038277973,0.00021362225,0.014418924],"genre_scores_gemma":[0.7159056,0.00022693851,0.27933264,0.0004249752,0.00008720827,0.0002869825,0.00009095985,0.000049688686,0.0035949906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902064,0.003662291,0.00076139596,0.001466124,0.0031787949,0.00072499044],"domain_scores_gemma":[0.9800394,0.009795851,0.0028629173,0.0029345516,0.0033986866,0.00096858316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011957261,0.0007988943,0.00084511016,0.0012609522,0.002220298,0.0040481873,0.0021942013,0.0025272823,0.0020116358],"category_scores_gemma":[0.025216386,0.000693819,0.0014710783,0.00063791097,0.0059566004,0.008517756,0.00672995,0.0032564094,0.0005118901],"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.00009572667,0.00009885007,0.0026803168,0.00020052574,0.00015013744,0.00067659246,0.0030648548,0.01608934,0.0042514335,0.9385395,0.0011697903,0.032982867],"study_design_scores_gemma":[0.0000668092,0.00013747688,0.00082793133,0.0000892699,0.00014664387,0.00033691138,0.0007573905,0.10049241,0.007687552,0.8767379,0.012630082,0.00008966246],"about_ca_topic_score_codex":0.0012612212,"about_ca_topic_score_gemma":0.0011063573,"teacher_disagreement_score":0.011957261,"about_ca_system_score_codex":0.001497399,"about_ca_system_score_gemma":0.002325884,"threshold_uncertainty_score":0.06323677},"labels":[],"label_agreement":null},{"id":"W2005725646","doi":"10.1109/coginf.2010.5599781","title":"Articular models for first-degree paraconsistent systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Logical consequence; Computer science; Constructive; Propositional calculus; Completeness (order theory); Class (philosophy); Textual entailment; Simple (philosophy); Degree (music); Artificial intelligence; Set (abstract data type); Natural language processing; Representation (politics); Theoretical computer science; Mathematics; Programming language","score_opus":0.046004156886435645,"score_gpt":0.2414202287709636,"score_spread":0.19541607188452798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005725646","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.07196463,0.0006526059,0.86958885,0.0025956433,0.00008284366,0.00012449609,0.0005280626,0.00075065426,0.053712193],"genre_scores_gemma":[0.85064566,0.00046329555,0.13188317,0.00032069455,0.00012289686,0.00018002979,0.00046338816,0.00009350321,0.01582739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884987,0.00036786386,0.000059779624,0.00018026595,0.00042328355,0.00011891648],"domain_scores_gemma":[0.9982198,0.00082423165,0.00018407755,0.00033430764,0.00031921858,0.00011834474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227843,0.00042462102,0.00041334683,0.00086085795,0.0008762727,0.0027731617,0.0011974245,0.0012054679,0.0077335257],"category_scores_gemma":[0.004324647,0.00033419477,0.0008013567,0.0008478416,0.0023551334,0.004687512,0.0018654686,0.002128586,0.000952077],"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.000005578178,0.0000059590884,0.00007996199,0.000016347229,0.000004105417,0.000032414715,0.00013671727,0.002762211,0.00030845313,0.994574,0.00030226246,0.0017721371],"study_design_scores_gemma":[0.000011325446,0.00000966069,0.000041214676,0.0000067730216,0.0000055602527,0.00003757513,0.000072774565,0.027285473,0.00053858705,0.9676686,0.0043162107,0.0000062379218],"about_ca_topic_score_codex":0.0021125325,"about_ca_topic_score_gemma":0.0029405456,"teacher_disagreement_score":0.0077335257,"about_ca_system_score_codex":0.0017770665,"about_ca_system_score_gemma":0.0008414031,"threshold_uncertainty_score":0.025871217},"labels":[],"label_agreement":null},{"id":"W2006754637","doi":"10.1016/j.artint.2010.11.021","title":"Specifying and computing preferred plans","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Computer science; Semantics (computer science); Preference; Plan (archaeology); Situation calculus; Bounded function; Order (exchange); Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.06177651901621427,"score_gpt":0.2950130996349307,"score_spread":0.23323658061871644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006754637","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.05788614,0.00037758163,0.92702526,0.0009974656,0.000046122557,0.0003479231,0.0008087997,0.0014612615,0.011049437],"genre_scores_gemma":[0.27146623,0.00047842876,0.7232598,0.00011486156,0.00003349229,0.00025717882,0.0015068493,0.0002629284,0.0026201576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918269,0.0031535192,0.00087674556,0.0010575036,0.0024519393,0.00063342263],"domain_scores_gemma":[0.98387825,0.011392274,0.0008511081,0.0019523425,0.0014548264,0.00047118627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007803748,0.0009330755,0.0011963357,0.003124777,0.0017777432,0.008838107,0.0030496756,0.0015980852,0.0083098505],"category_scores_gemma":[0.03330907,0.0016185952,0.0024896397,0.002912584,0.003724399,0.013118345,0.0039571794,0.0024115383,0.0011887063],"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.00041537097,0.00016872131,0.0037261057,0.00051135157,0.00013215205,0.0004355457,0.0017632999,0.06914342,0.0019577157,0.7838501,0.0051571713,0.1327391],"study_design_scores_gemma":[0.00008565157,0.00005126033,0.00032667458,0.00012006546,0.00009552099,0.00014197867,0.0009510863,0.28517914,0.0043455395,0.70019686,0.008460089,0.000046053345],"about_ca_topic_score_codex":0.011539538,"about_ca_topic_score_gemma":0.021431306,"teacher_disagreement_score":0.011539538,"about_ca_system_score_codex":0.0030673805,"about_ca_system_score_gemma":0.005316669,"threshold_uncertainty_score":0.041270673},"labels":[],"label_agreement":null},{"id":"W2006811440","doi":"10.1016/s0893-9659(03)00077-6","title":"Relaxed unification—Proposal","year":2003,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unification; Imperfect; Preprocessor; Mathematics; Fuzzy logic; Perfect information; Algorithm; Computer science; Theoretical computer science; Mathematical economics; Artificial intelligence; Programming language","score_opus":0.013007267441962825,"score_gpt":0.21475392927288964,"score_spread":0.20174666183092682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006811440","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.053010497,0.00598457,0.6680042,0.0389009,0.006570571,0.00039702817,0.0007675519,0.002230069,0.22413456],"genre_scores_gemma":[0.69756556,0.002309971,0.21012478,0.01131193,0.007694214,0.001007781,0.0016395588,0.001261295,0.067084946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918399,0.002883689,0.00038397827,0.0022441833,0.0014939123,0.00115422],"domain_scores_gemma":[0.98934233,0.0034140705,0.00030886367,0.005050527,0.0012643469,0.00061985507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0087497,0.0009491298,0.002006601,0.0024316611,0.0041211923,0.005269883,0.00638094,0.0056411624,0.018824017],"category_scores_gemma":[0.02261482,0.0012201832,0.002748903,0.00290956,0.009337435,0.02400421,0.010836027,0.009627303,0.0044081644],"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.000060608592,0.000016968663,0.000062745654,0.000045688852,0.000017398135,0.000027655402,0.00015926626,0.00036462685,0.00018186384,0.9862641,0.0034115347,0.009387627],"study_design_scores_gemma":[0.000037607464,0.000012460248,0.000071256865,0.00002824025,0.000020083766,0.000051620045,0.000061014296,0.0027051666,0.00035960283,0.9876079,0.009029842,0.000015297439],"about_ca_topic_score_codex":0.001939231,"about_ca_topic_score_gemma":0.0010879776,"teacher_disagreement_score":0.018824017,"about_ca_system_score_codex":0.0022444797,"about_ca_system_score_gemma":0.0028265358,"threshold_uncertainty_score":0.062972605},"labels":[],"label_agreement":null},{"id":"W2008731436","doi":"10.2178/jsl/1230396765","title":"Examining Fragments of the Quantified Propositional Calculus","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":27,"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 Toronto","funders":"","keywords":"Mathematics; Axiom; Mathematical proof; Hierarchy; Calculus (dental); Propositional calculus; Propositional variable; Proof complexity; Connection (principal bundle); Propositional formula; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Intermediate logic; Theoretical computer science","score_opus":0.0541860406085994,"score_gpt":0.2498554769199531,"score_spread":0.1956694363113537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008731436","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.34227052,0.0008673486,0.613866,0.0021301326,0.00016735386,0.00027218682,0.0007091032,0.0034045037,0.036312845],"genre_scores_gemma":[0.90135676,0.0002923243,0.0937643,0.000365219,0.00007862026,0.00006915951,0.00041790443,0.00023463104,0.003421141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975719,0.00060759607,0.00011500621,0.00032664725,0.0010288631,0.00035002598],"domain_scores_gemma":[0.9925735,0.004796696,0.00055199134,0.0011122513,0.0007320344,0.00023346095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026910575,0.00054642593,0.000528217,0.0014837013,0.0013446119,0.0030725743,0.001721609,0.0009407668,0.0059698257],"category_scores_gemma":[0.011459297,0.0008349073,0.0011382635,0.0014868807,0.003970416,0.006183577,0.0037588405,0.002134436,0.00047783062],"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.00037449,0.00010907721,0.0025111854,0.00028228926,0.000087591856,0.0020816124,0.002471006,0.027559849,0.013837261,0.9129455,0.0023552086,0.035384998],"study_design_scores_gemma":[0.00008072436,0.0001121014,0.0012612774,0.00011511385,0.00010866142,0.00055144104,0.0006368954,0.11240711,0.014720642,0.85236084,0.017591065,0.00005425949],"about_ca_topic_score_codex":0.007884062,"about_ca_topic_score_gemma":0.0062567485,"teacher_disagreement_score":0.007884062,"about_ca_system_score_codex":0.0024110773,"about_ca_system_score_gemma":0.0013190127,"threshold_uncertainty_score":0.019971073},"labels":[],"label_agreement":null},{"id":"W2009328505","doi":"10.1016/j.jal.2009.02.001","title":"Deontic action logic, atomic boolean algebras and fault-tolerance","year":2009,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Action (physics); Computer science; Theoretical computer science; Fault tolerance; Artificial intelligence; Algorithm; Programming language; Mathematics; Epistemology; Philosophy; Physics; Distributed computing","score_opus":0.019026955996949,"score_gpt":0.25567629607359293,"score_spread":0.23664934007664393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009328505","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.05228167,0.0053312136,0.888088,0.0039128484,0.00048479324,0.00008581577,0.00028333618,0.00060774584,0.048924625],"genre_scores_gemma":[0.84895855,0.0026509543,0.13209659,0.00082257116,0.000498643,0.0001364466,0.00042138316,0.00010629371,0.01430854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998145,0.0004439024,0.00019268076,0.00034124684,0.00058901415,0.00028827874],"domain_scores_gemma":[0.9961707,0.0018796716,0.00047248293,0.00072504644,0.0005621958,0.00018985513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027911311,0.00062409573,0.0008541999,0.0013125907,0.0018478947,0.0039359904,0.0020967557,0.0019448772,0.003488707],"category_scores_gemma":[0.005787579,0.00049892784,0.0011827733,0.0016258607,0.0050047464,0.007937836,0.0019000852,0.0030841702,0.00046050362],"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.000036784808,0.000018950082,0.00013489989,0.000047319103,0.000010150409,0.000056695586,0.00014888731,0.0039807446,0.00038657707,0.98719364,0.0007016093,0.0072836843],"study_design_scores_gemma":[0.000010921323,0.000006809583,0.00004389402,0.000012075266,0.000012666168,0.000043994347,0.00003975043,0.009590994,0.00037035014,0.9871731,0.002688013,0.0000073442184],"about_ca_topic_score_codex":0.004901376,"about_ca_topic_score_gemma":0.0036736657,"teacher_disagreement_score":0.004901376,"about_ca_system_score_codex":0.0023249723,"about_ca_system_score_gemma":0.0019003458,"threshold_uncertainty_score":0.01686889},"labels":[],"label_agreement":null},{"id":"W2011126595","doi":"10.1016/j.jal.2014.07.001","title":"The categorical imperative: Category theory as a foundation for deontic logic","year":2014,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Deontic logic; Foundation (evidence); Categorical variable; Categorical imperative; Category theory; Artificial intelligence; Computer science; Natural language processing; Mathematics; Epistemology; Philosophy; Pure mathematics; Machine learning; Political science","score_opus":0.014039131842560983,"score_gpt":0.26584042099298766,"score_spread":0.25180128915042665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011126595","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.025177557,0.008055841,0.85086685,0.018442016,0.001055902,0.00006672163,0.0005028736,0.00052840007,0.09530374],"genre_scores_gemma":[0.79658264,0.0030569665,0.18286702,0.00236642,0.0018942069,0.00020915222,0.000490152,0.00030820328,0.012225237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776936,0.0010229294,0.0001330173,0.00035925137,0.0005256558,0.00018993995],"domain_scores_gemma":[0.9949326,0.0028447923,0.00022278978,0.0008287526,0.0007918122,0.0003792953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045843343,0.00045629047,0.0010116107,0.0022929322,0.0025369122,0.00663567,0.0020503514,0.0022664657,0.004667171],"category_scores_gemma":[0.0067445356,0.0006827468,0.0012298983,0.0019476132,0.012502409,0.012768776,0.0034298664,0.005301905,0.00063014857],"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.000003207634,0.0000022333863,0.000020122361,0.00000921833,0.0000013345419,0.0000057331767,0.000085508815,0.00015092304,0.000044032247,0.99820673,0.00034734647,0.0011236178],"study_design_scores_gemma":[0.0000027973504,0.0000018137171,0.000017499655,0.000006048988,0.0000013584787,0.0000067889423,0.000020645783,0.0009141717,0.00003457073,0.9962047,0.0027864247,0.000003250304],"about_ca_topic_score_codex":0.0038153531,"about_ca_topic_score_gemma":0.0026312072,"teacher_disagreement_score":0.00663567,"about_ca_system_score_codex":0.0031455695,"about_ca_system_score_gemma":0.0027458665,"threshold_uncertainty_score":0.024244547},"labels":[],"label_agreement":null},{"id":"W2011932408","doi":"10.1017/s1755020308080131","title":"MATHEMATICAL METHODS IN PHILOSOPHY EDITORS’ INTRODUCTION","year":2008,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Calgary; University of Toronto","funders":"","keywords":"Philosophy of mathematics; Epistemology; Philosophy of logic; Philosophy of computer science; Mathematical practice; Mathematical logic; Dedekind cut; Philosophical logic; Foundations of mathematics; Philosophy; Philosophy of language; Modal logic; Computer science; Mathematics; Modal; Western philosophy; Pure mathematics; Algorithm; Metaphysics","score_opus":0.04543032424849617,"score_gpt":0.3364406164002181,"score_spread":0.2910102921517219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011932408","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.0011331852,0.26490408,0.04769908,0.088424966,0.45694035,0.00015946128,0.0014112142,0.0011990151,0.13812867],"genre_scores_gemma":[0.03242725,0.17522164,0.0412405,0.039265063,0.49477854,0.0004073647,0.001394481,0.0015124815,0.21375264],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995385,0.0014663441,0.00037009316,0.00071060564,0.0018531572,0.0002148955],"domain_scores_gemma":[0.98797566,0.0077898456,0.0005855892,0.0008840843,0.0022782849,0.00048656037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046282723,0.0016696325,0.0014947804,0.003897734,0.0011075911,0.0043532853,0.0019920669,0.002524543,0.049065758],"category_scores_gemma":[0.015714312,0.00069391786,0.0016560537,0.0026228663,0.003754149,0.0048023337,0.002176896,0.0071404492,0.01600413],"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.000029864923,0.00003250487,0.00022814973,0.00096601876,0.000056054865,0.000113035414,0.00026804325,0.00041739846,0.00025669675,0.14601128,0.7781603,0.07346079],"study_design_scores_gemma":[0.000008499254,0.000021658943,0.0002962812,0.00027493123,0.000012282036,0.00018323382,0.00003820824,0.0002640664,0.00006832076,0.058673363,0.9401456,0.000013505127],"about_ca_topic_score_codex":0.00064094097,"about_ca_topic_score_gemma":0.0008627726,"teacher_disagreement_score":0.049065758,"about_ca_system_score_codex":0.0021272292,"about_ca_system_score_gemma":0.0017851483,"threshold_uncertainty_score":0.1641413},"labels":[],"label_agreement":null},{"id":"W2012645914","doi":"10.3166/ria.26.85-102","title":"La logique modale des modèles d’équilibre","year":2012,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy","score_opus":0.0793269597150169,"score_gpt":0.2877673711702253,"score_spread":0.20844041145520836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012645914","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.02689712,0.001549513,0.91719115,0.009440406,0.00039475271,0.00006887699,0.00079298444,0.0008786357,0.042786628],"genre_scores_gemma":[0.8222928,0.0037227222,0.12310377,0.0017587262,0.0020074942,0.0006353412,0.0016834474,0.00053976534,0.044255935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964342,0.0014341433,0.00016123484,0.00061604637,0.001048189,0.00030627358],"domain_scores_gemma":[0.9878193,0.009197605,0.0005661608,0.0008727443,0.0012825195,0.00026162036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038728255,0.0017610615,0.0019250518,0.0022996224,0.0020108952,0.0072285426,0.0021249047,0.0034406174,0.016205935],"category_scores_gemma":[0.023672333,0.0011632812,0.0030813299,0.0023053545,0.0058361473,0.012762941,0.0030790032,0.011806287,0.0022799887],"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.000071960654,0.000035250923,0.00044979915,0.0001485728,0.00004758364,0.00013858956,0.00025654215,0.030622484,0.000665852,0.95634717,0.0031409203,0.008075261],"study_design_scores_gemma":[0.00004904627,0.000022843658,0.0004564756,0.00004754009,0.00002363398,0.00012423965,0.0001061825,0.297566,0.00064999494,0.691866,0.009049296,0.000038852966],"about_ca_topic_score_codex":0.023879096,"about_ca_topic_score_gemma":0.011611215,"teacher_disagreement_score":0.023879096,"about_ca_system_score_codex":0.008050163,"about_ca_system_score_gemma":0.0025143763,"threshold_uncertainty_score":0.05840826},"labels":[],"label_agreement":null},{"id":"W2012755080","doi":"10.1007/s12136-003-1019-7","title":"Searle freed of every flaw","year":2003,"lang":"en","type":"article","venue":"Acta Analytica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Presupposition; Interpretation (philosophy); Extension (predicate logic); Argument (complex analysis); Set (abstract data type); Epistemology; Philosophy; Comprehension; Linguistics; Remainder; Computer science; Mathematics; Arithmetic","score_opus":0.013245086076460692,"score_gpt":0.22890325118540505,"score_spread":0.21565816510894437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012755080","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.015364586,0.01079069,0.3102606,0.2749588,0.008166425,0.00011626494,0.00050152285,0.0023560375,0.37748516],"genre_scores_gemma":[0.4839735,0.008219265,0.18243024,0.045280635,0.0032913235,0.00026390393,0.0005456979,0.0020270124,0.27396846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647385,0.0011318069,0.00023711307,0.0008681519,0.0010657705,0.0002233327],"domain_scores_gemma":[0.98912746,0.003784996,0.0002684563,0.0038889204,0.0025893517,0.0003407869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006014641,0.0008911412,0.0014520363,0.0019950506,0.0033581038,0.0051506846,0.0017871726,0.0043373443,0.01642139],"category_scores_gemma":[0.034588214,0.0007212263,0.0009675956,0.0008269819,0.012012878,0.016914247,0.0046908013,0.008415937,0.0070891446],"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.000038067014,0.00001723802,0.00025020458,0.000068659036,0.000029481005,0.00005961419,0.00075271557,0.00036389034,0.00017109136,0.9441575,0.030234031,0.02385754],"study_design_scores_gemma":[0.000020666208,0.000014290417,0.00012031609,0.000100891484,0.000020279771,0.00013661217,0.00023342842,0.00089158484,0.00049690943,0.8461866,0.15176113,0.000017289065],"about_ca_topic_score_codex":0.0026254961,"about_ca_topic_score_gemma":0.003856424,"teacher_disagreement_score":0.01642139,"about_ca_system_score_codex":0.0016551961,"about_ca_system_score_gemma":0.002607201,"threshold_uncertainty_score":0.05493498},"labels":[],"label_agreement":null},{"id":"W2012950215","doi":"10.1006/aima.2000.1947","title":"Distribution Algebras and Duality","year":2000,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; McGill University","funders":"","keywords":"Mathematics; Duality (order theory); Distribution (mathematics); Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.010238859034066202,"score_gpt":0.2655569451731602,"score_spread":0.255318086139094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012950215","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.038639948,0.031422835,0.4609983,0.02769632,0.00179974,0.000058287693,0.00054726127,0.00046794448,0.43836933],"genre_scores_gemma":[0.85223603,0.013453112,0.0540994,0.0034386122,0.003667655,0.00017682077,0.00057092216,0.0002456459,0.07211177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868935,0.00054767955,0.00006582676,0.0003008891,0.00029229885,0.00010391986],"domain_scores_gemma":[0.9982584,0.0009839343,0.00009599579,0.00028209403,0.0002534766,0.00012602184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020994083,0.00051687815,0.0010096994,0.0017046323,0.002443589,0.0051431456,0.0009378247,0.0015593509,0.010059299],"category_scores_gemma":[0.0043142084,0.000460289,0.0008347864,0.0021489481,0.0076320292,0.014132249,0.0025935275,0.00521069,0.0016681396],"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.0000018351258,0.0000019059992,0.000016310409,0.0000035778544,9.266959e-7,0.000003066857,0.00003404631,0.000049251714,0.000014473558,0.9983491,0.00047793615,0.0010475507],"study_design_scores_gemma":[0.0000013667114,9.434407e-7,0.000011509693,0.0000022759166,7.1687873e-7,0.000009513322,0.000014972952,0.00015972504,0.000015260508,0.9965862,0.003196651,9.184903e-7],"about_ca_topic_score_codex":0.0013811542,"about_ca_topic_score_gemma":0.0007935401,"teacher_disagreement_score":0.010059299,"about_ca_system_score_codex":0.0023210845,"about_ca_system_score_gemma":0.0011748787,"threshold_uncertainty_score":0.03365171},"labels":[],"label_agreement":null},{"id":"W2013667259","doi":"10.1145/2362355.2362356","title":"Epistemic Strategies and Games on Concurrent Processes","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Process calculus; Computer science; Semantics (computer science); Class (philosophy); Epistemic modal logic; Information flow; Process (computing); Scheduling (production processes); Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.03906599009138076,"score_gpt":0.2874935594328966,"score_spread":0.24842756934151586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013667259","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.016839847,0.00080388226,0.9502618,0.001514504,0.00017622359,0.00020326198,0.00013142542,0.00021025131,0.02985891],"genre_scores_gemma":[0.54563195,0.0014124722,0.4342209,0.00075841235,0.00044585418,0.001014414,0.00035029722,0.0001512515,0.016014474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613935,0.0016885285,0.00038945416,0.00048265906,0.0009012417,0.0003988191],"domain_scores_gemma":[0.99689746,0.0015554097,0.0003297364,0.0002893528,0.0005805486,0.0003474632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299581,0.0013204664,0.0008212356,0.0017744479,0.0018753507,0.0035617,0.0019828,0.0019534754,0.0049025645],"category_scores_gemma":[0.006395047,0.0006491545,0.0020942509,0.0014933142,0.0047861417,0.008228063,0.002975652,0.003002948,0.0008629839],"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.0000054039183,0.000010855575,0.000038747803,0.000016375214,0.000004833529,0.000042024694,0.00015359437,0.0025976906,0.00018247036,0.9954436,0.00012527007,0.0013792561],"study_design_scores_gemma":[0.000019153447,0.000018378245,0.000037982318,0.000019310335,0.000009767503,0.00005326205,0.000074579264,0.019576779,0.00029938412,0.9729171,0.006962938,0.000011467331],"about_ca_topic_score_codex":0.004663717,"about_ca_topic_score_gemma":0.003685045,"teacher_disagreement_score":0.0049025645,"about_ca_system_score_codex":0.0026241404,"about_ca_system_score_gemma":0.0024002325,"threshold_uncertainty_score":0.019039571},"labels":[],"label_agreement":null},{"id":"W2014469781","doi":"10.1007/s10485-010-9241-0","title":"Deep Inference and Probabilistic Coherence Spaces","year":2010,"lang":"en","type":"article","venue":"Applied Categorical Structures","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sequent calculus; Functor; Linear logic; Noncommutative geometry; Sequent; Tensor product; Category theory; Rule of inference; Algebra over a field; Inference; Pure mathematics; Discrete mathematics; Artificial intelligence; Computer science; Mathematical proof","score_opus":0.009786615218030535,"score_gpt":0.2348890658194487,"score_spread":0.22510245060141817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014469781","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.03232379,0.0013606158,0.9546049,0.0031844126,0.00006985249,0.000030541563,0.00048455136,0.00033265544,0.007608679],"genre_scores_gemma":[0.8168791,0.0012071589,0.17367968,0.0007006443,0.00041299654,0.00013514851,0.0013094641,0.00013876376,0.005537085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961338,0.0018129648,0.0002475191,0.0007287553,0.0008256667,0.00025137313],"domain_scores_gemma":[0.9809234,0.014258112,0.0010710495,0.0018819614,0.0014046045,0.0004609188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045214104,0.0005935189,0.0010200007,0.0027928278,0.0015085175,0.004948068,0.0019971859,0.0014872064,0.0065233056],"category_scores_gemma":[0.023586947,0.0008960522,0.0013917357,0.002371884,0.0047204364,0.014236652,0.00439089,0.00466555,0.00053739524],"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.00004521686,0.00002467046,0.0005471666,0.0000749129,0.000042119143,0.000027524511,0.00020791942,0.008186709,0.00024119651,0.9700464,0.0009916321,0.019564578],"study_design_scores_gemma":[0.000004101019,0.000003426301,0.00006370628,0.0000092840055,0.00000677049,0.0000066682765,0.00002370399,0.020249989,0.000107682135,0.97896785,0.000552867,0.000004089373],"about_ca_topic_score_codex":0.0046064793,"about_ca_topic_score_gemma":0.0066754604,"teacher_disagreement_score":0.0065233056,"about_ca_system_score_codex":0.002954503,"about_ca_system_score_gemma":0.0016623891,"threshold_uncertainty_score":0.023911834},"labels":[],"label_agreement":null},{"id":"W2015311986","doi":"10.1002/malq.200410029","title":"Excluded Middle versus Choice in a topos","year":2005,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"McMaster University","funders":"","keywords":"Law of excluded middle; Topos theory; Epimorphism; Mathematics; Pure mathematics; Combinatorics; Linguistics; Philosophy; Literature","score_opus":0.046753796971506896,"score_gpt":0.27962813159821714,"score_spread":0.23287433462671026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015311986","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.16284236,0.005355546,0.4580335,0.008830819,0.00089726713,0.00007397076,0.000308676,0.0005841547,0.3630737],"genre_scores_gemma":[0.9605986,0.0010298529,0.02234312,0.00079590356,0.0005148646,0.00005191438,0.00009247098,0.000068004854,0.014505308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854976,0.00040472104,0.00009255899,0.00030981438,0.00040895457,0.00023410807],"domain_scores_gemma":[0.99876523,0.0006429871,0.000110545196,0.0001964251,0.00011967968,0.00016528732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020676425,0.0003896226,0.00051400135,0.0014024857,0.0021002525,0.0042852913,0.00070421066,0.0012977127,0.006623112],"category_scores_gemma":[0.0020069096,0.00027583845,0.0009201488,0.0013174308,0.0128440475,0.010577966,0.0032832061,0.0023234268,0.00072782184],"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.000007645787,0.0000024693325,0.000031104013,0.000008298355,0.0000023456844,0.000036824484,0.00010153884,0.00009657456,0.00015313832,0.99823654,0.0002111983,0.0011123968],"study_design_scores_gemma":[0.000007202209,0.000008971273,0.000054473207,0.000009232513,0.000005152196,0.00004654961,0.00006310559,0.00077836285,0.0002481073,0.99454933,0.0042247884,0.0000045773913],"about_ca_topic_score_codex":0.0013206587,"about_ca_topic_score_gemma":0.0010761592,"teacher_disagreement_score":0.006623112,"about_ca_system_score_codex":0.0016792198,"about_ca_system_score_gemma":0.0006748469,"threshold_uncertainty_score":0.022156537},"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":"W2017592844","doi":"10.1016/j.jal.2006.03.005","title":"A consistency-based framework for merging knowledge bases","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Merge (version control); Knowledge base; Computer science; Consistency (knowledge bases); Logical consequence; Operator (biology); Theoretical computer science; Mathematics; Artificial intelligence; Information retrieval","score_opus":0.021584547316818525,"score_gpt":0.2681046684767184,"score_spread":0.24652012115989985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017592844","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.002278893,0.00032215117,0.99317366,0.00040169823,0.00006261286,0.00023626354,0.00027181298,0.0018690547,0.0013837939],"genre_scores_gemma":[0.03307885,0.00021766721,0.9636421,0.00016130056,0.00007738562,0.00016774365,0.001176009,0.00031761135,0.0011612971],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98360026,0.0042677606,0.0026687654,0.0023826265,0.0062168315,0.00086380413],"domain_scores_gemma":[0.9624606,0.013426629,0.0020733539,0.012212092,0.008687806,0.0011395558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023242753,0.001276736,0.0022029204,0.008768401,0.0035148035,0.01027107,0.010452678,0.0038216775,0.0069079916],"category_scores_gemma":[0.05976507,0.0027514205,0.004158261,0.008428473,0.0035376528,0.018976776,0.011780218,0.005144966,0.002140787],"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.00066335563,0.00031278763,0.002899748,0.0008847306,0.0006113677,0.0009060405,0.0020501271,0.034560185,0.0070346487,0.3563613,0.014851709,0.578864],"study_design_scores_gemma":[0.0002601665,0.00022776434,0.00092886423,0.00048250053,0.00096911006,0.0009861359,0.0006944397,0.2972812,0.021976134,0.6068416,0.06909557,0.00025645847],"about_ca_topic_score_codex":0.011750469,"about_ca_topic_score_gemma":0.013989459,"teacher_disagreement_score":0.023242753,"about_ca_system_score_codex":0.002059355,"about_ca_system_score_gemma":0.006194079,"threshold_uncertainty_score":0.12292093},"labels":[],"label_agreement":null},{"id":"W2021003968","doi":"10.1016/j.artint.2011.10.001","title":"Parallel belief revision: Revising by sets of formulas","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Counterfactual thinking; Iterated function; Set (abstract data type); State (computer science); Belief structure; Function (biology); Mathematics; Mathematical economics; Epistemology; Computer science; Artificial intelligence; Algorithm; Philosophy","score_opus":0.08553203347805895,"score_gpt":0.29661412308617197,"score_spread":0.21108208960811303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021003968","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.031146944,0.0008124654,0.96029335,0.0012436939,0.00028859873,0.00023295335,0.00018872731,0.000930201,0.0048630633],"genre_scores_gemma":[0.5299142,0.000619216,0.46346694,0.0006199222,0.00045158205,0.0004252876,0.0005039892,0.00023225519,0.0037665823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98887527,0.0053716856,0.0008637267,0.001798523,0.0026326694,0.00045818076],"domain_scores_gemma":[0.9451847,0.036236495,0.0018070983,0.011334197,0.0046545314,0.00078307785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012554411,0.0011998992,0.0023955156,0.0021889503,0.0016162689,0.004927986,0.004959764,0.0021514609,0.0070927744],"category_scores_gemma":[0.06810715,0.0014720963,0.0029850719,0.0021143046,0.0037952145,0.011116041,0.0046829493,0.0046074223,0.00070301536],"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.0015100664,0.0005028428,0.0028349792,0.0008486392,0.0008517275,0.00042809235,0.0018715556,0.08912056,0.0038314266,0.4832241,0.00894962,0.4060264],"study_design_scores_gemma":[0.00014056913,0.00009787194,0.00024946802,0.000062386396,0.00017157396,0.00010630222,0.00010777675,0.30760363,0.0018017679,0.68739283,0.0022264835,0.00003936845],"about_ca_topic_score_codex":0.0031339969,"about_ca_topic_score_gemma":0.0033871555,"teacher_disagreement_score":0.012554411,"about_ca_system_score_codex":0.0017495354,"about_ca_system_score_gemma":0.0024166394,"threshold_uncertainty_score":0.066394866},"labels":[],"label_agreement":null},{"id":"W2024618947","doi":"10.1017/s1755020309090145","title":"RELEVANCE LOGICS AND RELATION ALGEBRAS","year":2009,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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 Alberta","funders":"","keywords":"Soundness; Relevance (law); Relation (database); Mathematics; Completeness (order theory); Semantics (computer science); Fragment (logic); Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Algorithm; Programming language; Data mining","score_opus":0.018160400362870248,"score_gpt":0.26656634320640077,"score_spread":0.24840594284353051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024618947","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.03179862,0.035740178,0.7722006,0.010069539,0.0006256849,0.00021952967,0.0005492109,0.0006996601,0.14809698],"genre_scores_gemma":[0.7287582,0.015851995,0.22514158,0.0028757486,0.0019352828,0.00033184525,0.0007579081,0.00014219162,0.024205338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543166,0.0016539498,0.00035740327,0.0008869696,0.0014099262,0.00026001787],"domain_scores_gemma":[0.9966449,0.0020155348,0.00026194163,0.00048158132,0.0004771756,0.00011882202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038670904,0.000505274,0.00073959515,0.0023582084,0.0018327989,0.0053924853,0.0011532656,0.0015670373,0.0039669136],"category_scores_gemma":[0.0069971895,0.00050139456,0.0011613745,0.0024211647,0.010092755,0.0117959995,0.0022360245,0.003068562,0.0010164585],"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.000003352175,0.0000031963261,0.00002794877,0.000036134094,0.000004455894,0.000026916443,0.00011939243,0.00047654015,0.00012827617,0.995014,0.00033687332,0.003822874],"study_design_scores_gemma":[0.0000033644328,0.0000025640259,0.000022244109,0.000013778488,0.0000027706812,0.000030580573,0.00002733219,0.000989844,0.00010337129,0.9922766,0.006523695,0.0000037418238],"about_ca_topic_score_codex":0.0037881178,"about_ca_topic_score_gemma":0.0022247306,"teacher_disagreement_score":0.0053924853,"about_ca_system_score_codex":0.003300516,"about_ca_system_score_gemma":0.0021922614,"threshold_uncertainty_score":0.02394706},"labels":[],"label_agreement":null},{"id":"W2025270539","doi":"10.1016/j.artint.2010.04.005","title":"A semantic characterization of a useful fragment of the situation calculus with knowledge","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Correctness; Fragment (logic); Calculus (dental); Embedding; Determinacy; Mathematics; Computer science; Algebra over a field; Artificial intelligence; Algorithm; Pure mathematics","score_opus":0.023592062439281004,"score_gpt":0.2558285231445378,"score_spread":0.2322364607052568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025270539","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.02247852,0.0007206355,0.91490155,0.0024528191,0.00024628287,0.00022701435,0.00093683926,0.0008630469,0.057173204],"genre_scores_gemma":[0.56522536,0.0009628422,0.41272083,0.0010585121,0.0006168052,0.0005049185,0.0018167257,0.0004158275,0.016678287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974362,0.0006716644,0.00022761924,0.00043967643,0.00088069146,0.00034415923],"domain_scores_gemma":[0.9969247,0.0013548484,0.00019495319,0.00058733765,0.000654588,0.00028364302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033917606,0.0009574057,0.0010830449,0.0036295212,0.0036357725,0.0061798007,0.002901771,0.002471089,0.00897108],"category_scores_gemma":[0.0058017126,0.0008033962,0.0025744862,0.0042386134,0.006125074,0.01329342,0.0033064664,0.003878743,0.0013338159],"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.000014701765,0.000012464738,0.00004545779,0.000026200434,0.000006162754,0.00007731458,0.00024375849,0.00044475138,0.000400374,0.9951591,0.00075207994,0.0028175926],"study_design_scores_gemma":[0.000013841959,0.000013528251,0.00008100008,0.000022291895,0.000026347581,0.00016790905,0.000113994225,0.00791681,0.0005801866,0.97976196,0.011285655,0.000016425149],"about_ca_topic_score_codex":0.004277315,"about_ca_topic_score_gemma":0.0028090992,"teacher_disagreement_score":0.00897108,"about_ca_system_score_codex":0.0020738246,"about_ca_system_score_gemma":0.00223488,"threshold_uncertainty_score":0.030011177},"labels":[],"label_agreement":null},{"id":"W2025482318","doi":"10.1145/1670412.1670417","title":"Expressive description logics via SAT","year":2009,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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":"Semantic reasoner; Computer science; Rotation formalisms in three dimensions; Satisfiability; Leverage (statistics); Boolean satisfiability problem; Satisfiability modulo theories; Programming language; Theoretical computer science; Automated reasoning; Description logic; Parameterized complexity; Propositional calculus; Algorithm; Artificial intelligence; Mathematics","score_opus":0.020033620206397824,"score_gpt":0.23086146575549177,"score_spread":0.21082784554909395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025482318","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.0032730554,0.00091164396,0.9721709,0.0010953784,0.0000942235,0.0001965214,0.0007738678,0.002789194,0.018695148],"genre_scores_gemma":[0.11198587,0.0026351565,0.8715882,0.00072564103,0.00021233941,0.00049505895,0.0030964743,0.00048156598,0.008779663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454415,0.001981821,0.00040303371,0.00065769296,0.0021570001,0.00025643644],"domain_scores_gemma":[0.99530303,0.0030250365,0.0001662421,0.001069222,0.00034194536,0.00009449183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032432075,0.0009808985,0.00090100494,0.0018856585,0.0010863976,0.005420757,0.0025360181,0.0011593075,0.01295161],"category_scores_gemma":[0.009873555,0.0009525338,0.0022417638,0.0028816727,0.0023774765,0.0075420463,0.004709608,0.0044363085,0.0034118285],"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.000073504954,0.00008275189,0.00025014608,0.0003979154,0.00008218813,0.00016686333,0.00027969357,0.018652838,0.0032747318,0.83325094,0.008164714,0.13532373],"study_design_scores_gemma":[0.00006418922,0.000022956623,0.00009364636,0.00010037948,0.000033180277,0.00017414824,0.00008690709,0.10787783,0.0042022876,0.8377093,0.04961371,0.00002141201],"about_ca_topic_score_codex":0.0016726427,"about_ca_topic_score_gemma":0.0025473877,"teacher_disagreement_score":0.01295161,"about_ca_system_score_codex":0.0016379375,"about_ca_system_score_gemma":0.0019908822,"threshold_uncertainty_score":0.04332745},"labels":[],"label_agreement":null},{"id":"W2026582799","doi":"10.1016/j.tcs.2004.07.028","title":"Enhancing global SLS-resolution with loop cutting and tabling mechanisms","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Resolution (logic); Semantics (computer science); Computation; Computer science; Property (philosophy); Loop (graph theory); Bounded function; Stack (abstract data type); Programming language; Simple (philosophy); Algorithm; Theoretical computer science; Mathematics","score_opus":0.006578832329436091,"score_gpt":0.22602170268789493,"score_spread":0.21944287035845883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026582799","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.022654828,0.00031884323,0.96046233,0.00035069644,0.00009886755,0.00010309877,0.00016305277,0.004347873,0.011500464],"genre_scores_gemma":[0.38329494,0.00021845948,0.60682476,0.00029297773,0.000083956904,0.00011064285,0.0005125381,0.0010509867,0.007610724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745196,0.00084750174,0.00018543446,0.00035493184,0.0008334646,0.00032672015],"domain_scores_gemma":[0.9938506,0.0026703065,0.00029643456,0.002243626,0.0007898441,0.00014918068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030865944,0.0012390133,0.0015259694,0.001745099,0.0011023812,0.0025089218,0.0026546952,0.0018665165,0.020790521],"category_scores_gemma":[0.011856064,0.0005709534,0.0015565405,0.0020316967,0.001992668,0.005991281,0.0061082086,0.0024576308,0.0025685532],"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.00066785514,0.0004005421,0.0018495021,0.0008849255,0.00022046767,0.00041943122,0.0009556051,0.11064493,0.020227535,0.24687696,0.013077796,0.60377455],"study_design_scores_gemma":[0.00017963773,0.00013966658,0.00038807778,0.00012359054,0.0001960344,0.00027966354,0.00041243903,0.57291734,0.029869922,0.37522122,0.02020915,0.00006332695],"about_ca_topic_score_codex":0.0011149793,"about_ca_topic_score_gemma":0.0029204187,"teacher_disagreement_score":0.020790521,"about_ca_system_score_codex":0.0006630376,"about_ca_system_score_gemma":0.0012484655,"threshold_uncertainty_score":0.06955123},"labels":[],"label_agreement":null},{"id":"W2026832606","doi":"10.1007/s10988-012-9117-x","title":"Relational domains and the interpretation of reciprocals","year":2012,"lang":"en","type":"article","venue":"Linguistics and Philosophy","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Technion-Israel Institute of Technology; Israel Academy of Sciences and Humanities; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Radboud Universiteit; York University","keywords":"Reciprocal; Interpretation (philosophy); Predicate (mathematical logic); Quantifier (linguistics); Linguistics; Philosophy of language; Relation (database); Meaning (existential); Domain theory; Semantic interpretation; Computer science; Epistemology; Mathematics; Natural language processing; Philosophy; Discrete mathematics; Metaphysics; Programming language","score_opus":0.024851088823639306,"score_gpt":0.24913377084769386,"score_spread":0.22428268202405455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026832606","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.0870391,0.0054581654,0.5475204,0.012706304,0.00046458826,0.000075331875,0.00038401215,0.00068149786,0.3456706],"genre_scores_gemma":[0.9292197,0.0012517492,0.05912209,0.0011624348,0.000319346,0.0001243139,0.0002560878,0.00022782899,0.0083165085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927285,0.0040902505,0.00040971625,0.0012680904,0.0010854325,0.00041804826],"domain_scores_gemma":[0.9936538,0.0034993908,0.00067780056,0.0013535763,0.00067250227,0.00014297481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006896607,0.0009079618,0.0007997288,0.0029170923,0.0029297585,0.0074784504,0.0020948101,0.0022774835,0.0071990746],"category_scores_gemma":[0.009440658,0.0006718775,0.0016317944,0.001917427,0.018069113,0.020393832,0.0068198843,0.0042601824,0.0010745223],"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.000006343205,0.0000033184629,0.00008146006,0.000020600099,0.0000035318385,0.000034068737,0.001070996,0.00015422709,0.00014507788,0.99620014,0.00024454045,0.0020356444],"study_design_scores_gemma":[0.000007803555,0.000006053703,0.0001565078,0.00003220349,0.0000079849615,0.00008205988,0.0007239881,0.0009508257,0.00038494178,0.98579746,0.0118389465,0.0000112023745],"about_ca_topic_score_codex":0.0016383724,"about_ca_topic_score_gemma":0.0009862413,"teacher_disagreement_score":0.0074784504,"about_ca_system_score_codex":0.003250249,"about_ca_system_score_gemma":0.001102899,"threshold_uncertainty_score":0.036473155},"labels":[],"label_agreement":null},{"id":"W2028246200","doi":"10.1016/s0004-3702(03)00111-5","title":"A consistency-based approach for belief change","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Disjoint sets; Computer science; Knowledge base; Sentence; Consistency (knowledge bases); Theoretical computer science; Implementation; Artificial intelligence; Natural language processing; Programming language; Mathematics; Discrete mathematics","score_opus":0.13670357145101936,"score_gpt":0.30438745971050946,"score_spread":0.1676838882594901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028246200","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.0028067261,0.00034698207,0.9898303,0.0014550664,0.0001389134,0.00012320044,0.00012992138,0.0002195343,0.004949295],"genre_scores_gemma":[0.2859944,0.00054885296,0.70503336,0.00089956564,0.00066022464,0.00063367846,0.0005851526,0.00022536633,0.005419369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98416835,0.006309347,0.0012311415,0.002817524,0.0048167114,0.0006569464],"domain_scores_gemma":[0.9451798,0.035956655,0.0023873136,0.00762437,0.007878754,0.0009731181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01770621,0.0011863551,0.0021316856,0.0052046506,0.002847389,0.0068129855,0.008307878,0.0041192495,0.009142019],"category_scores_gemma":[0.08936248,0.0015529927,0.0037189622,0.0043518445,0.0058892616,0.015752487,0.007287501,0.007967616,0.0012289884],"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.0002019824,0.00012068146,0.0013949451,0.0002455915,0.00022129547,0.00023119047,0.0009242716,0.030723248,0.0008645958,0.8603473,0.0037696026,0.10095522],"study_design_scores_gemma":[0.000059977945,0.000058007907,0.00029577923,0.00006693595,0.000116031566,0.00015606743,0.00013457268,0.16637662,0.00089935906,0.8271624,0.0046273326,0.00004688685],"about_ca_topic_score_codex":0.0060817976,"about_ca_topic_score_gemma":0.0045189345,"teacher_disagreement_score":0.01770621,"about_ca_system_score_codex":0.0032631627,"about_ca_system_score_gemma":0.0031154393,"threshold_uncertainty_score":0.093640566},"labels":[],"label_agreement":null},{"id":"W202943302","doi":"10.4230/dagsemproc.05321.11","title":"Iterated Belief Change and the Levi Identity","year":2005,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Alberta","funders":"","keywords":"Iterated function; Belief revision; Identity (music); Mathematics; Computer science; Set (abstract data type); Epistemology; Mathematical economics; Artificial intelligence; Philosophy","score_opus":0.0285557793842919,"score_gpt":0.25975007583539717,"score_spread":0.23119429645110526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202943302","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.05187049,0.0032966346,0.79581577,0.009131705,0.00035166013,0.00013415237,0.00018697308,0.0005790717,0.13863352],"genre_scores_gemma":[0.8730744,0.0009123264,0.10855669,0.0011225275,0.00036739992,0.0002605775,0.0001401161,0.00016832686,0.01539772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927428,0.0027435492,0.000397902,0.0014683185,0.0019615267,0.00068589114],"domain_scores_gemma":[0.99244106,0.0037385095,0.0007089527,0.0013218734,0.0012817193,0.0005079536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00645542,0.0005960001,0.0010422118,0.0015414812,0.0021026684,0.0045504794,0.0017442236,0.0019156192,0.0048642675],"category_scores_gemma":[0.013143295,0.00046462077,0.0019182276,0.00101982,0.012956786,0.0072298576,0.004386202,0.003765607,0.00093766337],"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.000018110251,0.000010982119,0.00014893913,0.00002998497,0.000014820765,0.000051328658,0.0004121839,0.0013444056,0.00018280209,0.99079657,0.0005087303,0.0064810975],"study_design_scores_gemma":[0.0000123247555,0.0000179841,0.000097622025,0.0000144389205,0.0000076384395,0.000030602318,0.00005579597,0.0060110735,0.00028290224,0.99075717,0.0027015104,0.000010907335],"about_ca_topic_score_codex":0.002562924,"about_ca_topic_score_gemma":0.0014384586,"teacher_disagreement_score":0.00645542,"about_ca_system_score_codex":0.0042546983,"about_ca_system_score_gemma":0.0016035562,"threshold_uncertainty_score":0.03413993},"labels":[],"label_agreement":null},{"id":"W2029705123","doi":"10.1109/tciaig.2014.2365414","title":"Predicting Opponent's Production in Real-Time Strategy Games With Answer Set Programming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Intelligence and AI in Games","topic":"Logic, Reasoning, and Knowledge","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":"University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Artificial intelligence; Set (abstract data type); Semantics (computer science); Theoretical computer science; Machine learning; Programming language","score_opus":0.02649509238743087,"score_gpt":0.27691518188270714,"score_spread":0.2504200894952763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029705123","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.18025377,0.00018360336,0.81725496,0.00036676173,0.000024117491,0.000081292346,0.00015196945,0.0005474399,0.0011360584],"genre_scores_gemma":[0.89812326,0.00010139199,0.10060733,0.000078838275,0.000019753601,0.0001316257,0.00024959428,0.00005505048,0.000633025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985304,0.0006679224,0.00007627313,0.00029867858,0.0002660762,0.0001606215],"domain_scores_gemma":[0.9878192,0.0103638815,0.0008868854,0.00020832487,0.00043327714,0.0002885359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031399543,0.0014563334,0.0011177884,0.0012086355,0.00037934515,0.0015013103,0.0017078746,0.0013229487,0.0016721148],"category_scores_gemma":[0.013013268,0.0005807403,0.0008643096,0.00061698945,0.001061757,0.002170961,0.0012408178,0.0019747035,0.0002258705],"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.00023737388,0.00011009851,0.0027919565,0.000057813475,0.00005900155,0.00006772728,0.000083174426,0.96747935,0.0009156236,0.004833149,0.00022162912,0.023143198],"study_design_scores_gemma":[0.0000040292593,0.000014607679,0.00012582217,0.0000022456275,0.000002864826,0.0000041715266,0.000007346548,0.9956868,0.00027639454,0.0038469015,0.000025942325,0.000002867767],"about_ca_topic_score_codex":0.0052628065,"about_ca_topic_score_gemma":0.0036750992,"teacher_disagreement_score":0.0052628065,"about_ca_system_score_codex":0.0012620613,"about_ca_system_score_gemma":0.001239754,"threshold_uncertainty_score":0.016605854},"labels":[],"label_agreement":null},{"id":"W2030345508","doi":"10.3166/ria.26.11-38","title":"Les travaux de Pascal Nicolas. Interrogation, induction et déduction automatiques pour le raisonnement non monotone... et plus encore","year":2012,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pascal (unit); Rotation formalisms in three dimensions; Computer science; Humanities; Philosophy; Programming language; Mathematics","score_opus":0.09318070153650114,"score_gpt":0.3328635752720203,"score_spread":0.23968287373551916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030345508","genre_codex":"commentary","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.007829771,0.23783351,0.18096949,0.33447656,0.020643642,0.00022583677,0.0005492447,0.0007447229,0.2167272],"genre_scores_gemma":[0.24378733,0.15308383,0.23393114,0.08267939,0.028565358,0.00078446633,0.0007535488,0.001510284,0.2549046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98811615,0.005298692,0.00031567342,0.0024980172,0.003373171,0.00039824072],"domain_scores_gemma":[0.9871019,0.009026718,0.00049987354,0.00041897208,0.0025582616,0.00039428603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054362603,0.0017943333,0.0007676211,0.0021062032,0.0040697437,0.005507858,0.0017569562,0.0034183965,0.0045060907],"category_scores_gemma":[0.019534014,0.001556181,0.0013462226,0.0019287925,0.008166729,0.008578828,0.0018290501,0.0135560585,0.0024680651],"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.00021337847,0.00008143483,0.00077562616,0.00054000877,0.000058700523,0.0004688754,0.0028622895,0.002613579,0.0008671707,0.6759638,0.2130334,0.10252172],"study_design_scores_gemma":[0.000022733528,0.000024863322,0.00071166374,0.00018837547,0.0000222843,0.00087640126,0.0003564296,0.0024597573,0.0029210576,0.10957643,0.882756,0.000083982246],"about_ca_topic_score_codex":0.04537161,"about_ca_topic_score_gemma":0.016548513,"teacher_disagreement_score":0.04537161,"about_ca_system_score_codex":0.005865094,"about_ca_system_score_gemma":0.0037854414,"threshold_uncertainty_score":0.09021509},"labels":[],"label_agreement":null},{"id":"W2032952766","doi":"10.1007/bf02379783","title":"Knowability and intuitionistic logic","year":2001,"lang":"en","type":"article","venue":"Philosophia","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Philosophy of language; Philosophy of science; Philosophy of mind; Philosophy; Epistemology; Intuitionistic logic; Linguistics; Metaphysics; Propositional calculus","score_opus":0.034124425823559436,"score_gpt":0.2603120722121932,"score_spread":0.22618764638863378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032952766","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.05677902,0.05813679,0.53193456,0.060615733,0.0011548739,0.00011779554,0.0007920133,0.000686087,0.28978312],"genre_scores_gemma":[0.91729844,0.011447726,0.05130933,0.0034356166,0.0018896261,0.0001769218,0.0005784963,0.000098971184,0.013764882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655354,0.0014894675,0.00025845494,0.00052920345,0.0009297589,0.00023959778],"domain_scores_gemma":[0.98628914,0.010875108,0.00060534774,0.0011879496,0.00074779417,0.00029458714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003963166,0.00073564326,0.0011406004,0.0025192962,0.0026218859,0.006806626,0.0017493215,0.003264168,0.007768192],"category_scores_gemma":[0.013602404,0.00074762857,0.0014504823,0.0022901436,0.016583899,0.020381674,0.0027200216,0.0063999845,0.0011627426],"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.0000118275775,0.00001166862,0.00009839658,0.00006240181,0.000010205464,0.000028727434,0.00024868388,0.00034403818,0.00004200885,0.99464417,0.0008603367,0.0036376582],"study_design_scores_gemma":[0.0000027527801,0.0000013414086,0.00002789819,0.000009850502,0.0000024518831,0.000012662234,0.000023027173,0.00029604224,0.000020452995,0.99839467,0.0012063385,0.0000025525596],"about_ca_topic_score_codex":0.0025703644,"about_ca_topic_score_gemma":0.0015621299,"teacher_disagreement_score":0.007768192,"about_ca_system_score_codex":0.0034265788,"about_ca_system_score_gemma":0.0012830452,"threshold_uncertainty_score":0.025987148},"labels":[],"label_agreement":null},{"id":"W2035142469","doi":"10.1017/s1471068414000210","title":"<tt>claspfolio</tt>2: Advances in Algorithm Selection for Answer Set Programming","year":2014,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":65,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Solver; Computer science; Selection (genetic algorithm); Modular design; Portfolio; Answer set programming; Set (abstract data type); Schedule; Artificial intelligence; Programming language","score_opus":0.01772871674396846,"score_gpt":0.30882743560079146,"score_spread":0.291098718856823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035142469","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.005312829,0.0006519615,0.9724076,0.0011775161,0.00018023315,0.00014452395,0.0003169586,0.008983539,0.010824855],"genre_scores_gemma":[0.08079989,0.00060097023,0.90857816,0.0006685039,0.00023070425,0.00018837972,0.0014368903,0.0020159981,0.005480524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99407274,0.0021295394,0.00043811856,0.0007701288,0.002285556,0.00030393072],"domain_scores_gemma":[0.9928039,0.004069462,0.00031599024,0.0011709293,0.0013312532,0.00030849376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006405593,0.0011200225,0.000792088,0.0017613624,0.0007027424,0.003244398,0.003113337,0.0013175287,0.014842696],"category_scores_gemma":[0.01544213,0.00065531867,0.001407422,0.0020660188,0.00112267,0.00375657,0.003432839,0.003669002,0.004069015],"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.00046606676,0.00039973896,0.0015170324,0.0006236341,0.00016200561,0.00020712102,0.0002473997,0.08267284,0.008226175,0.15575421,0.07755086,0.67217296],"study_design_scores_gemma":[0.00019897436,0.0001931469,0.000392412,0.0001806839,0.000054165634,0.00034403644,0.00008048136,0.6861024,0.020329975,0.18712188,0.104948245,0.000053678243],"about_ca_topic_score_codex":0.0020241647,"about_ca_topic_score_gemma":0.0029144872,"teacher_disagreement_score":0.014842696,"about_ca_system_score_codex":0.0017194729,"about_ca_system_score_gemma":0.0027508696,"threshold_uncertainty_score":0.04965377},"labels":[],"label_agreement":null},{"id":"W2036651904","doi":"10.1016/s0168-0072(03)00056-3","title":"A second-order system for polytime reasoning based on Grädel's theorem","year":2003,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Order (exchange); Bounded function; Polynomial; Reverse mathematics; Corollary; Second-order logic; Function (biology); Class (philosophy); French horn; Polynomial hierarchy; Discrete mathematics; Second-order arithmetic; Time complexity; Combinatorics; Algebra over a field; Pure mathematics; Computer science; Axiom; Description logic; Artificial intelligence","score_opus":0.03015922952910509,"score_gpt":0.26459985969411787,"score_spread":0.23444063016501276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036651904","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.011174231,0.00014862983,0.9778706,0.00043412478,0.0001561874,0.00014440634,0.00041186984,0.002368222,0.0072916746],"genre_scores_gemma":[0.31044635,0.00024985088,0.6765533,0.00043401308,0.00017143448,0.0003094969,0.0011172937,0.00051148975,0.01020685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970805,0.00044524262,0.00036886046,0.0007664689,0.0009288924,0.000410086],"domain_scores_gemma":[0.99703586,0.0012628142,0.00013471828,0.00074904866,0.0005827881,0.00023492552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021799672,0.00089878077,0.0019864172,0.0020427005,0.0023830612,0.006029017,0.0035321836,0.0016932179,0.008442881],"category_scores_gemma":[0.005992429,0.0010690312,0.0033595066,0.0017234825,0.0036091853,0.009100276,0.005377519,0.004462021,0.0025941024],"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.00017017424,0.00007694906,0.00040614867,0.00015129664,0.00004404693,0.00015940612,0.00052606006,0.009541546,0.0030838272,0.9481313,0.003799767,0.03390947],"study_design_scores_gemma":[0.00012805282,0.00007902539,0.000234928,0.00004236513,0.00013142222,0.00013004965,0.00010712263,0.168494,0.005704373,0.8072465,0.017614063,0.000088153814],"about_ca_topic_score_codex":0.009750141,"about_ca_topic_score_gemma":0.012213935,"teacher_disagreement_score":0.009750141,"about_ca_system_score_codex":0.002973073,"about_ca_system_score_gemma":0.0027818906,"threshold_uncertainty_score":0.028244257},"labels":[],"label_agreement":null},{"id":"W2037742565","doi":"10.1305/ndjfl/1091030851","title":"Probabilistic Canonical Models for Partial Logics","year":2003,"lang":"en","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Victoria","funders":"","keywords":"Soundness; Completeness (order theory); Probabilistic logic; Predicate (mathematical logic); Gödel's completeness theorem; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Programming language; Statistics","score_opus":0.04454526761879116,"score_gpt":0.27234907474568604,"score_spread":0.22780380712689488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037742565","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.011544367,0.0011616467,0.9363325,0.0040239096,0.0002687614,0.00012385026,0.00047356507,0.0005070026,0.045564324],"genre_scores_gemma":[0.7074967,0.0024231712,0.25996926,0.002050131,0.0010115664,0.000827914,0.0013123979,0.00030812543,0.024600714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99450773,0.0021642048,0.00035633062,0.0007974508,0.0016515733,0.0005226574],"domain_scores_gemma":[0.99453545,0.0026974934,0.00039094538,0.00097137794,0.0010031833,0.00040144954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005390879,0.0011117619,0.0010060746,0.002582562,0.0023603365,0.007829623,0.0022522137,0.00210866,0.008325564],"category_scores_gemma":[0.012762972,0.0010853269,0.0025450494,0.0025926558,0.0070875306,0.013531157,0.004465384,0.004541677,0.0013899985],"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.0000019493984,0.000002522276,0.00002303032,0.0000071969403,0.0000025526042,0.00001055101,0.000042316242,0.0010139016,0.000015622722,0.9979685,0.00020219586,0.00070963247],"study_design_scores_gemma":[0.000003698049,0.0000020163895,0.000010666812,0.000007300348,0.0000030110666,0.000015552598,0.00002077943,0.007879025,0.000038258386,0.9898633,0.002152287,0.000004205247],"about_ca_topic_score_codex":0.004853367,"about_ca_topic_score_gemma":0.0057526273,"teacher_disagreement_score":0.008325564,"about_ca_system_score_codex":0.0038902487,"about_ca_system_score_gemma":0.0027288522,"threshold_uncertainty_score":0.028510034},"labels":[],"label_agreement":null},{"id":"W2039987681","doi":"10.1016/j.artint.2014.03.007","title":"On our best behaviour","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Clearance; Computer science; Epistemology; Context (archaeology); Cognitive science; Artificial intelligence; Artificial general intelligence; Psychology; Data science; Philosophy; History","score_opus":0.052468964991108834,"score_gpt":0.30392796302351216,"score_spread":0.25145899803240335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039987681","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07467522,0.0025014216,0.18995184,0.06907381,0.0022303953,0.00040594916,0.001224978,0.005149796,0.6547866],"genre_scores_gemma":[0.6635661,0.0021684668,0.108009964,0.009711631,0.00071908336,0.00030857712,0.0014566737,0.0019968548,0.21206267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683595,0.001130859,0.00012116337,0.0006045772,0.00077866734,0.0005287199],"domain_scores_gemma":[0.99445516,0.0016268826,0.00023963906,0.0016994382,0.0012920446,0.0006869462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023290352,0.0010792644,0.0006839425,0.0011985644,0.002255819,0.004888448,0.0019966369,0.0032623287,0.053871244],"category_scores_gemma":[0.012792192,0.00039976838,0.0009762899,0.00075104117,0.0018477917,0.0061492,0.002642412,0.0031857146,0.01611282],"study_design_candidate":"not_applicable","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.00071866135,0.001047184,0.011918495,0.00057493953,0.00042097544,0.0011435325,0.003437312,0.01528711,0.018971821,0.42255324,0.16883804,0.3550887],"study_design_scores_gemma":[0.000110968555,0.0004030966,0.00412851,0.00050611404,0.0003342738,0.0011794767,0.0041580545,0.06283129,0.011877,0.53833586,0.3759648,0.00017057541],"about_ca_topic_score_codex":0.003371028,"about_ca_topic_score_gemma":0.0059416466,"teacher_disagreement_score":0.053871244,"about_ca_system_score_codex":0.0011330702,"about_ca_system_score_gemma":0.0021605736,"threshold_uncertainty_score":0.18021727},"labels":[],"label_agreement":null},{"id":"W2041784286","doi":"10.1016/j.tcs.2014.10.027","title":"Algorithmic correspondence for intuitionistic modal mu-calculus","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Research Foundation","keywords":"Soundness; Mathematics; Focus (optics); Modal; Calculus (dental); Algebraic number; Intuitionistic logic; Interpretation (philosophy); Algebra over a field; Discrete mathematics; Modal logic; Pure mathematics; Computer science; Propositional calculus; Programming language","score_opus":0.008760041303592257,"score_gpt":0.24834116186091518,"score_spread":0.23958112055732292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041784286","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.0705866,0.0009783464,0.81781155,0.0034338103,0.00034449357,0.0001434447,0.00048819755,0.0011419848,0.10507153],"genre_scores_gemma":[0.7575612,0.0006721916,0.2163255,0.00091559667,0.00044774884,0.00035020182,0.0008221016,0.00030803893,0.022597436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974482,0.00078298803,0.00018317135,0.00054552715,0.00071080023,0.00032941456],"domain_scores_gemma":[0.99744105,0.001471057,0.000120047975,0.00045378253,0.0003417941,0.00017219808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021200539,0.00068338873,0.0012743851,0.0021730214,0.0038818794,0.0057782736,0.0031574457,0.0022316903,0.015623102],"category_scores_gemma":[0.0059442464,0.0008209876,0.0025278039,0.0022400965,0.003440693,0.010974556,0.005103754,0.004619551,0.0015154147],"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.000012035192,0.000015495478,0.000066366316,0.000017653123,0.0000048431957,0.000016897679,0.000094006835,0.00040675042,0.00009986174,0.9965084,0.00045534252,0.002302342],"study_design_scores_gemma":[0.000006289775,0.00000431518,0.000043982815,0.0000052113587,0.0000051478996,0.000017408376,0.000030585277,0.0037689845,0.0001075352,0.99476963,0.0012356733,0.0000052282744],"about_ca_topic_score_codex":0.0016585207,"about_ca_topic_score_gemma":0.0017699508,"teacher_disagreement_score":0.015623102,"about_ca_system_score_codex":0.0027169178,"about_ca_system_score_gemma":0.0017325445,"threshold_uncertainty_score":0.052264452},"labels":[],"label_agreement":null},{"id":"W2042629502","doi":"10.1145/1342991.1342998","title":"A logic of nonmonotone inductive definitions","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":109,"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":"Datalog; Iterated function; Higher-order logic; Inductive logic programming; Stable model semantics; Logic programming; Computational logic; Rotation formalisms in three dimensions; Computer science; Classical logic; Dynamic logic (digital electronics); Programming language; Semantics (computer science); Theoretical computer science; Mathematics; Multimodal logic; Description logic","score_opus":0.08719166760923303,"score_gpt":0.273118851588242,"score_spread":0.18592718397900898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042629502","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.011324658,0.0015907133,0.94641477,0.0017438715,0.00035343974,0.00011072814,0.00032720302,0.0004910365,0.03764359],"genre_scores_gemma":[0.32934847,0.0017655549,0.64274603,0.0021095648,0.0006457076,0.0003963103,0.00064302643,0.0002765907,0.02206877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971788,0.000726064,0.00030142782,0.0007428916,0.00082529854,0.00022544706],"domain_scores_gemma":[0.9973954,0.0013311914,0.00026676076,0.00035869554,0.0005224138,0.00012548795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003345286,0.0005769735,0.00049520377,0.0014272239,0.001355221,0.003299898,0.0016964807,0.0009289149,0.003161218],"category_scores_gemma":[0.0029592982,0.0005926506,0.0014034088,0.0013172708,0.0049695447,0.008527607,0.0024674477,0.0033831706,0.00086883],"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.0000070237065,0.000008820647,0.00007718894,0.00004428789,0.0000060294024,0.000066558154,0.00021612691,0.00035229904,0.0006463289,0.9907799,0.0007141884,0.0070811547],"study_design_scores_gemma":[0.00001807261,0.000031755222,0.00015339539,0.00005293721,0.000028636516,0.00035807528,0.000103724524,0.0074180565,0.0034312147,0.91354156,0.07484045,0.000022081067],"about_ca_topic_score_codex":0.00066956994,"about_ca_topic_score_gemma":0.0007424937,"teacher_disagreement_score":0.003345286,"about_ca_system_score_codex":0.001684289,"about_ca_system_score_gemma":0.001352427,"threshold_uncertainty_score":0.017691731},"labels":[],"label_agreement":null},{"id":"W2043434266","doi":"10.7202/039715ar","title":"La dualité de Lautman contre la négativité de Hegel, et le paradoxe de leurs formalisations","year":2010,"lang":"fr","type":"article","venue":"Philosophiques","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy; Humanities","score_opus":0.16477225120965233,"score_gpt":0.35804103502314116,"score_spread":0.19326878381348883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043434266","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.13591248,0.010329562,0.38069192,0.061280865,0.0008561487,0.000063494306,0.00013299227,0.00038295562,0.4103495],"genre_scores_gemma":[0.93823385,0.0016568596,0.03475657,0.002198372,0.00022341148,0.00014805644,0.0000444683,0.00015784518,0.022580616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476874,0.0031591316,0.00015762875,0.0006438795,0.00092578825,0.00034486857],"domain_scores_gemma":[0.9958045,0.0026257136,0.00030464202,0.00063258404,0.00051012874,0.00012257318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055368077,0.0006427774,0.0006626431,0.001857838,0.0029009571,0.005185655,0.0011804618,0.0020608618,0.00498957],"category_scores_gemma":[0.0076855742,0.0004255719,0.000871369,0.0013708567,0.029382192,0.010949813,0.005151081,0.0044409395,0.00060106063],"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.000003584739,0.0000011844891,0.00004003692,0.000012676333,0.0000014534436,0.000011120588,0.0011719734,0.000067133435,0.00008443344,0.9975266,0.00019459338,0.0008852385],"study_design_scores_gemma":[0.0000073650845,0.000006521881,0.000104954,0.000037349982,0.0000037461903,0.000048712493,0.00088308094,0.00063092867,0.0003167874,0.979502,0.018450238,0.000008311136],"about_ca_topic_score_codex":0.0037791762,"about_ca_topic_score_gemma":0.003357855,"teacher_disagreement_score":0.0058054407,"about_ca_system_score_codex":0.0058054407,"about_ca_system_score_gemma":0.0023383573,"threshold_uncertainty_score":0.04212165},"labels":[],"label_agreement":null},{"id":"W2043753407","doi":"10.1007/s11229-005-9063-z","title":"The Case for Psychologism in Default and Inheritance Reasoning","year":2005,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; Universität Salzburg; University of Alberta","keywords":"Object (grammar); Semantic reasoner; Non-monotonic logic; Class (philosophy); Default logic; Inference; Zeno's paradoxes; Defeasible reasoning; Computer science; Default rule; Epistemology; Statement (logic); Artificial intelligence; Philosophy; Sociology; Description logic","score_opus":0.02037252022230052,"score_gpt":0.2858765888486398,"score_spread":0.2655040686263393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043753407","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.028459284,0.009332093,0.53038996,0.2073379,0.0018180758,0.00011970304,0.00047988002,0.00070794363,0.22135521],"genre_scores_gemma":[0.8216946,0.003073955,0.14491695,0.012794955,0.0031243854,0.0003012847,0.0002962825,0.0003309654,0.013466558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99050844,0.0052061398,0.00049056095,0.0014216392,0.0017853795,0.00058781315],"domain_scores_gemma":[0.96531314,0.024064219,0.0010792125,0.0061999825,0.0021109092,0.0012324947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018509,0.00052064477,0.0014144442,0.0029612347,0.0031835865,0.012278884,0.0034111917,0.010085664,0.01829063],"category_scores_gemma":[0.045156714,0.0012489525,0.0018669039,0.0018427251,0.033641275,0.042085804,0.0062691923,0.009511873,0.0022091316],"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.000025138526,0.000015358128,0.00020876448,0.0000311522,0.00001145572,0.000049423692,0.0002929962,0.00021358783,0.000043429267,0.99403304,0.0011316173,0.0039440845],"study_design_scores_gemma":[0.000010464162,0.0000012098924,0.00003644328,0.000009839475,0.0000020618445,0.000025924232,0.000043010725,0.00050125143,0.000031356896,0.9973028,0.0020317591,0.0000039404263],"about_ca_topic_score_codex":0.0033108678,"about_ca_topic_score_gemma":0.002261169,"teacher_disagreement_score":0.018509,"about_ca_system_score_codex":0.00450874,"about_ca_system_score_gemma":0.0026372958,"threshold_uncertainty_score":0.097886145},"labels":[],"label_agreement":null},{"id":"W2044849666","doi":"10.1016/j.evalprogplan.2010.04.001","title":"Program theory evaluation: Logic analysis","year":2010,"lang":"en","type":"article","venue":"Evaluation and Program Planning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Hôpital Charles-Le Moyne","funders":"Canadian Institutes of Health Research; Canadian Health Services Research Foundation","keywords":"Logic model; Computer science; Engineering; Political science; Public administration","score_opus":0.06455360024763711,"score_gpt":0.4119331162399644,"score_spread":0.3473795159923273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044849666","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.0046378872,0.0024398193,0.9687876,0.0030638373,0.00015009767,0.0001847635,0.00018408215,0.00090105773,0.019650865],"genre_scores_gemma":[0.36370525,0.0032825603,0.6141466,0.0012860957,0.00086315116,0.0006338229,0.00085025065,0.00089675956,0.014335484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990008,0.005340335,0.00044223538,0.00091193797,0.0028020034,0.00049556646],"domain_scores_gemma":[0.97909087,0.014962012,0.0006418817,0.0019388427,0.0030006983,0.00036573736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008969906,0.00112297,0.0013631794,0.0032908139,0.0012205848,0.0065971585,0.0026749873,0.0012927941,0.014018726],"category_scores_gemma":[0.033624567,0.00088450144,0.0017491251,0.0031114093,0.0046117892,0.011498065,0.0035546282,0.0039477986,0.0016560078],"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.00010908711,0.00013311379,0.0006048567,0.00040488748,0.000051612617,0.000051590177,0.00024824074,0.010241788,0.0004421691,0.8130716,0.009982578,0.16465849],"study_design_scores_gemma":[0.000024339024,0.00001647841,0.00014968641,0.00011250527,0.000042354965,0.000041817988,0.00009549774,0.053469114,0.0012559684,0.93643165,0.008345845,0.000014721329],"about_ca_topic_score_codex":0.0031237553,"about_ca_topic_score_gemma":0.0024323761,"teacher_disagreement_score":0.014018726,"about_ca_system_score_codex":0.0048868665,"about_ca_system_score_gemma":0.0036984417,"threshold_uncertainty_score":0.047437966},"labels":[],"label_agreement":null},{"id":"W2045334742","doi":"10.1163/18773109-13050102","title":"Towards a Formal Pragmatics of Discourse","year":2013,"lang":"en","type":"article","venue":"International Review of Pragmatics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Pragmatics; Grice; Linguistics; Implicature; Meaning (existential); Cooperative principle; Conversation; Utterance; Intentionality; Computer science; Sentence; Epistemology; Psychology; Philosophy","score_opus":0.013628440612719754,"score_gpt":0.3039496294824747,"score_spread":0.290321188869755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045334742","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.011452002,0.017002454,0.7419261,0.07787018,0.001841968,0.00018171562,0.00035334934,0.0006822298,0.1486901],"genre_scores_gemma":[0.63349116,0.006888531,0.31617403,0.00671784,0.0027587686,0.0007676321,0.0004269604,0.00049648626,0.0322787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98742944,0.008757972,0.0004917926,0.0011894075,0.0014591825,0.00067226397],"domain_scores_gemma":[0.9916687,0.004962101,0.00053572806,0.0012273444,0.0010319218,0.0005741168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015155205,0.0016682206,0.0017469707,0.00444846,0.005308767,0.012022979,0.0031598809,0.005103916,0.0060295057],"category_scores_gemma":[0.010035945,0.0011299665,0.0032824103,0.0023746565,0.03846837,0.02804712,0.0064475005,0.008110519,0.0016807561],"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.0000029142234,0.0000025880418,0.000017331278,0.000019763853,0.000002181735,0.0000121239,0.0005458315,0.00018938023,0.000032618667,0.99776495,0.00046719023,0.0009430449],"study_design_scores_gemma":[0.000007022561,0.0000041971152,0.000016128854,0.000024156141,0.0000025335523,0.000013560088,0.00024221643,0.0008914564,0.000041111638,0.98191607,0.016836155,0.000005384651],"about_ca_topic_score_codex":0.0037103647,"about_ca_topic_score_gemma":0.0019216604,"teacher_disagreement_score":0.015155205,"about_ca_system_score_codex":0.008213542,"about_ca_system_score_gemma":0.003736141,"threshold_uncertainty_score":0.08014935},"labels":[],"label_agreement":null},{"id":"W2045716498","doi":"10.1016/j.artint.2012.10.005","title":"How to progress a database III","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Axiom; Conjecture; Closing (real estate); Class (philosophy); Mathematics; Order (exchange); Action (physics); Calculus (dental); Property (philosophy); Computer science; Axiomatic system; First-order logic; Mathematical economics; Algebra over a field; Epistemology; Artificial intelligence; Discrete mathematics; Pure mathematics; Philosophy","score_opus":0.07326986236854748,"score_gpt":0.3126493991198949,"score_spread":0.23937953675134743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045716498","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.02614234,0.004819812,0.79469174,0.04419973,0.0027063056,0.0007193356,0.0023753757,0.013759224,0.110586196],"genre_scores_gemma":[0.20654662,0.004073986,0.6773911,0.0038186987,0.000628491,0.00037556788,0.004300166,0.0021080794,0.10075733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959188,0.0009904657,0.00058743876,0.00080542034,0.0013382208,0.00035964348],"domain_scores_gemma":[0.9873964,0.0030843085,0.00030519124,0.0050705355,0.0034423093,0.0007011239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071913735,0.0007290193,0.0008786827,0.001577908,0.0023506393,0.009698739,0.002731854,0.002358472,0.023528716],"category_scores_gemma":[0.022209978,0.0008958175,0.0012832927,0.0015358741,0.002383085,0.02091088,0.0042295884,0.0035642104,0.012273067],"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.00033242255,0.00017540532,0.002478724,0.0007439336,0.000069388705,0.00031502353,0.0019326316,0.006467798,0.006249539,0.44177046,0.12210538,0.41735923],"study_design_scores_gemma":[0.00009615214,0.0001399574,0.00052493106,0.000761513,0.00013763599,0.00045939346,0.0019869583,0.032016348,0.012592109,0.32585675,0.6253412,0.00008708238],"about_ca_topic_score_codex":0.008459734,"about_ca_topic_score_gemma":0.004995653,"teacher_disagreement_score":0.023528716,"about_ca_system_score_codex":0.0016337243,"about_ca_system_score_gemma":0.00389057,"threshold_uncertainty_score":0.07871145},"labels":[],"label_agreement":null},{"id":"W2046052255","doi":"10.1080/19462166.2014.1001790","title":"Context-aware reconfiguration of large-scale surveillance systems: argumentative approach","year":2015,"lang":"en","type":"article","venue":"Argument & Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"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":"Control reconfiguration; Argumentative; Context (archaeology); Computer science; Scale (ratio); Political science; Embedded system; Geography","score_opus":0.031684915621979254,"score_gpt":0.27530688808844095,"score_spread":0.2436219724664617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046052255","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.0357037,0.00040419982,0.9546967,0.0011115384,0.00004305174,0.00020235263,0.00005982862,0.00047924166,0.007299383],"genre_scores_gemma":[0.63851553,0.00032019962,0.3586774,0.00014289122,0.00006852309,0.00021760732,0.00013932075,0.00008043635,0.0018380976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961299,0.001922991,0.00027247463,0.00059005985,0.0007537892,0.00033078183],"domain_scores_gemma":[0.9892803,0.007943436,0.00082748424,0.0009818601,0.0006327212,0.00033420027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044878586,0.00083962275,0.00080151897,0.002117092,0.0015413573,0.004630676,0.0026031777,0.002314744,0.0026820211],"category_scores_gemma":[0.014721392,0.0006113849,0.0015113623,0.0014190206,0.0045758686,0.004881698,0.0037189496,0.0020561628,0.00031958148],"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.00026290544,0.00022308441,0.0023511434,0.00062682,0.00019091449,0.0014577205,0.002932251,0.4034996,0.008359247,0.4886149,0.0018911869,0.08959026],"study_design_scores_gemma":[0.00005141357,0.00005109395,0.00031998137,0.00010487817,0.0000687901,0.00018139288,0.0005820509,0.78730434,0.0036143241,0.20088768,0.0068039466,0.000030067651],"about_ca_topic_score_codex":0.0017878771,"about_ca_topic_score_gemma":0.0019513709,"teacher_disagreement_score":0.004630676,"about_ca_system_score_codex":0.0025316048,"about_ca_system_score_gemma":0.0014212142,"threshold_uncertainty_score":0.023734331},"labels":[],"label_agreement":null},{"id":"W2046769817","doi":"10.1145/1147376.1147391","title":"Consistent query answering in databases","year":2006,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":201,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Set (abstract data type); Query optimization; Query language; View; Sargable; Data integrity; Information retrieval; Distributed database; Web search query; Database design; Programming language; Search engine","score_opus":0.02901131692479943,"score_gpt":0.2536003828049169,"score_spread":0.22458906588011748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046769817","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.012682657,0.0055321045,0.962248,0.010721473,0.00023965782,0.00028660972,0.0008170172,0.0012973374,0.006174994],"genre_scores_gemma":[0.25715604,0.0038828673,0.72466123,0.004543471,0.0011564209,0.0007447725,0.0034275893,0.00041797318,0.0040097674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94670576,0.026773699,0.0058387476,0.0066428995,0.01233647,0.0017025196],"domain_scores_gemma":[0.93134224,0.04979386,0.002462218,0.009696869,0.005890435,0.0008144685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.034602795,0.00093269243,0.0030790353,0.0041263546,0.0029852933,0.011917599,0.0057066865,0.005320413,0.0038819364],"category_scores_gemma":[0.078813404,0.0019872796,0.0022904389,0.008777403,0.006738278,0.017948518,0.008526813,0.0051659322,0.0012137867],"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.00040094947,0.00018530693,0.002248037,0.0011121226,0.00033121565,0.0008303344,0.0021237938,0.024487205,0.0022961013,0.81646216,0.01825614,0.13126665],"study_design_scores_gemma":[0.00009506322,0.000044362612,0.00018978884,0.000112356225,0.000089636735,0.0003660146,0.0003826328,0.063520245,0.0012568723,0.9201823,0.0137263145,0.00003439394],"about_ca_topic_score_codex":0.003173642,"about_ca_topic_score_gemma":0.001962613,"teacher_disagreement_score":0.034602795,"about_ca_system_score_codex":0.003002761,"about_ca_system_score_gemma":0.003352671,"threshold_uncertainty_score":0.18299925},"labels":[],"label_agreement":null},{"id":"W2049702075","doi":"10.1007/s11225-008-9100-2","title":"Resource-origins of Nonmonotonicity","year":2008,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Defeasible estate; Computer science; Inference; Context (archaeology); Non-monotonic logic; Theoretical computer science; Deductive reasoning; Artificial intelligence; Resource (disambiguation); Cognitive science","score_opus":0.03141366693341228,"score_gpt":0.24261159096300994,"score_spread":0.21119792402959767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049702075","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.18573448,0.0104764905,0.28696516,0.031758685,0.0004849517,0.00014536965,0.0008924374,0.0007516786,0.4827908],"genre_scores_gemma":[0.9611249,0.001535241,0.024009708,0.0008080244,0.00028116952,0.00007076623,0.00023376534,0.00023370938,0.011702694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622935,0.0012579359,0.00026142847,0.0012184969,0.0006893643,0.00034335916],"domain_scores_gemma":[0.97098273,0.01962363,0.0011360649,0.005703911,0.0020489413,0.00050474465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062574428,0.00038744972,0.0009717252,0.0019988006,0.0022174772,0.0072700046,0.0021777018,0.002407246,0.011316181],"category_scores_gemma":[0.021258686,0.0010594614,0.0010883093,0.0017320367,0.010558093,0.017741408,0.0032001277,0.0039032414,0.0011231852],"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.000023915189,0.000014465854,0.00036485094,0.00003291197,0.000010986973,0.000087435255,0.00044984405,0.00039126351,0.00019220363,0.9930228,0.00067455985,0.0047347476],"study_design_scores_gemma":[0.0000107629885,0.0000038019111,0.00034180022,0.000016967797,0.000009492671,0.00007087859,0.00008562825,0.0013573887,0.00022048788,0.9923453,0.0055296463,0.0000079911],"about_ca_topic_score_codex":0.0034448549,"about_ca_topic_score_gemma":0.0028109618,"teacher_disagreement_score":0.011316181,"about_ca_system_score_codex":0.0040379665,"about_ca_system_score_gemma":0.0017723916,"threshold_uncertainty_score":0.0378564},"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":"W2051230890","doi":"10.1002/spe.398","title":"G<scp>EN</scp>E<scp>X</scp>: a tool for testing in ILP","year":2001,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Inductive logic programming; Programming language; Variety (cybernetics); Logic program; Computer science; Generator (circuit theory); Field (mathematics); Logic programming; Software engineering; Artificial intelligence; Mathematics","score_opus":0.027810246710578333,"score_gpt":0.29305896350348737,"score_spread":0.265248716792909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051230890","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011842961,0.00007607248,0.8729793,0.00043651872,0.00007582404,0.00021133057,0.0012288346,0.10322324,0.009925967],"genre_scores_gemma":[0.17862587,0.00015311761,0.7899957,0.0005208608,0.000057717654,0.0006788928,0.004405546,0.015631236,0.009930991],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984273,0.0007137625,0.00015763166,0.00023746917,0.00039112035,0.00007284738],"domain_scores_gemma":[0.98606306,0.01104504,0.00043404233,0.0013662217,0.00081407855,0.00027758288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003423519,0.0011958714,0.00058555644,0.0017246619,0.00060753804,0.0020233027,0.0021831838,0.0016527646,0.03327161],"category_scores_gemma":[0.015925705,0.0006817573,0.0008056632,0.0008733248,0.0018767911,0.0035377734,0.002121707,0.0016504759,0.0074045495],"study_design_candidate":"not_applicable","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.0014843774,0.0007026161,0.00613695,0.0011201239,0.00015093865,0.0021472613,0.0010901474,0.06831513,0.01830357,0.13949724,0.20778005,0.55327165],"study_design_scores_gemma":[0.0005403147,0.00040803655,0.0016872964,0.00035316055,0.000047301815,0.0016525724,0.00019277075,0.68412465,0.05909492,0.14335497,0.10842682,0.00011725435],"about_ca_topic_score_codex":0.0014375212,"about_ca_topic_score_gemma":0.0010501246,"teacher_disagreement_score":0.03327161,"about_ca_system_score_codex":0.0003977248,"about_ca_system_score_gemma":0.0006821306,"threshold_uncertainty_score":0.11130464},"labels":[],"label_agreement":null},{"id":"W2051445745","doi":"10.1145/507234.507237","title":"A logical foundation for deductive object-oriented databases","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Programming language; Deductive database; Syntax; Semantics (computer science); Class (philosophy); Object (grammar); Well-founded semantics; Logic programming; Inheritance (genetic algorithm); Operational semantics; Database; Natural language processing; Artificial intelligence; Denotational semantics","score_opus":0.07233550198391613,"score_gpt":0.2909125887188853,"score_spread":0.21857708673496917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051445745","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.004130984,0.0034134015,0.96950567,0.006341223,0.00046727713,0.00019217293,0.00030180844,0.00065475336,0.014992857],"genre_scores_gemma":[0.1374639,0.005820825,0.8409525,0.0044378513,0.0015618816,0.00063276873,0.0009320486,0.0003185922,0.007879667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940128,0.0014617819,0.0007951354,0.0008406765,0.0025058312,0.00038382344],"domain_scores_gemma":[0.9916986,0.00417873,0.00067912106,0.0010404062,0.0019477073,0.00045545422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008905284,0.0007730386,0.0010224988,0.003470689,0.0032393057,0.009901508,0.0031213006,0.0029694694,0.0039972183],"category_scores_gemma":[0.012802687,0.0014597184,0.0022581718,0.003078677,0.010634559,0.019101996,0.0047744177,0.0063579073,0.0020400109],"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.000005690585,0.000020125452,0.00007391792,0.000057148653,0.0000061043615,0.00008243231,0.0002636209,0.00054763386,0.00020572329,0.9920258,0.0011258293,0.005585916],"study_design_scores_gemma":[0.000020238629,0.000015966694,0.000048981856,0.000061405204,0.000010242909,0.00010758383,0.00008008367,0.003917661,0.00038446137,0.9625782,0.03276023,0.0000149607495],"about_ca_topic_score_codex":0.0022547739,"about_ca_topic_score_gemma":0.0013230507,"teacher_disagreement_score":0.009901508,"about_ca_system_score_codex":0.0029527324,"about_ca_system_score_gemma":0.003697742,"threshold_uncertainty_score":0.047096193},"labels":[],"label_agreement":null},{"id":"W2052611985","doi":"10.5555/777092.777107","title":"A hoare-style proof system for robot programs","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Hoare logic; Computer science; Correctness; Programming language; Soundness; Axiom; Mathematics","score_opus":0.037150635832537984,"score_gpt":0.23094377559375287,"score_spread":0.19379313976121487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052611985","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.0025243328,0.00013038711,0.9917258,0.00024496895,0.00004386438,0.00013491996,0.0000998432,0.0030374657,0.0020583945],"genre_scores_gemma":[0.12829335,0.0005383007,0.8629289,0.00051941007,0.0001243905,0.00036257692,0.000384292,0.00052442297,0.0063242926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814725,0.00049348833,0.00015766652,0.00032557448,0.0006957542,0.00018035674],"domain_scores_gemma":[0.9979462,0.0010819504,0.00012473753,0.00034098845,0.00041373458,0.00009226693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022316861,0.0005776781,0.000605183,0.001243163,0.0014709451,0.0021900514,0.0015455523,0.0011011437,0.0071839658],"category_scores_gemma":[0.0055744406,0.0008215988,0.001188451,0.00064639887,0.0024652749,0.0032442976,0.0029356594,0.0028560562,0.0021593608],"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.00017350576,0.00015484964,0.00046569225,0.0005661005,0.00011834423,0.00054614415,0.0009269985,0.015821924,0.026511459,0.7418907,0.013435588,0.1993887],"study_design_scores_gemma":[0.0002778305,0.0003440148,0.0006904315,0.00022005507,0.00020261736,0.001090651,0.00017030163,0.17172249,0.051553406,0.5854634,0.18808138,0.00018342106],"about_ca_topic_score_codex":0.0020411585,"about_ca_topic_score_gemma":0.0026181354,"teacher_disagreement_score":0.0071839658,"about_ca_system_score_codex":0.0009955344,"about_ca_system_score_gemma":0.00230109,"threshold_uncertainty_score":0.024032772},"labels":[],"label_agreement":null},{"id":"W2053332270","doi":"10.1016/s0304-3975(00)00096-7","title":"Measure and probability for concurrency theorists","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conditional probability; Probabilistic logic; Regular conditional probability; Probability measure; Concurrency; Measure (data warehouse); Law of total probability; Theoretical computer science; Probability theory; Computer science; Conditional probability distribution; Semantics (computer science); Mathematics; Probabilistic argumentation; Probability distribution; Mathematical economics; Probability mass function; Artificial intelligence; Discrete mathematics; Programming language; Posterior probability; Econometrics; Statistics; Data mining; Bayesian probability","score_opus":0.01856159685253597,"score_gpt":0.2620203990383691,"score_spread":0.24345880218583313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053332270","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.040059987,0.029782508,0.7963651,0.06388509,0.0018058848,0.00007371011,0.00041646784,0.00045154206,0.06715971],"genre_scores_gemma":[0.87608284,0.008602705,0.09146197,0.003190521,0.005128463,0.00039845565,0.00033946225,0.000258471,0.014537034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943118,0.0027590902,0.00034774194,0.0009530833,0.0012538626,0.00037439642],"domain_scores_gemma":[0.95836246,0.03414597,0.0011477771,0.0035520534,0.0016117605,0.0011799592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008358628,0.00090598024,0.0022950987,0.0040124576,0.004361005,0.00923762,0.002933469,0.0047677997,0.008127453],"category_scores_gemma":[0.036677055,0.0010849595,0.002228696,0.004500144,0.017612522,0.028917575,0.0055463207,0.008327379,0.00088289904],"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.0000051197158,0.0000048341662,0.00005868549,0.000013930747,0.000004304364,0.000007753961,0.00007521445,0.0003284637,0.000017667644,0.99764305,0.00048677134,0.001354088],"study_design_scores_gemma":[0.0000021079236,0.0000014050826,0.000012754508,0.0000042608926,0.0000015066677,0.000004766439,0.0000138945015,0.0008137693,0.000008759101,0.9984162,0.000718486,0.0000020626528],"about_ca_topic_score_codex":0.0032035047,"about_ca_topic_score_gemma":0.001469019,"teacher_disagreement_score":0.00923762,"about_ca_system_score_codex":0.006274319,"about_ca_system_score_gemma":0.0023478197,"threshold_uncertainty_score":0.045523524},"labels":[],"label_agreement":null},{"id":"W2053780293","doi":"10.1016/j.ijar.2011.09.008","title":"Revising beliefs on the basis of evidence","year":2011,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Categorical variable; Iterated function; Set (abstract data type); Probabilistic logic; Mathematical economics; Bayesian probability; Artificial intelligence; Basis (linear algebra); Computer science; Mathematics; Operator (biology); Belief structure; Possible world; Task (project management); Machine learning; Epistemology; Economics; Philosophy","score_opus":0.13479095554841497,"score_gpt":0.306626557219609,"score_spread":0.17183560167119405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053780293","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.27042803,0.0031944946,0.6984166,0.012026545,0.0006368127,0.00039257406,0.00072264805,0.000656478,0.013525839],"genre_scores_gemma":[0.87378794,0.00083723664,0.12248402,0.0006480516,0.00026368018,0.00010062186,0.000499281,0.00006306617,0.0013160658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99209493,0.0027596825,0.0008729451,0.0013945214,0.0023764062,0.0005015281],"domain_scores_gemma":[0.8947208,0.078762285,0.0049913744,0.010434548,0.009528185,0.0015628979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011789515,0.0012124649,0.0017956233,0.0037669346,0.0008649086,0.0063763005,0.00412541,0.0029269753,0.004420233],"category_scores_gemma":[0.13198458,0.0012702764,0.0016234238,0.0018634701,0.0029747242,0.010863026,0.0038611859,0.0052528135,0.0005281594],"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.0036386522,0.0010717688,0.04834181,0.0025032966,0.0024567943,0.0023185182,0.0038062716,0.16150846,0.009580864,0.28605294,0.007909307,0.4708113],"study_design_scores_gemma":[0.00026035798,0.00026269144,0.0047547026,0.0005803453,0.0005127709,0.00033076678,0.00074254547,0.37356085,0.0044396943,0.611049,0.003383086,0.00012319465],"about_ca_topic_score_codex":0.0041312794,"about_ca_topic_score_gemma":0.0061321897,"teacher_disagreement_score":0.011789515,"about_ca_system_score_codex":0.0017136829,"about_ca_system_score_gemma":0.0025205538,"threshold_uncertainty_score":0.062349677},"labels":[],"label_agreement":null},{"id":"W2054098217","doi":"10.1111/j.0824-7935.2004.t01-1-00230.x","title":"Reasoning with Sets of Defaults in Default Logic","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","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":"Default logic; Default; Default rule; Computer science; Non-monotonic logic; Extension (predicate logic); Set (abstract data type); Artificial intelligence; Theoretical computer science; Autoepistemic logic; Description logic; Programming language; Economics; Multimodal logic; Finance","score_opus":0.02536463840298186,"score_gpt":0.2859904590066911,"score_spread":0.26062582060370926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054098217","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.014037429,0.00032433262,0.97799,0.00078550796,0.000060822764,0.00012718052,0.00027249858,0.000662944,0.0057393787],"genre_scores_gemma":[0.21019113,0.00058586814,0.7834145,0.00086680794,0.00017996642,0.0003762105,0.0008607402,0.00011552413,0.0034092998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99211687,0.0026172518,0.0011078438,0.0012108146,0.0023064995,0.0006407389],"domain_scores_gemma":[0.9929583,0.0041451748,0.0006048471,0.0013874273,0.000601489,0.0003027983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009563467,0.0012143857,0.0012961833,0.0032851775,0.0019914326,0.005619117,0.0038929435,0.0030064103,0.0043756925],"category_scores_gemma":[0.010156648,0.0014818367,0.004106012,0.0025347508,0.0060149254,0.014019687,0.0060371663,0.0055897557,0.00073914946],"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.000116113566,0.00009737886,0.000914529,0.0002223549,0.0001259029,0.00044479605,0.0010239094,0.025179548,0.0025069495,0.9343417,0.0019784153,0.033048466],"study_design_scores_gemma":[0.000045043536,0.000029570489,0.00012256953,0.00004939319,0.00006485174,0.00012965915,0.00011676664,0.038289163,0.002656155,0.95326275,0.005199869,0.00003430734],"about_ca_topic_score_codex":0.003873052,"about_ca_topic_score_gemma":0.005212238,"teacher_disagreement_score":0.009563467,"about_ca_system_score_codex":0.003409895,"about_ca_system_score_gemma":0.0019316071,"threshold_uncertainty_score":0.050577044},"labels":[],"label_agreement":null},{"id":"W2055357888","doi":"10.1109/aamas.2004.199","title":"On Ability to Autonomously Execute Agent Programs with Sensing","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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":"Computer science; Semantics (computer science); Knowledge base; Programming language; State (computer science); Work (physics); Base (topology); Multi-agent system; Software engineering; Intelligent agent; Artificial intelligence; Human–computer interaction; Engineering","score_opus":0.016127139126159935,"score_gpt":0.23426885190950175,"score_spread":0.21814171278334182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055357888","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.22280675,0.0002429814,0.7371059,0.004184003,0.00009096339,0.00012447387,0.000105163854,0.0034987335,0.031840943],"genre_scores_gemma":[0.88721603,0.00017621457,0.107562624,0.00051497103,0.00006486962,0.00013718709,0.00011782902,0.00023333551,0.003977077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738175,0.0009826059,0.0001932772,0.00051873125,0.0005770093,0.00034658483],"domain_scores_gemma":[0.97708285,0.015830973,0.0016007392,0.0031520904,0.0014700973,0.0008632907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035379755,0.00051273196,0.0004075976,0.0005809122,0.0009350058,0.0025131973,0.0017999319,0.0015847372,0.003357379],"category_scores_gemma":[0.019107237,0.0006504764,0.0007847179,0.00042744764,0.0063514556,0.007966143,0.0041859057,0.002743935,0.0005791103],"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.0007682678,0.00029621876,0.0047345855,0.0003121002,0.00007927652,0.00075373374,0.002498874,0.10470413,0.028197315,0.7763606,0.0038219464,0.07747289],"study_design_scores_gemma":[0.00010934068,0.00019650237,0.00070987054,0.00005194249,0.000053185024,0.00019965498,0.00025856282,0.40349868,0.012616322,0.57577634,0.0064713797,0.000058212343],"about_ca_topic_score_codex":0.0028061222,"about_ca_topic_score_gemma":0.0020953543,"teacher_disagreement_score":0.0035379755,"about_ca_system_score_codex":0.00075376465,"about_ca_system_score_gemma":0.001092586,"threshold_uncertainty_score":0.018710852},"labels":[],"label_agreement":null},{"id":"W205596015","doi":"10.1007/978-3-642-04238-6_65","title":"Optimal Multicore Scheduling: An Application of ASP Techniques","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multi-core processor; Solver; Scheduling (production processes); Graph; Vertex cover; Answer set programming; Parallel computing; Theoretical computer science; Set (abstract data type); Mathematical optimization; Programming language; Mathematics","score_opus":0.017391979314482327,"score_gpt":0.2668498456944376,"score_spread":0.24945786637995526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205596015","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.010132237,0.0006206677,0.9699725,0.00028952555,0.00017700098,0.000069438436,0.00011587722,0.0014874213,0.017135331],"genre_scores_gemma":[0.1647815,0.0008178678,0.8274496,0.00015457995,0.00020417439,0.00009301667,0.000236195,0.00054569653,0.005717261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00014442138,0.000048461363,0.000097984026,0.00024884313,0.00008351393],"domain_scores_gemma":[0.9990231,0.0005238376,0.00005833821,0.0002185336,0.00012977864,0.000046336354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011024751,0.0009367852,0.0009811256,0.00077118335,0.0010201436,0.0017006333,0.0016931727,0.0008016679,0.006268566],"category_scores_gemma":[0.0025958747,0.0005543798,0.00096159434,0.0018989334,0.00057737314,0.0019747438,0.0013917563,0.0017893687,0.0007887483],"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.00036081157,0.00021090446,0.0006293977,0.0003443604,0.00008166412,0.00014289767,0.0001548894,0.32962117,0.006990184,0.19616333,0.013952005,0.45134845],"study_design_scores_gemma":[0.00004271587,0.000037375557,0.00012301766,0.000020751251,0.000029632469,0.00007431153,0.000028207818,0.8616329,0.0024597256,0.12730281,0.008238362,0.000010158282],"about_ca_topic_score_codex":0.0034006224,"about_ca_topic_score_gemma":0.0059657237,"teacher_disagreement_score":0.006268566,"about_ca_system_score_codex":0.0010590648,"about_ca_system_score_gemma":0.0015666628,"threshold_uncertainty_score":0.020970404},"labels":[],"label_agreement":null},{"id":"W2056850725","doi":"10.1145/1119439.1119440","title":"Unfolding partiality and disjunctions in stable model semantics","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":142,"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 Alberta","funders":"","keywords":"Partial evaluation; Computer science; Stable model semantics; Semantics (computer science); Modular design; Programming language; Program transformation; Model transformation; Theoretical computer science; Disjunctive normal form; Transformation (genetics); Stability (learning theory); Core (optical fiber); State (computer science); Operational semantics; Artificial intelligence","score_opus":0.028269337300304863,"score_gpt":0.2572350780560444,"score_spread":0.22896574075573953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056850725","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.012754971,0.0000575456,0.98442036,0.00010598083,0.000010398753,0.000035112396,0.000039957573,0.00071826536,0.0018575522],"genre_scores_gemma":[0.34541708,0.00024747654,0.6499996,0.00012709004,0.000040467225,0.0001434128,0.00029867387,0.00040739693,0.0033187382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978588,0.0006660138,0.00012456626,0.00042892754,0.00073628547,0.00018535732],"domain_scores_gemma":[0.99818283,0.00087471714,0.000116634175,0.0005039584,0.00025566758,0.00006612324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024042844,0.0006048529,0.0004608088,0.0008059588,0.0006994105,0.0015358252,0.0013351084,0.00049431715,0.0027849397],"category_scores_gemma":[0.0041578743,0.00076053943,0.0013881543,0.000840782,0.0029197298,0.0053434484,0.002856727,0.0018799145,0.0005054903],"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.00013401515,0.000063755404,0.0009847715,0.00017543115,0.000049814495,0.0001699348,0.0011710471,0.03692455,0.008593243,0.85286516,0.00089367846,0.09797457],"study_design_scores_gemma":[0.000034227865,0.00011504664,0.0002872513,0.000051531242,0.00006913487,0.00015361136,0.00023488299,0.20892295,0.019694505,0.7548564,0.015545986,0.000034616245],"about_ca_topic_score_codex":0.00197701,"about_ca_topic_score_gemma":0.00300512,"teacher_disagreement_score":0.0027849397,"about_ca_system_score_codex":0.0012030115,"about_ca_system_score_gemma":0.0010389725,"threshold_uncertainty_score":0.01271522},"labels":[],"label_agreement":null},{"id":"W2058110750","doi":"10.1016/s0743-1066(99)00071-0","title":"Abducing through negation as failure: stable models within the independent choice logic","year":2000,"lang":"en","type":"article","venue":"The Journal of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Negation; Stable model semantics; Semantics (computer science); Proposition; Logic program; Computer science; Programming language; Higher-order logic; Set (abstract data type); Circumscription; Simple (philosophy); Theoretical computer science; Non-monotonic logic; Game semantics; Logic programming; Mathematics; Description logic; Epistemology; Operational semantics; Denotational semantics","score_opus":0.03285870710316814,"score_gpt":0.26981322105363487,"score_spread":0.23695451395046674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058110750","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.0858872,0.0008348009,0.88032794,0.005123602,0.000104160565,0.000082513456,0.0002606577,0.00031236562,0.027066793],"genre_scores_gemma":[0.908682,0.00061781256,0.08174131,0.00034153892,0.00013854422,0.000111469046,0.00027625714,0.00012755832,0.007963535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949321,0.0022956692,0.00030643868,0.00066674844,0.0012840496,0.00051498605],"domain_scores_gemma":[0.97751325,0.016360097,0.0012556299,0.002488033,0.0016318725,0.00075116544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074318685,0.0010834535,0.001520672,0.0017248482,0.0018380563,0.005809215,0.0041382145,0.0036275801,0.005173996],"category_scores_gemma":[0.023560122,0.0011425519,0.002628063,0.0018384192,0.008707115,0.01487834,0.005295293,0.0048047705,0.0006563244],"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.00008054402,0.000028568507,0.00032667277,0.000031192074,0.000029850586,0.00010063194,0.00025723307,0.024824403,0.00020309376,0.96929216,0.00044589856,0.0043797814],"study_design_scores_gemma":[0.000014819563,0.000008216062,0.000018314278,0.000006272066,0.000008226286,0.0000139758595,0.000022283342,0.05744035,0.00012726967,0.94202536,0.000307235,0.000007733011],"about_ca_topic_score_codex":0.005105812,"about_ca_topic_score_gemma":0.0043876097,"teacher_disagreement_score":0.0074318685,"about_ca_system_score_codex":0.0023021705,"about_ca_system_score_gemma":0.002578319,"threshold_uncertainty_score":0.0393039},"labels":[],"label_agreement":null},{"id":"W2059326695","doi":"10.1023/b:amai.0000034523.18162.6b","title":"Representing von Neumann–Morgenstern Games in the Situation Calculus","year":2004,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Von Neumann architecture; Formalism (music); Stochastic game; Nash equilibrium; Game theory; Computer science; Variety (cybernetics); Situation calculus; Mathematical economics; Mathematics; Calculus (dental); Artificial intelligence; Pure mathematics","score_opus":0.12865549613399657,"score_gpt":0.3436359137128901,"score_spread":0.21498041757889352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059326695","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.07060285,0.00096019683,0.8733456,0.0020764011,0.00035761806,0.00015305895,0.00037492102,0.00071822724,0.051411033],"genre_scores_gemma":[0.82264555,0.000742665,0.16457726,0.00027712737,0.00019097586,0.00019180324,0.00036205963,0.00016905266,0.010843562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970546,0.0012740656,0.00022447314,0.00037708457,0.0005918785,0.00047786094],"domain_scores_gemma":[0.9980236,0.0010125068,0.00018317516,0.0003105996,0.0002625355,0.00020747619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294249,0.0010986782,0.0014536357,0.00155597,0.002650348,0.008074849,0.0025818974,0.0023758952,0.008813257],"category_scores_gemma":[0.0071977186,0.00092298404,0.0022145177,0.0019040166,0.0040633027,0.012171616,0.004176076,0.0029303841,0.0012371683],"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.000038700597,0.000020197635,0.00008753495,0.00002155151,0.000013339284,0.000081723614,0.0002310287,0.0077871834,0.00027882532,0.98832244,0.0003503128,0.002767158],"study_design_scores_gemma":[0.00001707056,0.000007944478,0.000016910277,0.000009879946,0.000012981483,0.00002298504,0.00006066827,0.032846816,0.00024131054,0.96471,0.0020421008,0.000011307328],"about_ca_topic_score_codex":0.0043120175,"about_ca_topic_score_gemma":0.0044120066,"teacher_disagreement_score":0.008813257,"about_ca_system_score_codex":0.0025743013,"about_ca_system_score_gemma":0.0019593588,"threshold_uncertainty_score":0.029483318},"labels":[],"label_agreement":null},{"id":"W2059970836","doi":"10.3166/jancl.12.259-285","title":"Reasoning credulously and skeptically within a single extension","year":2002,"lang":"en","type":"article","venue":"Journal of Applied Non-Classical Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Extension (predicate logic); Axiom; Monotonic function; Computer science; Default logic; Consistency (knowledge bases); Mathematical economics; Skepticism; Mathematics; Theoretical computer science; Artificial intelligence; Epistemology; Philosophy; Programming language","score_opus":0.024626511849084255,"score_gpt":0.22140071502953568,"score_spread":0.1967742031804514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059970836","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.17397684,0.00026647878,0.8060009,0.0018939936,0.000119559285,0.00012290147,0.00016409924,0.0011026479,0.016352594],"genre_scores_gemma":[0.66276515,0.00017034181,0.3323227,0.00051116257,0.000111211586,0.00013224699,0.00023322075,0.00016207568,0.0035918325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369603,0.0017809828,0.00052376254,0.0013480679,0.0021287801,0.0005222602],"domain_scores_gemma":[0.9821988,0.008404143,0.0013210664,0.006127906,0.0014113451,0.0005367573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010214693,0.00082027283,0.0010258494,0.0013658577,0.0017075316,0.005003507,0.0025049197,0.0029562032,0.003148265],"category_scores_gemma":[0.014952802,0.0011043194,0.0031956395,0.0009140252,0.0068804566,0.016251018,0.0070404354,0.0052759936,0.00071856816],"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.0004287072,0.00020420598,0.0032968477,0.000195542,0.00014298942,0.0011499609,0.002099652,0.0114639895,0.012148464,0.90714103,0.0010376138,0.06069108],"study_design_scores_gemma":[0.000057732093,0.000075896736,0.00065358134,0.00007979445,0.00011026378,0.00044754552,0.00032717967,0.04635018,0.015041063,0.931386,0.005408617,0.00006210843],"about_ca_topic_score_codex":0.0006839865,"about_ca_topic_score_gemma":0.00091618055,"teacher_disagreement_score":0.010214693,"about_ca_system_score_codex":0.0017785067,"about_ca_system_score_gemma":0.0017981662,"threshold_uncertainty_score":0.05402106},"labels":[],"label_agreement":null},{"id":"W2062205093","doi":"10.1016/s0004-3702(00)00031-x","title":"ConGolog, a concurrent programming language based on the situation calculus","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":496,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Concurrency; Programming language; Computer science; Axiom; Rotation formalisms in three dimensions; Situation calculus; Process calculus; Semantics (computer science); Operational semantics; Pi calculus; Theoretical computer science; Mathematics","score_opus":0.04249999969817588,"score_gpt":0.29459508375138727,"score_spread":0.2520950840532114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062205093","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.0044441475,0.00039708512,0.9683884,0.0002742724,0.00022172165,0.00026092003,0.0006531069,0.01450685,0.010853374],"genre_scores_gemma":[0.14903384,0.0007316384,0.8310709,0.00061226595,0.0001931925,0.0008370463,0.0011568383,0.0017961634,0.014568106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990633,0.00023388784,0.00010261678,0.00021331727,0.00029769226,0.000089071465],"domain_scores_gemma":[0.9978714,0.001198736,0.00016725963,0.0003233889,0.00026101986,0.00017817739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018928213,0.0006744238,0.0005408698,0.001257498,0.0011394607,0.0042833304,0.0024021503,0.00096009666,0.00798149],"category_scores_gemma":[0.0063486993,0.0007223093,0.0010988776,0.000971317,0.0016214935,0.0038802645,0.0016410766,0.0021495812,0.0015759569],"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.0004958277,0.00017079436,0.00096281356,0.00075965776,0.00007682228,0.0004566307,0.000703683,0.012103312,0.010894408,0.82616055,0.024166832,0.12304858],"study_design_scores_gemma":[0.00039190255,0.00017555841,0.00039403574,0.0002371403,0.00024396859,0.000925928,0.00015901893,0.15922962,0.021205943,0.5052261,0.31165728,0.0001535121],"about_ca_topic_score_codex":0.0022379232,"about_ca_topic_score_gemma":0.0030527564,"teacher_disagreement_score":0.00798149,"about_ca_system_score_codex":0.0008014961,"about_ca_system_score_gemma":0.002639626,"threshold_uncertainty_score":0.026700735},"labels":[],"label_agreement":null},{"id":"W2063169574","doi":"10.2307/2694928","title":"An intensional type theory: motivation and cut-elimination","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","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":"University of British Columbia","funders":"","keywords":"Axiom; Type theory; Type (biology); Mathematics; Completeness (order theory); Interpretation (philosophy); Syntax; Discrete mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.02827150745272364,"score_gpt":0.2724352146138546,"score_spread":0.24416370716113098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063169574","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.042913735,0.0018394851,0.87756026,0.0058295657,0.00032562832,0.00012009933,0.0002828555,0.0003513375,0.070777066],"genre_scores_gemma":[0.6327535,0.0015404145,0.34682205,0.0019959481,0.0009123269,0.00030144182,0.000510545,0.00030937663,0.014854479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959598,0.001497659,0.00025795758,0.0005391904,0.0013839239,0.00036145185],"domain_scores_gemma":[0.9910802,0.005203805,0.0005112312,0.0012975072,0.0015841167,0.0003231427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065995585,0.00051933434,0.0009307651,0.0033327106,0.0019857697,0.004260767,0.0026538696,0.0018477371,0.005958092],"category_scores_gemma":[0.008735419,0.0010078993,0.0018617539,0.0035545283,0.009650997,0.013353823,0.004333783,0.00588826,0.0005665527],"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.000004757275,0.0000049686505,0.00005163286,0.000016659782,0.0000030561057,0.000033630906,0.000094298535,0.00031170508,0.0000823301,0.9973495,0.00037613625,0.0016713062],"study_design_scores_gemma":[0.000011921059,0.0000066411967,0.000056798097,0.000023058305,0.000009224901,0.00009419606,0.0000608005,0.004295578,0.0002979961,0.99081284,0.00432474,0.0000060940138],"about_ca_topic_score_codex":0.0014180209,"about_ca_topic_score_gemma":0.0011118297,"teacher_disagreement_score":0.0065995585,"about_ca_system_score_codex":0.0027150796,"about_ca_system_score_gemma":0.0011794639,"threshold_uncertainty_score":0.034902215},"labels":[],"label_agreement":null},{"id":"W2063972032","doi":"10.1016/j.tcs.2004.09.035","title":"A behavioural pseudometric for probabilistic transition systems","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Mathematics; Coalgebra; Functor; Equivalence (formal languages); Metric space; Modal logic; Discrete mathematics; Metric (unit); Algebra over a field; Pure mathematics; Modal; Statistics","score_opus":0.019719505836628813,"score_gpt":0.24980407481604147,"score_spread":0.23008456897941265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063972032","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.03471328,0.0005471348,0.94939977,0.002437674,0.0003931813,0.00011961817,0.00045562163,0.00041513058,0.011518535],"genre_scores_gemma":[0.57222015,0.0014481655,0.40350783,0.0011864371,0.0018875898,0.0010670158,0.0015208462,0.0004972063,0.016664647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98961747,0.003708705,0.0010694483,0.0019325468,0.0029724669,0.0006994571],"domain_scores_gemma":[0.9729859,0.014632402,0.0022686666,0.0025180604,0.0042998795,0.0032951818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007874497,0.0010209093,0.0015193454,0.004270452,0.002471063,0.005357291,0.0029806131,0.002943746,0.0060750344],"category_scores_gemma":[0.03580166,0.00088846585,0.0022899723,0.0036730657,0.0053165685,0.014862998,0.006914367,0.007152298,0.0012542874],"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.00004571658,0.000035745576,0.00037718326,0.000062157356,0.000010187857,0.00003801078,0.0002047125,0.0021903035,0.00073153997,0.9836802,0.0008987761,0.011725448],"study_design_scores_gemma":[0.000019182584,0.00009754345,0.00036419358,0.00003306088,0.000017153752,0.00016740263,0.000073833224,0.040309306,0.00063599885,0.95261526,0.0056276596,0.00003943428],"about_ca_topic_score_codex":0.0011699019,"about_ca_topic_score_gemma":0.00073778146,"teacher_disagreement_score":0.007874497,"about_ca_system_score_codex":0.0029225077,"about_ca_system_score_gemma":0.002483765,"threshold_uncertainty_score":0.04164487},"labels":[],"label_agreement":null},{"id":"W2064126174","doi":"10.1007/s10472-007-9044-7","title":"On a rule-based interpretation of default conditionals","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Defeasible estate; Interpretation (philosophy); Defeasible reasoning; Non-monotonic logic; Inference; Default logic; Conditional probability; Rule of inference; Mathematics; Computer science; Theoretical computer science; Artificial intelligence; Mathematical economics; Description logic; Programming language","score_opus":0.08515365237624793,"score_gpt":0.3483287366739617,"score_spread":0.26317508429771375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064126174","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.016833972,0.000661072,0.9103722,0.006711862,0.0006984546,0.00014594923,0.0005531576,0.0009708023,0.06305258],"genre_scores_gemma":[0.45233998,0.0008110879,0.5278555,0.0027688458,0.0012256409,0.00025588705,0.0009842907,0.00072340306,0.013035338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949699,0.002088432,0.00045732304,0.000966544,0.0011551018,0.00036260093],"domain_scores_gemma":[0.9908743,0.0050478196,0.0002966057,0.0018949527,0.0016043285,0.00028203375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006825057,0.000986566,0.001533144,0.0032764957,0.0021806136,0.007282273,0.0048652836,0.004703644,0.0135325445],"category_scores_gemma":[0.018568402,0.0014630432,0.0033064866,0.0020910932,0.007857525,0.017187692,0.0047702645,0.0062113353,0.0018374466],"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.000046014527,0.000021807815,0.00015177738,0.000037899426,0.000019806936,0.00014633808,0.0003659719,0.0016184732,0.00047383842,0.98767775,0.0018228083,0.0076175216],"study_design_scores_gemma":[0.00003139589,0.000010058732,0.00008205593,0.000027435824,0.00002949411,0.00008584925,0.00005632618,0.013571587,0.0003764943,0.9807118,0.005001126,0.000016409307],"about_ca_topic_score_codex":0.0034237937,"about_ca_topic_score_gemma":0.0033965106,"teacher_disagreement_score":0.0135325445,"about_ca_system_score_codex":0.0020351813,"about_ca_system_score_gemma":0.0014525828,"threshold_uncertainty_score":0.04527086},"labels":[],"label_agreement":null},{"id":"W2065234465","doi":"10.1007/s001530100135","title":"The modal logic of the countable random frame","year":2003,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Modal logic; Mathematics; Normal modal logic; Countable set; Intermediate logic; Accessibility relation; Discrete mathematics; Dynamic logic (digital electronics); Modal μ-calculus; Multimodal logic; Axiom; Frame (networking); S5; Modal; Algebra over a field; Pure mathematics; Theoretical computer science; Computer science; Description logic; Geometry","score_opus":0.019905836028134085,"score_gpt":0.25093022166200113,"score_spread":0.23102438563386704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065234465","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.0627359,0.0070111444,0.7742977,0.0113768475,0.00052178727,0.00008910895,0.0012053031,0.00077033206,0.14199196],"genre_scores_gemma":[0.83935267,0.0037233792,0.11913041,0.0013964237,0.0015659403,0.0002702712,0.0013165593,0.00031602543,0.032928348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979091,0.0008880297,0.00013246293,0.00043226316,0.00044902027,0.00018899745],"domain_scores_gemma":[0.9961707,0.0019368601,0.00033940302,0.00080844667,0.0004722239,0.00027226686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034122826,0.00070337934,0.0015327615,0.00290474,0.003222524,0.006861448,0.0022433216,0.0022285082,0.0087773],"category_scores_gemma":[0.008120467,0.0007573478,0.0018121627,0.0026851823,0.006518632,0.014243378,0.0031663463,0.0039346786,0.0013994863],"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.0000061974515,0.000002150415,0.00001303158,0.0000076891465,0.000002321426,0.000007856579,0.000034737295,0.00018091893,0.000057292604,0.9984151,0.00033462635,0.00093802647],"study_design_scores_gemma":[0.0000063863254,0.000003577508,0.000024499319,0.000008265102,0.0000047396406,0.000017011356,0.00001873758,0.0024975582,0.00009051165,0.9949222,0.0024003475,0.0000061946575],"about_ca_topic_score_codex":0.0025967848,"about_ca_topic_score_gemma":0.002014742,"teacher_disagreement_score":0.0087773,"about_ca_system_score_codex":0.0028872355,"about_ca_system_score_gemma":0.0013900534,"threshold_uncertainty_score":0.029362977},"labels":[],"label_agreement":null},{"id":"W2065798393","doi":"10.1080/09528130701475617","title":"Weighting strategy for non-clausal resolution","year":2008,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Weighting; Satisfiability; Resolution (logic); Propositional formula; Propositional calculus; Algorithm; Propositional variable; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.06308542882193925,"score_gpt":0.32893391334340266,"score_spread":0.2658484845214634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065798393","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.0015824109,0.00009191777,0.9953803,0.00009230147,0.000050053193,0.00010979086,0.000030437966,0.0003450727,0.0023176677],"genre_scores_gemma":[0.07020722,0.00029020425,0.92153543,0.00015681704,0.00006164808,0.0004180938,0.00021695966,0.00042510088,0.006688474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943183,0.0020577605,0.00047083315,0.00061456114,0.0022559895,0.00028261324],"domain_scores_gemma":[0.9943725,0.0029628363,0.00021948316,0.0011424845,0.001114771,0.0001879634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052934997,0.0013869368,0.0014193457,0.0024487388,0.0013124401,0.002711034,0.0035114083,0.0015490848,0.01313935],"category_scores_gemma":[0.015249738,0.000879553,0.001547634,0.0020273717,0.0015281425,0.005192478,0.0041016275,0.0031241209,0.0031856874],"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.000110421795,0.000210704,0.0003017184,0.0003875301,0.000096157426,0.00025233123,0.00029370663,0.021093922,0.009919082,0.63540065,0.003938852,0.32799494],"study_design_scores_gemma":[0.00007693847,0.00007890451,0.00014421344,0.00010636623,0.00008659488,0.00026826997,0.00009831425,0.31709245,0.014727548,0.6479748,0.019274369,0.0000712308],"about_ca_topic_score_codex":0.0010443039,"about_ca_topic_score_gemma":0.0018827172,"teacher_disagreement_score":0.01313935,"about_ca_system_score_codex":0.0013031021,"about_ca_system_score_gemma":0.0019789068,"threshold_uncertainty_score":0.043955445},"labels":[],"label_agreement":null},{"id":"W2068303546","doi":"10.1016/j.apal.2009.01.015","title":"Dynamic topological S5","year":2009,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Topological space; Mathematics; Topological tensor product; Modal logic; Topological vector space; Normal modal logic; Function space; Topology (electrical circuits); Compact-open topology; Category of topological spaces; Class (philosophy); Homeomorphism (graph theory); Discrete space; Pure mathematics; Modal; Discrete mathematics; Computer science; Mathematical analysis; Combinatorics; Functional analysis; Artificial intelligence","score_opus":0.03521211998771567,"score_gpt":0.2953889388376347,"score_spread":0.260176818849919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068303546","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.0992574,0.001212909,0.1609061,0.0065542697,0.0010281525,0.00009809882,0.002479927,0.001082967,0.72738016],"genre_scores_gemma":[0.75280136,0.0011460559,0.038577385,0.0015551016,0.0007830489,0.00014661116,0.0032342644,0.0006546338,0.20110151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00015149462,0.00004869417,0.00028206533,0.0002179732,0.00014756569],"domain_scores_gemma":[0.9988122,0.0002212532,0.00012208302,0.00023137478,0.0004078366,0.00020530363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425134,0.00067626004,0.00065647694,0.0035466233,0.0032658018,0.005087009,0.0008442255,0.0012823726,0.049289502],"category_scores_gemma":[0.002061993,0.0004033708,0.0008975368,0.0018032187,0.0030035675,0.0066529545,0.002838497,0.002205392,0.0057936893],"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.000011963962,0.0000053238414,0.00005717128,0.000010997297,0.0000026484634,0.000018809356,0.000055383192,0.00013370543,0.00016632325,0.9944185,0.002331943,0.002787264],"study_design_scores_gemma":[0.000009388897,0.000012678801,0.00016440848,0.000011944506,0.000007224329,0.0001320743,0.00013909364,0.0015600576,0.00037430957,0.95746857,0.040110193,0.00001003992],"about_ca_topic_score_codex":0.0017004343,"about_ca_topic_score_gemma":0.0017735992,"teacher_disagreement_score":0.049289502,"about_ca_system_score_codex":0.002243805,"about_ca_system_score_gemma":0.00095947494,"threshold_uncertainty_score":0.16488981},"labels":[],"label_agreement":null},{"id":"W2069492207","doi":"10.1080/11663081.2014.911519","title":"Penumbral connections in comparative constructions","year":2014,"lang":"en","type":"article","venue":"Journal of Applied Non-Classical Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Realisation; Mathematics; Linguistics; Epistemology; Philosophy","score_opus":0.023160714168411842,"score_gpt":0.26007806483877466,"score_spread":0.23691735067036282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069492207","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.22218893,0.0014590662,0.51301324,0.001816918,0.0001619179,0.00010342782,0.0002726772,0.00045743203,0.26052633],"genre_scores_gemma":[0.96004003,0.00023897612,0.032911856,0.00015603179,0.000046342084,0.00004931828,0.000119971344,0.000095178046,0.006342394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697363,0.0014769575,0.00016648813,0.0006126435,0.00051235704,0.00025791448],"domain_scores_gemma":[0.9975503,0.0013088543,0.00027786652,0.0004214584,0.00034897303,0.00009241047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028772713,0.0005196512,0.00031406467,0.001765972,0.0020639757,0.00371025,0.0009817376,0.0012364786,0.008691666],"category_scores_gemma":[0.005113882,0.0004266477,0.0007760774,0.001522826,0.0062425397,0.009834322,0.0037998832,0.00187505,0.00066641264],"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.000013242219,0.0000030753445,0.00020963409,0.000026312004,0.000003768436,0.00005034962,0.0016058488,0.00019156132,0.00059905666,0.992645,0.00013070487,0.004521479],"study_design_scores_gemma":[0.000012762507,0.000046380486,0.0012993391,0.0000561022,0.000027160033,0.00036122865,0.0019401454,0.0038240107,0.002387758,0.9575252,0.032498285,0.000021609161],"about_ca_topic_score_codex":0.00091171113,"about_ca_topic_score_gemma":0.00089656975,"teacher_disagreement_score":0.008691666,"about_ca_system_score_codex":0.0026393787,"about_ca_system_score_gemma":0.0005197649,"threshold_uncertainty_score":0.029076517},"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":"W2070368455","doi":"10.1016/s0004-3702(02)00365-x","title":"Knowledge, action, and the frame problem","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Action (physics); Computer science; GRASP; Frame (networking); Frame problem; Knowledge representation and reasoning; Artificial intelligence; Object (grammar); Affect (linguistics); Successor cardinal; Cognitive science; Knowledge management; Mathematics; Programming language; Psychology; Communication","score_opus":0.060709685827284116,"score_gpt":0.3073802869727568,"score_spread":0.2466706011454727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070368455","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.07490284,0.021333776,0.55789626,0.071610816,0.001306863,0.0001767957,0.0009909999,0.00048698613,0.27129468],"genre_scores_gemma":[0.8484771,0.0075304424,0.11570827,0.0018395551,0.0010044277,0.00027208804,0.0010190404,0.000106751184,0.02404237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974963,0.0012288446,0.00016646108,0.0004857369,0.0003444213,0.00027827843],"domain_scores_gemma":[0.9940948,0.004490598,0.00034190115,0.0004903695,0.00033244456,0.00025002216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004245333,0.00079158583,0.0011594036,0.0020849274,0.0031805888,0.0069076875,0.002005928,0.005278386,0.010104905],"category_scores_gemma":[0.011656762,0.0006521878,0.0013236551,0.0023574042,0.011650495,0.018848307,0.0030248626,0.0033808742,0.0009913457],"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.000035965168,0.000013827895,0.00008867598,0.000037230355,0.000006890878,0.000048611746,0.00019711185,0.0011427919,0.000044633587,0.98962307,0.0016733389,0.007087992],"study_design_scores_gemma":[0.000012933782,0.000003418999,0.00003298731,0.000016240832,0.000005298657,0.00002048004,0.00010006122,0.0018819531,0.000040351577,0.9941567,0.0037248568,0.000004598406],"about_ca_topic_score_codex":0.01584084,"about_ca_topic_score_gemma":0.007767883,"teacher_disagreement_score":0.01584084,"about_ca_system_score_codex":0.0038242913,"about_ca_system_score_gemma":0.0027045696,"threshold_uncertainty_score":0.033804238},"labels":[],"label_agreement":null},{"id":"W2070533073","doi":"10.1017/s0960129506005226","title":"Special issue on quantum programming languages","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","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":"Dalhousie University","funders":"","keywords":"Computer science; Rotation formalisms in three dimensions; Quantum computer; Programming language; Quantum; Theoretical computer science; Mathematics","score_opus":0.010990766051604109,"score_gpt":0.270382784079142,"score_spread":0.2593920180275379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070533073","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.0011756486,0.046119597,0.012665545,0.08741899,0.7297337,0.00017050869,0.0009900875,0.0006830548,0.121042974],"genre_scores_gemma":[0.008281519,0.02646605,0.00266201,0.018039864,0.76233155,0.00021065633,0.0016258006,0.0012587006,0.17912373],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99677783,0.00061361125,0.0003968577,0.0006897543,0.0011936416,0.0003283316],"domain_scores_gemma":[0.99008054,0.0047568614,0.00047717232,0.0009415199,0.0024252115,0.0013186804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216041,0.0014851926,0.0023854442,0.0050245007,0.00386777,0.009140741,0.001808641,0.0037680783,0.099368736],"category_scores_gemma":[0.009694133,0.0009108898,0.002001758,0.0042810715,0.0020117231,0.010674746,0.0039497474,0.0073453886,0.024425635],"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.000029905323,0.000035993464,0.000107888016,0.00028808464,0.000020333224,0.00008340797,0.00010224963,0.00012213929,0.00026102667,0.022258272,0.94940025,0.027290536],"study_design_scores_gemma":[0.000010687398,0.000019838491,0.00019099965,0.00017167369,0.000010828733,0.00019829762,0.000051888917,0.00028286286,0.000112935515,0.014198391,0.9847408,0.000010812346],"about_ca_topic_score_codex":0.0008566223,"about_ca_topic_score_gemma":0.0015157424,"teacher_disagreement_score":0.099368736,"about_ca_system_score_codex":0.002883837,"about_ca_system_score_gemma":0.0023580391,"threshold_uncertainty_score":0.33242154},"labels":[],"label_agreement":null},{"id":"W2071118378","doi":"10.1145/1055686.1055694","title":"Minimum model semantics for logic programs with negation-as-failure","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":45,"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 Victoria","funders":"","keywords":"Negation; Mathematics; Uncountable set; Countable set; Zero (linguistics); Discrete mathematics; Truth value; Intersection (aeronautics); Stable model semantics; Negation as failure; Element (criminal law); Semantics (computer science); Computer science; Operational semantics; Programming language","score_opus":0.02990417311902534,"score_gpt":0.2711068560446593,"score_spread":0.24120268292563393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071118378","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.03558721,0.00023174867,0.9508844,0.0011157956,0.00005403341,0.0001075007,0.00029403958,0.00075320306,0.010972101],"genre_scores_gemma":[0.6873579,0.00029364444,0.3049319,0.00041012585,0.00011039278,0.0005895728,0.00068137905,0.00046145587,0.0051636295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984767,0.00034307956,0.00011562112,0.00026756138,0.0005750128,0.00022211591],"domain_scores_gemma":[0.9985592,0.00064556685,0.00018586492,0.00021999989,0.0002547693,0.00013466584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661536,0.0007923537,0.0008704636,0.0013750402,0.0013933437,0.003432591,0.0023565535,0.001495493,0.003333531],"category_scores_gemma":[0.0029784746,0.0006133208,0.002349708,0.0012249844,0.00387922,0.008335372,0.003314878,0.003994444,0.000456528],"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.0000293845,0.000031844418,0.00017959962,0.000050687297,0.000014665982,0.0001060493,0.00048252454,0.0049748155,0.0014382796,0.9883631,0.00043904939,0.0038900753],"study_design_scores_gemma":[0.000030497065,0.000037318565,0.00008684657,0.000032977197,0.000021069753,0.000108273474,0.00014783246,0.040666856,0.0026803552,0.9513504,0.0048189214,0.000018749997],"about_ca_topic_score_codex":0.0020846624,"about_ca_topic_score_gemma":0.0022547708,"teacher_disagreement_score":0.003432591,"about_ca_system_score_codex":0.0028013359,"about_ca_system_score_gemma":0.0018145149,"threshold_uncertainty_score":0.020325184},"labels":[],"label_agreement":null},{"id":"W2074047803","doi":"10.1007/s11390-010-9407-0","title":"Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Probabilistic analysis of algorithms; Mathematical proof; Theory of computation; Computational complexity theory; Algorithm; Automated theorem proving; Probabilistic logic; Time complexity; Descriptive complexity theory; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01665396761359184,"score_gpt":0.2521595947787549,"score_spread":0.23550562716516305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074047803","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.23670515,0.00072738936,0.75096583,0.0015716858,0.000094010196,0.00025745423,0.0005225123,0.0016096714,0.007546358],"genre_scores_gemma":[0.8299691,0.00032041073,0.166609,0.0001875136,0.00018715415,0.0001680015,0.0007475308,0.0004092745,0.0014019852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98046446,0.0068556764,0.0012934459,0.0022699798,0.0056085484,0.0035079026],"domain_scores_gemma":[0.68754643,0.29132038,0.0067776926,0.008248334,0.0042655296,0.0018416818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016049549,0.002066412,0.002108012,0.0033353867,0.0015097498,0.008651337,0.0062932614,0.0025545123,0.0064739306],"category_scores_gemma":[0.111674525,0.0018809054,0.0035765604,0.003376046,0.0051656454,0.017016403,0.003706661,0.0051575233,0.0004244227],"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.00092266285,0.0008302806,0.009942908,0.00045570917,0.0003998052,0.00022956166,0.0004262391,0.70861703,0.004433843,0.2257523,0.0017882042,0.046201393],"study_design_scores_gemma":[0.0001080789,0.000102951046,0.0008456679,0.00002358395,0.0001026165,0.00007032613,0.000059479764,0.8531631,0.002730955,0.1423853,0.00037706387,0.000030863113],"about_ca_topic_score_codex":0.0067499876,"about_ca_topic_score_gemma":0.0054236627,"teacher_disagreement_score":0.016049549,"about_ca_system_score_codex":0.0058754818,"about_ca_system_score_gemma":0.007278106,"threshold_uncertainty_score":0.08487916},"labels":[],"label_agreement":null},{"id":"W2075300940","doi":"10.1007/s11225-013-9519-y","title":"Remarks on the Scott–Lindenbaum Theorem","year":2013,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Generalization; Subject (documents); Order (exchange); Inference; Logical consequence; Epistemology; Computer science; Mathematical logic; Rule of inference; Mathematics; Mathematical economics; Calculus (dental); Algebra over a field; Philosophy; Artificial intelligence; Algorithm; Pure mathematics","score_opus":0.02004094291187576,"score_gpt":0.2323315146845149,"score_spread":0.21229057177263916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075300940","genre_codex":"commentary","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.023947636,0.010416768,0.11561096,0.45319596,0.013590031,0.00006492666,0.0012465087,0.0008459812,0.38108122],"genre_scores_gemma":[0.6803157,0.009879201,0.06884359,0.095747575,0.039472092,0.00037607102,0.0010973152,0.00061699795,0.1036515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659556,0.00108805,0.00021485625,0.00085684913,0.00095533434,0.000289372],"domain_scores_gemma":[0.9838778,0.011963791,0.0004900597,0.0013318524,0.0018764278,0.00046001276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008138843,0.000983865,0.0012446423,0.0020157497,0.0035675874,0.0033647188,0.002572765,0.003929957,0.030979339],"category_scores_gemma":[0.018164188,0.00051584136,0.0016540397,0.0013818344,0.008906685,0.013502036,0.0037558044,0.0059485137,0.004351372],"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.00006548904,0.000024637257,0.00020883692,0.00007442653,0.000022818835,0.00013929141,0.0002500855,0.00031678777,0.0001914459,0.9707126,0.023271661,0.004721887],"study_design_scores_gemma":[0.000021182872,0.000010818906,0.00031512417,0.000025413314,0.000010850875,0.000060807473,0.00006430062,0.00038738802,0.00013809426,0.97686315,0.022089604,0.000013302583],"about_ca_topic_score_codex":0.0024936374,"about_ca_topic_score_gemma":0.0015655085,"teacher_disagreement_score":0.030979339,"about_ca_system_score_codex":0.002136829,"about_ca_system_score_gemma":0.00075444486,"threshold_uncertainty_score":0.103636205},"labels":[],"label_agreement":null},{"id":"W2076950106","doi":"10.5555/777092.777173","title":"Non-Markovian control in the situation calculus","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"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 Toronto","funders":"","keywords":"Situation calculus; Markov process; Property (philosophy); Action (physics); Computer science; Operator (biology); Calculus (dental); Markov property; Markov chain; State (computer science); Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Artificial intelligence; Markov model; Pure mathematics; Machine learning; Epistemology","score_opus":0.013837984708431474,"score_gpt":0.2173002804085869,"score_spread":0.20346229570015542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076950106","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.03615067,0.0019602897,0.90432256,0.0030036499,0.00021230662,0.00011273638,0.00021053092,0.0006053021,0.053421903],"genre_scores_gemma":[0.78886336,0.0013987069,0.19458416,0.0004094784,0.00031943904,0.0003598753,0.00021877703,0.00012941347,0.013716758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735105,0.0007921738,0.00021590103,0.0004683224,0.00084003905,0.0003325058],"domain_scores_gemma":[0.9976006,0.001274223,0.00022170378,0.0003472513,0.00034061185,0.00021559987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034628164,0.0007093428,0.00075179664,0.0010800029,0.0016679823,0.004227292,0.0015939054,0.001188095,0.0036775933],"category_scores_gemma":[0.004023284,0.0006716708,0.0016435268,0.001086897,0.0068004588,0.007822344,0.0023306247,0.0029407945,0.0004674216],"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.000010061367,0.000007971016,0.00005572624,0.000015625912,0.0000055999994,0.000049693106,0.0001764873,0.0029469358,0.00019499048,0.99442697,0.00019628381,0.0019137182],"study_design_scores_gemma":[0.000014640039,0.000009500797,0.000047143032,0.000013302958,0.000012408641,0.000025844174,0.000037182188,0.019045196,0.00029177085,0.97665787,0.0038341966,0.000010947747],"about_ca_topic_score_codex":0.0076991217,"about_ca_topic_score_gemma":0.0059381975,"teacher_disagreement_score":0.0076991217,"about_ca_system_score_codex":0.0034828319,"about_ca_system_score_gemma":0.0025794585,"threshold_uncertainty_score":0.025269866},"labels":[],"label_agreement":null},{"id":"W2078103992","doi":"10.1016/j.ic.2005.02.004","title":"Bisimulation and cocongruence for probabilistic systems","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Bisimulation; Mathematics; Equivalence (formal languages); Probabilistic logic; Event (particle physics); Characterization (materials science); Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.011050950264788953,"score_gpt":0.23722474774498226,"score_spread":0.2261737974801933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078103992","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.098370664,0.0018252314,0.8386015,0.0029833976,0.00040065564,0.00011532606,0.0004090401,0.0006825486,0.056611646],"genre_scores_gemma":[0.9131007,0.00083708746,0.07573026,0.0005329892,0.0005519935,0.00026618154,0.00038740083,0.00021630379,0.008377073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99164164,0.0025547538,0.00068851974,0.0015837328,0.0024417164,0.0010897736],"domain_scores_gemma":[0.97247756,0.01940642,0.0012071582,0.0034258687,0.002228999,0.0012540291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060151513,0.0009092557,0.0016186778,0.0029241005,0.003696901,0.0062814644,0.0024192757,0.00220852,0.007045334],"category_scores_gemma":[0.025780583,0.0011182884,0.0024920222,0.0022757428,0.008795652,0.011958765,0.0056765927,0.007188178,0.00074626826],"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.000024143234,0.000013870786,0.00011203746,0.000024228344,0.0000070745655,0.00004486936,0.00016618162,0.0011249298,0.00015530418,0.99580944,0.00022246425,0.0022954617],"study_design_scores_gemma":[0.000008147204,0.000007952422,0.00004088607,0.000008940431,0.000008218149,0.000051735773,0.00002289805,0.007320318,0.00024202891,0.991447,0.0008323439,0.00000964805],"about_ca_topic_score_codex":0.0024999576,"about_ca_topic_score_gemma":0.0018970132,"teacher_disagreement_score":0.007045334,"about_ca_system_score_codex":0.0029540928,"about_ca_system_score_gemma":0.0021391474,"threshold_uncertainty_score":0.031811535},"labels":[],"label_agreement":null},{"id":"W2078711049","doi":"10.1016/s0743-1066(99)00074-6","title":"An abductive approach to disjunctive logic programming","year":2000,"lang":"en","type":"article","venue":"The Journal of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abductive reasoning; Programming language; Computer science; Logic programming; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.0271003463705564,"score_gpt":0.27402904815734697,"score_spread":0.24692870178679058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078711049","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.002419903,0.00050982874,0.9885548,0.0010474352,0.000082382525,0.00008325925,0.0000800017,0.00024052284,0.0069819107],"genre_scores_gemma":[0.10184155,0.0007444073,0.8926217,0.0004338633,0.00022137095,0.00012220918,0.00021192856,0.000048878097,0.003754024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961333,0.0012764569,0.0003780567,0.00046486803,0.0015489573,0.00019835691],"domain_scores_gemma":[0.9916461,0.006069058,0.0002433093,0.0008617673,0.0010281012,0.00015167156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004604106,0.0009581954,0.0010793158,0.0024724796,0.0012217712,0.004060639,0.0045594885,0.0018092815,0.0061520035],"category_scores_gemma":[0.014349448,0.0010036611,0.001882796,0.0023626967,0.0037166853,0.005496581,0.0038505043,0.004940936,0.00070100266],"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.00009371076,0.00016504321,0.0005243777,0.00032059182,0.000109897715,0.0002424581,0.0005071665,0.034280498,0.0013523459,0.78542244,0.003906716,0.17307469],"study_design_scores_gemma":[0.000035305886,0.00002132718,0.00009226694,0.000097373595,0.0000557074,0.000115211194,0.000089710156,0.1871142,0.0011068026,0.80422425,0.0070291525,0.000018763407],"about_ca_topic_score_codex":0.0031878233,"about_ca_topic_score_gemma":0.005344678,"teacher_disagreement_score":0.0061520035,"about_ca_system_score_codex":0.0013299558,"about_ca_system_score_gemma":0.00149949,"threshold_uncertainty_score":0.024349093},"labels":[],"label_agreement":null},{"id":"W2079251035","doi":"10.1109/coginf.2010.5599679","title":"Decision-making in fuzzy environments using ontological control with fuzzy automata","year":2010,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fuzzy logic; Artificial intelligence; Fuzzy control system; sort","score_opus":0.012248846624269788,"score_gpt":0.2556208528076253,"score_spread":0.24337200618335553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079251035","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.022095716,0.00033293196,0.96531904,0.0005767715,0.00007015314,0.000067546665,0.000036924197,0.00015764161,0.011343331],"genre_scores_gemma":[0.7033998,0.0006439801,0.29188812,0.0001747458,0.00008367372,0.00028666493,0.0000768997,0.000045852,0.003400285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861884,0.0005824899,0.0001148292,0.00018618864,0.00038771122,0.00010981516],"domain_scores_gemma":[0.99847037,0.0008922463,0.00017149853,0.00020718142,0.00016956487,0.00008901504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751166,0.00060442503,0.0006560305,0.0007400418,0.0010395547,0.0028434221,0.0010821497,0.0011039622,0.0015462177],"category_scores_gemma":[0.0040723826,0.00036648838,0.0015913494,0.00066896883,0.003623353,0.0031410272,0.002190464,0.0017680235,0.00021522668],"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.000037178586,0.000033391283,0.0003292088,0.000052345426,0.000034936777,0.00012646393,0.0004973256,0.12499314,0.0020116724,0.8604868,0.00031899993,0.011078421],"study_design_scores_gemma":[0.000037298258,0.00004063363,0.0001077117,0.00003805204,0.000028160995,0.000032063508,0.000101890524,0.49183378,0.0019689968,0.5012821,0.004497969,0.000031418676],"about_ca_topic_score_codex":0.0043946453,"about_ca_topic_score_gemma":0.0039175153,"teacher_disagreement_score":0.0043946453,"about_ca_system_score_codex":0.0018188745,"about_ca_system_score_gemma":0.0012811341,"threshold_uncertainty_score":0.013196945},"labels":[],"label_agreement":null},{"id":"W2080872423","doi":"10.1007/s11225-013-9492-5","title":"Decidability of an Xstit Logic","year":2013,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Decidability; Undecidable problem; Mathematics; Completeness (order theory); Fragment (logic); Discrete mathematics; Closure (psychology); Intermediate logic; Zeroth-order logic; Mathematical proof; Dynamic logic (digital electronics); Computer science; Algorithm; Description logic; Programming language; Multimodal logic","score_opus":0.023146463325487702,"score_gpt":0.2570697660865448,"score_spread":0.2339233027610571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080872423","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.23495394,0.0031939005,0.53005797,0.015061802,0.00083168177,0.00030920815,0.0028737402,0.0025414622,0.21017633],"genre_scores_gemma":[0.86914575,0.0012181493,0.08785669,0.0020427522,0.0007283866,0.00020614301,0.003718403,0.00029890062,0.034784812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641585,0.0008849505,0.0003216107,0.00078469294,0.0011163872,0.00047640214],"domain_scores_gemma":[0.991013,0.006756329,0.00035203918,0.0007089477,0.00084364874,0.00032606494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039606146,0.0006753915,0.0010047901,0.0018338672,0.0034441492,0.0069835423,0.0031079282,0.0022795615,0.009542574],"category_scores_gemma":[0.010089344,0.0011910099,0.003921376,0.0018245599,0.0048483885,0.0126562705,0.003537851,0.006721123,0.00096163567],"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.00007376903,0.0000664014,0.00049326185,0.000094327464,0.000036842768,0.00013659746,0.00040571927,0.0018650551,0.0006736097,0.98559433,0.0029051178,0.007654974],"study_design_scores_gemma":[0.000051639025,0.000015647302,0.0002259821,0.000026977386,0.00005211049,0.00009976814,0.000107254054,0.013951057,0.0014397108,0.9782653,0.0057480754,0.000016517482],"about_ca_topic_score_codex":0.005959975,"about_ca_topic_score_gemma":0.005590818,"teacher_disagreement_score":0.009542574,"about_ca_system_score_codex":0.00371712,"about_ca_system_score_gemma":0.0025271622,"threshold_uncertainty_score":0.031923115},"labels":[],"label_agreement":null},{"id":"W2082167645","doi":"10.1007/s10992-008-9086-2","title":"Iterated Belief Change and the Recovery Axiom","year":2008,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kensington Health","funders":"Australian Research Council; National ICT Australia; New South Wales Government; Australian Government; University of Sydney; Australian National University","keywords":"Axiom; Iterated function; Axiom of choice; Mathematical economics; Counterexample; Mathematics; Representation theorem; Peano axioms; Computer science; Discrete mathematics; Set (abstract data type); Set theory; Programming language","score_opus":0.07301883437600006,"score_gpt":0.25120086866369545,"score_spread":0.1781820342876954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082167645","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.07109718,0.0017958906,0.7716686,0.027918657,0.0005026668,0.00020661142,0.00045389254,0.0005850142,0.12577152],"genre_scores_gemma":[0.86809105,0.00067437405,0.113020174,0.0021899077,0.000464724,0.000263286,0.0002882759,0.00013980613,0.014868311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330115,0.0026014003,0.00046765647,0.0014027875,0.0015360678,0.0006910839],"domain_scores_gemma":[0.95865214,0.029312251,0.0016700343,0.0062335655,0.0033581224,0.0007739862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009117135,0.00054019847,0.0012991311,0.001333742,0.0027182435,0.0037100173,0.00290591,0.0045879297,0.010000613],"category_scores_gemma":[0.0434442,0.0010274017,0.002455991,0.0010473616,0.010742229,0.015293237,0.0047226483,0.01025344,0.0010170295],"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.000042600048,0.000021920072,0.00018824887,0.00003729865,0.00002167658,0.000100446414,0.0002620685,0.0008194699,0.00018492356,0.99288225,0.00084861054,0.004590456],"study_design_scores_gemma":[0.000028601786,0.000009308658,0.00012071329,0.000010637778,0.000014475244,0.00009584717,0.000038940558,0.004348282,0.00020646362,0.9938929,0.0012235872,0.00001023275],"about_ca_topic_score_codex":0.0041306834,"about_ca_topic_score_gemma":0.0027498377,"teacher_disagreement_score":0.010000613,"about_ca_system_score_codex":0.0025478422,"about_ca_system_score_gemma":0.0019126039,"threshold_uncertainty_score":0.04821664},"labels":[],"label_agreement":null},{"id":"W2082633051","doi":"10.1007/s10458-008-9035-z","title":"Computational logic-based agents","year":2008,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science","score_opus":0.06283576573167605,"score_gpt":0.27752194740119823,"score_spread":0.2146861816695222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082633051","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.016018482,0.002765454,0.7599642,0.01331966,0.00059691665,0.00019907481,0.00055093266,0.0009781636,0.20560709],"genre_scores_gemma":[0.48477677,0.00260533,0.45324582,0.002383547,0.0005822096,0.00038838337,0.0012800681,0.00018481305,0.054553054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.00070505746,0.00014201048,0.00029671745,0.0005038591,0.00010936944],"domain_scores_gemma":[0.99667007,0.0016843412,0.0001964519,0.00064409,0.00057583756,0.0002292862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018209023,0.0005527436,0.0005327729,0.0013290858,0.001616383,0.0071377894,0.0019236983,0.001459437,0.011118243],"category_scores_gemma":[0.0065268795,0.0004359465,0.00076455425,0.0009646192,0.0040835836,0.006164468,0.0026301038,0.0021743618,0.002298338],"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.00001596822,0.000022439159,0.00013822947,0.00004308074,0.000011467262,0.000041518862,0.00017611547,0.0020325521,0.00026731653,0.9836035,0.0023488202,0.011299082],"study_design_scores_gemma":[0.000018354354,0.0000096397425,0.000065968605,0.00003063118,0.000012386141,0.000047644546,0.00008265743,0.015255091,0.0004837271,0.9457412,0.038244378,0.000008173228],"about_ca_topic_score_codex":0.0017480154,"about_ca_topic_score_gemma":0.0018304834,"teacher_disagreement_score":0.011118243,"about_ca_system_score_codex":0.0018485975,"about_ca_system_score_gemma":0.001791489,"threshold_uncertainty_score":0.037194192},"labels":[],"label_agreement":null},{"id":"W2084895856","doi":"10.1109/tcbb.2007.1008","title":"Quartet-Based Phylogeny Reconstruction with Answer Set Programming","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Chinese Academy of Sciences; University of Alberta; Rice University; University of Utah","keywords":"Ultrametric space; Answer set programming; Representation (politics); Set (abstract data type); Computer science; Theoretical computer science; Consistency (knowledge bases); Perspective (graphical); Mathematics; Algorithm; Artificial intelligence; Discrete mathematics; Programming language","score_opus":0.017292598267489197,"score_gpt":0.2633733039962493,"score_spread":0.24608070572876012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084895856","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.0036676265,0.00010812552,0.9944296,0.00032704617,0.00002197141,0.00005135587,0.00009469601,0.0003153585,0.0009842926],"genre_scores_gemma":[0.101970896,0.00022649152,0.89451903,0.00034630502,0.00008856382,0.0003768801,0.0008902487,0.0002018282,0.0013796781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965023,0.0015248023,0.00020072404,0.0007728619,0.00079727126,0.00020202341],"domain_scores_gemma":[0.9926059,0.005515815,0.0004697651,0.00074760616,0.0005188581,0.00014204379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043580104,0.0009652959,0.0016185072,0.0019551709,0.0009161094,0.0029022112,0.003939946,0.0016844526,0.0060011945],"category_scores_gemma":[0.016388914,0.000673008,0.002485858,0.0023943116,0.0019443072,0.005664255,0.0032649112,0.0035313196,0.0008494937],"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.00018544136,0.00022419264,0.0012229125,0.00049065915,0.00010932686,0.00018097811,0.00046387123,0.4480754,0.0021456664,0.3175125,0.0044030314,0.22498606],"study_design_scores_gemma":[0.000023409217,0.000037568952,0.00007948222,0.00003549343,0.000018249972,0.000049396032,0.000060427858,0.68679494,0.0008980921,0.3096538,0.002333395,0.000015765052],"about_ca_topic_score_codex":0.0015539193,"about_ca_topic_score_gemma":0.0014350996,"teacher_disagreement_score":0.0060011945,"about_ca_system_score_codex":0.0012911895,"about_ca_system_score_gemma":0.0015069806,"threshold_uncertainty_score":0.023047626},"labels":[],"label_agreement":null},{"id":"W2086967111","doi":"10.1109/inm.2007.374804","title":"A Hybrid Approach to Operating System Discovery using Answer Set Programming","year":2007,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Carleton University","funders":"","keywords":"Computer science; Set (abstract data type); Answer set programming; Simple (philosophy); Representation (politics); Logic programming; Artificial intelligence; Programming language","score_opus":0.03235120864900761,"score_gpt":0.26844110396093873,"score_spread":0.23608989531193111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086967111","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.0022915984,0.000118110074,0.9929756,0.0010516816,0.000026209502,0.00008717899,0.000056567776,0.00042014904,0.002972975],"genre_scores_gemma":[0.08703475,0.00030878378,0.9084316,0.00063539535,0.00012195565,0.0002911203,0.000270161,0.00012603015,0.0027801327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9878576,0.004863703,0.00077134866,0.0016880451,0.004150162,0.00066914066],"domain_scores_gemma":[0.983267,0.012726008,0.0006267486,0.0016903487,0.0013589454,0.00033086693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012267565,0.0011174722,0.0013701493,0.0041363933,0.002425819,0.0075958553,0.005966649,0.0030426858,0.005555164],"category_scores_gemma":[0.017680552,0.0010690703,0.004327872,0.0031387932,0.006372411,0.016032314,0.0067063663,0.00566718,0.0010095672],"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.00013347807,0.00018508635,0.0005600836,0.0003222639,0.00012617678,0.00026532353,0.00095653976,0.025280464,0.0021201635,0.8801204,0.0031789476,0.08675111],"study_design_scores_gemma":[0.000060777853,0.000051527953,0.00008215029,0.00006412892,0.00008661381,0.0002156051,0.00022290082,0.18761668,0.0033663441,0.7970516,0.011133218,0.00004852773],"about_ca_topic_score_codex":0.0031181714,"about_ca_topic_score_gemma":0.0031715746,"teacher_disagreement_score":0.012267565,"about_ca_system_score_codex":0.0026248507,"about_ca_system_score_gemma":0.0030777713,"threshold_uncertainty_score":0.06487781},"labels":[],"label_agreement":null},{"id":"W2087074619","doi":"10.1109/icif.2007.4408149","title":"Interpreted systems for situation analysis","year":2007,"lang":"en","type":"article","venue":"","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Knowledge base; Knowledge representation and reasoning; Theoretical computer science; Set (abstract data type); Task (project management); Semantics (computer science); Representation (politics); Bounded function; Process (computing); Artificial intelligence; Mathematics; Programming language","score_opus":0.016515323493074573,"score_gpt":0.271569782630237,"score_spread":0.25505445913716246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087074619","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.001778596,0.0040802155,0.9227245,0.0037995253,0.00080253085,0.0001955327,0.0003092309,0.0008323699,0.06547752],"genre_scores_gemma":[0.20249215,0.0048546526,0.761132,0.0022939793,0.0019575392,0.0013281467,0.0013345445,0.0005913785,0.024015652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930676,0.0035402768,0.0007516189,0.0010537222,0.0012324468,0.00035431123],"domain_scores_gemma":[0.9937937,0.0035912995,0.00041343196,0.0012681119,0.0007127376,0.00022063838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007048794,0.0020059433,0.001342135,0.0031940052,0.00231571,0.009379054,0.0025073672,0.0027849386,0.018733716],"category_scores_gemma":[0.01049568,0.0009563272,0.0031874413,0.0021508539,0.010863984,0.013163448,0.006632201,0.007417198,0.003245121],"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.000006034905,0.0000047133467,0.000031217514,0.000055112938,0.000008809555,0.000046300906,0.00035036262,0.001058763,0.000093610885,0.99298626,0.00078703504,0.004571695],"study_design_scores_gemma":[0.0000099994095,0.000008152731,0.000030763655,0.00006173117,0.000010093908,0.000056068366,0.000130158,0.0052146567,0.00013779584,0.9584191,0.035909336,0.000012074964],"about_ca_topic_score_codex":0.002944701,"about_ca_topic_score_gemma":0.0018099801,"teacher_disagreement_score":0.018733716,"about_ca_system_score_codex":0.0044256146,"about_ca_system_score_gemma":0.0025400342,"threshold_uncertainty_score":0.06267053},"labels":[],"label_agreement":null},{"id":"W2087144687","doi":"10.1145/383779.383782","title":"Incremental execution of guarded theories","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"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 Toronto","funders":"","keywords":"Computer science; Nondeterministic algorithm; Prolog; Implementation; Programming language; Expressive power; Bounded function; Robot; Interpreter; Heuristics; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02347817064120366,"score_gpt":0.26743130340983406,"score_spread":0.2439531327686304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087144687","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.092083804,0.00030501393,0.88526964,0.00046997526,0.000086989545,0.00016463679,0.00030042493,0.00795724,0.0133621935],"genre_scores_gemma":[0.6189023,0.00024630266,0.3764241,0.0001735668,0.00003869063,0.00015197061,0.00052840746,0.00051130384,0.0030232219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858,0.00050754735,0.00009144347,0.00020365664,0.00038597223,0.00023141677],"domain_scores_gemma":[0.99668187,0.002084857,0.00014050584,0.0006662543,0.00031579888,0.00011067499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017472793,0.0004469191,0.00040323715,0.000578923,0.0005750933,0.0013370138,0.0017401095,0.0005778595,0.0033733982],"category_scores_gemma":[0.007172005,0.00051233044,0.0010110547,0.00043129895,0.001891546,0.0025847503,0.002638485,0.0013360815,0.00040812948],"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.0006581912,0.00024109342,0.00546986,0.0006006999,0.00013370672,0.0012260156,0.0020144158,0.17758368,0.022862824,0.61015207,0.0050734445,0.17398396],"study_design_scores_gemma":[0.0001111155,0.00011545372,0.000582399,0.0000880083,0.000105418374,0.00013599324,0.00019286094,0.6274358,0.021021185,0.33703965,0.013129095,0.00004304044],"about_ca_topic_score_codex":0.003544871,"about_ca_topic_score_gemma":0.007553176,"teacher_disagreement_score":0.003544871,"about_ca_system_score_codex":0.0009912532,"about_ca_system_score_gemma":0.0015426265,"threshold_uncertainty_score":0.011285067},"labels":[],"label_agreement":null},{"id":"W2087666725","doi":"10.1016/j.ic.2010.12.005","title":"A logical duality for underspecified probabilistic systems","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Probabilistic logic; Galois connection; Duality (order theory); Connection (principal bundle); Probabilistic automaton; Functor; Bisimulation; Mathematics; Automaton; Evidentiality; Simple (philosophy); Computer science; Theoretical computer science; Discrete mathematics; Artificial intelligence","score_opus":0.03267041144300124,"score_gpt":0.27589539379364997,"score_spread":0.2432249823506487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087666725","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.020997874,0.00076215,0.9315302,0.005183999,0.00038843392,0.0000644375,0.00037323756,0.0002891802,0.040410534],"genre_scores_gemma":[0.69402665,0.0010639507,0.28666168,0.0024689704,0.0013865593,0.00027681456,0.0007716709,0.0002480756,0.0130956285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925621,0.002734775,0.0006905625,0.0014311884,0.0019182017,0.00066318404],"domain_scores_gemma":[0.98662823,0.0071974043,0.0007876087,0.0026571935,0.0020047424,0.00072486047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008000167,0.00072368176,0.0013900183,0.0027583083,0.0028350628,0.008660678,0.0026536994,0.0028728505,0.009929375],"category_scores_gemma":[0.017695058,0.0011620501,0.003303413,0.0017490351,0.008674558,0.022345018,0.007711113,0.008871674,0.0012881726],"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.000007865699,0.000005740839,0.000043224605,0.000012222467,0.000003849133,0.000024720928,0.00007066489,0.0002811441,0.000083671315,0.99781114,0.00025600364,0.0013997116],"study_design_scores_gemma":[0.0000045613265,0.000003793059,0.000023246606,0.0000073007213,0.000005032631,0.00004003872,0.000021279457,0.0027030907,0.00011905549,0.99550146,0.0015660544,0.0000050433555],"about_ca_topic_score_codex":0.000888692,"about_ca_topic_score_gemma":0.000716402,"teacher_disagreement_score":0.009929375,"about_ca_system_score_codex":0.002353038,"about_ca_system_score_gemma":0.0017068384,"threshold_uncertainty_score":0.042309403},"labels":[],"label_agreement":null},{"id":"W2089872474","doi":"10.1080/0952813031000064567","title":"Planning under uncertainty as G<scp>OLOG</scp>programs","year":2003,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"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":"Situation calculus; Computer science; Logic programming; Artificial intelligence; Popularity; Belief revision; Programming language","score_opus":0.044964826564468104,"score_gpt":0.32627017792663426,"score_spread":0.28130535136216617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089872474","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.0553884,0.0015388331,0.84044224,0.005515096,0.000097073076,0.00031651778,0.0010481104,0.0026594829,0.092994176],"genre_scores_gemma":[0.6142391,0.0020655429,0.34940034,0.0008487697,0.00015680131,0.0005396719,0.0014262423,0.0004433739,0.0308802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924195,0.00021711474,0.00005289299,0.00010749168,0.00027977454,0.0001007636],"domain_scores_gemma":[0.9985661,0.0008218018,0.00017280497,0.00016715098,0.00020153895,0.00007062899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132591,0.00046954234,0.00042149713,0.0014233536,0.00082029076,0.004379477,0.0011289513,0.0010704263,0.006021869],"category_scores_gemma":[0.0035000092,0.00047890015,0.00090513687,0.0029809903,0.0033484432,0.0030678893,0.0013679359,0.0017112902,0.0010246753],"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.000039623348,0.000022368604,0.0005225469,0.00008845031,0.000026544458,0.0003563409,0.0005231776,0.07233223,0.00047679796,0.89412934,0.004196164,0.027286407],"study_design_scores_gemma":[0.000022522365,0.000012675972,0.00020185423,0.000048128466,0.000019012237,0.00009988878,0.000122029094,0.16163087,0.00051639706,0.8084777,0.028834235,0.000014656532],"about_ca_topic_score_codex":0.017571976,"about_ca_topic_score_gemma":0.010915977,"teacher_disagreement_score":0.017571976,"about_ca_system_score_codex":0.0032329499,"about_ca_system_score_gemma":0.0025989383,"threshold_uncertainty_score":0.03493941},"labels":[],"label_agreement":null},{"id":"W2091224100","doi":"10.1016/j.entcs.2014.06.003","title":"Non-deterministic Semantics in Polynomial Format","year":2014,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Modal logic; Semantics (computer science); Mathematics; Algebra over a field; Algebraic semantics; Polynomial; Discrete mathematics; Computer science; Modal; Calculus (dental); Theoretical computer science; Programming language; Pure mathematics","score_opus":0.004740707857415193,"score_gpt":0.23440243660763127,"score_spread":0.22966172875021607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091224100","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.0029806392,0.0002570811,0.9888815,0.00054624496,0.00013061502,0.000049285012,0.00016953677,0.0006908487,0.0062942365],"genre_scores_gemma":[0.27691397,0.0010160682,0.70628536,0.00058838277,0.00036120904,0.0003271759,0.0006329262,0.0005429611,0.013331904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958675,0.0011855707,0.0003784539,0.0008464444,0.0013926977,0.00032942396],"domain_scores_gemma":[0.99603397,0.0018562251,0.000239269,0.0011096718,0.0006727817,0.00008817237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004439808,0.000641686,0.00071953575,0.0012308288,0.0012556219,0.0036739907,0.0024526487,0.0009095242,0.006445293],"category_scores_gemma":[0.005611058,0.0005721415,0.0020034066,0.0012955101,0.0040269834,0.009107112,0.0030341013,0.0033807068,0.0019114983],"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.000020407673,0.000010644887,0.000038773967,0.00006155388,0.0000059087133,0.000034480097,0.00017199782,0.0013167681,0.0006245108,0.9869473,0.0006405828,0.010127067],"study_design_scores_gemma":[0.0000427031,0.000030921827,0.00006632752,0.000030752082,0.000021296286,0.00013650443,0.00006825908,0.023849228,0.0056300457,0.92764044,0.042456467,0.000027059692],"about_ca_topic_score_codex":0.001594089,"about_ca_topic_score_gemma":0.0016213161,"teacher_disagreement_score":0.006445293,"about_ca_system_score_codex":0.0022683297,"about_ca_system_score_gemma":0.0020307968,"threshold_uncertainty_score":0.023480177},"labels":[],"label_agreement":null},{"id":"W2091250089","doi":"10.4204/eptcs.139.2","title":"Automated Reasoning over Deontic Action Logics with Finite Vocabularies","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","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":"McMaster University","funders":"","keywords":"Deontic logic; Action (physics); Coherence (philosophical gambling strategy); Accessibility relation; Normal modal logic; Non-monotonic logic; Description logic; Boolean algebra; Algebra over a field","score_opus":0.006135563503916793,"score_gpt":0.2358335286004227,"score_spread":0.22969796509650592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091250089","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.111719936,0.0005193941,0.8799472,0.0011813921,0.00006144273,0.00022270506,0.0006460709,0.00083020114,0.0048716445],"genre_scores_gemma":[0.5906819,0.0005619668,0.40310028,0.00030422502,0.0001315516,0.0001812727,0.0012811394,0.00014225721,0.0036154552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461514,0.001999147,0.00047502585,0.00090100314,0.0015589377,0.00045084563],"domain_scores_gemma":[0.97862166,0.017242434,0.0012720898,0.0017464383,0.0008058136,0.00031163945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004918313,0.00080324005,0.0012377028,0.0014098154,0.0018365487,0.00556823,0.002646567,0.0012079547,0.004133175],"category_scores_gemma":[0.014384222,0.00099146,0.003038235,0.0016623844,0.0026929958,0.011174764,0.0035199262,0.0028892872,0.00041128806],"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.00033517234,0.00023743854,0.0021979853,0.00068052625,0.0002980647,0.0008245854,0.0012752112,0.18783219,0.009938775,0.7406418,0.0018344477,0.05390393],"study_design_scores_gemma":[0.00012587334,0.000052772615,0.00048271235,0.00004796271,0.000117840325,0.00013481191,0.00023299965,0.38938826,0.008304964,0.59512657,0.005942225,0.00004313271],"about_ca_topic_score_codex":0.010496682,"about_ca_topic_score_gemma":0.01727653,"teacher_disagreement_score":0.010496682,"about_ca_system_score_codex":0.004000432,"about_ca_system_score_gemma":0.0037098976,"threshold_uncertainty_score":0.029025257},"labels":[],"label_agreement":null},{"id":"W2093837890","doi":"10.1007/s11229-005-6198-x","title":"Argumentation Schemes and Enthymemes","year":2005,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Argumentation theory; Philosophy of language; Defeasible estate; Epistemology; Philosophy of science; Metaphysics; Class (philosophy); Computer science; Defeasible reasoning; Philosophy","score_opus":0.008882417552413664,"score_gpt":0.23314860182502464,"score_spread":0.22426618427261097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093837890","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.038712814,0.0067869993,0.7758278,0.013338457,0.00054344896,0.00014722018,0.0002561046,0.000387655,0.16399944],"genre_scores_gemma":[0.75502485,0.0021528166,0.21230602,0.00058373535,0.00046165488,0.0002107223,0.0004275742,0.00020513228,0.028627438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891294,0.0070756855,0.0008475738,0.0011602351,0.00140516,0.0003819158],"domain_scores_gemma":[0.9768693,0.016047511,0.0012284941,0.0037094748,0.0016074277,0.0005379335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0112704085,0.00089429267,0.0009049437,0.0033849494,0.0029971914,0.009201841,0.0024290655,0.0039915806,0.015928732],"category_scores_gemma":[0.03702288,0.00085979444,0.0011565655,0.0023005588,0.013088494,0.02362964,0.0055966773,0.0039731734,0.0018308817],"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.000017712595,0.0000066625175,0.000046965244,0.000031183306,0.000005877857,0.000028467692,0.00048190175,0.0002772426,0.0000891248,0.99365634,0.0003585121,0.0050000637],"study_design_scores_gemma":[0.000010395886,0.000003781128,0.000024451978,0.000025325868,0.000003843042,0.000030674506,0.0001253795,0.0009617622,0.00013687875,0.9945208,0.0041521275,0.0000045592624],"about_ca_topic_score_codex":0.00041305515,"about_ca_topic_score_gemma":0.0005496104,"teacher_disagreement_score":0.015928732,"about_ca_system_score_codex":0.0021955862,"about_ca_system_score_gemma":0.0009264669,"threshold_uncertainty_score":0.059604287},"labels":[],"label_agreement":null},{"id":"W2096908165","doi":"10.1109/csfw.1989.40588","title":"Obligation as the basis of integrity specification","year":2003,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Obligation; Modal logic; Computer science; Data integrity; Programming language; Operator (biology); Theoretical computer science; Modal; Computer security; Law; Political science","score_opus":0.031680056981581016,"score_gpt":0.25823887499631587,"score_spread":0.22655881801473485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096908165","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.00724995,0.0019373269,0.883235,0.011223365,0.00036195308,0.00014020359,0.00019786134,0.0005310018,0.09512335],"genre_scores_gemma":[0.5397855,0.003843421,0.41219294,0.002994354,0.0008056186,0.0006459831,0.0005877496,0.00031233905,0.038832124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411535,0.0020734884,0.00062473724,0.00080126413,0.0018397745,0.0005452788],"domain_scores_gemma":[0.9952905,0.0019466323,0.0004220009,0.0008938481,0.0012080686,0.00023887935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070533087,0.00072585396,0.0006450327,0.0021610097,0.0022234311,0.0073066815,0.00278274,0.0034841977,0.0041746744],"category_scores_gemma":[0.0084601985,0.0007168257,0.0013578566,0.0015024107,0.012405714,0.013510606,0.003269966,0.0046528084,0.0014786574],"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.000003746234,0.000004298058,0.000024433451,0.000019857704,0.0000018017138,0.000048310743,0.00020538362,0.0008589232,0.00013806093,0.9953513,0.00052623224,0.002817699],"study_design_scores_gemma":[0.000007934675,0.000017241211,0.000039378527,0.00006845459,0.0000117375075,0.000115115334,0.00014044816,0.011088211,0.0010735258,0.9568076,0.030610334,0.000019984462],"about_ca_topic_score_codex":0.0043066777,"about_ca_topic_score_gemma":0.0027904662,"teacher_disagreement_score":0.0073066815,"about_ca_system_score_codex":0.0036063143,"about_ca_system_score_gemma":0.0037097177,"threshold_uncertainty_score":0.037301958},"labels":[],"label_agreement":null},{"id":"W2098574494","doi":"10.1007/978-3-540-73580-9_31","title":"What’s Your Problem? The Problem of Problem Definition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abstraction; Process (computing); Computer science; Mathematical optimization; Mathematics; Calculus (dental); Programming language; Epistemology","score_opus":0.043297582746145445,"score_gpt":0.2620005646056397,"score_spread":0.21870298185949424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098574494","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044213952,0.024793597,0.19111966,0.7251856,0.00606793,0.00022328275,0.00038592436,0.0002720391,0.04753058],"genre_scores_gemma":[0.28510025,0.033155724,0.5242203,0.106321394,0.018306702,0.0017153467,0.0018240277,0.00086572795,0.0284906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9593924,0.028307108,0.0022210367,0.0042787767,0.0044895066,0.0013110542],"domain_scores_gemma":[0.907421,0.07008669,0.0025181423,0.0068908557,0.0102827,0.0028006227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036006354,0.0012472116,0.002938047,0.0032869596,0.00638035,0.012699245,0.0071596494,0.011198515,0.009709893],"category_scores_gemma":[0.11004454,0.0012583662,0.0024170738,0.004461818,0.035965163,0.05362212,0.008354182,0.022271328,0.0029125037],"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.000028386887,0.000046843867,0.0003261805,0.00037407124,0.000037375547,0.00008353674,0.0012615151,0.00040199692,0.000055329583,0.91505474,0.045044955,0.037285097],"study_design_scores_gemma":[0.000014082444,0.0000049486334,0.000059313676,0.00022794922,0.000007838786,0.00012346574,0.0013431188,0.000774659,0.00004628054,0.9556668,0.04171522,0.000016284233],"about_ca_topic_score_codex":0.0052484,"about_ca_topic_score_gemma":0.0031383678,"teacher_disagreement_score":0.036006354,"about_ca_system_score_codex":0.005370316,"about_ca_system_score_gemma":0.008424502,"threshold_uncertainty_score":0.19042206},"labels":[],"label_agreement":null},{"id":"W2099368613","doi":"10.48550/arxiv.1203.0699","title":"Ambiguous Language and Differences in Beliefs","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Ambiguity; Interpretation (philosophy); Semantics (computer science); Computer science; Modal logic; Modal; Mathematical economics; Artificial intelligence; Mathematics; Programming language","score_opus":0.047831075611830344,"score_gpt":0.17253225531980096,"score_spread":0.12470117970797062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099368613","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.6764661,0.002835874,0.19847083,0.018884927,0.0002006056,0.000087736276,0.00027379373,0.00017838522,0.10260167],"genre_scores_gemma":[0.9915726,0.00019656777,0.006721752,0.00036703388,0.000038465863,0.000030905067,0.00003791721,0.000018706796,0.0010161304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9848183,0.008753952,0.0009235598,0.0019430771,0.0026312117,0.00093003496],"domain_scores_gemma":[0.95238954,0.03306618,0.0051114187,0.005309502,0.0026354725,0.0014879772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011892582,0.00043226665,0.0007570613,0.0016789249,0.0017860433,0.0066030677,0.0016713731,0.0027973293,0.0044820653],"category_scores_gemma":[0.05574586,0.0006034951,0.0008017237,0.0013306824,0.011389127,0.015912887,0.006784689,0.0038172402,0.00036105321],"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.00014066549,0.000042793574,0.0017556194,0.00006280867,0.000037523907,0.00020808968,0.0040911897,0.003095273,0.0004996946,0.9799361,0.0003915253,0.00973877],"study_design_scores_gemma":[0.000024052279,0.000017647053,0.000715936,0.000023936971,0.000016195158,0.00009084709,0.0007592054,0.0036980116,0.0002265595,0.99304235,0.0013696933,0.00001561733],"about_ca_topic_score_codex":0.0013970655,"about_ca_topic_score_gemma":0.0007142502,"teacher_disagreement_score":0.011892582,"about_ca_system_score_codex":0.003101004,"about_ca_system_score_gemma":0.0012060123,"threshold_uncertainty_score":0.06289476},"labels":[],"label_agreement":null},{"id":"W2099873657","doi":"10.1109/tai.1990.130451","title":"KNOWBEL: a hybrid expert system building tool","year":2002,"lang":"en","type":"article","venue":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Knowledge base; Knowledge representation and reasoning; Expert system; Programming language; Prolog; Knowledge-based systems; Telos; Software engineering; Logic programming; Sublanguage; Legal expert system; Inference engine; Artificial intelligence; Datalog","score_opus":0.10749208777967083,"score_gpt":0.30102167037262473,"score_spread":0.19352958259295389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099873657","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.0020836804,0.00011918335,0.89129305,0.00017871842,0.000035045683,0.00014073918,0.0014562209,0.08915359,0.015539653],"genre_scores_gemma":[0.045686405,0.0003251664,0.9092923,0.0003717565,0.00003934189,0.0003765033,0.008549254,0.008403556,0.026955621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987985,0.00022757977,0.00010042683,0.00028350053,0.00050127535,0.00008876398],"domain_scores_gemma":[0.9980422,0.00089975534,0.000114438735,0.00037614274,0.0004811549,0.00008628311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016913288,0.0008905491,0.00061557867,0.0019701135,0.0005800112,0.0027364476,0.0029639842,0.001348847,0.039275695],"category_scores_gemma":[0.004432709,0.0014076226,0.0009624908,0.00077481335,0.00053115666,0.004466677,0.0024743644,0.0017861811,0.016162105],"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.00046779503,0.00026452457,0.0010558605,0.0011450617,0.00020458916,0.0006320032,0.0007586729,0.03513358,0.016017227,0.08563712,0.18546091,0.6732226],"study_design_scores_gemma":[0.00025425546,0.0001496996,0.0009315457,0.0003486826,0.00016731938,0.00105394,0.00023315799,0.37618136,0.030639024,0.1032773,0.48658744,0.00017621621],"about_ca_topic_score_codex":0.0024174259,"about_ca_topic_score_gemma":0.0055449004,"teacher_disagreement_score":0.039275695,"about_ca_system_score_codex":0.00078034,"about_ca_system_score_gemma":0.0014286954,"threshold_uncertainty_score":0.13139033},"labels":[],"label_agreement":null},{"id":"W2100078804","doi":"10.1093/logcom/exi021","title":"Expressing Default Logic Variants in Default Logic","year":2005,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"W2100272792","doi":"10.1109/icif.2003.177375","title":"Uncertainty in a situation analysis perspective","year":2003,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Perspective (graphical); Computer science; Artificial intelligence","score_opus":0.014611142875638108,"score_gpt":0.2613385321076573,"score_spread":0.24672738923201917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100272792","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.013008344,0.04651404,0.46658283,0.076658286,0.0013951225,0.000112982125,0.00033205838,0.0001761735,0.3952201],"genre_scores_gemma":[0.85486645,0.027863394,0.095051214,0.0048261867,0.0025280935,0.00034120446,0.00023168857,0.000089947236,0.014201763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916176,0.0055021467,0.00032302356,0.000591521,0.0013506325,0.0006149766],"domain_scores_gemma":[0.992424,0.0058986335,0.00043320924,0.00034159582,0.0004910611,0.00041137805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009087132,0.00139191,0.0011444804,0.004609891,0.0053154537,0.016093343,0.002137259,0.003672973,0.006334874],"category_scores_gemma":[0.00804711,0.00075318414,0.0016138993,0.0032646474,0.01898256,0.020687275,0.005754572,0.0062307157,0.00066469214],"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.000003439428,0.0000030079493,0.000037024904,0.000031926746,0.000006478065,0.000042345146,0.0006731659,0.00060668535,0.00001828614,0.9961599,0.00051923713,0.0018985099],"study_design_scores_gemma":[0.000002710544,0.0000047849403,0.000030197658,0.00006824488,0.0000054846214,0.00004293684,0.0007802817,0.000995046,0.000034609304,0.98113084,0.016898312,0.0000064887968],"about_ca_topic_score_codex":0.003822958,"about_ca_topic_score_gemma":0.0029527168,"teacher_disagreement_score":0.016093343,"about_ca_system_score_codex":0.008267124,"about_ca_system_score_gemma":0.0031821628,"threshold_uncertainty_score":0.05998242},"labels":[],"label_agreement":null},{"id":"W2100908575","doi":"10.1007/11896548_27","title":"Semantically Correct Query Answers in the Presence of Null Values","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Null (SQL); Computer science; Information retrieval; Natural language processing; Data mining","score_opus":0.013479258034750025,"score_gpt":0.2379310757544465,"score_spread":0.22445181771969647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100908575","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.031842865,0.00066185626,0.9406935,0.0046519316,0.0005061581,0.00019770113,0.0010937202,0.007918898,0.012433375],"genre_scores_gemma":[0.5843519,0.0010692264,0.39435336,0.0022763484,0.00061990344,0.00031331103,0.004082469,0.0031918404,0.009741635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96190035,0.011900235,0.003902164,0.0038505355,0.015434969,0.0030118406],"domain_scores_gemma":[0.86772346,0.08720804,0.0035232091,0.027013846,0.013708894,0.0008226145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019428775,0.0017149942,0.002976525,0.0023573157,0.0023159105,0.010346148,0.0040895357,0.006519419,0.0068557085],"category_scores_gemma":[0.12975541,0.0018671608,0.0020225921,0.0026666601,0.0065483134,0.024855189,0.009528573,0.0055449926,0.0034572738],"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.0026851979,0.000318031,0.00539616,0.0015323175,0.00028931588,0.0029785766,0.004302633,0.023581289,0.018168068,0.7476382,0.03543054,0.1576797],"study_design_scores_gemma":[0.00021286136,0.00006524944,0.00028572988,0.00018774024,0.00019277004,0.0012907549,0.00074428174,0.06531987,0.026131954,0.8869077,0.018564641,0.000096491385],"about_ca_topic_score_codex":0.0016755419,"about_ca_topic_score_gemma":0.001725079,"teacher_disagreement_score":0.019428775,"about_ca_system_score_codex":0.0017744057,"about_ca_system_score_gemma":0.0040579727,"threshold_uncertainty_score":0.10275042},"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":"W2101249878","doi":"10.1016/j.apal.2006.04.001","title":"Frege systems for extensible modal logics","year":2006,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Propositional calculus; Propositional variable; Equivalence (formal languages); Intuitionistic logic; Well-formed formula; Mathematics; Modal; Modal logic; Calculus (dental); Mathematical proof; Propositional formula; Discrete mathematics; Intermediate logic; Zeroth-order logic; Logical equivalence; Algebra over a field; Computer science; Pure mathematics; Programming language; Multimodal logic; Description logic","score_opus":0.04791883066781888,"score_gpt":0.2739468383898415,"score_spread":0.22602800772202264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101249878","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.032509156,0.002635363,0.91554475,0.0017751274,0.00032869156,0.00018896295,0.00044567345,0.0013864343,0.045185927],"genre_scores_gemma":[0.59272,0.0020521558,0.36255616,0.0009312111,0.00050664594,0.00038548996,0.0012363755,0.00053147355,0.039080545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977247,0.00068941346,0.00019011975,0.00045663325,0.0005304146,0.000408727],"domain_scores_gemma":[0.997422,0.0013531942,0.00015285204,0.0005723532,0.0003533993,0.00014615487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312236,0.0012158921,0.0013348572,0.0033701165,0.0032879643,0.0056549055,0.002692002,0.002384406,0.015045059],"category_scores_gemma":[0.0074224714,0.0012011926,0.0024117436,0.002207228,0.0040185275,0.012941726,0.006303594,0.005201523,0.0020518377],"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.000026544174,0.000013451266,0.00007845601,0.000026935866,0.000012859081,0.00004772773,0.00018211099,0.0023152295,0.00026750463,0.9873125,0.0011007376,0.008615824],"study_design_scores_gemma":[0.000009495286,0.0000052462756,0.000028697845,0.000015456822,0.00001062021,0.00002542047,0.00005513742,0.009326467,0.00019353072,0.98655975,0.0037572605,0.0000129185255],"about_ca_topic_score_codex":0.0041079996,"about_ca_topic_score_gemma":0.005977805,"teacher_disagreement_score":0.015045059,"about_ca_system_score_codex":0.0030954222,"about_ca_system_score_gemma":0.0012902442,"threshold_uncertainty_score":0.0503307},"labels":[],"label_agreement":null},{"id":"W2101995394","doi":"10.1007/978-3-540-75292-9_8","title":"A Complete and Compact Propositional Deontic Logic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Propositional variable; Zeroth-order logic; Computer science; Autoepistemic logic; Programming language; Intermediate logic; Philosophy; Linguistics; Multimodal logic; Description logic","score_opus":0.0332965171951564,"score_gpt":0.26533941998612304,"score_spread":0.23204290279096662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101995394","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.03408257,0.003051395,0.8198724,0.0026568219,0.00055972213,0.00015629765,0.001742574,0.0015331721,0.13634515],"genre_scores_gemma":[0.46414185,0.002272349,0.46080247,0.0009103797,0.00064061914,0.0002265815,0.0019891188,0.00040865576,0.06860803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926716,0.0001242983,0.0000607804,0.00017017324,0.0003092013,0.00006834532],"domain_scores_gemma":[0.99916553,0.00037844933,0.000055533965,0.00017949472,0.00016156012,0.000059483016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333689,0.0006759675,0.0007485353,0.00083406444,0.001445437,0.0036517838,0.0011970304,0.0011774208,0.009762538],"category_scores_gemma":[0.0021886493,0.00067762256,0.00080918544,0.001331939,0.0020581863,0.006308046,0.0021931233,0.0025807887,0.001958339],"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.000025969706,0.00001709165,0.000045327015,0.000060713974,0.0000062057306,0.00004164994,0.0001111571,0.0012359214,0.0008316351,0.9719663,0.0033773181,0.022280617],"study_design_scores_gemma":[0.000015957383,0.00001197896,0.0000675196,0.000019603487,0.000010886515,0.0000739535,0.000031401956,0.007100529,0.0006912876,0.96669155,0.025276577,0.000008753235],"about_ca_topic_score_codex":0.001224977,"about_ca_topic_score_gemma":0.0014324854,"teacher_disagreement_score":0.009762538,"about_ca_system_score_codex":0.0012047143,"about_ca_system_score_gemma":0.0010207313,"threshold_uncertainty_score":0.032658875},"labels":[],"label_agreement":null},{"id":"W2102812030","doi":"10.1109/ismvl.1991.130733","title":"The abnormality predicate","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Circumscription; Rotation formalisms in three dimensions; Randomness; Predicate (mathematical logic); Computer science; Non-monotonic logic; Abnormality; Class (philosophy); Decidability; Artificial intelligence; Theoretical computer science; Mathematics; Programming language; Psychology","score_opus":0.021013678198789156,"score_gpt":0.21114604478294627,"score_spread":0.1901323665841571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102812030","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.040071372,0.0021597818,0.6732595,0.028637934,0.0016438229,0.00038721942,0.0025485947,0.004686238,0.24660552],"genre_scores_gemma":[0.8269059,0.0018073559,0.12448789,0.00652643,0.0016681438,0.00061335455,0.0025400205,0.001284119,0.034166783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937972,0.001657953,0.0005037781,0.0015015191,0.0017217605,0.00081786775],"domain_scores_gemma":[0.988456,0.00728663,0.0009165974,0.0016925136,0.0012209862,0.00042721108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053987056,0.00076938496,0.0010855297,0.0019579653,0.003792034,0.005024179,0.0021161635,0.0034702949,0.013316537],"category_scores_gemma":[0.015226842,0.000727131,0.0015998497,0.0023793706,0.0098117255,0.017501233,0.00605625,0.00556678,0.003269057],"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.000045291537,0.000009106752,0.00033892933,0.000031157255,0.000005832169,0.00011871381,0.00025736037,0.0002809917,0.00033712893,0.987056,0.003886176,0.007633325],"study_design_scores_gemma":[0.000033312554,0.000045857872,0.00041579563,0.00005393884,0.000039074228,0.00068847876,0.00028672355,0.004739824,0.0032871808,0.855006,0.13535365,0.000050219405],"about_ca_topic_score_codex":0.0021785435,"about_ca_topic_score_gemma":0.0011894312,"teacher_disagreement_score":0.013316537,"about_ca_system_score_codex":0.0026939053,"about_ca_system_score_gemma":0.0023772267,"threshold_uncertainty_score":0.044548273},"labels":[],"label_agreement":null},{"id":"W2103168978","doi":"","title":"Logic, modality, and philosophy of mathematics","year":2000,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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":"Quine; Philosophy; Epistemology; Philosophical logic; Philosophy of mathematics; Mathematical logic; Analytic philosophy; Argument (complex analysis); Foundations of mathematics; Metaphysics; Surprise; Mathematics; Contemporary philosophy; Sociology; Algorithm","score_opus":0.026925534405359955,"score_gpt":0.24765243336507903,"score_spread":0.2207268989597191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103168978","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.009815783,0.28690386,0.01840448,0.22700486,0.003881137,0.000034396508,0.00020432667,0.000122238,0.4536289],"genre_scores_gemma":[0.8161882,0.075981304,0.008862578,0.03300249,0.0078117982,0.00022571142,0.00013619613,0.00011486947,0.057676915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971992,0.00178787,0.00012620908,0.00026973203,0.0004929335,0.00012404106],"domain_scores_gemma":[0.99721295,0.0019314972,0.0001407409,0.0002649622,0.0003394388,0.00011047848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031880355,0.0005249798,0.0006418579,0.0021342908,0.0033323509,0.007093765,0.0010344761,0.0030931586,0.004426299],"category_scores_gemma":[0.0054175677,0.00031729817,0.00046620035,0.0019408958,0.028726242,0.009285701,0.002910757,0.0060058953,0.0008022693],"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.00000486265,0.0000021926398,0.00002477865,0.000026222011,0.0000022277466,0.000011550847,0.00075937225,0.000056000234,0.000024365152,0.99033177,0.00612026,0.002636429],"study_design_scores_gemma":[0.000007705208,0.0000055021706,0.00011688951,0.00008020578,0.000001894592,0.000032202486,0.00034601477,0.00009460388,0.000023303845,0.91109663,0.088190824,0.0000041999456],"about_ca_topic_score_codex":0.0050641,"about_ca_topic_score_gemma":0.00464651,"teacher_disagreement_score":0.007093765,"about_ca_system_score_codex":0.006593681,"about_ca_system_score_gemma":0.0035290816,"threshold_uncertainty_score":0.047840655},"labels":[],"label_agreement":null},{"id":"W2104606980","doi":"10.1016/j.tcs.2011.10.026","title":"The loop formula based semantics of description logic programs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stable model semantics; Answer set programming; Well-founded semantics; Logic programming; Semantics (computer science); Classical logic; Theoretical computer science; Programming language; Computer science; Operational semantics; Mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Algorithm; Denotational semantics; Pure mathematics","score_opus":0.0374375417248961,"score_gpt":0.24258265929032496,"score_spread":0.20514511756542886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104606980","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.026843244,0.00052258815,0.9551336,0.0017152213,0.000120977726,0.00010825402,0.0005425598,0.0011886153,0.013824968],"genre_scores_gemma":[0.7304053,0.00064838456,0.25838917,0.0007854587,0.00024066101,0.0002831359,0.00096336775,0.00043522715,0.007849312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807656,0.0006519445,0.00017763236,0.000291032,0.00057964853,0.00022309515],"domain_scores_gemma":[0.99651766,0.001890188,0.0002267318,0.000578192,0.00059704325,0.00019015577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025248816,0.0005442249,0.00064540404,0.0015132395,0.0009245895,0.0041213487,0.0020920138,0.0014505956,0.0049760025],"category_scores_gemma":[0.0065328805,0.0005136208,0.0012260531,0.0012772463,0.0030428374,0.009513984,0.0022354077,0.0026156476,0.00073399383],"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.00006202925,0.000023137382,0.000116707735,0.00006184909,0.000009525375,0.000046063527,0.000256848,0.0025310817,0.0010100323,0.9817708,0.0007531726,0.013358588],"study_design_scores_gemma":[0.000038281134,0.000025118146,0.000055971832,0.000027185624,0.000025316045,0.00004291088,0.000059736238,0.023943061,0.0016488475,0.96811265,0.0060061878,0.000014655953],"about_ca_topic_score_codex":0.0016747739,"about_ca_topic_score_gemma":0.0011977763,"teacher_disagreement_score":0.0049760025,"about_ca_system_score_codex":0.001660177,"about_ca_system_score_gemma":0.0015087345,"threshold_uncertainty_score":0.016646385},"labels":[],"label_agreement":null},{"id":"W2106637261","doi":"10.48550/arxiv.1404.7541","title":"An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Equivalence (formal languages); Forgetting; Logical equivalence; Computer science; Programming language; Stable model semantics; Mathematics; Theoretical computer science; Algebra over a field; Arithmetic; Discrete mathematics; Pure mathematics; Linguistics; Philosophy; Description logic; Multimodal logic","score_opus":0.1387383248776635,"score_gpt":0.22379951085715413,"score_spread":0.08506118597949064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106637261","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.021485412,0.00019516471,0.97185296,0.00043713965,0.00006116366,0.00009739273,0.0001056252,0.0022101132,0.0035550608],"genre_scores_gemma":[0.33797318,0.00031400472,0.65415484,0.0008220132,0.00020489795,0.00017007026,0.0004999382,0.00091039744,0.00495068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943879,0.0009714143,0.00047237423,0.0013064556,0.0022733656,0.00058844744],"domain_scores_gemma":[0.98683816,0.0052091153,0.0005382018,0.0058578947,0.0012404587,0.00031609365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004825085,0.00079174497,0.0009793689,0.0013672047,0.0010478871,0.0026426204,0.004150022,0.0012553368,0.0039389995],"category_scores_gemma":[0.014311595,0.0008972085,0.0026933942,0.0015081627,0.0043661883,0.00852031,0.006172536,0.005371475,0.000609019],"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.00036416328,0.0002571217,0.0019657,0.0005481881,0.0001352111,0.00058511854,0.0018754522,0.031723842,0.016874176,0.7049144,0.0025798073,0.23817687],"study_design_scores_gemma":[0.00007119475,0.00018676263,0.0004121546,0.00009261659,0.00020305476,0.000500126,0.00019235935,0.10514541,0.034140483,0.837677,0.021317592,0.000061378036],"about_ca_topic_score_codex":0.0013678448,"about_ca_topic_score_gemma":0.0014918618,"teacher_disagreement_score":0.004825085,"about_ca_system_score_codex":0.0013033851,"about_ca_system_score_gemma":0.0015252794,"threshold_uncertainty_score":0.025517821},"labels":[],"label_agreement":null},{"id":"W2106767395","doi":"10.1109/icdcsw.2010.31","title":"Temporal Reasoning about Resources for Deadline Assurance in Distributed Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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 Saskatchewan","funders":"","keywords":"Computer science; Scalability; Distributed computing; Computation; Syntax; Resource (disambiguation); Semantics (computer science); Key (lock); Theoretical computer science; Programming language; Database; Computer security; Computer network; Artificial intelligence","score_opus":0.011161303295997358,"score_gpt":0.2480832108003184,"score_spread":0.23692190750432104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106767395","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.017338093,0.00073082745,0.97321826,0.0014983825,0.00011931033,0.00014054331,0.0003990186,0.0008079176,0.0057476875],"genre_scores_gemma":[0.5087438,0.0011320703,0.4850803,0.0006401522,0.00029629018,0.0003950255,0.00085992675,0.00019595242,0.0026565348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936052,0.00261962,0.00071110827,0.0008738468,0.0016440689,0.0005461204],"domain_scores_gemma":[0.98436487,0.01200233,0.0011542178,0.0009921112,0.0010883478,0.0003981168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082081985,0.0011977546,0.0010286572,0.0025437037,0.0019714874,0.0055574225,0.002656308,0.0018433769,0.0033475095],"category_scores_gemma":[0.026934367,0.0009432494,0.0022079109,0.0024610853,0.004326325,0.012271882,0.0034487592,0.0034518563,0.0005361895],"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.00029976573,0.00007404122,0.00091590494,0.0003106689,0.000086338456,0.0006850156,0.00081564236,0.1356679,0.0022909325,0.8259038,0.003016549,0.029933417],"study_design_scores_gemma":[0.00007350615,0.00003197134,0.000099172794,0.00007453421,0.000058378733,0.00012610313,0.00017081208,0.39041892,0.002094947,0.60103816,0.0057792226,0.0000342014],"about_ca_topic_score_codex":0.011774225,"about_ca_topic_score_gemma":0.008982096,"teacher_disagreement_score":0.011774225,"about_ca_system_score_codex":0.004257691,"about_ca_system_score_gemma":0.0031518599,"threshold_uncertainty_score":0.043409646},"labels":[],"label_agreement":null},{"id":"W2108489993","doi":"10.1016/j.tcs.2007.02.059","title":"Recursively defined metric spaces without contraction","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric space; Bounded function; Metric (unit); Fixed point; Contraction (grammar); Probabilistic logic; Banach space; Discrete mathematics; Contraction mapping; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.012316706694448192,"score_gpt":0.2644182511156446,"score_spread":0.2521015444211964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108489993","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.057143748,0.0013251951,0.89525145,0.001362943,0.00020643226,0.000077982506,0.00027445392,0.00039814244,0.043959558],"genre_scores_gemma":[0.5920309,0.0010175166,0.37688333,0.0007432003,0.00021807707,0.00030960992,0.0007942759,0.00042104823,0.027582001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953616,0.0015948939,0.0003910081,0.0011049209,0.0011617853,0.00038586807],"domain_scores_gemma":[0.9938933,0.0028517435,0.00035333112,0.0013506887,0.0010415618,0.0005093308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003108308,0.0009271027,0.0011465919,0.0019136666,0.001560014,0.003673062,0.0023459417,0.0019541301,0.006241839],"category_scores_gemma":[0.0111461,0.0007450233,0.0017139348,0.0015047723,0.004783294,0.014067767,0.006593222,0.0061338553,0.0014401829],"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.000008983033,0.00000539444,0.0000502873,0.000014531012,0.000003303731,0.000025183186,0.00011877632,0.000331806,0.00031522888,0.9953366,0.0002663978,0.0035236122],"study_design_scores_gemma":[0.000009303274,0.00001586911,0.00006546985,0.000012248788,0.000006733574,0.00010087746,0.00005635582,0.0054112864,0.000685027,0.98904735,0.004578477,0.00001091617],"about_ca_topic_score_codex":0.00097255176,"about_ca_topic_score_gemma":0.0011455581,"teacher_disagreement_score":0.006241839,"about_ca_system_score_codex":0.0021693406,"about_ca_system_score_gemma":0.0012835322,"threshold_uncertainty_score":0.020880997},"labels":[],"label_agreement":null},{"id":"W2109468254","doi":"10.1109/tkde.2012.86","title":"Achieving Data Privacy through Secrecy Views and Null-Based Virtual Updates","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Wien","keywords":"Computer science; Null (SQL); Secrecy; Tuple; SQL; Semantics (computer science); Relational database; Information retrieval; Theoretical computer science; Database; Data mining; Programming language; Computer security; Mathematics","score_opus":0.06739210014020883,"score_gpt":0.3002273917608937,"score_spread":0.23283529162068486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109468254","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.0313521,0.00021180348,0.96119785,0.0011091783,0.00005680165,0.000091983275,0.00021143758,0.00076976995,0.0049991366],"genre_scores_gemma":[0.7206561,0.00066486845,0.27115008,0.0008319452,0.00026005507,0.0002869899,0.0005196398,0.00040636412,0.00522398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881644,0.004122072,0.00125864,0.0014397785,0.0039908946,0.0010241896],"domain_scores_gemma":[0.9814098,0.0068253223,0.0014938244,0.007600015,0.00213544,0.0005356278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009718719,0.00083607,0.0010113115,0.0014062611,0.0017496953,0.007988882,0.0025749332,0.0014013074,0.00158052],"category_scores_gemma":[0.018868024,0.0009864589,0.0022047153,0.0017672098,0.0075632622,0.01994334,0.0089445505,0.0037897862,0.0005160403],"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.00017340161,0.000055964338,0.00085219496,0.0000658881,0.000036993024,0.0001915758,0.0009607816,0.008203553,0.0032237873,0.96825904,0.0011598718,0.016816849],"study_design_scores_gemma":[0.00006318793,0.00009548402,0.00016438354,0.00004316586,0.00008854787,0.000314434,0.00032229177,0.07279181,0.015763117,0.90107757,0.009224696,0.00005132245],"about_ca_topic_score_codex":0.0017548867,"about_ca_topic_score_gemma":0.0014913866,"teacher_disagreement_score":0.009718719,"about_ca_system_score_codex":0.0014588826,"about_ca_system_score_gemma":0.0029788695,"threshold_uncertainty_score":0.0513981},"labels":[],"label_agreement":null},{"id":"W2110595279","doi":"10.1109/dasfaa.2001.916372","title":"A logical foundation for deductive object-oriented databases","year":2001,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Carleton University; University of Regina","funders":"","keywords":"Computer science; Programming language; Deductive database; Syntax; Semantics (computer science); Inheritance (genetic algorithm); Well-founded semantics; Class (philosophy); Object (grammar); Logic programming; Database; Operational semantics; Natural language processing; Artificial intelligence; Denotational semantics","score_opus":0.05026735854825105,"score_gpt":0.30626079656808325,"score_spread":0.2559934380198322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110595279","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.0045036688,0.0034937132,0.96846604,0.0059094266,0.00039912853,0.00018372697,0.00030517596,0.00061239727,0.01612679],"genre_scores_gemma":[0.16548476,0.0062631695,0.8118714,0.004502413,0.0015422625,0.00066942535,0.0009924873,0.0003060855,0.008367961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994609,0.0012821974,0.00073641853,0.00078150164,0.0022322906,0.00035865945],"domain_scores_gemma":[0.9927624,0.0036666144,0.00057328754,0.00089278247,0.0017056017,0.00039928462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008281218,0.00073122705,0.0009513184,0.0032219943,0.0030618473,0.009564313,0.0030876745,0.0028054095,0.004177203],"category_scores_gemma":[0.011789226,0.0012942306,0.0021934093,0.00287125,0.010447906,0.018411722,0.0044379197,0.0059061227,0.0018698703],"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.0000043899117,0.000019087027,0.000058501966,0.00005063121,0.000005662561,0.00007498502,0.00024868018,0.0005597263,0.00019108875,0.9928846,0.0010270324,0.004875578],"study_design_scores_gemma":[0.000016901695,0.00001339321,0.00004386986,0.000056995967,0.000009155203,0.00009174121,0.00007413753,0.0039543863,0.00035109694,0.967888,0.027487127,0.000013182399],"about_ca_topic_score_codex":0.0025248865,"about_ca_topic_score_gemma":0.0014780486,"teacher_disagreement_score":0.009564313,"about_ca_system_score_codex":0.003007651,"about_ca_system_score_gemma":0.0035500994,"threshold_uncertainty_score":0.043795764},"labels":[],"label_agreement":null},{"id":"W2110616577","doi":"10.1016/j.jal.2004.07.023","title":"Deductive databases for computing certain and consistent answers from mediated data integration systems","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Datalog; Deductive database; Computer science; Conjunctive query; Semantics (computer science); Data integrity; Class (philosophy); Theoretical computer science; Database theory; Operator (biology); Database; Programming language; Database design; Artificial intelligence; Relational database","score_opus":0.07065628126672241,"score_gpt":0.2913610897038004,"score_spread":0.22070480843707801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110616577","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.0427663,0.0010857636,0.94868463,0.0004655797,0.00006977956,0.00032455943,0.00081969035,0.0030860757,0.002697599],"genre_scores_gemma":[0.37321004,0.00054311164,0.6221821,0.00023391945,0.00008979641,0.0003788279,0.0018765357,0.00016306619,0.0013226065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916078,0.0022941022,0.0010343983,0.0011166442,0.0035432656,0.00040377583],"domain_scores_gemma":[0.9826514,0.010539172,0.00076864276,0.0038246838,0.0018981016,0.00031796994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007404847,0.0008320501,0.0018273757,0.004264815,0.001724964,0.008285174,0.0049455543,0.0025199892,0.0047515817],"category_scores_gemma":[0.036620077,0.001071372,0.0019020992,0.004411177,0.002660709,0.009446743,0.0042421655,0.002658049,0.0013532471],"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.0014248688,0.00051876524,0.0065326584,0.0011934695,0.0005437046,0.0008758294,0.0022037947,0.09158253,0.0067408825,0.43591687,0.0072466265,0.44522002],"study_design_scores_gemma":[0.00014913135,0.00013770026,0.0008023874,0.00011468284,0.00033955235,0.00033154277,0.0005256192,0.55940276,0.0112807425,0.4212574,0.0055782474,0.00008021177],"about_ca_topic_score_codex":0.0037066578,"about_ca_topic_score_gemma":0.0058434387,"teacher_disagreement_score":0.008285174,"about_ca_system_score_codex":0.0019839108,"about_ca_system_score_gemma":0.0023723082,"threshold_uncertainty_score":0.039161026},"labels":[],"label_agreement":null},{"id":"W2110717496","doi":"10.1017/s1471068410000268","title":"Loop formulas for description logic programs","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"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 Alberta","funders":"","keywords":"Answer set programming; Computer science; Stable model semantics; Logic programming; Formalism (music); Semantics (computer science); Theoretical computer science; Description logic; Set (abstract data type); Property (philosophy); Programming language; Classical logic; Algebra over a field; Operational semantics; Mathematics; Pure mathematics","score_opus":0.04084231505699853,"score_gpt":0.30553718113804595,"score_spread":0.2646948660810474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110717496","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.056028996,0.0006398982,0.9155968,0.002364027,0.00013933408,0.00022850014,0.0006171387,0.0016679462,0.022717336],"genre_scores_gemma":[0.7733301,0.0005563164,0.21720627,0.0009451765,0.00021951014,0.0005711138,0.0012868309,0.00031757334,0.0055671316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521095,0.0016676462,0.00035562454,0.0006797199,0.0015959479,0.00049013935],"domain_scores_gemma":[0.9896219,0.0064232983,0.0005652858,0.00085816684,0.0021239144,0.00040731538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038965011,0.00066695176,0.00074045453,0.0021889752,0.001056,0.003986736,0.0014388168,0.0013792036,0.0048700324],"category_scores_gemma":[0.014496131,0.0005262172,0.0016135107,0.0014428446,0.004867505,0.008253043,0.0037038112,0.0033172623,0.0005016422],"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.000027218874,0.000025666906,0.0002384889,0.000050389033,0.000008770056,0.00007583727,0.00035124566,0.0033055188,0.0003763543,0.9878848,0.0006958612,0.0069598],"study_design_scores_gemma":[0.000028051938,0.000016279528,0.00006263023,0.000028876346,0.000014160203,0.00004219042,0.000084291125,0.042746995,0.0010142407,0.9506028,0.0053461073,0.000013317359],"about_ca_topic_score_codex":0.0036584886,"about_ca_topic_score_gemma":0.0021919466,"teacher_disagreement_score":0.0048700324,"about_ca_system_score_codex":0.002932349,"about_ca_system_score_gemma":0.0017859506,"threshold_uncertainty_score":0.021275818},"labels":[],"label_agreement":null},{"id":"W2111035999","doi":"10.1017/s0012217314000730","title":"Natural Deduction: An Introduction to Logic with Real Arguments, a Little History, and Some HumourRICHARD T.W. ARTHUR Peterborough: Broadview Press, 2011; 452 pp.; $44.95 (paperback)","year":2014,"lang":"en","type":"article","venue":"Dialogue","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":"Simon Fraser University","funders":"","keywords":"Law and economics; Mathematical economics; History; Mathematics; Sociology","score_opus":0.014556617794908334,"score_gpt":0.22301766433850123,"score_spread":0.2084610465435929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111035999","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004442431,0.74750906,0.03145653,0.04075532,0.0115098525,0.00007783886,0.00027416032,0.00071801106,0.16725495],"genre_scores_gemma":[0.02132138,0.5320687,0.042176675,0.02630054,0.028911084,0.0003805235,0.0008594231,0.000984275,0.34699738],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970907,0.0010873922,0.00018585799,0.00035651788,0.0010978781,0.00018158775],"domain_scores_gemma":[0.9963301,0.002554469,0.00016092675,0.00020227401,0.0005013276,0.00025090188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003410101,0.0015947942,0.0013907923,0.0032319112,0.0018552461,0.0067212386,0.0015953493,0.0032718442,0.0388312],"category_scores_gemma":[0.004146389,0.0012992102,0.0012719393,0.0039817104,0.007884025,0.014052616,0.0027594615,0.009819131,0.023125166],"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.000062906074,0.00006562491,0.00011030667,0.0011273917,0.000027014932,0.0001350806,0.0010607082,0.0003880626,0.0006041705,0.16748668,0.62624997,0.20268208],"study_design_scores_gemma":[0.000008197351,0.000015832757,0.0001350701,0.0005952671,0.000004613856,0.00017728609,0.00016398799,0.00010883629,0.00008423839,0.08214671,0.9165444,0.000015616857],"about_ca_topic_score_codex":0.0025555391,"about_ca_topic_score_gemma":0.0036541389,"teacher_disagreement_score":0.0388312,"about_ca_system_score_codex":0.0041377037,"about_ca_system_score_gemma":0.0030608822,"threshold_uncertainty_score":0.12990332},"labels":[],"label_agreement":null},{"id":"W2111570599","doi":"10.1016/j.ijar.2008.03.005","title":"An anytime deduction algorithm for the probabilistic logic and entailment problems","year":2008,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Probabilistic logic; Logical consequence; Probabilistic argumentation; Consistency (knowledge bases); Range (aeronautics); Set (abstract data type); Computer science; Algorithm; Probabilistic CTL; Mathematics; Artificial intelligence; Probabilistic analysis of algorithms; Theoretical computer science; Programming language","score_opus":0.025118576528918378,"score_gpt":0.2758985520497831,"score_spread":0.25077997552086473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111570599","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.006810712,0.00028619528,0.98782504,0.0004824951,0.000092774724,0.00008798994,0.00014619823,0.0011427664,0.003125817],"genre_scores_gemma":[0.08623619,0.0002082943,0.9094596,0.00025510797,0.0001288209,0.00009997778,0.00048167972,0.00022884793,0.0029014975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977054,0.00049932575,0.00022214043,0.0006431148,0.0007344472,0.00019555182],"domain_scores_gemma":[0.99460226,0.0035263353,0.00020829361,0.00085147173,0.00060011016,0.00021155822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029055108,0.0011132164,0.0016389287,0.0015216788,0.0018316227,0.0035686009,0.0045549655,0.0023260035,0.009423204],"category_scores_gemma":[0.011337685,0.000885073,0.002415745,0.0019963384,0.0014286267,0.0077748722,0.0044792728,0.004607704,0.0016162205],"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.0005976475,0.0005227082,0.0010067202,0.00051556807,0.00016355036,0.00024729277,0.00043029038,0.053395137,0.0042423876,0.32754326,0.011882649,0.59945285],"study_design_scores_gemma":[0.00018382778,0.0000780271,0.00021511741,0.000047065092,0.00013727671,0.00022829919,0.00009308594,0.43911588,0.0040451395,0.5486999,0.0071183117,0.00003804453],"about_ca_topic_score_codex":0.0025665164,"about_ca_topic_score_gemma":0.0054988153,"teacher_disagreement_score":0.009423204,"about_ca_system_score_codex":0.0020545286,"about_ca_system_score_gemma":0.0029616416,"threshold_uncertainty_score":0.031523705},"labels":[],"label_agreement":null},{"id":"W2112527940","doi":"10.1007/978-3-540-88636-5_65","title":"On the Definition of Essential and Contingent Properties of Subjective Belief Bases","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Belief revision; Belief structure; Generalization; Probabilistic logic; Computer science; Subjective logic; Knowledge base; Base (topology); Artificial intelligence; Mathematics; Epistemology; Philosophy","score_opus":0.026405093118350466,"score_gpt":0.21442909301677707,"score_spread":0.1880239998984266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112527940","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.024854692,0.0035741986,0.9005082,0.0043791807,0.00038865066,0.00014711462,0.0006763292,0.00016657701,0.065305024],"genre_scores_gemma":[0.64993405,0.0029807042,0.33362737,0.0014124714,0.0009942154,0.0007348387,0.0009457317,0.00020988467,0.009160657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958008,0.0018239326,0.0005513583,0.00064503733,0.00090745365,0.00027136592],"domain_scores_gemma":[0.98005074,0.014617996,0.00087900064,0.0020542564,0.0018171183,0.0005809047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01005776,0.0009999413,0.0014930427,0.00277027,0.0019167135,0.005976445,0.0026222926,0.0027458784,0.005974522],"category_scores_gemma":[0.022170113,0.001442221,0.002368322,0.0027982313,0.010819985,0.019031398,0.0041846377,0.008026673,0.0006278286],"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.000006983574,0.0000047226686,0.000039859435,0.000018539968,0.00000624005,0.000014120533,0.00011633609,0.00030672117,0.00009610719,0.9974717,0.00021709519,0.0017015722],"study_design_scores_gemma":[0.0000047402264,0.0000055086684,0.00007681936,0.000022199383,0.000006082544,0.000031187847,0.000028797207,0.0023189962,0.00007426667,0.9961171,0.0013077311,0.0000065847375],"about_ca_topic_score_codex":0.0013453439,"about_ca_topic_score_gemma":0.0012904562,"teacher_disagreement_score":0.01005776,"about_ca_system_score_codex":0.0027207008,"about_ca_system_score_gemma":0.001304944,"threshold_uncertainty_score":0.053191185},"labels":[],"label_agreement":null},{"id":"W2113835981","doi":"10.1017/s1471068413000355","title":"Disjunctive logic programs with existential quantification in rule heads","year":2013,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","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":"University of Alberta","funders":"","keywords":"Decidability; Undecidable problem; Computer science; Stable model semantics; Existentialism; Programming language; Fragment (logic); Extension (predicate logic); Theoretical computer science; Semantics (computer science); Operational semantics; Epistemology","score_opus":0.03106231653637484,"score_gpt":0.2877385025871762,"score_spread":0.25667618605080134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113835981","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.1938504,0.00026228424,0.78274244,0.0021248448,0.00007964658,0.00025588853,0.00036914073,0.0012310835,0.019084228],"genre_scores_gemma":[0.8491761,0.00027306273,0.14459574,0.00042259763,0.00007485951,0.00018349076,0.0002931679,0.00013913217,0.004841787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975968,0.0008388922,0.00014974928,0.00042888196,0.0006496195,0.00033603958],"domain_scores_gemma":[0.9945569,0.0038108754,0.000394717,0.00044576084,0.0005686441,0.00022311512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238084,0.0005593296,0.00057414005,0.0010954557,0.0008744036,0.0031261873,0.0015363188,0.00085979595,0.0029824702],"category_scores_gemma":[0.0072603542,0.0005230984,0.0012552196,0.0010187522,0.0044208206,0.00654555,0.0023987999,0.0021828827,0.00030651738],"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.00011929216,0.00010761373,0.0011196611,0.000121662844,0.000040713687,0.000504487,0.0010662476,0.030739011,0.0039648274,0.94511807,0.00076446036,0.016333848],"study_design_scores_gemma":[0.00007257291,0.00007841512,0.00029517172,0.00006275549,0.00008810297,0.00014755806,0.00031349182,0.19810951,0.009150623,0.7839704,0.0076733287,0.000038111946],"about_ca_topic_score_codex":0.0036993392,"about_ca_topic_score_gemma":0.0035685282,"teacher_disagreement_score":0.004238084,"about_ca_system_score_codex":0.0021479535,"about_ca_system_score_gemma":0.0018661504,"threshold_uncertainty_score":0.022413373},"labels":[],"label_agreement":null},{"id":"W2114078774","doi":"10.1007/978-3-540-78499-9_7","title":"A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Dalhousie University","funders":"","keywords":"Linear logic; Monad (category theory); Lambda calculus; Mathematics; Simply typed lambda calculus; Operator (biology); Algebra over a field; Categorical variable; Calculus (dental); Typed lambda calculus; Discrete mathematics; Pure mathematics; Functor","score_opus":0.023988883625357695,"score_gpt":0.27258825112380214,"score_spread":0.24859936749844444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114078774","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.009068119,0.00056654343,0.9489135,0.001936303,0.00020510195,0.0000945331,0.00034638558,0.0011266589,0.0377429],"genre_scores_gemma":[0.512195,0.00085914246,0.41742676,0.0013510828,0.0005352686,0.000550501,0.0008059713,0.0007793206,0.06549687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894506,0.00026882175,0.00006672945,0.00022322286,0.00031745556,0.00017870605],"domain_scores_gemma":[0.9992537,0.00030502072,0.000055566783,0.0001631676,0.00013726782,0.00008531213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328494,0.0008679839,0.00082063675,0.00066339696,0.0019022216,0.0062929373,0.003269001,0.0021722275,0.011996917],"category_scores_gemma":[0.0017549753,0.0010089335,0.00218052,0.0012773758,0.0049046865,0.0068097464,0.0026128239,0.004567861,0.0029974151],"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.0000128258835,0.000017537408,0.000034997018,0.000026873835,0.0000037601694,0.000043695487,0.00013407158,0.002131525,0.0004287634,0.99445504,0.00076909154,0.001941879],"study_design_scores_gemma":[0.000020697256,0.0000131984025,0.000038115995,0.00001607722,0.000012561066,0.0000408831,0.000038022725,0.024032624,0.00060634135,0.96709096,0.008076386,0.000014144055],"about_ca_topic_score_codex":0.0048013236,"about_ca_topic_score_gemma":0.0048220456,"teacher_disagreement_score":0.011996917,"about_ca_system_score_codex":0.0028106235,"about_ca_system_score_gemma":0.0020955577,"threshold_uncertainty_score":0.040133715},"labels":[],"label_agreement":null},{"id":"W2114587893","doi":"10.1109/sccc.2005.1587860","title":"Optimizing Repair Programs for Consistent Query Answering","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Query language; Query optimization; Semantics (computer science); Data integrity; Logic programming; Database; Computation; Theoretical computer science; Programming language; Deductive database; Information retrieval","score_opus":0.022662002560906398,"score_gpt":0.2386941877532323,"score_spread":0.21603218519232592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114587893","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.1580486,0.00022242291,0.8351686,0.00046013444,0.000016075364,0.00014044288,0.00016009707,0.0028204306,0.002963236],"genre_scores_gemma":[0.5875628,0.00019011811,0.40881944,0.00016692925,0.000018177954,0.00025791858,0.00046850144,0.00055912277,0.0019570095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740463,0.00075051363,0.00017087524,0.00043469795,0.00092372874,0.0003155301],"domain_scores_gemma":[0.99576545,0.002906433,0.00031170965,0.0005534317,0.00038183306,0.00008110444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024041634,0.00057991006,0.0007870649,0.00075539335,0.0005450093,0.0020193867,0.0014132559,0.00086835615,0.0017630886],"category_scores_gemma":[0.009166348,0.00064738374,0.0008404184,0.0010963007,0.0014822128,0.003252388,0.001906113,0.001574969,0.00022199897],"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.0007496749,0.0005145306,0.0037990755,0.0004237312,0.00010303348,0.00025123096,0.0008536308,0.5353286,0.03187049,0.1937257,0.004308761,0.22807147],"study_design_scores_gemma":[0.00007320677,0.00010296643,0.00028694843,0.000016818893,0.000048122893,0.00006267975,0.00018478805,0.8970022,0.014091315,0.0861476,0.0019642129,0.000019102974],"about_ca_topic_score_codex":0.0038218158,"about_ca_topic_score_gemma":0.005309807,"teacher_disagreement_score":0.0038218158,"about_ca_system_score_codex":0.0018516028,"about_ca_system_score_gemma":0.0017020985,"threshold_uncertainty_score":0.01343441},"labels":[],"label_agreement":null},{"id":"W2115895293","doi":"10.1017/s1471068406002729","title":"Temporal phylogenetic networks and logic programming","year":2006,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Austrian Science Fund; National Science Foundation","keywords":"Computer science; Phylogenetic tree; Logic programming; Constraint (computer-aided design); Set (abstract data type); Programming language; Theoretical computer science; Artificial intelligence; Mathematics; Biology","score_opus":0.01761395012785124,"score_gpt":0.27116941309205317,"score_spread":0.25355546296420195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115895293","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.014577423,0.004523342,0.936541,0.01032439,0.00021851427,0.00008408126,0.00052679697,0.00054484606,0.03265953],"genre_scores_gemma":[0.46560413,0.005197458,0.51258713,0.0022388552,0.0007591344,0.0005089678,0.0009022694,0.00018744415,0.01201468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975448,0.0011975954,0.0001433418,0.0005331443,0.0003870269,0.00019400063],"domain_scores_gemma":[0.99338406,0.005376006,0.00043074993,0.00029934698,0.00030673054,0.0002031939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003567516,0.0007687862,0.0007720565,0.0018784486,0.0016674673,0.004535636,0.0019485599,0.0016882408,0.0064469506],"category_scores_gemma":[0.008776014,0.00047453932,0.0016152851,0.0031401243,0.0056637176,0.008002441,0.002325626,0.0034849523,0.0007072844],"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.000011989067,0.000009670084,0.00012550861,0.00005786672,0.000015248954,0.000040155686,0.00009461128,0.009930689,0.00006098552,0.97904074,0.0010132279,0.0095993625],"study_design_scores_gemma":[0.0000048531665,0.0000026281784,0.00002442974,0.000011411768,0.0000041700596,0.000017331342,0.000020119844,0.02064453,0.000038324524,0.9768693,0.002358819,0.000004053441],"about_ca_topic_score_codex":0.006742198,"about_ca_topic_score_gemma":0.004509007,"teacher_disagreement_score":0.006742198,"about_ca_system_score_codex":0.0050124717,"about_ca_system_score_gemma":0.0019176542,"threshold_uncertainty_score":0.03636819},"labels":[],"label_agreement":null},{"id":"W2116816400","doi":"10.1613/jair.3132","title":"Iterated Belief Change Due to Actions and Observations","year":2011,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","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; British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Iterated function; Rationality; Action (physics); Computer science; Set (abstract data type); Class (philosophy); Artificial intelligence; Epistemology; Cognitive psychology; Psychology; Mathematics","score_opus":0.6200459931118603,"score_gpt":0.4382108662719989,"score_spread":0.18183512683986136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116816400","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.12660308,0.0003472233,0.8620867,0.0012013835,0.00009216568,0.00012592041,0.00011798292,0.0005209127,0.008904617],"genre_scores_gemma":[0.88917106,0.00017274021,0.107621916,0.00019974183,0.000068091475,0.00010239371,0.00008116611,0.00005274714,0.002530144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99400663,0.0020632101,0.0003537843,0.0012902075,0.0017819736,0.000504138],"domain_scores_gemma":[0.97084695,0.020853443,0.0027380597,0.00309331,0.0018129495,0.00065525254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069193165,0.00062391226,0.000600638,0.0012068518,0.0008418285,0.0029355462,0.0016035166,0.0015661571,0.0026029674],"category_scores_gemma":[0.033132,0.00056306855,0.0016670846,0.00064114196,0.004833991,0.006638172,0.0024525286,0.0026594035,0.00019099428],"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.00057373126,0.00016122773,0.01062315,0.00038068762,0.00037784595,0.0022761736,0.0054984232,0.09029905,0.012882672,0.80304456,0.0011597618,0.07272271],"study_design_scores_gemma":[0.00008248456,0.00014969394,0.0025688992,0.000067005974,0.00018407208,0.00040382883,0.00051097746,0.23945558,0.0082784705,0.74466395,0.0035428856,0.00009223703],"about_ca_topic_score_codex":0.0039724526,"about_ca_topic_score_gemma":0.0031713182,"teacher_disagreement_score":0.0069193165,"about_ca_system_score_codex":0.001771629,"about_ca_system_score_gemma":0.0012858766,"threshold_uncertainty_score":0.03659326},"labels":[],"label_agreement":null},{"id":"W2118008655","doi":"10.1109/fskd.2011.6019890","title":"Intra dynamic scenario relations and a dynamic decision making algorithm","year":2011,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Defence Research and Development Canada; Royal Military College of Canada","funders":"Defence Research and Development Canada","keywords":"Relation (database); Computer science; Simple (philosophy); Algorithm; Dynamic problem; Dynamic decision-making; Mathematical optimization; Data mining; Mathematics; Artificial intelligence","score_opus":0.013849504245673532,"score_gpt":0.2474362636355422,"score_spread":0.23358675938986867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118008655","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.011202803,0.00007152706,0.9813976,0.00013227561,0.00001850363,0.00008134084,0.000048307982,0.00027536417,0.006772311],"genre_scores_gemma":[0.27141583,0.00012372213,0.72475487,0.00005700874,0.000031613792,0.00016910439,0.00024688116,0.00008484206,0.003116122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967303,0.00097236724,0.00022423799,0.00089409563,0.000980507,0.00019845042],"domain_scores_gemma":[0.997552,0.0013174643,0.00021391592,0.00037708328,0.00040992987,0.00012964403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027824766,0.0007550019,0.000415371,0.0015480254,0.0010160088,0.0024142358,0.0012785547,0.00079133245,0.0064626327],"category_scores_gemma":[0.006761718,0.00035044344,0.00063718547,0.0016428493,0.0014220617,0.004605063,0.0017605193,0.0014762445,0.0006892091],"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.00019448576,0.00013191607,0.0020750826,0.00013955614,0.00007643903,0.0002644885,0.00052450446,0.11803597,0.0052436013,0.63386935,0.0015785854,0.23786601],"study_design_scores_gemma":[0.00003456222,0.00007470374,0.0005335528,0.000039613613,0.000051398936,0.00028814515,0.00021730692,0.5931032,0.008034279,0.3788161,0.018768288,0.000038876846],"about_ca_topic_score_codex":0.0013165991,"about_ca_topic_score_gemma":0.0011466094,"teacher_disagreement_score":0.0064626327,"about_ca_system_score_codex":0.0010290728,"about_ca_system_score_gemma":0.0013303636,"threshold_uncertainty_score":0.021619678},"labels":[],"label_agreement":null},{"id":"W2118078906","doi":"10.1142/s0218213001000623","title":"EFFICIENT DEFEASIBLE REASONING SYSTEMS","year":2001,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":120,"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 Toronto","funders":"Australian Research Council; Griffith University","keywords":"Defeasible estate; Forward chaining; Computer science; Non-monotonic logic; Defeasible reasoning; Backward chaining; Chaining; Logic programming; Simplicity; Description logic; Monotonic function; Theoretical computer science; Artificial intelligence; Programming language; Inference engine; Expert system; Mathematics","score_opus":0.06739144958469796,"score_gpt":0.32078427180292085,"score_spread":0.2533928222182229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118078906","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.021653738,0.0012448488,0.94986284,0.0010521649,0.00013186355,0.0004952455,0.00069052493,0.003318986,0.021549782],"genre_scores_gemma":[0.24689272,0.0014495946,0.7337188,0.00044652246,0.00011570282,0.000525384,0.0023412197,0.00034215668,0.014167829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967996,0.00084527786,0.00031716278,0.000483449,0.0013560201,0.00019847217],"domain_scores_gemma":[0.9961216,0.0019531448,0.00021792385,0.0010004985,0.0006141736,0.00009269169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029101896,0.00087811274,0.0011352694,0.0013764303,0.0014698851,0.004006876,0.002140418,0.0020789108,0.013385291],"category_scores_gemma":[0.010762162,0.00081762305,0.00085908355,0.0015871003,0.0011362323,0.0044785007,0.0030471946,0.0015118027,0.0040198965],"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.00052799465,0.00038132875,0.0012683375,0.00094260724,0.00020285127,0.0005734186,0.0007266694,0.1358282,0.013961396,0.48420453,0.021117972,0.3402648],"study_design_scores_gemma":[0.00027195038,0.00008285108,0.00033003328,0.00010012532,0.00009737519,0.00034250453,0.00018591898,0.54917973,0.010993351,0.35908872,0.0792885,0.00003895032],"about_ca_topic_score_codex":0.0014009171,"about_ca_topic_score_gemma":0.0016546336,"teacher_disagreement_score":0.013385291,"about_ca_system_score_codex":0.0011472469,"about_ca_system_score_gemma":0.0014528054,"threshold_uncertainty_score":0.044778287},"labels":[],"label_agreement":null},{"id":"W2118858476","doi":"","title":"Grounding for model expansion in k-guarded formulas with inductive definitions","year":2007,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"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":"Solver; Constraint satisfaction problem; Computer science; Constraint programming; Constraint (computer-aided design); Theoretical computer science; Algorithm; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.036582873890549,"score_gpt":0.2307817107230248,"score_spread":0.1941988368324758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118858476","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.04161227,0.00018373856,0.95169,0.00038427112,0.00002603138,0.000108305925,0.00012034778,0.00093684724,0.00493815],"genre_scores_gemma":[0.38877577,0.00021514755,0.6079644,0.00019997482,0.000032154883,0.00010558253,0.00045050433,0.00023692606,0.002019419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982968,0.00048182826,0.00010603711,0.00029707773,0.00049794256,0.00032030663],"domain_scores_gemma":[0.99736965,0.001770716,0.00011585433,0.00046703187,0.00019999285,0.000076741715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023979626,0.00063242886,0.0009276771,0.0010486436,0.0007505407,0.0019664313,0.0021276807,0.0008485823,0.0045870505],"category_scores_gemma":[0.00769867,0.00066146953,0.0019834964,0.0015582955,0.002524519,0.0057242457,0.0044803037,0.0026248305,0.0005244369],"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.00024840486,0.00018605417,0.002580091,0.0003591852,0.00008731592,0.00064051995,0.0008899399,0.07198602,0.009749867,0.71293753,0.0031758172,0.19715923],"study_design_scores_gemma":[0.000070099115,0.00006318527,0.0003914919,0.00009364576,0.00006810334,0.00020750814,0.00025573655,0.37174657,0.013346117,0.60753685,0.006185966,0.000034631586],"about_ca_topic_score_codex":0.002916439,"about_ca_topic_score_gemma":0.0046279603,"teacher_disagreement_score":0.0045870505,"about_ca_system_score_codex":0.0014447956,"about_ca_system_score_gemma":0.0014340872,"threshold_uncertainty_score":0.015345216},"labels":[],"label_agreement":null},{"id":"W2119488357","doi":"","title":"Graphs and colorings for answer set programming with preferences","year":2003,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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":"Dependency (UML); Characterization (materials science); Answer set programming; Dependency graph; Colored; Computer science; Set (abstract data type); Analogy; Theoretical computer science; Preference; Mathematics; Sequence (biology); Graph; Function (biology); Discrete mathematics; Artificial intelligence; Programming language; Linguistics","score_opus":0.025631371530383324,"score_gpt":0.24291505355882256,"score_spread":0.21728368202843923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119488357","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.011269352,0.0002007289,0.9768521,0.00092855236,0.000058484675,0.0000742127,0.000127199,0.0003011333,0.010188218],"genre_scores_gemma":[0.31613043,0.0004911279,0.67567694,0.0008002047,0.00017160768,0.00047439372,0.0003949505,0.00030131344,0.005559076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633634,0.0018033508,0.00024953045,0.0006105709,0.0006868972,0.00031333906],"domain_scores_gemma":[0.9931926,0.0045090658,0.00043008616,0.0009944078,0.000575338,0.00029847462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041366583,0.00074696797,0.0005561726,0.0018862366,0.0016491329,0.003401987,0.001464253,0.0016175099,0.006096848],"category_scores_gemma":[0.009984545,0.00066223246,0.0018655359,0.0024764568,0.005586284,0.008487057,0.003161337,0.003859171,0.00087400246],"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.000010238939,0.000010739468,0.000115836694,0.000029172834,0.000005872521,0.00003225399,0.00019768254,0.002839066,0.0004516479,0.9880185,0.00034987493,0.00793908],"study_design_scores_gemma":[0.0000047256185,0.000008958245,0.000067784356,0.000013043409,0.000007496681,0.0000332704,0.000063057894,0.010718973,0.0004419235,0.98585516,0.002774897,0.000010818822],"about_ca_topic_score_codex":0.0019184228,"about_ca_topic_score_gemma":0.001954703,"teacher_disagreement_score":0.006096848,"about_ca_system_score_codex":0.0022438692,"about_ca_system_score_gemma":0.001360141,"threshold_uncertainty_score":0.02187699},"labels":[],"label_agreement":null},{"id":"W2120692608","doi":"","title":"Parallel belief revision","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"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":"Belief revision; Iterated function; Negation; Set (abstract data type); Computer science; Pearl; Representation (politics); Mathematics; Artificial intelligence; Algorithm; Calculus (dental); Epistemology","score_opus":0.027199399227129717,"score_gpt":0.24288773117482523,"score_spread":0.21568833194769552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120692608","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.019378275,0.0015147018,0.90902233,0.007263967,0.00044005446,0.00044115493,0.00014753084,0.0003865605,0.061405484],"genre_scores_gemma":[0.73806405,0.0010729231,0.24795114,0.0016359274,0.0005649323,0.00065263646,0.00016865217,0.000056289948,0.009833436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892442,0.0051566684,0.0005536858,0.0018881476,0.0027410493,0.00041621886],"domain_scores_gemma":[0.9888285,0.005285548,0.00071466516,0.0029601601,0.0018461847,0.0003649317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011830027,0.00088310055,0.0012832223,0.0016084181,0.0014010627,0.0037113216,0.002819844,0.0021473577,0.0056801625],"category_scores_gemma":[0.024021022,0.0004639938,0.0016966431,0.0012991014,0.0059350035,0.006831641,0.0037885716,0.003910757,0.00068874256],"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.000053415788,0.000044317043,0.00031038126,0.00013141856,0.000085012834,0.00007405023,0.0005686114,0.004272469,0.00028466544,0.9586287,0.0016223245,0.03392466],"study_design_scores_gemma":[0.00004039216,0.000036740632,0.000103990256,0.000025811834,0.000025651469,0.000072196235,0.000068657355,0.014475876,0.00023763302,0.9801831,0.004716606,0.000013410493],"about_ca_topic_score_codex":0.0010160698,"about_ca_topic_score_gemma":0.0010907323,"teacher_disagreement_score":0.011830027,"about_ca_system_score_codex":0.0032481842,"about_ca_system_score_gemma":0.0020379547,"threshold_uncertainty_score":0.062563956},"labels":[],"label_agreement":null},{"id":"W2120747446","doi":"10.1007/s10992-011-9191-5","title":"On the Ternary Relation and Conditionality","year":2011,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Conditionality; Relation (database); Ternary operation; Semantics (computer science); Mathematical economics; Epistemology; Binary relation; Mathematics; Computer science; Discrete mathematics; Philosophy; Political science; Law; Data mining; Programming language","score_opus":0.07743447063397903,"score_gpt":0.2576858007410835,"score_spread":0.18025133010710448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120747446","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.07403204,0.018820994,0.58537644,0.02952632,0.002938151,0.00010257267,0.00075723825,0.0005249074,0.28792146],"genre_scores_gemma":[0.8850567,0.008114372,0.07981849,0.003921305,0.004355655,0.00020309673,0.00059002556,0.00037125422,0.01756911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671704,0.001377205,0.00024857695,0.00063802314,0.00061368797,0.0004054505],"domain_scores_gemma":[0.97899663,0.017236542,0.0005983312,0.001432915,0.0012861501,0.00044942708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063825757,0.00091394025,0.0014489132,0.0031627784,0.0038757296,0.0055881413,0.0017887233,0.002791884,0.011979636],"category_scores_gemma":[0.021966584,0.0011459772,0.0021681087,0.003383764,0.015680516,0.026004799,0.004879706,0.0076683997,0.0013153439],"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.00001184723,0.0000040644077,0.000046701367,0.000013770407,0.0000026988557,0.000020924821,0.000090951806,0.00020624266,0.00005084065,0.9972646,0.00064250466,0.0016448713],"study_design_scores_gemma":[0.000004991715,0.000002500044,0.00003183294,0.000010875138,0.0000045626484,0.00002168759,0.000015766687,0.00060360425,0.00005489664,0.9974572,0.0017859474,0.0000061678497],"about_ca_topic_score_codex":0.003917318,"about_ca_topic_score_gemma":0.002452308,"teacher_disagreement_score":0.011979636,"about_ca_system_score_codex":0.0027245565,"about_ca_system_score_gemma":0.0015719555,"threshold_uncertainty_score":0.0400759},"labels":[],"label_agreement":null},{"id":"W2120811814","doi":"10.1017/s1471068409990056","title":"Characterizations of stable model semantics for logic programs with arbitrary constraint atoms","year":2009,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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":"University of Alberta","funders":"","keywords":"Constraint (computer-aided design); Stable model semantics; Constraint logic programming; Computer science; Semantics (computer science); Atom (system on chip); Representation (politics); Theoretical computer science; Programming language; Discrete mathematics; Constraint satisfaction; Mathematics; Operational semantics; Artificial intelligence","score_opus":0.0320336723505918,"score_gpt":0.2855219591597016,"score_spread":0.2534882868091098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120811814","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.08204917,0.00022050267,0.9110131,0.00066128693,0.000038520528,0.0001557327,0.00041869364,0.0008460865,0.0045969947],"genre_scores_gemma":[0.79228777,0.00027316084,0.20200104,0.0003685903,0.00010850014,0.0005347493,0.0012645508,0.00039831657,0.0027632294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953328,0.00094783976,0.0003860295,0.0008441025,0.0020206796,0.000468632],"domain_scores_gemma":[0.9923854,0.0033442366,0.00095167226,0.0011957181,0.001796281,0.0003267233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033236614,0.00085277186,0.0010939775,0.0027777215,0.0009980871,0.004020952,0.0025379756,0.0018156361,0.0035573975],"category_scores_gemma":[0.011487857,0.000758188,0.0022881385,0.0019325027,0.0034283835,0.009574919,0.0028714056,0.002702343,0.0005280318],"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.00008151628,0.00008732285,0.00084194686,0.000093636576,0.000057418332,0.00021164733,0.0006164992,0.021844074,0.004446014,0.9593706,0.00069287734,0.011656407],"study_design_scores_gemma":[0.000043695676,0.00005985937,0.00020619886,0.00003527593,0.000040058192,0.0000958837,0.0001496582,0.18306577,0.0043694223,0.8087998,0.0031048297,0.000029537565],"about_ca_topic_score_codex":0.0024544063,"about_ca_topic_score_gemma":0.0021892847,"teacher_disagreement_score":0.004020952,"about_ca_system_score_codex":0.0024875859,"about_ca_system_score_gemma":0.0017345696,"threshold_uncertainty_score":0.018048763},"labels":[],"label_agreement":null},{"id":"W2123303914","doi":"","title":"Abductive logic programming by nonground rewrite systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soundness; Negation; Completeness (order theory); Abductive reasoning; Computer science; Logic programming; Programming language; Horn clause; Context (archaeology); Non-monotonic logic; Semantics (computer science); Stable model semantics; Simple (philosophy); Theoretical computer science; Artificial intelligence; Mathematics; Operational semantics; Epistemology","score_opus":0.02582932841134032,"score_gpt":0.23667528999010468,"score_spread":0.21084596157876434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123303914","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.012202282,0.00043196126,0.9778301,0.0008735207,0.00005706047,0.00009579179,0.0000797701,0.00066809164,0.0077613783],"genre_scores_gemma":[0.37642008,0.000828074,0.61157167,0.0006850018,0.0002479428,0.0002597307,0.00036090967,0.00020626481,0.009420352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959009,0.0015797026,0.00036740376,0.0007314348,0.0011549572,0.00026556235],"domain_scores_gemma":[0.9968592,0.0018912433,0.000156053,0.00068450323,0.00031729095,0.00009170805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004875404,0.0008560414,0.00094946224,0.0008789301,0.00072506553,0.003943674,0.0022529876,0.0010783082,0.0026398543],"category_scores_gemma":[0.0066657453,0.0006987143,0.001819045,0.000960962,0.0039359494,0.0068721264,0.0042918394,0.004068143,0.0008044131],"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.000057465208,0.00005463569,0.00017759964,0.000108305954,0.000045898087,0.00016743332,0.00047627906,0.012411077,0.0035546394,0.9527627,0.0010584731,0.029125508],"study_design_scores_gemma":[0.000055762168,0.000039365324,0.00006307995,0.00002258705,0.000040603063,0.00009349019,0.000065768654,0.06938502,0.0031119594,0.92197156,0.005130536,0.000020234123],"about_ca_topic_score_codex":0.001505603,"about_ca_topic_score_gemma":0.002262698,"teacher_disagreement_score":0.004875404,"about_ca_system_score_codex":0.001313528,"about_ca_system_score_gemma":0.0012637929,"threshold_uncertainty_score":0.025783896},"labels":[],"label_agreement":null},{"id":"W2123858720","doi":"10.22329/il.v20i1.2253","title":"Reification Fallacies and Inappropriate Totalities","year":2000,"lang":"en","type":"article","venue":"Informal Logic","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reification (Marxism); Epistemology; Identification (biology); Doctrine; Ontology; sort; Conjunction (astronomy); Set (abstract data type); Feature (linguistics); Philosophy; Computer science; Linguistics; Law; Political science; Information retrieval","score_opus":0.015490676401537142,"score_gpt":0.22033394613027807,"score_spread":0.20484326972874092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123858720","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.105840325,0.004449737,0.22416013,0.025968878,0.00076745625,0.00013138208,0.00032162666,0.0015216358,0.6368389],"genre_scores_gemma":[0.9406432,0.0011159163,0.027365224,0.0021407169,0.00031102812,0.00015449282,0.0001850833,0.0007346609,0.027349675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887567,0.0047417646,0.0008571435,0.0023214463,0.0024597526,0.0008631209],"domain_scores_gemma":[0.9915718,0.0027430295,0.0005830975,0.0034363489,0.0013891674,0.00027654675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077119414,0.00084233365,0.0011697421,0.0027711345,0.0049298266,0.007320938,0.0015623658,0.0025785596,0.0074684755],"category_scores_gemma":[0.015298968,0.00078544964,0.0012571382,0.002017198,0.023913505,0.018125145,0.008509995,0.0060726847,0.0016010168],"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.000008058476,0.0000034674379,0.00006501784,0.000012865575,0.0000036392366,0.00004577073,0.0013198227,0.00008340594,0.00009150859,0.995195,0.0007414593,0.002429915],"study_design_scores_gemma":[0.000011026989,0.0000032896862,0.000053395834,0.000022225731,0.000005869104,0.00007567136,0.000510539,0.00038998056,0.00028027542,0.9828813,0.015760653,0.0000057306097],"about_ca_topic_score_codex":0.0029619597,"about_ca_topic_score_gemma":0.0032172152,"teacher_disagreement_score":0.0077119414,"about_ca_system_score_codex":0.004394929,"about_ca_system_score_gemma":0.0018047162,"threshold_uncertainty_score":0.040785134},"labels":[],"label_agreement":null},{"id":"W2123899469","doi":"","title":"Belief modeling for maritime surveillance","year":2009,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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":"Computer science; Anomaly detection; Ranking (information retrieval); Attack patterns; Domain (mathematical analysis); Scalability; Computer security; Point (geometry); Information overload; Order (exchange); Data mining; Data science; Information retrieval; Intrusion detection system; Database; World Wide Web","score_opus":0.03120990749814043,"score_gpt":0.2773515951467125,"score_spread":0.24614168764857206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123899469","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.006937733,0.0014289294,0.983941,0.001296769,0.00007571612,0.00006016098,0.00030469164,0.0003135133,0.005641402],"genre_scores_gemma":[0.6493989,0.0024456375,0.3407813,0.00051239197,0.00034376103,0.0004293519,0.000973703,0.00008497305,0.0050299587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977168,0.0011486171,0.00013174595,0.00031252878,0.0005143983,0.00017586333],"domain_scores_gemma":[0.9940632,0.0045660795,0.00043765374,0.0002907909,0.00048739012,0.00015497315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294764,0.0009374008,0.001135767,0.0014398277,0.0007291933,0.0028231295,0.002140308,0.0018621436,0.0032216052],"category_scores_gemma":[0.010460504,0.0006132331,0.0014328198,0.001606934,0.0015450338,0.0034217022,0.0016271716,0.0027597593,0.00059152284],"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.00013975972,0.00008632463,0.0013285056,0.00024396619,0.00016047784,0.00020527738,0.00046178405,0.5065046,0.0006252567,0.44837117,0.002871509,0.039001383],"study_design_scores_gemma":[0.000022459719,0.00001816195,0.0001370879,0.00003219029,0.000027683498,0.000022362046,0.00004821885,0.7671112,0.00017942305,0.23000497,0.0023788163,0.000017339627],"about_ca_topic_score_codex":0.015930025,"about_ca_topic_score_gemma":0.013874638,"teacher_disagreement_score":0.015930025,"about_ca_system_score_codex":0.003034149,"about_ca_system_score_gemma":0.001513661,"threshold_uncertainty_score":0.031674623},"labels":[],"label_agreement":null},{"id":"W2124312938","doi":"10.5555/1775223.1775235","title":"Automatic composition of stateless components: a logical reasoning approach","year":2007,"lang":"en","type":"article","venue":"Fundamentals of Software Engineering","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stateless protocol; Computer science; Component (thermodynamics); Component-based software engineering; Reuse; Workflow; Composition (language); Simple (philosophy); Programming language; Software; Process (computing); Software system; Software engineering; Distributed computing; Theoretical computer science; Database; Engineering","score_opus":0.016228821260242787,"score_gpt":0.233477971207716,"score_spread":0.2172491499474732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124312938","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.0065239505,0.00008559255,0.99054366,0.00008190838,0.00003872932,0.000067538116,0.000024054922,0.0013790816,0.001255474],"genre_scores_gemma":[0.1259318,0.00016040461,0.8705884,0.00008147172,0.000040983745,0.0001047792,0.00018677292,0.0004054554,0.0024998735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961372,0.00080607686,0.00035105177,0.00077022606,0.0016322708,0.00030310417],"domain_scores_gemma":[0.99259335,0.00392427,0.00043584392,0.0018277722,0.0010066807,0.00021206745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004010705,0.0012087104,0.0012359311,0.0020737771,0.0022716182,0.0038293754,0.0038336252,0.0021053925,0.005861555],"category_scores_gemma":[0.011876012,0.0017212147,0.0027653896,0.0013675132,0.003400818,0.007652697,0.0035187707,0.002675197,0.001385474],"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.00080885453,0.00046440194,0.0020173162,0.00089857215,0.00028694837,0.001368678,0.0012548494,0.10165258,0.064537436,0.46410692,0.005081806,0.35752162],"study_design_scores_gemma":[0.00012797982,0.000100576464,0.0002483747,0.000100821824,0.00032904334,0.00047651143,0.0001788929,0.531856,0.057823487,0.39840934,0.010271451,0.00007744422],"about_ca_topic_score_codex":0.0015213875,"about_ca_topic_score_gemma":0.002912886,"teacher_disagreement_score":0.005861555,"about_ca_system_score_codex":0.0009944836,"about_ca_system_score_gemma":0.0016864536,"threshold_uncertainty_score":0.021210909},"labels":[],"label_agreement":null},{"id":"W2125004756","doi":"10.1016/j.entcs.2004.11.012","title":"Algebra and Sequent Calculus for Epistemic Actions","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sequent calculus; Sequent; Proof calculus; Mathematics; Cut-elimination theorem; Calculus (dental); Constructive; Algebra over a field; Semantics (computer science); Algebraic semantics; Natural deduction; Computer science; Discrete mathematics; Pure mathematics; Mathematical proof; Programming language","score_opus":0.012084311959250749,"score_gpt":0.27192947919433375,"score_spread":0.259845167235083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125004756","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.010883594,0.004593987,0.8916559,0.003143012,0.00076098624,0.0001669178,0.0007029895,0.00068974035,0.08740286],"genre_scores_gemma":[0.4928765,0.006444716,0.44489798,0.0021823004,0.002204553,0.0009764031,0.0016639269,0.00025929094,0.048494402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980106,0.0004700232,0.00015363663,0.00035882046,0.0007528196,0.00025414312],"domain_scores_gemma":[0.9988502,0.00044717774,0.00012422568,0.00013851005,0.00029528583,0.00014461248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789397,0.000765954,0.0010036937,0.002149614,0.0026244435,0.0036512443,0.0022317702,0.0015054825,0.0095098065],"category_scores_gemma":[0.003085761,0.00046415548,0.0020709676,0.002361517,0.0043570255,0.007465553,0.0031136184,0.0036522038,0.0025469495],"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.0000032361525,0.000006432072,0.000019819849,0.000018870183,0.0000030423405,0.000041085583,0.00007500126,0.00043278004,0.00013731461,0.9975581,0.0003503219,0.0013539572],"study_design_scores_gemma":[0.000006138134,0.0000050755275,0.000025859912,0.000009139531,0.000005493452,0.000042561605,0.000019739637,0.0025674067,0.00012705762,0.9876243,0.00956028,0.000006903198],"about_ca_topic_score_codex":0.00342139,"about_ca_topic_score_gemma":0.0023965964,"teacher_disagreement_score":0.0095098065,"about_ca_system_score_codex":0.0025416068,"about_ca_system_score_gemma":0.0022547108,"threshold_uncertainty_score":0.031813443},"labels":[],"label_agreement":null},{"id":"W2126807418","doi":"10.1109/sefm.2007.7","title":"An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers","year":2007,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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":"","keywords":"Deontic logic; Rotation formalisms in three dimensions; Computer science; Formalism (music); Artificial intelligence; Programming language; Theoretical computer science; Epistemology; Philosophy; Mathematics","score_opus":0.019573973634043215,"score_gpt":0.29478597226918524,"score_spread":0.275211998635142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126807418","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.01571277,0.0014266032,0.9073982,0.013819704,0.00036581382,0.00008348706,0.0001208233,0.00025236985,0.060820244],"genre_scores_gemma":[0.5328532,0.0014326121,0.4517866,0.0026320808,0.00036328429,0.00024228287,0.00014031274,0.00014385031,0.01040574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975715,0.0011383971,0.0001829077,0.0003428084,0.00063999003,0.00012430816],"domain_scores_gemma":[0.9967589,0.0014944169,0.00025218222,0.000795533,0.00048655638,0.00021242315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007998887,0.00047145857,0.0005621532,0.001310901,0.0034358124,0.0039213146,0.0013374622,0.0025955564,0.0022101726],"category_scores_gemma":[0.007367266,0.0005474866,0.0008583398,0.0012305306,0.011103997,0.010882436,0.0027867681,0.0044798083,0.00043638347],"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.0000066735447,0.000005039661,0.000051470226,0.0000133006015,0.000002266183,0.000028986842,0.00030729044,0.0005344972,0.00013629484,0.99636453,0.0004080028,0.0021417183],"study_design_scores_gemma":[0.000012587999,0.000008050712,0.000052956682,0.000020393152,0.000007688881,0.00005891569,0.00016524133,0.005276688,0.00039378938,0.9791525,0.01483903,0.000012158253],"about_ca_topic_score_codex":0.0034830007,"about_ca_topic_score_gemma":0.0027369445,"teacher_disagreement_score":0.007998887,"about_ca_system_score_codex":0.002446834,"about_ca_system_score_gemma":0.0017319056,"threshold_uncertainty_score":0.042302668},"labels":[],"label_agreement":null},{"id":"W2128924604","doi":"10.1145/544741.544746","title":"The cognitive agents specification language and verification environment for multiagent systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":77,"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":"Computer science; Programming language; Specification language; Language Of Temporal Ordering Specification; Multi-agent system; Formal verification; Formal specification; Frame (networking); Model checking; Verification; Software engineering; Artificial intelligence; Software system; Software","score_opus":0.04007593874261665,"score_gpt":0.24360148356895042,"score_spread":0.20352554482633378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128924604","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.0008468649,0.00011286621,0.99094087,0.0002373188,0.000052245006,0.00017686599,0.0002243241,0.003625452,0.0037832358],"genre_scores_gemma":[0.05431682,0.0003488664,0.93588513,0.00043203996,0.00011514392,0.0010081526,0.0012449367,0.0011352295,0.0055136625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411786,0.0023833625,0.0006986282,0.0005212958,0.0018410456,0.00043782848],"domain_scores_gemma":[0.99475646,0.0025548476,0.00054106046,0.00095304864,0.0009444089,0.00025009984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006150292,0.0009039035,0.0008766372,0.0013123825,0.0011399606,0.003515233,0.0029664354,0.0015989084,0.0073277405],"category_scores_gemma":[0.011069602,0.0012697193,0.0019673551,0.0010717936,0.0024868264,0.004785694,0.0029802916,0.0038244363,0.0035947622],"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.00017176707,0.00008108024,0.00042534576,0.0004630366,0.000048640788,0.00061194145,0.0008978729,0.029713538,0.006049699,0.87514627,0.017704273,0.068686485],"study_design_scores_gemma":[0.0003966257,0.00015193802,0.0003221449,0.00038682134,0.000077975055,0.00086982484,0.00022500323,0.23992632,0.019649785,0.39263594,0.34519726,0.00016033168],"about_ca_topic_score_codex":0.0047337827,"about_ca_topic_score_gemma":0.0042574503,"teacher_disagreement_score":0.0073277405,"about_ca_system_score_codex":0.0017330339,"about_ca_system_score_gemma":0.0060795587,"threshold_uncertainty_score":0.032526255},"labels":[],"label_agreement":null},{"id":"W2133280672","doi":"10.1109/micai.2008.37","title":"Integrating Subjective Knowledge Bases through an Extended Belief Game Model","year":2008,"lang":"en","type":"article","venue":"","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 New Brunswick","funders":"","keywords":"Belief revision; Negotiation; Computer science; Belief structure; Function (biology); Process (computing); Artificial intelligence; Knowledge base; Base (topology); Theoretical computer science; Mathematics","score_opus":0.0492504672102236,"score_gpt":0.29168281330469004,"score_spread":0.24243234609446643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133280672","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.017154505,0.00012760742,0.97670525,0.00034343806,0.000017829545,0.000101012985,0.000050155548,0.000112514594,0.0053876517],"genre_scores_gemma":[0.5344171,0.00033454748,0.4603781,0.00014849659,0.00005344659,0.00026078447,0.00016508537,0.000032284148,0.004210189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962197,0.0018197331,0.00028139417,0.00039936014,0.0010555317,0.00022442361],"domain_scores_gemma":[0.99611986,0.0021993858,0.00035423564,0.00046236874,0.0006239115,0.00024024543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005627695,0.00081858353,0.0007161638,0.0014222377,0.000678035,0.0034826149,0.0024962018,0.0012641335,0.0023650865],"category_scores_gemma":[0.009608598,0.0005124972,0.0010894284,0.001335446,0.0017299001,0.0072838827,0.0024688141,0.0015373689,0.00032471126],"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.000111830814,0.00009716382,0.0008001859,0.000099048084,0.00009901201,0.00036312404,0.001113932,0.107724294,0.001884257,0.84754276,0.0005236796,0.03964061],"study_design_scores_gemma":[0.00005111696,0.00008309874,0.00025030048,0.000035602447,0.00008432296,0.00010409269,0.00014057587,0.64338857,0.0012489283,0.34931323,0.005259638,0.000040464154],"about_ca_topic_score_codex":0.0040243166,"about_ca_topic_score_gemma":0.00372568,"teacher_disagreement_score":0.005627695,"about_ca_system_score_codex":0.0015489955,"about_ca_system_score_gemma":0.0014121945,"threshold_uncertainty_score":0.029762447},"labels":[],"label_agreement":null},{"id":"W2134010284","doi":"10.1109/aamas.2004.101","title":"Decentralized Resource Control for Multi-Agent Systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Multi-agent system; Computation; Decentralised system; Processor scheduling; Resource (disambiguation); Control (management); Programming language; Artificial intelligence; Engineering","score_opus":0.03541074712518117,"score_gpt":0.2706403248601243,"score_spread":0.23522957773494313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134010284","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.0072716535,0.0015314572,0.9653665,0.0011615803,0.00014585593,0.00011271431,0.00006588251,0.00057281135,0.023771647],"genre_scores_gemma":[0.7794949,0.002499616,0.20026422,0.00036226562,0.0003989325,0.0006972744,0.00018736825,0.00013662774,0.01595885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988349,0.00036681475,0.000068120324,0.00020859533,0.0004062334,0.00011531743],"domain_scores_gemma":[0.9991247,0.00041624036,0.00010152708,0.00014858077,0.00013627023,0.00007271427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015597437,0.00059515063,0.0005766505,0.00045298206,0.0009855452,0.0022340573,0.0013527599,0.0009084677,0.0033357274],"category_scores_gemma":[0.0025339348,0.00030528285,0.0003941788,0.0006589649,0.0018349059,0.0024192687,0.0017892094,0.0015636113,0.00049220485],"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.00005944729,0.000029149029,0.00012485172,0.00013783104,0.000020704974,0.00010426253,0.00016300859,0.16154656,0.002099362,0.8024709,0.0032677262,0.029976089],"study_design_scores_gemma":[0.000056093526,0.00003064972,0.00008350796,0.000028632016,0.000015832667,0.000038062943,0.00004022131,0.5401866,0.0009665034,0.43479076,0.02374764,0.000015528523],"about_ca_topic_score_codex":0.0030784707,"about_ca_topic_score_gemma":0.003503465,"teacher_disagreement_score":0.0033357274,"about_ca_system_score_codex":0.0019500739,"about_ca_system_score_gemma":0.001559014,"threshold_uncertainty_score":0.014148831},"labels":[],"label_agreement":null},{"id":"W2134063388","doi":"10.1111/phc3.12048","title":"Belief Revision I: The AGM Theory","year":2013,"lang":"en","type":"article","venue":"Philosophy Compass","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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 Toronto","funders":"","keywords":"Doxastic logic; Belief revision; Iterated function; Ideal (ethics); Epistemology; Focus (optics); Psychology; Philosophy; Computer science; Mathematics","score_opus":0.021295354762366478,"score_gpt":0.23393315765878472,"score_spread":0.21263780289641826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134063388","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.0701467,0.0113448,0.65910184,0.027510956,0.0011338001,0.00022775894,0.00034155176,0.0005224563,0.22967021],"genre_scores_gemma":[0.9527355,0.0012030358,0.037918534,0.0011152646,0.0008172693,0.0001604551,0.000073131,0.000042941178,0.0059338314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933694,0.0038289248,0.00023445347,0.00075692,0.0013714248,0.0004389183],"domain_scores_gemma":[0.9848461,0.010071865,0.0010464806,0.0015958445,0.0019370291,0.0005026349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073950742,0.0004935243,0.0009729392,0.001812224,0.0011292547,0.004228143,0.001570849,0.0021639892,0.0056669167],"category_scores_gemma":[0.021844577,0.00033282538,0.0012237821,0.0012270936,0.0065744407,0.004037299,0.0020233546,0.0036761505,0.000578737],"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.000023997633,0.000017961933,0.00030764609,0.000073407755,0.000028385546,0.00005174825,0.00030551731,0.0024001605,0.0000955874,0.9828199,0.001864319,0.012011349],"study_design_scores_gemma":[0.000023993323,0.000017571612,0.00022019309,0.000038338483,0.000014534156,0.000053163738,0.000060393122,0.013661466,0.000081966944,0.9833466,0.0024712146,0.000010431787],"about_ca_topic_score_codex":0.0016214333,"about_ca_topic_score_gemma":0.000882489,"teacher_disagreement_score":0.0073950742,"about_ca_system_score_codex":0.003414088,"about_ca_system_score_gemma":0.0015472575,"threshold_uncertainty_score":0.03910935},"labels":[],"label_agreement":null},{"id":"W2134275439","doi":"10.1016/j.artint.2010.04.003","title":"Iterated belief change in the situation calculus","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"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":"Belief revision; Situation calculus; Introspection; Computer science; Iterated function; Formalism (music); Action (physics); Artificial intelligence; Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology","score_opus":0.07049695495656967,"score_gpt":0.31678408271310493,"score_spread":0.24628712775653527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134275439","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.12017623,0.0017579829,0.7822523,0.005132981,0.00023841888,0.00012361014,0.0002099333,0.00039900807,0.08970948],"genre_scores_gemma":[0.9201356,0.0005930094,0.068546,0.00026753233,0.00022199545,0.00011784412,0.00011724931,0.000066760666,0.009933905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566406,0.0018107312,0.00025188457,0.0005480462,0.0013034537,0.00042178144],"domain_scores_gemma":[0.9921251,0.00550269,0.00042091802,0.0007311233,0.0008280099,0.00039218535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051826397,0.00054337154,0.0010767941,0.0012978481,0.0019381553,0.0050930656,0.0020630842,0.002084981,0.005665939],"category_scores_gemma":[0.016970443,0.0007757639,0.001947111,0.0011830396,0.005167685,0.009877235,0.0026853383,0.0037406585,0.0005416111],"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.000033891334,0.0000204106,0.00015110013,0.000025970521,0.000022393368,0.000100242556,0.0003407173,0.0035729771,0.00024001622,0.99165183,0.00033295853,0.003507544],"study_design_scores_gemma":[0.00001427202,0.0000075899547,0.000058317288,0.000006159783,0.000013968559,0.000036837228,0.00003808922,0.02047519,0.00012971058,0.97861594,0.0005954155,0.000008507126],"about_ca_topic_score_codex":0.0040615764,"about_ca_topic_score_gemma":0.0022915276,"teacher_disagreement_score":0.005665939,"about_ca_system_score_codex":0.0030732069,"about_ca_system_score_gemma":0.0015352907,"threshold_uncertainty_score":0.027408719},"labels":[],"label_agreement":null},{"id":"W2136410977","doi":"10.1109/icde.1991.131524","title":"First-order logic reducible programs","year":2002,"lang":"en","type":"article","venue":"","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 Alberta","funders":"","keywords":"Transitive closure; Assertion; Fixed point; Computer science; Arity; Logical consequence; Second-order logic; Closure (psychology); Constraint (computer-aided design); Data integrity; Discrete mathematics; Directed acyclic graph; Set (abstract data type); First-order logic; Theoretical computer science; Logic programming; Programming language; Independence (probability theory); Horn clause; Least fixed point; Mathematics; Algorithm; Higher-order logic; Fixed-point theorem; Description logic; Artificial intelligence","score_opus":0.04528125853756291,"score_gpt":0.23941647949954495,"score_spread":0.19413522096198205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136410977","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.0624422,0.0009000249,0.85923225,0.0009698264,0.00012771838,0.00038418238,0.00090188684,0.0016855636,0.07335639],"genre_scores_gemma":[0.6542917,0.0013166197,0.3096674,0.0005952534,0.00019054838,0.00062941597,0.0024298234,0.0005218276,0.030357474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851555,0.00033415676,0.00009717164,0.0003136413,0.0005292836,0.00021019463],"domain_scores_gemma":[0.99738044,0.0013420157,0.0002612694,0.0005106399,0.00041879294,0.000086952736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012235093,0.0006234115,0.0006121484,0.0010268531,0.00069309404,0.002343314,0.0011850958,0.00068035204,0.0037992387],"category_scores_gemma":[0.0045745396,0.00036843578,0.0016796141,0.0008605497,0.0021190373,0.0032761062,0.0012041923,0.0029424517,0.00044978023],"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.000049333954,0.0000525551,0.0002936319,0.00015120697,0.00003874158,0.0002690709,0.00056114345,0.01565325,0.0016483049,0.95943785,0.0018732282,0.019971538],"study_design_scores_gemma":[0.00003436905,0.000042992873,0.0002103473,0.00005654126,0.0000741864,0.00022413295,0.00016246042,0.03976322,0.0055804034,0.9291441,0.024687637,0.00001971816],"about_ca_topic_score_codex":0.0029666626,"about_ca_topic_score_gemma":0.002611455,"teacher_disagreement_score":0.0037992387,"about_ca_system_score_codex":0.0019147032,"about_ca_system_score_gemma":0.00182872,"threshold_uncertainty_score":0.013892233},"labels":[],"label_agreement":null},{"id":"W2137777810","doi":"10.1109/lics.2001.932495","title":"A second-order system for polytime reasoning using Gradel's theorem","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Bounded function; Order (exchange); Polynomial; Second-order logic; Polynomial hierarchy; Mathematics; Function (biology); Reverse mathematics; Discrete mathematics; Corollary; Class (philosophy); Time complexity; Combinatorics; Algebra over a field; Computer science; Pure mathematics; Description logic; Axiom; Artificial intelligence; Higher-order logic","score_opus":0.03144452859730704,"score_gpt":0.24252649787912492,"score_spread":0.21108196928181788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137777810","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.012108767,0.00027282155,0.97330993,0.00070245715,0.000101045596,0.00012402251,0.00037312912,0.0018987391,0.011109114],"genre_scores_gemma":[0.38207993,0.0004516601,0.6018711,0.00093518785,0.00022838595,0.0003544967,0.001219376,0.00053426425,0.012325748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726653,0.00046684803,0.00022615689,0.00070728036,0.00094176875,0.0003914436],"domain_scores_gemma":[0.99702543,0.0012013003,0.00020927674,0.00088221044,0.00049252715,0.0001892164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019851895,0.0006569273,0.0009576374,0.0014394411,0.0014041542,0.0036321967,0.0022957844,0.000988675,0.00661674],"category_scores_gemma":[0.0048635984,0.0007794931,0.002670042,0.0014753606,0.0045688804,0.007772166,0.004689873,0.0047701057,0.0019671079],"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.000048687674,0.000031335217,0.00037162498,0.00010464994,0.000020907424,0.00012165985,0.00039375538,0.005874956,0.0029027197,0.9736372,0.0021028745,0.0143896155],"study_design_scores_gemma":[0.000091614085,0.00007067454,0.00038126638,0.00004258598,0.000060760478,0.00020027958,0.00010015893,0.09193427,0.008605879,0.8609624,0.037481744,0.00006837683],"about_ca_topic_score_codex":0.0075521856,"about_ca_topic_score_gemma":0.00872627,"teacher_disagreement_score":0.0075521856,"about_ca_system_score_codex":0.0035901791,"about_ca_system_score_gemma":0.0022414182,"threshold_uncertainty_score":0.02604872},"labels":[],"label_agreement":null},{"id":"W2139630036","doi":"10.1023/b:amai.0000031197.13122.aa","title":"On the Semantics of Deliberation in IndiGolog — from Theory to Implementation","year":2004,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"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":"Deliberation; Computer science; Semantics (computer science); Simple (philosophy); Plan (archaeology); Situation calculus; Bounded function; Programming language; Theoretical computer science; Artificial intelligence; Epistemology; Mathematics","score_opus":0.10192786342286023,"score_gpt":0.35328617196106066,"score_spread":0.2513583085382004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139630036","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.015545734,0.0015084682,0.92183256,0.0104393205,0.0003666525,0.00011553451,0.00017852524,0.00085776363,0.049155384],"genre_scores_gemma":[0.6797531,0.0012456852,0.30629784,0.0019101753,0.00043266508,0.00040335552,0.00027952064,0.0006422176,0.009035412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99294126,0.003900056,0.0005749566,0.00076069415,0.001078127,0.00074496324],"domain_scores_gemma":[0.9889158,0.0069295284,0.00045044863,0.0023527963,0.00088719954,0.00046413127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006937534,0.0009849243,0.0014939985,0.0018410033,0.0032575023,0.00968957,0.0040184,0.004585908,0.010015821],"category_scores_gemma":[0.018174017,0.0013878194,0.002894607,0.0021031718,0.019541126,0.023874002,0.007935761,0.007842503,0.0013428977],"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.000020706124,0.000013311614,0.00006930496,0.00002472561,0.000007427728,0.000025456313,0.0003575596,0.0014522745,0.00006904707,0.99404764,0.00045795788,0.0034545672],"study_design_scores_gemma":[0.000014259958,0.0000081024,0.00003033002,0.000022814835,0.000008683806,0.000020101423,0.00009371279,0.005642075,0.00014902148,0.99131596,0.002685216,0.00000965409],"about_ca_topic_score_codex":0.0062685744,"about_ca_topic_score_gemma":0.0046615703,"teacher_disagreement_score":0.010015821,"about_ca_system_score_codex":0.004458337,"about_ca_system_score_gemma":0.0033004736,"threshold_uncertainty_score":0.03668964},"labels":[],"label_agreement":null},{"id":"W2139714950","doi":"10.1023/a:1016524013831","title":"Hypothetical Temporal Reasoning in Databases","year":2002,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Predicate (mathematical logic); Data integrity; Relational database; Temporal database; Database schema; Temporal logic; Programming language; Database; Theoretical computer science; State (computer science); Database theory; Database design; Information retrieval","score_opus":0.047617313625412445,"score_gpt":0.2615235239113944,"score_spread":0.21390621028598195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139714950","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.08828324,0.006924246,0.798193,0.02225874,0.00066265883,0.00018918872,0.00088584755,0.00070367486,0.08189943],"genre_scores_gemma":[0.8021438,0.00268597,0.18398626,0.0009936374,0.00063601974,0.00012903682,0.0010069136,0.00007513999,0.008343234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472696,0.0029276712,0.0005065664,0.0006201794,0.0009788275,0.00023979328],"domain_scores_gemma":[0.97885066,0.01602021,0.0007196212,0.0023729831,0.0014998036,0.0005367841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076346737,0.000438833,0.000781575,0.0021908549,0.002604711,0.007861656,0.002446954,0.003025445,0.00978213],"category_scores_gemma":[0.03877252,0.00094666064,0.0016201793,0.0026398906,0.0063146814,0.01993454,0.002658244,0.0035086398,0.0010566803],"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.00007922784,0.000034430483,0.0003377879,0.000067735244,0.0000183077,0.00008988485,0.00028336913,0.0030822563,0.00015725294,0.98530537,0.0017795317,0.008764882],"study_design_scores_gemma":[0.000017054772,0.0000053583144,0.000051461135,0.00001388025,0.000012199113,0.000054574746,0.000082452425,0.011675759,0.00016107,0.9854929,0.0024266262,0.0000065081417],"about_ca_topic_score_codex":0.0032214432,"about_ca_topic_score_gemma":0.002485164,"teacher_disagreement_score":0.00978213,"about_ca_system_score_codex":0.002691361,"about_ca_system_score_gemma":0.0015774996,"threshold_uncertainty_score":0.040376484},"labels":[],"label_agreement":null},{"id":"W2139771194","doi":"10.1016/s0004-3702(99)00087-9","title":"Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Circumscription; Axiom; Successor cardinal; State (computer science); Mathematics; Computer science; Frame problem; Class (philosophy); Set (abstract data type); Frame (networking); Theoretical computer science; Artificial intelligence; Algorithm; Programming language","score_opus":0.044013511608110345,"score_gpt":0.2909212580944951,"score_spread":0.24690774648638475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139771194","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.0022404436,0.00007424075,0.9898783,0.00046109664,0.000078852856,0.000059353024,0.000064793276,0.00034731804,0.0067955386],"genre_scores_gemma":[0.123124905,0.000172306,0.86601096,0.0004200464,0.00019639116,0.00031190438,0.00020190424,0.0002572089,0.009304311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979024,0.00061129156,0.0001326456,0.0006552546,0.00046848145,0.00022992335],"domain_scores_gemma":[0.99671954,0.0017064734,0.00023836923,0.00076422765,0.00041578876,0.00015566345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036703565,0.0012623437,0.0018048794,0.0010559382,0.0014458356,0.0034805536,0.0049416185,0.004055095,0.017311156],"category_scores_gemma":[0.015681885,0.0011444101,0.0019909788,0.0012152988,0.003262313,0.006791714,0.0058806976,0.0044445107,0.0030120038],"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.00014359171,0.000100053294,0.00022287563,0.00015904751,0.000054643966,0.00025606996,0.0005460938,0.062439375,0.001201141,0.7957646,0.007572018,0.13154048],"study_design_scores_gemma":[0.000045636527,0.000030319032,0.00004758617,0.000047129837,0.00003423038,0.000113443966,0.00009027642,0.30206493,0.00081862684,0.69150186,0.005182646,0.000023295479],"about_ca_topic_score_codex":0.003140039,"about_ca_topic_score_gemma":0.004572681,"teacher_disagreement_score":0.017311156,"about_ca_system_score_codex":0.00087813655,"about_ca_system_score_gemma":0.002766747,"threshold_uncertainty_score":0.057911575},"labels":[],"label_agreement":null},{"id":"W2140743943","doi":"10.1007/s11225-012-9395-x","title":"Actuality in Propositional Modal Logic","year":2012,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Modal logic; Normal modal logic; Zeroth-order logic; Propositional variable; Modal μ-calculus; Intermediate logic; Kripke semantics; Mathematics; Modal; Operator (biology); Kripke structure; S5; Well-formed formula; Intuitionistic logic; Dynamic logic (digital electronics); Accessibility relation; Mathematical proof; Calculus (dental); Multimodal logic; Discrete mathematics; Propositional calculus; Computer science; Algorithm; Model checking; Theoretical computer science; Description logic; Physics","score_opus":0.03603683727267915,"score_gpt":0.2830724367028787,"score_spread":0.24703559943019954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140743943","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.16893965,0.019828716,0.63592774,0.026638767,0.0007071495,0.000100661695,0.0005435327,0.0005302766,0.14678349],"genre_scores_gemma":[0.9387885,0.0040099607,0.04819149,0.00070193707,0.0008174127,0.00008978679,0.00043291674,0.0000890449,0.006879063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953394,0.0023015994,0.0003132773,0.0006445109,0.0010471217,0.00035417743],"domain_scores_gemma":[0.9834816,0.013602144,0.00052005623,0.0010333917,0.0009949259,0.0003679257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061801695,0.00066590443,0.001074984,0.002344477,0.0027731708,0.007678926,0.0020044327,0.0021729285,0.0055135605],"category_scores_gemma":[0.014842111,0.0012383608,0.0012879916,0.0027124987,0.0113689685,0.022721482,0.0032442345,0.007753057,0.00052493624],"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.000014355599,0.000015222692,0.00017483949,0.00003375273,0.000007843448,0.00003543185,0.00027707755,0.00053877855,0.000056393437,0.99579805,0.00047493857,0.0025734135],"study_design_scores_gemma":[0.0000048114066,0.0000024888323,0.00004859849,0.000007582699,0.0000048426264,0.0000160457,0.000040488427,0.0011905757,0.000028849094,0.99771297,0.00093952724,0.0000032100709],"about_ca_topic_score_codex":0.002391715,"about_ca_topic_score_gemma":0.0014667651,"teacher_disagreement_score":0.007678926,"about_ca_system_score_codex":0.0029422308,"about_ca_system_score_gemma":0.0011969153,"threshold_uncertainty_score":0.032684267},"labels":[],"label_agreement":null},{"id":"W2142254252","doi":"10.22329/il.v31i2.3078","title":"Diagramming Objections To Independent Premises","year":2011,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Premise; Arrow; Argument (complex analysis); Premises; Epistemology; Sociology; Philosophy; Computer science; Law; Political science","score_opus":0.03932603295168866,"score_gpt":0.23968911017331745,"score_spread":0.2003630772216288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142254252","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.014221192,0.00048040875,0.9338008,0.0032571994,0.00065947126,0.00023526598,0.00013851178,0.0014360704,0.045771167],"genre_scores_gemma":[0.2533862,0.0008961759,0.7193735,0.0016301573,0.0004925814,0.0009393684,0.00046800278,0.0014469858,0.021367088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986842,0.008350569,0.00077122386,0.0016996732,0.0019796025,0.00035684745],"domain_scores_gemma":[0.9465644,0.03917511,0.0022685595,0.0067131952,0.0044053006,0.0008735115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015737522,0.0010818683,0.00075769285,0.0029936756,0.0031483863,0.007370349,0.0024622818,0.0032029217,0.015580516],"category_scores_gemma":[0.048493493,0.0010331032,0.0014835853,0.0015440718,0.007831468,0.015949158,0.0078444285,0.0066803764,0.0023578305],"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.00008561815,0.00002485346,0.00037245598,0.00020328193,0.00002014586,0.00032015005,0.008139513,0.0007494953,0.0017686235,0.9585928,0.0029788068,0.026744317],"study_design_scores_gemma":[0.000062115876,0.000038078593,0.0002191673,0.0002446868,0.00005016289,0.00021843384,0.0014183843,0.005435659,0.0038199893,0.8791916,0.10927179,0.000030020235],"about_ca_topic_score_codex":0.0007264453,"about_ca_topic_score_gemma":0.00076666276,"teacher_disagreement_score":0.015737522,"about_ca_system_score_codex":0.002350324,"about_ca_system_score_gemma":0.0017576881,"threshold_uncertainty_score":0.083228946},"labels":[],"label_agreement":null},{"id":"W2142696533","doi":"10.1017/s1755020313000087","title":"STRONG COMPLETENESS OF S4 FOR ANY DENSE-IN-ITSELF METRIC SPACE","year":2013,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"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 Toronto","funders":"","keywords":"Completeness (order theory); Real line; Metric space; Mathematics; Space (punctuation); Metric (unit); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.033617575872152174,"score_gpt":0.2871383618909682,"score_spread":0.253520786018816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142696533","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.371387,0.0038456358,0.53801686,0.0065204296,0.00011773285,0.00015361761,0.0010736583,0.00039008647,0.07849508],"genre_scores_gemma":[0.9399592,0.0014115511,0.05000726,0.00042653613,0.00009519418,0.00011877936,0.0010682131,0.00006031305,0.0068529192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959383,0.0014962135,0.00045817433,0.00067278836,0.0011132528,0.00032122183],"domain_scores_gemma":[0.99293,0.003341069,0.0004695507,0.00089599856,0.0019745873,0.00038878183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038480107,0.00051603763,0.0010401402,0.0018182555,0.0016126496,0.0035288874,0.0012480363,0.0012140197,0.003987541],"category_scores_gemma":[0.0056726215,0.00047659106,0.0017326593,0.0019585895,0.0061235474,0.0076525845,0.00430153,0.0025386612,0.0005494671],"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.00004337752,0.00001557085,0.00061943237,0.00017788056,0.000047921814,0.00009283748,0.00048131103,0.0028033862,0.0009027436,0.98751897,0.0008610163,0.006435604],"study_design_scores_gemma":[0.000018699033,0.000041316827,0.0006383054,0.000043314034,0.00002208108,0.00012010136,0.00034549844,0.010423781,0.0020849588,0.97644717,0.009793287,0.000021404574],"about_ca_topic_score_codex":0.004079628,"about_ca_topic_score_gemma":0.0028039974,"teacher_disagreement_score":0.004079628,"about_ca_system_score_codex":0.001998633,"about_ca_system_score_gemma":0.0021226862,"threshold_uncertainty_score":0.020350516},"labels":[],"label_agreement":null},{"id":"W2143134544","doi":"10.1111/j.1467-9329.2007.00379.x","title":"RULE‐FOLLOWING WITHOUT REASONS: WITTGENSTEIN'S QUIETISM AND THE CONSTITUTIVE QUESTION","year":2007,"lang":"en","type":"article","venue":"Ratio","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":119,"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","funders":"","keywords":"Conflation; Epistemology; Objectivity (philosophy); Meaning (existential); Philosophy; Focus (optics)","score_opus":0.008774348466961375,"score_gpt":0.2528014911494923,"score_spread":0.24402714268253092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143134544","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.07057071,0.005168135,0.14482437,0.04068881,0.0010916746,0.00009332339,0.00024733224,0.00034004325,0.73697567],"genre_scores_gemma":[0.9718389,0.0011266685,0.010201318,0.0024074593,0.0005144548,0.00006670113,0.000081299506,0.00013690883,0.013626328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959223,0.0015774339,0.0003011388,0.0008324217,0.0010292785,0.00033738537],"domain_scores_gemma":[0.9935673,0.0038502063,0.00042918883,0.0011705703,0.0007904025,0.00019236734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006425636,0.00031191265,0.00073995715,0.0016616501,0.0023973854,0.007275668,0.0018089707,0.0031286487,0.0052018343],"category_scores_gemma":[0.012743352,0.00040811996,0.001124211,0.0012499857,0.02608407,0.012768999,0.0029295105,0.004404696,0.0011307913],"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.0000035647904,0.0000021620926,0.00002012157,0.000008815674,0.0000014863375,0.00001752631,0.00026908529,0.00005321452,0.000040969317,0.9980552,0.0004419185,0.0010859671],"study_design_scores_gemma":[0.00000447579,0.0000028312597,0.000034985424,0.000015019001,0.0000026879682,0.000025722813,0.00012472636,0.00022221013,0.000122367,0.9935854,0.005855415,0.000004159468],"about_ca_topic_score_codex":0.0018880662,"about_ca_topic_score_gemma":0.0011141617,"teacher_disagreement_score":0.007275668,"about_ca_system_score_codex":0.0031057838,"about_ca_system_score_gemma":0.0015164684,"threshold_uncertainty_score":0.033982396},"labels":[],"label_agreement":null},{"id":"W2143883571","doi":"","title":"High-level robot programming in dynamic and incompletely known environments","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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 Toronto","funders":"","keywords":"Computer science; Probabilistic logic; Robot; Control (management); Perspective (graphical); Situation calculus; Mobile robot; Artificial intelligence; Human–computer interaction","score_opus":0.019813099601451913,"score_gpt":0.23733718015851382,"score_spread":0.2175240805570619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143883571","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.015342289,0.00013406269,0.9807097,0.0006022718,0.000014211568,0.000044008866,0.000049856404,0.00039967845,0.002704076],"genre_scores_gemma":[0.35919794,0.00044969877,0.6342941,0.0002894251,0.00007058173,0.00023381018,0.00018466974,0.00016927916,0.0051104766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827194,0.00070295925,0.00011052791,0.00029623686,0.0003859757,0.00023238508],"domain_scores_gemma":[0.9947708,0.0040961043,0.00029144285,0.0004585798,0.0002575688,0.00012538089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034201595,0.000652208,0.00079543126,0.00037745183,0.000976776,0.0030627295,0.001935377,0.0009841542,0.0024411725],"category_scores_gemma":[0.007057119,0.0007607996,0.0014144334,0.0005326421,0.003632019,0.004984521,0.003113812,0.0030304962,0.00037596494],"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.00012750835,0.000058105805,0.00046191984,0.00027735272,0.00004825642,0.00032733727,0.0010516015,0.31749213,0.0018411588,0.6486192,0.00089797954,0.028797532],"study_design_scores_gemma":[0.000045524608,0.000042913693,0.00009365715,0.0000460521,0.000026870664,0.000065666245,0.00014500621,0.41964325,0.0018152486,0.5738694,0.00418958,0.000016829254],"about_ca_topic_score_codex":0.0023288867,"about_ca_topic_score_gemma":0.0042815655,"teacher_disagreement_score":0.0034201595,"about_ca_system_score_codex":0.0014695227,"about_ca_system_score_gemma":0.0016458773,"threshold_uncertainty_score":0.018087745},"labels":[],"label_agreement":null},{"id":"W2144423143","doi":"10.1109/wi-iat.2009.329","title":"Temporalised Epistemic Logic for Reasoning about Agent-Based Systems","year":2009,"lang":"en","type":"article","venue":"","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Epistemic modal logic; Temporal logic; Multi-agent system; Description logic; Dynamic logic (digital electronics); Model checking; Theoretical computer science; Programming language; Artificial intelligence; Multimodal logic; Engineering","score_opus":0.028668523819654762,"score_gpt":0.27286494336745754,"score_spread":0.24419641954780277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144423143","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.0019731694,0.0010949154,0.98889136,0.00087407144,0.0001649508,0.00011483006,0.00018692303,0.00061575137,0.006083998],"genre_scores_gemma":[0.16964914,0.0023152332,0.81863743,0.001058278,0.000494033,0.00063054025,0.00083768193,0.00021155975,0.006166021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963511,0.0014706608,0.0004179034,0.00038483995,0.0011375132,0.00023805742],"domain_scores_gemma":[0.9950755,0.003471831,0.00033920776,0.00044836226,0.0004736684,0.00019140197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005261693,0.0012396979,0.0009877491,0.0023004888,0.001331249,0.004977922,0.0026993733,0.0018449436,0.0068314667],"category_scores_gemma":[0.008812875,0.0007238728,0.0029382245,0.0026422017,0.003942312,0.007988909,0.002442944,0.005392137,0.0016298868],"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.00006698128,0.00004799022,0.00016130693,0.00030968376,0.000060900955,0.0003631996,0.00039727622,0.01863299,0.0020038087,0.95838916,0.0021104414,0.017456258],"study_design_scores_gemma":[0.00007608306,0.000047026366,0.00007180437,0.000118890785,0.0000729958,0.00019728535,0.00009081641,0.10562446,0.0022790707,0.8680272,0.023353629,0.000040740757],"about_ca_topic_score_codex":0.0037794902,"about_ca_topic_score_gemma":0.0025722892,"teacher_disagreement_score":0.0068314667,"about_ca_system_score_codex":0.0036555317,"about_ca_system_score_gemma":0.0026539695,"threshold_uncertainty_score":0.027826786},"labels":[],"label_agreement":null},{"id":"W2144792489","doi":"10.1007/978-3-642-04893-7_21","title":"Dynamic Epistemic Temporal Logic","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Temporal logic; Epistemic modal logic; Dynamic logic (digital electronics); Artificial intelligence; Programming language; Multimodal logic; Description logic; Electrical engineering","score_opus":0.015262000565845996,"score_gpt":0.24641862588764663,"score_spread":0.23115662532180062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144792489","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031286196,0.00783532,0.32386672,0.004251598,0.00081600953,0.000055957426,0.00044752174,0.00063253153,0.6589657],"genre_scores_gemma":[0.4121601,0.015284567,0.15865141,0.0022456332,0.0014755577,0.0002673943,0.0019998434,0.00070559623,0.40720978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953175,0.00012587023,0.000031012652,0.00011234949,0.00015592009,0.00004310073],"domain_scores_gemma":[0.9995666,0.00019876628,0.000026021886,0.00008279144,0.000095174764,0.000030680752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071532273,0.00077323016,0.0004415645,0.0011063131,0.0011864428,0.0034547006,0.0008964369,0.0010228339,0.01662323],"category_scores_gemma":[0.0016434228,0.00044789317,0.0006598586,0.0012425624,0.0025381579,0.0049207313,0.0012721883,0.0026942294,0.004264232],"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.0000075812213,0.000006502422,0.000018605704,0.000028906421,0.000002987757,0.000019879544,0.00008815291,0.0004260139,0.00020538902,0.9778657,0.006478002,0.014852247],"study_design_scores_gemma":[0.0000041307667,0.0000035708733,0.000028696726,0.000041143583,0.0000062550403,0.000060851635,0.00003172418,0.0017278265,0.00039301792,0.9163027,0.0813948,0.0000052739874],"about_ca_topic_score_codex":0.001363502,"about_ca_topic_score_gemma":0.0013670849,"teacher_disagreement_score":0.01662323,"about_ca_system_score_codex":0.0021181412,"about_ca_system_score_gemma":0.0010776771,"threshold_uncertainty_score":0.05561024},"labels":[],"label_agreement":null},{"id":"W2145855346","doi":"10.22329/il.v30i1.692","title":"Defeasible Classifications and Inferences from Definitions","year":2010,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Defeasible estate; Defeasible reasoning; Argumentation theory; Argument (complex analysis); Heuristics; Variety (cybernetics); Epistemology; Analogy; Computer science; Inference; sort; Subject (documents); Artificial intelligence; Philosophy; Information retrieval","score_opus":0.05435871230586371,"score_gpt":0.25239604860623904,"score_spread":0.19803733630037534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145855346","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.019772602,0.0033868332,0.7463093,0.035836723,0.0006513718,0.00023213199,0.000404392,0.00029897722,0.19310777],"genre_scores_gemma":[0.6458333,0.0022178935,0.32818785,0.0067946315,0.0009777423,0.0007235731,0.0007775372,0.0002460892,0.014241378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97538054,0.015624857,0.0015797794,0.0023556778,0.0040020635,0.001057082],"domain_scores_gemma":[0.95555997,0.029476399,0.003587716,0.00675798,0.0036983772,0.0009195468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026787749,0.00089638267,0.0011940013,0.0061690267,0.00439744,0.011910862,0.0036063811,0.006050908,0.00723425],"category_scores_gemma":[0.04895095,0.0010308429,0.0016947468,0.0043045618,0.02511769,0.028739769,0.008188022,0.0074945316,0.0014422506],"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.0000034553025,0.000002025333,0.00004431586,0.00001825235,0.0000030488022,0.000022550255,0.000351535,0.00017251265,0.00001844151,0.9973591,0.0005527656,0.0014520168],"study_design_scores_gemma":[0.0000034497657,0.0000019075558,0.000029179399,0.00004289949,0.0000029763155,0.000026991012,0.00013872526,0.00076356187,0.000061719795,0.99059135,0.008333511,0.0000037436926],"about_ca_topic_score_codex":0.0014813669,"about_ca_topic_score_gemma":0.001570443,"teacher_disagreement_score":0.026787749,"about_ca_system_score_codex":0.004935387,"about_ca_system_score_gemma":0.0023269064,"threshold_uncertainty_score":0.1416688},"labels":[],"label_agreement":null},{"id":"W2146474977","doi":"10.1111/nous.12111","title":"Triviality For Restrictor Conditionals","year":2015,"lang":"en","type":"article","venue":"Noûs","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":36,"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 Toronto","funders":"","keywords":"Triviality; Semantics (computer science); Mathematics; Computer science; Pure mathematics; Programming language","score_opus":0.11085560812688953,"score_gpt":0.31862410390284396,"score_spread":0.2077684957759544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146474977","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.063452005,0.0008261353,0.838788,0.0048997807,0.00021734995,0.00017934834,0.00039075,0.002145355,0.08910132],"genre_scores_gemma":[0.88914514,0.0009991236,0.09117765,0.0019939204,0.0006371074,0.00033865604,0.0007500956,0.0007346424,0.014223578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99072635,0.0033599827,0.00070727913,0.002048267,0.0018824829,0.0012756054],"domain_scores_gemma":[0.9778946,0.013351441,0.0013243402,0.0036181062,0.0031739047,0.0006377065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007833988,0.0010356515,0.0012719841,0.0046088677,0.0049544675,0.005518556,0.002817169,0.00248254,0.01376979],"category_scores_gemma":[0.025751946,0.0012842854,0.004125888,0.0026556815,0.015489971,0.023789167,0.009515206,0.007160408,0.0020299146],"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.000021961427,0.000009511533,0.00027338695,0.00003655443,0.000013115042,0.000101696496,0.00045128624,0.00028978483,0.00030244992,0.99545753,0.00074801664,0.0022947402],"study_design_scores_gemma":[0.000009636395,0.000014201103,0.00024234159,0.00002916955,0.000036981462,0.00015831701,0.00019658105,0.0030097761,0.0013908552,0.9897113,0.005170735,0.000030102035],"about_ca_topic_score_codex":0.0021875822,"about_ca_topic_score_gemma":0.0013504976,"teacher_disagreement_score":0.01376979,"about_ca_system_score_codex":0.0029533415,"about_ca_system_score_gemma":0.0019194876,"threshold_uncertainty_score":0.046064496},"labels":[],"label_agreement":null},{"id":"W2146782276","doi":"10.1145/2535838.2535858","title":"Consistency analysis of decision-making programs","year":2014,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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 Toronto","funders":"","keywords":"Nondeterministic algorithm; Computer science; Consistency (knowledge bases); Semantics (computer science); Ideal (ethics); Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.014767737436996211,"score_gpt":0.26543117408861794,"score_spread":0.2506634366516217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146782276","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.058994178,0.00030620728,0.9332983,0.0009913351,0.00004102654,0.00019032382,0.00039760608,0.0006407613,0.0051403237],"genre_scores_gemma":[0.7412909,0.00027342673,0.25357464,0.00029415436,0.00015152358,0.00048230294,0.0011199046,0.00029969442,0.0025134974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98616064,0.0049746553,0.0008980785,0.002069145,0.0047998964,0.0010975023],"domain_scores_gemma":[0.93765914,0.047490433,0.003503069,0.0040555047,0.006473797,0.0008179815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010942803,0.0007520359,0.0011381366,0.002579899,0.0012589397,0.003616467,0.002819557,0.0013295639,0.0030436171],"category_scores_gemma":[0.051476132,0.0008964681,0.0018177632,0.00198917,0.004142597,0.0043261955,0.002440737,0.0031525507,0.0003464803],"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.00040906903,0.00014637463,0.0055669346,0.00033435645,0.0002516781,0.00044229013,0.0008951449,0.17914803,0.0025459286,0.76838,0.0018283459,0.040051863],"study_design_scores_gemma":[0.00006020338,0.000049588114,0.00050553936,0.000049914597,0.00006249722,0.00007430086,0.00010091164,0.36917493,0.0028456934,0.62483054,0.002222736,0.00002304549],"about_ca_topic_score_codex":0.0033916624,"about_ca_topic_score_gemma":0.0016841014,"teacher_disagreement_score":0.010942803,"about_ca_system_score_codex":0.0027509322,"about_ca_system_score_gemma":0.0037109638,"threshold_uncertainty_score":0.05787176},"labels":[],"label_agreement":null},{"id":"W2147003847","doi":"10.1109/icif.2005.1591960","title":"A general algebraic structure for situation analysis","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Algebraic number; Presentation (obstetrics); Theoretical computer science; Blueprint; Algebraic structure; Key (lock); Formal methods; Mathematics; Programming language","score_opus":0.011350339408145038,"score_gpt":0.25034089499074536,"score_spread":0.23899055558260032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147003847","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.006024891,0.0013222849,0.9463523,0.0024222606,0.00019961917,0.00010134032,0.0003249385,0.00029020742,0.042962197],"genre_scores_gemma":[0.42861396,0.002950462,0.5504859,0.0009110817,0.00071654026,0.0006642974,0.00074936566,0.00014629672,0.014762106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719703,0.0009946025,0.00028552147,0.00058979867,0.0007021608,0.0002308139],"domain_scores_gemma":[0.9976234,0.0010356475,0.00031638794,0.000382569,0.0004563039,0.00018576017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030588808,0.0009312433,0.0007898915,0.0028041997,0.002497336,0.007027547,0.0016627659,0.0014765032,0.008892268],"category_scores_gemma":[0.005222127,0.0005920034,0.00261468,0.0028050975,0.0084895855,0.014864116,0.0043663294,0.0039262683,0.0017616928],"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.000002646456,0.000002467479,0.000032030202,0.000019681342,0.0000036281385,0.000015808313,0.00013339733,0.000549321,0.000059295617,0.99701935,0.00023253748,0.0019298398],"study_design_scores_gemma":[0.0000057310485,0.00001061607,0.000039637223,0.00002148353,0.00000685897,0.00005796893,0.00010467707,0.0044749663,0.000082876526,0.98151577,0.013670652,0.000008781252],"about_ca_topic_score_codex":0.0030225425,"about_ca_topic_score_gemma":0.001685578,"teacher_disagreement_score":0.008892268,"about_ca_system_score_codex":0.0035215355,"about_ca_system_score_gemma":0.0017954311,"threshold_uncertainty_score":0.029747605},"labels":[],"label_agreement":null},{"id":"W2148856926","doi":"","title":"Loop formulas for logic programs with arbitrary constraint atoms","year":2008,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Constraint (computer-aided design); Computer science; Constraint satisfaction; Constraint satisfaction problem; Set (abstract data type); Semantics (computer science); Constraint logic programming; Theoretical computer science; Loop (graph theory); Connection (principal bundle); Computation; Encoding (memory); Task (project management); Stable model semantics; Discrete mathematics; Algorithm; Mathematics; Programming language; Combinatorics; Operational semantics; Artificial intelligence","score_opus":0.03727958682741188,"score_gpt":0.2414199814649113,"score_spread":0.20414039463749944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148856926","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.008749605,0.00022457377,0.98028886,0.00059988885,0.000112439746,0.000111668945,0.00043693962,0.00047625223,0.008999857],"genre_scores_gemma":[0.33528522,0.00074151246,0.6518755,0.0009930538,0.00031141748,0.00065153476,0.0013978316,0.0005426183,0.008201261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989618,0.0002001227,0.00008878342,0.00015930054,0.00043177514,0.00015810759],"domain_scores_gemma":[0.998396,0.00077766785,0.00024336272,0.00017148329,0.00034581198,0.00006562756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015194417,0.0009366812,0.00057770615,0.0014303991,0.00078006485,0.0025835067,0.0017878346,0.0012409261,0.006181991],"category_scores_gemma":[0.0047061406,0.00041152452,0.0013361953,0.0014906547,0.0021718133,0.0052540596,0.0016865308,0.0029327718,0.0011910888],"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.000021761547,0.000022988675,0.00020127265,0.00011888821,0.0000128864185,0.0001208776,0.0002071514,0.0061332085,0.0014323617,0.9731723,0.002034404,0.01652198],"study_design_scores_gemma":[0.000021233338,0.000024350922,0.00009884072,0.00005215648,0.000032393404,0.00011458138,0.000080531856,0.06869248,0.002562313,0.9159338,0.012367946,0.000019465306],"about_ca_topic_score_codex":0.0019901632,"about_ca_topic_score_gemma":0.0031834396,"teacher_disagreement_score":0.006181991,"about_ca_system_score_codex":0.0015446888,"about_ca_system_score_gemma":0.0010134933,"threshold_uncertainty_score":0.020680785},"labels":[],"label_agreement":null},{"id":"W2149618674","doi":"10.1109/ismvl.2012.46","title":"Counting Predicates, Subset Surjective Functions, and Counting CSPs","year":2012,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Closure operator; Surjective function; Closure (psychology); Mathematics; Partial function; Counting problem; Constraint satisfaction problem; Operator (biology); Galois connection; Set (abstract data type); Discrete mathematics; Type (biology); Distributive property; Invariant (physics); Partially ordered set; Algebra over a field; Closed set; Computer science; Pure mathematics; Programming language","score_opus":0.015242394752017755,"score_gpt":0.22598053530609977,"score_spread":0.21073814055408202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149618674","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.364898,0.00062083785,0.6262866,0.0008587087,0.000044865257,0.00006657217,0.00022523449,0.0005000027,0.006499159],"genre_scores_gemma":[0.856044,0.0004064649,0.14018047,0.00023392684,0.000096203636,0.0001412762,0.00033303493,0.00010379846,0.002460807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967956,0.0007772996,0.00021419184,0.00081564503,0.000963855,0.0004334017],"domain_scores_gemma":[0.9903594,0.006190138,0.0010438738,0.0014449363,0.00047459107,0.00048701692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027585707,0.0008000691,0.0010168973,0.0016956022,0.0012177733,0.0034282566,0.0016846139,0.0008171721,0.0022367234],"category_scores_gemma":[0.009582597,0.0004896902,0.0020185576,0.002487495,0.0041482267,0.009809001,0.0031105753,0.0030586352,0.00018186824],"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.0001463123,0.00007962186,0.0022695314,0.00012736222,0.00003801197,0.00017279272,0.00062672043,0.016759781,0.0061289943,0.9484837,0.0004884247,0.024678838],"study_design_scores_gemma":[0.000029867891,0.000119395714,0.00147593,0.00003360008,0.000086749315,0.00040998857,0.0002906161,0.11437249,0.012541032,0.8664565,0.0041314466,0.000052370717],"about_ca_topic_score_codex":0.0021617098,"about_ca_topic_score_gemma":0.0013661564,"teacher_disagreement_score":0.0034282566,"about_ca_system_score_codex":0.0021947497,"about_ca_system_score_gemma":0.001308149,"threshold_uncertainty_score":0.015924096},"labels":[],"label_agreement":null},{"id":"W2150877227","doi":"10.3765/bls.v40i0.3157","title":"Stative versus Eventive Predicates and vP-internal Structure","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Annual Meeting of the Berkeley Linguistics Society","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Linguistics; Computer science; Psychology; Philosophy","score_opus":0.007884930574373585,"score_gpt":0.23354797123486282,"score_spread":0.22566304066048923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150877227","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.076976575,0.014952609,0.021633508,0.011970224,0.0013331665,0.00007453328,0.001830028,0.0002606262,0.8709687],"genre_scores_gemma":[0.9197481,0.010846203,0.005516128,0.00068755494,0.0012119961,0.00006745745,0.0029329145,0.00018100558,0.058808602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944276,0.0002357432,0.000036595568,0.000111927126,0.00010349405,0.000069437774],"domain_scores_gemma":[0.9980532,0.0012979412,0.00016947559,0.00019297951,0.00018122682,0.00010529262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011474082,0.00048295376,0.0005809831,0.00083295966,0.0014765756,0.0058289915,0.0010390686,0.0017149647,0.06995327],"category_scores_gemma":[0.0036277163,0.00032908304,0.00045912756,0.0015201697,0.0027845125,0.0066190665,0.0021363818,0.0020633808,0.0061066253],"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.0003219335,0.00008114386,0.0011251221,0.00049137336,0.00004115011,0.00041478017,0.0013864443,0.00030877625,0.0027388132,0.93517244,0.019646468,0.038271427],"study_design_scores_gemma":[0.00007484637,0.00008920803,0.005459281,0.00058617425,0.000116768264,0.000741619,0.0015307391,0.0015592832,0.0030827352,0.899626,0.087099634,0.00003373204],"about_ca_topic_score_codex":0.0016485662,"about_ca_topic_score_gemma":0.0028533265,"teacher_disagreement_score":0.06995327,"about_ca_system_score_codex":0.0011160307,"about_ca_system_score_gemma":0.0005825709,"threshold_uncertainty_score":0.23401695},"labels":[],"label_agreement":null},{"id":"W2151561403","doi":"","title":"A Surprise-Based Qualitative Probability Calculus II","year":2010,"lang":"en","type":"article","venue":"The Florida AI Research Society","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 Windsor","funders":"","keywords":"Surprise; Ranking (information retrieval); Commit; Computer science; Continuation; Function (biology); Abstraction; Artificial intelligence; Epistemology; Psychology","score_opus":0.09068551896578436,"score_gpt":0.40948646247543513,"score_spread":0.31880094350965077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151561403","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.0066228556,0.00016985566,0.97778624,0.0010421782,0.00011872919,0.000059245125,0.00018841747,0.0004337586,0.01357877],"genre_scores_gemma":[0.5486731,0.0004438332,0.43813753,0.0008783742,0.0003762229,0.0002933571,0.00025466192,0.00024214914,0.010700763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997595,0.00061804027,0.00017862732,0.0003821886,0.0010095183,0.00021663931],"domain_scores_gemma":[0.9955622,0.0023339696,0.00037785308,0.00054655795,0.00086074776,0.00031861934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004655024,0.00051105546,0.0006485735,0.0018067377,0.0014576183,0.0043413015,0.0016023917,0.0011071106,0.0048795696],"category_scores_gemma":[0.010457514,0.00048843806,0.0017791359,0.0013178318,0.0041117957,0.006334952,0.0027593474,0.0031840282,0.00078909675],"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.000011316031,0.0000060681646,0.0001069374,0.000024737827,0.000005032835,0.000046232828,0.00014244353,0.004501342,0.00039442157,0.989116,0.0004905749,0.005154904],"study_design_scores_gemma":[0.000007515797,0.000011140312,0.000057883193,0.000012859,0.000009639353,0.000045904755,0.00003785137,0.044766445,0.0004647053,0.9500846,0.0044872137,0.000014217132],"about_ca_topic_score_codex":0.0027402446,"about_ca_topic_score_gemma":0.001915385,"teacher_disagreement_score":0.0048795696,"about_ca_system_score_codex":0.0028094195,"about_ca_system_score_gemma":0.001948112,"threshold_uncertainty_score":0.024618387},"labels":[],"label_agreement":null},{"id":"W2151708137","doi":"10.1007/978-3-540-72200-7_25","title":"Using Answer Sets to Solve Belief Change Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Computer science; Path (computing); Transition (genetics); Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.08867244043153139,"score_gpt":0.3034429093995342,"score_spread":0.21477046896800284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151708137","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.015236605,0.0003187929,0.97526324,0.0009889595,0.00016574982,0.0001733882,0.00018750023,0.0011862201,0.0064794915],"genre_scores_gemma":[0.2996513,0.00026380483,0.6919358,0.00054258696,0.00022005361,0.00050949946,0.0009662813,0.00030149586,0.0056091524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960537,0.0017621104,0.0002801633,0.0005186396,0.0010712455,0.00031412428],"domain_scores_gemma":[0.9808383,0.016755393,0.00045364266,0.00087780756,0.0008305729,0.0002442432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049144733,0.0012840604,0.0016168393,0.0015388868,0.0012249396,0.002871594,0.0036809545,0.0027010401,0.010230228],"category_scores_gemma":[0.030547356,0.0010232453,0.0023055617,0.0011093382,0.0021714752,0.0060000513,0.003913067,0.0052782763,0.001199257],"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.00079907884,0.00069846405,0.0013293363,0.00069817906,0.00034658783,0.00027922593,0.0012240038,0.21930826,0.0028612812,0.3626063,0.015159634,0.39468968],"study_design_scores_gemma":[0.00012731178,0.00005617851,0.0001298323,0.00005057568,0.000067369925,0.00003386061,0.00010358649,0.4370056,0.0017119668,0.5579234,0.002764764,0.000025524765],"about_ca_topic_score_codex":0.0036212949,"about_ca_topic_score_gemma":0.0043222024,"teacher_disagreement_score":0.010230228,"about_ca_system_score_codex":0.0014419106,"about_ca_system_score_gemma":0.0011336743,"threshold_uncertainty_score":0.034223497},"labels":[],"label_agreement":null},{"id":"W2151965800","doi":"","title":"Tractable reasoning in first-order knowledge bases with disjunctive information","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"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 Toronto","funders":"","keywords":"Decidability; Bounded function; Computer science; Knowledge base; Theoretical computer science; Description logic; Circumscription; Order (exchange); Propositional calculus; Situation calculus; Non-monotonic logic; Action (physics); Base (topology); Artificial intelligence; Mathematics; Programming language","score_opus":0.007595747985419319,"score_gpt":0.21694047255306015,"score_spread":0.20934472456764083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151965800","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.042000428,0.0004015843,0.95011735,0.0013609191,0.000019815052,0.00011907562,0.00040042875,0.0011266076,0.0044538807],"genre_scores_gemma":[0.54259336,0.0008802187,0.45070356,0.00051608944,0.00016137659,0.00032844947,0.0013019787,0.00023823486,0.0032767062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98955977,0.0027174274,0.0007682259,0.0016876286,0.004019101,0.0012479613],"domain_scores_gemma":[0.9490477,0.042247474,0.002204082,0.004498289,0.0015311562,0.00047120565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008688409,0.000998022,0.002081209,0.002717954,0.0022847827,0.008473934,0.0039357776,0.0019814114,0.0034591998],"category_scores_gemma":[0.03408226,0.0015021203,0.0052561183,0.0030661558,0.0049891816,0.01736781,0.0047118035,0.0062341294,0.0006134546],"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.00033700996,0.00027328022,0.0011102768,0.00063051825,0.0002773447,0.0008248776,0.00104109,0.20664456,0.0051030936,0.7458829,0.0016602075,0.036214832],"study_design_scores_gemma":[0.00009809976,0.000035244484,0.00021359221,0.00004024229,0.00010570184,0.00019658508,0.00011303398,0.35370404,0.0064800233,0.63643086,0.0025453006,0.000037180143],"about_ca_topic_score_codex":0.011752213,"about_ca_topic_score_gemma":0.011522919,"teacher_disagreement_score":0.011752213,"about_ca_system_score_codex":0.005731646,"about_ca_system_score_gemma":0.0038011214,"threshold_uncertainty_score":0.04594922},"labels":[],"label_agreement":null},{"id":"W2154093507","doi":"10.1016/j.jcss.2006.10.013","title":"First-order query rewriting for inconsistent databases","year":2006,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rewriting; Computer science; Conjunctive query; Boolean conjunctive query; Class (philosophy); Set (abstract data type); Query language; Query optimization; Database; Sargable; Order (exchange); Data integrity; Database query; Theoretical computer science; Information retrieval; Web search query; Relational database; Programming language; Search engine; Artificial intelligence","score_opus":0.03061450247099549,"score_gpt":0.26054316029865665,"score_spread":0.22992865782766117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154093507","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.03263834,0.0011676179,0.95491856,0.0019216915,0.00023294259,0.00021272847,0.00050427334,0.002489003,0.0059149005],"genre_scores_gemma":[0.4441048,0.00081173255,0.5435937,0.0010206645,0.00030010287,0.00017136191,0.0016850347,0.0011537025,0.007158902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98366356,0.0050633326,0.0021181013,0.0015334376,0.0063673826,0.0012541958],"domain_scores_gemma":[0.9623588,0.020094912,0.0013478427,0.009933002,0.0056580245,0.00060746935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012986017,0.0006641238,0.002112208,0.001890118,0.0018146052,0.0048334496,0.0039438778,0.001957653,0.00333284],"category_scores_gemma":[0.036224015,0.001299047,0.0026943511,0.0021450408,0.0032436007,0.008540692,0.0042809597,0.00433209,0.00073404034],"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.0005376618,0.0002518532,0.0032647864,0.0008755242,0.00032704175,0.0016605343,0.0031244436,0.028342875,0.010199618,0.82317156,0.014288161,0.11395583],"study_design_scores_gemma":[0.00013830877,0.00009231028,0.00045362074,0.00008388483,0.00033461183,0.0010664272,0.0006352197,0.15463392,0.0155035695,0.809095,0.017858312,0.00010478347],"about_ca_topic_score_codex":0.005258131,"about_ca_topic_score_gemma":0.004889467,"teacher_disagreement_score":0.012986017,"about_ca_system_score_codex":0.0023136982,"about_ca_system_score_gemma":0.002961481,"threshold_uncertainty_score":0.068677425},"labels":[],"label_agreement":null},{"id":"W2154595228","doi":"10.1145/1183278.1183279","title":"Domain-dependent knowledge in answer set planning","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":60,"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 Toronto","funders":"","keywords":"Computer science; Planner; Answer set programming; Correctness; Domain (mathematical analysis); Domain knowledge; Plan (archaeology); Logic programming; Set (abstract data type); Control (management); Semantics (computer science); Modular design; Programming language; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02998419991651737,"score_gpt":0.2864637845921789,"score_spread":0.25647958467566156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154595228","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.017873432,0.00027488035,0.9740475,0.00048247422,0.000024789419,0.000089131805,0.000057494668,0.00035124324,0.006799094],"genre_scores_gemma":[0.5282831,0.00050656847,0.46685317,0.00028567453,0.00006932073,0.00024775043,0.00024018314,0.00013618538,0.0033780092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965714,0.0013764551,0.00020691758,0.00047605456,0.0010982715,0.00027076466],"domain_scores_gemma":[0.9896119,0.008502368,0.00039667834,0.0009090741,0.00040280216,0.00017712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044533177,0.0006044397,0.0005788234,0.00092985266,0.0009492981,0.0022002126,0.0019568084,0.0013590908,0.0028459541],"category_scores_gemma":[0.012714415,0.00072387425,0.0010192513,0.0009103588,0.0044026077,0.005283163,0.0027163248,0.0022169042,0.00038274043],"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.00027337053,0.00014764289,0.0011660412,0.0004646993,0.00006662851,0.0006588993,0.0013435509,0.31413892,0.006204916,0.5718476,0.0011560707,0.10253154],"study_design_scores_gemma":[0.000061165156,0.00008808933,0.00029764872,0.000085226726,0.000059502672,0.00019970007,0.000202702,0.44925818,0.009789603,0.5306237,0.0092938095,0.00004077879],"about_ca_topic_score_codex":0.003475498,"about_ca_topic_score_gemma":0.0038560356,"teacher_disagreement_score":0.0044533177,"about_ca_system_score_codex":0.0014403433,"about_ca_system_score_gemma":0.0017267072,"threshold_uncertainty_score":0.023551643},"labels":[],"label_agreement":null},{"id":"W2155378065","doi":"10.1609/aaai.v29i1.9398","title":"asprin: Customizing Answer Set Preferences without a Headache","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Preference; Computer science; Set (abstract data type); Dominance (genetics); Logic program; Extensibility; Artificial intelligence; Theoretical computer science; Machine learning; Logic programming; Mathematics; Programming language","score_opus":0.16490016425506848,"score_gpt":0.3202468155818483,"score_spread":0.15534665132677983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155378065","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.009499313,0.0000931833,0.9743062,0.00023356611,0.00006987918,0.00025141813,0.00034269187,0.009731931,0.0054717762],"genre_scores_gemma":[0.17909485,0.0001767834,0.80557865,0.00062977494,0.00007807495,0.00050996523,0.0015074788,0.0026252978,0.009799047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940818,0.0018855677,0.00051733013,0.0009806859,0.0020695503,0.0004649577],"domain_scores_gemma":[0.99359363,0.002573073,0.0002301872,0.0025142445,0.00082076364,0.0002681518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007811057,0.0009939153,0.000910596,0.0012867423,0.00082224223,0.0030086867,0.0033098813,0.001275053,0.013980957],"category_scores_gemma":[0.019598573,0.00084763765,0.0014391649,0.0010959875,0.0012569526,0.008682886,0.0067420388,0.0029018305,0.003435525],"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.0015188253,0.0005022943,0.0022736876,0.0005630716,0.00014792162,0.00040323354,0.0011448328,0.03322285,0.021066446,0.26290503,0.022338316,0.6539135],"study_design_scores_gemma":[0.00023561533,0.00038415764,0.00069474016,0.00016317025,0.000102701255,0.00048707135,0.00046051567,0.47424206,0.036430493,0.3818781,0.104797624,0.0001237961],"about_ca_topic_score_codex":0.0010719835,"about_ca_topic_score_gemma":0.0020079424,"teacher_disagreement_score":0.013980957,"about_ca_system_score_codex":0.0009968764,"about_ca_system_score_gemma":0.0012306155,"threshold_uncertainty_score":0.04677093},"labels":[],"label_agreement":null},{"id":"W2156474728","doi":"10.1016/j.artint.2014.08.006","title":"Belief revision in Horn theories","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Belief revision; French horn; Horn clause; Iterated function; Mathematics; Representation (politics); Inference; Relevance (law); Logic programming; Algorithm; Computer science; Algebra over a field; Artificial intelligence; Pure mathematics","score_opus":0.028501850449163646,"score_gpt":0.2806735463121939,"score_spread":0.25217169586303023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156474728","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.09423985,0.007443486,0.8247896,0.009853581,0.0004508373,0.00014335118,0.00038810977,0.00040832433,0.062283006],"genre_scores_gemma":[0.88088334,0.0022699726,0.102778606,0.0009668835,0.0007782612,0.00018697981,0.00047298858,0.00008882476,0.011574183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932967,0.0039970395,0.0003373627,0.0005149959,0.0014197906,0.00043418107],"domain_scores_gemma":[0.9657894,0.028291278,0.001134645,0.0020051599,0.0022262458,0.0005532943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008801711,0.0005867886,0.0012766497,0.0022052557,0.0015558944,0.005495979,0.00173275,0.0018347122,0.0059623714],"category_scores_gemma":[0.0351727,0.0007901374,0.0014959972,0.0022703314,0.0052472176,0.009843514,0.002734897,0.00522873,0.00053951744],"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.000088256915,0.000035200916,0.00038846917,0.00009122781,0.000044241282,0.00006669546,0.0003452641,0.003334026,0.00017781371,0.979391,0.0014913753,0.014546487],"study_design_scores_gemma":[0.00001545072,0.000006361187,0.00007028349,0.000014729886,0.000011843373,0.000017722045,0.0000342,0.01068662,0.000073970135,0.9885649,0.0004985813,0.000005306143],"about_ca_topic_score_codex":0.002882051,"about_ca_topic_score_gemma":0.002336795,"teacher_disagreement_score":0.008801711,"about_ca_system_score_codex":0.002598124,"about_ca_system_score_gemma":0.0014703562,"threshold_uncertainty_score":0.046548486},"labels":[],"label_agreement":null},{"id":"W2159100004","doi":"10.1016/j.is.2008.01.005","title":"The complexity and approximation of fixing numerical attributes in databases under integrity constraints","year":2008,"lang":"en","type":"article","venue":"Information Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Data integrity; Conjunctive query; Consistency (knowledge bases); Semantics (computer science); Computational complexity theory; Approximation algorithm; Aggregate (composite); Theoretical computer science; Time complexity; Relational database; Algorithm; Artificial intelligence; Programming language","score_opus":0.10078243575120967,"score_gpt":0.2798962895402359,"score_spread":0.17911385378902622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159100004","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.2091035,0.003487328,0.7596431,0.014121178,0.00027836845,0.00023419544,0.0013347446,0.0015931731,0.0102044735],"genre_scores_gemma":[0.72432476,0.0024643282,0.26457295,0.0011613667,0.0005887968,0.00023900991,0.0016391677,0.00058873784,0.004420809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9763698,0.009628555,0.002018114,0.0029893867,0.0069523156,0.0020418272],"domain_scores_gemma":[0.78063756,0.1849755,0.006889088,0.021304665,0.004352477,0.0018406992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015240541,0.0013909467,0.0045005223,0.0031047417,0.002828511,0.013348566,0.008031937,0.005782464,0.0067871604],"category_scores_gemma":[0.15505262,0.0025727896,0.0042371065,0.0077025937,0.008751255,0.037448615,0.00842388,0.007959457,0.0009261341],"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.0024604022,0.00036524222,0.009293603,0.00088659034,0.00035307638,0.00032397485,0.0020274175,0.47284666,0.0019087748,0.36693153,0.007907336,0.1346953],"study_design_scores_gemma":[0.00011136674,0.000057215155,0.0005793527,0.0000678004,0.00013448826,0.00013759645,0.0003155245,0.5049471,0.00096727256,0.4913793,0.0012597146,0.000043298787],"about_ca_topic_score_codex":0.015262619,"about_ca_topic_score_gemma":0.010052606,"teacher_disagreement_score":0.015262619,"about_ca_system_score_codex":0.008160215,"about_ca_system_score_gemma":0.006759237,"threshold_uncertainty_score":0.08060062},"labels":[],"label_agreement":null},{"id":"W2161931079","doi":"","title":"On the progression of situation calculus basic action theories: resolving a 10-year-old conjecture","year":2008,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":29,"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 Toronto","funders":"","keywords":"Conjecture; Axiom; Action (physics); Situation calculus; Class (philosophy); Mathematics; Order (exchange); Calculus (dental); Mathematical economics; Simplicity; Computer science; Algebra over a field; Epistemology; Pure mathematics; Artificial intelligence; Philosophy","score_opus":0.05303353946653421,"score_gpt":0.3074726919626472,"score_spread":0.254439152496113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161931079","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.110928275,0.00905165,0.69224894,0.068195395,0.0018401516,0.00021697085,0.0010417113,0.0013294371,0.11514753],"genre_scores_gemma":[0.79174143,0.007753274,0.17392266,0.004797597,0.0027203006,0.00036134885,0.0009578951,0.0003971855,0.017348375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99399865,0.0021092324,0.00049160334,0.0013553374,0.0015305282,0.0005146216],"domain_scores_gemma":[0.9686613,0.022321464,0.0012696065,0.004090201,0.0026035134,0.0010538977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01692893,0.0011651197,0.0014208163,0.0030169627,0.0034825734,0.0062135346,0.003257363,0.0047108177,0.0073683956],"category_scores_gemma":[0.033385776,0.0011857925,0.0022877532,0.0026982643,0.020355612,0.052916963,0.008518706,0.012459031,0.0015609405],"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.000024922962,0.000008389368,0.00008545664,0.000040551564,0.0000041290946,0.00003845681,0.00038789792,0.0007404813,0.000063971114,0.9943521,0.00068105245,0.0035725816],"study_design_scores_gemma":[0.00001439681,0.00001080129,0.000033661243,0.00003472609,0.0000033559777,0.000024913064,0.00005593547,0.0019054451,0.00008773581,0.99438864,0.0034322077,0.000008183982],"about_ca_topic_score_codex":0.0031333952,"about_ca_topic_score_gemma":0.0015546846,"teacher_disagreement_score":0.01692893,"about_ca_system_score_codex":0.0042224894,"about_ca_system_score_gemma":0.0032771481,"threshold_uncertainty_score":0.08952981},"labels":[],"label_agreement":null},{"id":"W21619706","doi":"10.1186/1472-6963-11-134","title":"Rules, Defaults, and the Meta-level of Informal Logic","year":2003,"lang":"en","type":"article","venue":"BMC Health Services Research","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 Windsor","funders":"","keywords":"Default; Computer science; Business","score_opus":0.2053773328589518,"score_gpt":0.4085598602310278,"score_spread":0.203182527372076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21619706","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.09257089,0.006039433,0.8421772,0.009568794,0.0002719517,0.00027359,0.0014692892,0.0018478706,0.04578093],"genre_scores_gemma":[0.69750595,0.0018907953,0.29334205,0.0013846455,0.00021440274,0.0002330036,0.0014203968,0.00019342742,0.0038152758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886197,0.0053315726,0.001960509,0.0015908014,0.001840239,0.000657213],"domain_scores_gemma":[0.96407604,0.024506424,0.0031418558,0.00478862,0.0024443842,0.0010426926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014749325,0.0007782736,0.0010432543,0.004084817,0.001991084,0.009055756,0.0029372398,0.0018470725,0.0038894576],"category_scores_gemma":[0.024842916,0.0010941451,0.0022844805,0.0024862837,0.009780491,0.015092661,0.004370861,0.003108655,0.00082194293],"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.00010760863,0.000036580757,0.003155751,0.00029179096,0.000097517615,0.00045881345,0.0015812295,0.0039744545,0.0006466785,0.9615237,0.001787056,0.02633882],"study_design_scores_gemma":[0.000030382049,0.000017416869,0.00052425155,0.00014536188,0.000059480284,0.00017519463,0.00025457435,0.0073649096,0.0005339156,0.9829217,0.007943099,0.000029626413],"about_ca_topic_score_codex":0.0055319555,"about_ca_topic_score_gemma":0.004360833,"teacher_disagreement_score":0.014749325,"about_ca_system_score_codex":0.00374907,"about_ca_system_score_gemma":0.0024556594,"threshold_uncertainty_score":0.07800281},"labels":[],"label_agreement":null},{"id":"W2162068502","doi":"10.1111/j.0824-7935.2004.00240.x","title":"A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; European Commission","keywords":"Preference; Artificial intelligence; Set (abstract data type); Variety (cybernetics); Computer science; Representation (politics); Machine learning; Qualitative reasoning; Mathematics; Statistics","score_opus":0.19677730184830175,"score_gpt":0.30447294138072617,"score_spread":0.10769563953242442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162068502","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011186498,0.598737,0.33717367,0.007660891,0.000751646,0.000301338,0.00015679197,0.0003433268,0.043688864],"genre_scores_gemma":[0.08764725,0.59469247,0.3054665,0.0023165848,0.0031646648,0.00048117532,0.0005098025,0.00014863347,0.0055729477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940236,0.0018878917,0.00072289194,0.00080910156,0.0021453714,0.00041103933],"domain_scores_gemma":[0.99094474,0.0060886503,0.0005239612,0.00078055996,0.0014052653,0.00025690574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009541159,0.0011474852,0.0018172477,0.0109015405,0.0019047201,0.0062725293,0.003499557,0.0025920086,0.003284272],"category_scores_gemma":[0.008072882,0.0011860337,0.0020835884,0.018466283,0.0034694048,0.009749989,0.002401533,0.0037951244,0.0010161903],"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.00013698805,0.00028226798,0.0022769088,0.004581614,0.0001369145,0.00024299129,0.0013879149,0.0034487236,0.0008887197,0.33475578,0.007776285,0.644085],"study_design_scores_gemma":[0.00010293035,0.0004186233,0.004860188,0.0056811166,0.00026553977,0.0022146017,0.0021267883,0.030179918,0.0026070792,0.59858614,0.35271174,0.0002452607],"about_ca_topic_score_codex":0.0021400412,"about_ca_topic_score_gemma":0.0021793137,"teacher_disagreement_score":0.0109015405,"about_ca_system_score_codex":0.0029881187,"about_ca_system_score_gemma":0.0024983992,"threshold_uncertainty_score":0.050459027},"labels":[],"label_agreement":null},{"id":"W2162446442","doi":"10.1007/978-3-642-30743-0_29","title":"The Truth about Defaults","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Default; Artificial intelligence; Finance; Business","score_opus":0.016012102116677206,"score_gpt":0.23975165715641353,"score_spread":0.22373955503973633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162446442","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.034012925,0.01916888,0.1456348,0.048262913,0.0016918436,0.000062990526,0.0011465149,0.00031603943,0.74970305],"genre_scores_gemma":[0.90526205,0.006765049,0.029747447,0.004901892,0.0028524518,0.00015774411,0.0009889047,0.0002556309,0.04906891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962256,0.0014496535,0.0002810003,0.0009958307,0.00079655135,0.00025137732],"domain_scores_gemma":[0.9932903,0.004699606,0.00023405971,0.0011022545,0.00051747286,0.000156224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004780507,0.0006149972,0.0010732797,0.0018167893,0.00263436,0.0072097704,0.0016976859,0.005132976,0.0145064425],"category_scores_gemma":[0.014299829,0.0013489769,0.0010232306,0.0014626614,0.014499667,0.025356358,0.0029142809,0.008243876,0.0024787853],"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.000020521053,0.0000058763585,0.00006725624,0.0000325584,0.0000046750793,0.000026258216,0.00028153724,0.00010981798,0.0000909484,0.9916821,0.0023803113,0.0052980823],"study_design_scores_gemma":[0.000005154889,0.0000020434534,0.00003505388,0.000021073878,0.0000030419417,0.000025408848,0.000043339296,0.00015727869,0.000058637896,0.99428564,0.0053606736,0.0000027974334],"about_ca_topic_score_codex":0.0009885357,"about_ca_topic_score_gemma":0.00079259765,"teacher_disagreement_score":0.0145064425,"about_ca_system_score_codex":0.002541892,"about_ca_system_score_gemma":0.001048204,"threshold_uncertainty_score":0.04852885},"labels":[],"label_agreement":null},{"id":"W2163037973","doi":"10.2307/2586689","title":"On the role of implication in formal logic","year":2000,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Finitary; Negation; Mathematics; Proof calculus; Second-order logic; Non-classical logic; Classical logic; Higher-order logic; Predicate logic; Computer science; Discrete mathematics; Calculus (dental); Programming language; Logical consequence; Natural deduction; Description logic; Artificial intelligence","score_opus":0.012738441753293799,"score_gpt":0.2407078262733269,"score_spread":0.2279693845200331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163037973","genre_codex":"methods","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.18834881,0.0075596655,0.63443685,0.01653398,0.0006022624,0.00008309877,0.00015774128,0.0008369986,0.15144067],"genre_scores_gemma":[0.9542544,0.001041441,0.040070523,0.00075464585,0.00027890442,0.000041361844,0.00004441657,0.00005956225,0.0034547665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973375,0.0013328213,0.00015487878,0.00029028062,0.0005737775,0.00031069823],"domain_scores_gemma":[0.98815364,0.009358086,0.00041658475,0.0007257777,0.0010808035,0.00026514282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005278584,0.00038141332,0.00047387125,0.0012771836,0.0018131395,0.0032144655,0.0010743425,0.0010447844,0.002489281],"category_scores_gemma":[0.008883854,0.0004198668,0.00061450154,0.0008976233,0.012459307,0.008833267,0.002111794,0.0022541764,0.0002983385],"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.000032761644,0.0000099877825,0.00026991806,0.000047176225,0.0000055512824,0.000094626885,0.00033646685,0.0011324,0.00045025419,0.9912465,0.0003751401,0.0059991437],"study_design_scores_gemma":[0.000008756433,0.0000072682683,0.000057778525,0.000015261445,0.000007795691,0.00004975389,0.000035675057,0.003966955,0.00035136257,0.9932562,0.0022379274,0.0000053520266],"about_ca_topic_score_codex":0.002112035,"about_ca_topic_score_gemma":0.001373405,"teacher_disagreement_score":0.005278584,"about_ca_system_score_codex":0.0027044679,"about_ca_system_score_gemma":0.0012843258,"threshold_uncertainty_score":0.027916193},"labels":[],"label_agreement":null},{"id":"W2164278469","doi":"10.22215/etd/2007-06172","title":"Optimizing and implementing repair programs for consistent query answering in databases","year":2007,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Semantics (computer science); Database; Class (philosophy); Conjunctive query; Query language; Database theory; Deductive database; Information retrieval; Description logic; Data integrity; Theoretical computer science; Programming language; Relational database; Artificial intelligence","score_opus":0.05074246501349941,"score_gpt":0.30533666221599226,"score_spread":0.2545941972024929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164278469","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.109271124,0.0005833667,0.8712553,0.000839759,0.000064559856,0.0002178754,0.00027977832,0.014974363,0.00251389],"genre_scores_gemma":[0.43784058,0.00031578413,0.55600184,0.00030329736,0.000058545596,0.00016276784,0.00080792967,0.0016308039,0.0028783164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99438983,0.0022017225,0.0005014761,0.0007859266,0.0014796389,0.0006415026],"domain_scores_gemma":[0.98727757,0.008182051,0.0007485318,0.0024534438,0.0010991951,0.00023924456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052282414,0.00077338226,0.0010093879,0.0009947716,0.0010045929,0.0034063256,0.0035569682,0.0018167391,0.0030518146],"category_scores_gemma":[0.018287476,0.00092710974,0.001083565,0.0014057866,0.0021727849,0.0052968976,0.002806685,0.0018517474,0.0007234925],"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.0018577114,0.0010227313,0.011453184,0.0008811422,0.00021837573,0.00051517074,0.0022695197,0.23002186,0.03339182,0.09532535,0.0141934985,0.6088496],"study_design_scores_gemma":[0.00023953973,0.00029522422,0.0010145034,0.000059096452,0.000163244,0.00016770464,0.00068710034,0.8943567,0.0365389,0.059567124,0.006849783,0.00006107725],"about_ca_topic_score_codex":0.009105636,"about_ca_topic_score_gemma":0.010924666,"teacher_disagreement_score":0.009105636,"about_ca_system_score_codex":0.0016054522,"about_ca_system_score_gemma":0.003064987,"threshold_uncertainty_score":0.02764988},"labels":[],"label_agreement":null},{"id":"W2164569390","doi":"10.1016/j.procs.2015.05.031","title":"Modelling Multi-agent Systems with Category Theory","year":2015,"lang":"en","type":"article","venue":"Procedia Computer Science","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":"Concordia University","funders":"","keywords":"Categorical variable; Computer science; Category theory; Constructive; Proof theory; Property (philosophy); Constructive proof; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Mathematical proof; Programming language; Epistemology; Discrete mathematics; Process (computing); Pure mathematics","score_opus":0.051465289621392435,"score_gpt":0.24475976158846388,"score_spread":0.19329447196707145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164569390","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.0075262147,0.0014470832,0.96740234,0.0012821389,0.00012260194,0.000084958396,0.00008775647,0.0002639702,0.021783022],"genre_scores_gemma":[0.5667762,0.002231966,0.42030442,0.00046114004,0.0003094003,0.00047325646,0.0002639708,0.000098797274,0.009080924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779284,0.0011472881,0.0001362699,0.00020370755,0.0005459051,0.00017385208],"domain_scores_gemma":[0.9978167,0.0013159771,0.00018098147,0.0002644769,0.00026642362,0.00015541686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022556365,0.00062191125,0.00069261,0.0018949683,0.0011627747,0.0035470966,0.0019011879,0.0017367176,0.003825808],"category_scores_gemma":[0.00331207,0.0004407283,0.0013958884,0.0014838603,0.003958856,0.00452093,0.00381453,0.0021532623,0.0005566544],"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.000005835627,0.000008501133,0.00012392722,0.000039160484,0.000013474108,0.00009921999,0.00031035495,0.016136589,0.00024817954,0.9796769,0.00032001827,0.003017811],"study_design_scores_gemma":[0.000013590506,0.000018980174,0.00008852747,0.000036539703,0.000010300896,0.000084677566,0.00013376048,0.0805306,0.00022657002,0.89957017,0.01927013,0.000016121696],"about_ca_topic_score_codex":0.0072535938,"about_ca_topic_score_gemma":0.004829729,"teacher_disagreement_score":0.0072535938,"about_ca_system_score_codex":0.0023183422,"about_ca_system_score_gemma":0.0018582889,"threshold_uncertainty_score":0.016820788},"labels":[],"label_agreement":null},{"id":"W2166645709","doi":"","title":"Horn clause contraction functions: belief set and belief base approaches","year":2010,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"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":"Contraction (grammar); Horn clause; Propositional calculus; French horn; Belief revision; Mathematics; Computer science; Algorithm; Artificial intelligence; Discrete mathematics; Logic programming; Linguistics; Psychology","score_opus":0.0617395922315109,"score_gpt":0.28607829287329756,"score_spread":0.22433870064178665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166645709","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.005739462,0.00083302584,0.97842443,0.001460363,0.00005146491,0.00008284447,0.000071801835,0.0001179856,0.013218614],"genre_scores_gemma":[0.44525138,0.0019505272,0.53749883,0.001164569,0.0004345736,0.0007986844,0.00039807186,0.00016986608,0.012333472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99365836,0.0031451185,0.00030647952,0.0006366819,0.0018805864,0.00037288506],"domain_scores_gemma":[0.9889305,0.007838587,0.00043508952,0.0012065828,0.0012748636,0.00031428202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0112926625,0.00084973575,0.0009407327,0.002898495,0.0011483436,0.0035332763,0.0033495575,0.0020015484,0.0054694717],"category_scores_gemma":[0.018638462,0.0005450394,0.0017085944,0.0027572736,0.0054145698,0.010623644,0.003540126,0.0046843737,0.00087461143],"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.000028018718,0.000024301607,0.00013836694,0.000059153102,0.000019720625,0.000029470193,0.0003694859,0.0064603044,0.00025982948,0.96700233,0.0006082563,0.025000675],"study_design_scores_gemma":[0.000018083318,0.000033210585,0.000117873526,0.000051983217,0.000022066042,0.000048265705,0.00016170835,0.056421604,0.0007949543,0.93656504,0.0057490873,0.000016204402],"about_ca_topic_score_codex":0.0021924148,"about_ca_topic_score_gemma":0.0012271485,"teacher_disagreement_score":0.0112926625,"about_ca_system_score_codex":0.0030737957,"about_ca_system_score_gemma":0.001503439,"threshold_uncertainty_score":0.059722066},"labels":[],"label_agreement":null},{"id":"W2169636436","doi":"10.1111/j.0824-7935.2004.t01-1-00229.x","title":"Iterated Belief Change","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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 Alberta","funders":"","keywords":"Belief revision; Iterated function; Belief structure; State (computer science); Computer science; Set (abstract data type); Artificial intelligence; Cognitive psychology; Epistemology; Cognitive science; Mathematics; Psychology; Algorithm; Philosophy","score_opus":0.0611266769740203,"score_gpt":0.29352131358405786,"score_spread":0.23239463661003756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169636436","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.029000387,0.00086668454,0.87226605,0.0037164188,0.00021870034,0.00034824465,0.00029902885,0.0005451527,0.09273929],"genre_scores_gemma":[0.7875039,0.00054216845,0.19504131,0.0010869475,0.00021553777,0.0006630574,0.0002962079,0.000121864694,0.014528966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926886,0.0024535405,0.00046957802,0.0016899547,0.0021522366,0.0005460893],"domain_scores_gemma":[0.9877023,0.00595791,0.0013442725,0.0029699018,0.0016057105,0.00041996557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007512202,0.00084845297,0.00070168474,0.0016145548,0.0016480797,0.0032923035,0.0032953734,0.0024754428,0.009977345],"category_scores_gemma":[0.02032734,0.0006074399,0.0022685803,0.0011802146,0.0076851672,0.011594356,0.0047068777,0.0045566433,0.00082269986],"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.000026257323,0.00002517138,0.00051415106,0.00006783801,0.00003254583,0.00011795109,0.001069492,0.0021304667,0.00025919647,0.98432827,0.00060288265,0.010825695],"study_design_scores_gemma":[0.00002998043,0.000047033598,0.00039179774,0.000060072212,0.000047900827,0.00020117595,0.00024153202,0.015103781,0.00064094295,0.97249514,0.010714113,0.000026475456],"about_ca_topic_score_codex":0.0028225137,"about_ca_topic_score_gemma":0.0024994975,"teacher_disagreement_score":0.009977345,"about_ca_system_score_codex":0.0035722824,"about_ca_system_score_gemma":0.0019389727,"threshold_uncertainty_score":0.03972876},"labels":[],"label_agreement":null},{"id":"W2170164284","doi":"10.22329/il.v21i3.2248","title":"Ambiguity in a Dialectical Perspective","year":2001,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ambiguity; Dialectic; Fallacy; Epistemology; Norm (philosophy); Perspective (graphical); Constraint (computer-aided design); Philosophy; Sociology; Computer science; Mathematics; Linguistics; Artificial intelligence","score_opus":0.024231981693972355,"score_gpt":0.27727046776489134,"score_spread":0.253038486070919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170164284","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.032578062,0.020058706,0.3645599,0.10920699,0.0013383535,0.0001783971,0.00015173857,0.00021364678,0.47171417],"genre_scores_gemma":[0.9241868,0.004968322,0.04646214,0.005686125,0.0010156948,0.0003285334,0.00007035644,0.00016262295,0.017119313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97731745,0.016168553,0.0008363086,0.0014178263,0.0031809926,0.0010789691],"domain_scores_gemma":[0.9854655,0.010798362,0.00076294236,0.0011719164,0.0012149177,0.00058631203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017603368,0.0011555512,0.0013455086,0.0053153355,0.008682686,0.020818686,0.0025536632,0.0066685337,0.003824818],"category_scores_gemma":[0.015346985,0.0008874163,0.0011402919,0.0028885056,0.051464397,0.025519887,0.008741326,0.009196748,0.0007093803],"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.000002963037,0.0000022375182,0.000015022423,0.00001341391,0.0000018594948,0.000015893722,0.0016134962,0.00013275721,0.000023256005,0.9974874,0.00017636635,0.00051520765],"study_design_scores_gemma":[0.0000065564427,0.0000029916757,0.000011941839,0.00004045948,0.0000026442822,0.000016992777,0.0010482933,0.00037889788,0.00006237647,0.98572356,0.012701449,0.000003955676],"about_ca_topic_score_codex":0.0022933085,"about_ca_topic_score_gemma":0.0014498389,"teacher_disagreement_score":0.020818686,"about_ca_system_score_codex":0.013671732,"about_ca_system_score_gemma":0.0048162113,"threshold_uncertainty_score":0.09919584},"labels":[],"label_agreement":null},{"id":"W2170245713","doi":"10.1017/s1471068414000015","title":"aspeed: Solver scheduling via answer set programming","year":2014,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"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":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Answer set programming; Solver; Constraint programming; Benchmarking; Boolean satisfiability problem; Scheduling (production processes); Set (abstract data type); Computation; Satisfiability; Theoretical computer science; Simple (philosophy); Mathematical optimization; Programming language","score_opus":0.02471089799935112,"score_gpt":0.29372717397137965,"score_spread":0.26901627597202854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170245713","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.013676234,0.00016215423,0.9672355,0.00070841046,0.00020306621,0.00023785555,0.0008287475,0.006508051,0.010439947],"genre_scores_gemma":[0.18332535,0.00019902096,0.8086811,0.00039946364,0.00011172287,0.00040111772,0.0020168466,0.0012284507,0.0036370312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997044,0.0011926539,0.00021697233,0.00040469138,0.0008701091,0.00027161298],"domain_scores_gemma":[0.9949891,0.0031034497,0.00024711492,0.0008190283,0.00067889923,0.00016245172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025922514,0.001046806,0.0006540097,0.0011945029,0.00067847135,0.0022284437,0.0019833387,0.0010017429,0.0128639955],"category_scores_gemma":[0.010103336,0.00052636495,0.0012553015,0.0013889062,0.0010726751,0.0023283416,0.0019726935,0.002534065,0.00228916],"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.00047366574,0.00046118797,0.0013242562,0.00059698016,0.0000836303,0.00025906804,0.00025905433,0.37986073,0.008159076,0.22681491,0.031591978,0.3501154],"study_design_scores_gemma":[0.00009046087,0.00009176632,0.00011648874,0.00005010582,0.000025765714,0.00005285823,0.000049425536,0.8433764,0.009534929,0.13399398,0.012598668,0.00001921147],"about_ca_topic_score_codex":0.0020573705,"about_ca_topic_score_gemma":0.0025302204,"teacher_disagreement_score":0.0128639955,"about_ca_system_score_codex":0.0011290449,"about_ca_system_score_gemma":0.0022165617,"threshold_uncertainty_score":0.043034375},"labels":[],"label_agreement":null},{"id":"W2170431068","doi":"10.1613/jair.4031","title":"Horn Clause Contraction Functions","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Horn clause; Contraction (grammar); Propositional calculus; French horn; Remainder; Mathematics; Classical logic; Forgetting; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Logic programming; Arithmetic; Linguistics","score_opus":0.1545227878795776,"score_gpt":0.39424318178333695,"score_spread":0.23972039390375935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170431068","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.030800728,0.00068214623,0.89401793,0.0013710337,0.00023055909,0.00034117122,0.00061629125,0.0010436499,0.07089642],"genre_scores_gemma":[0.4984809,0.0011208616,0.41768557,0.0016925039,0.00047697264,0.0009956921,0.0022670159,0.0009410029,0.07633941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763393,0.00066245295,0.0001463536,0.00041478616,0.00084211404,0.00030032388],"domain_scores_gemma":[0.9960884,0.0022475575,0.00018009327,0.0006634147,0.00066635245,0.00015414009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037952035,0.00085288635,0.0006443549,0.0017808634,0.0010805905,0.0021625832,0.0022060783,0.0012674181,0.018469969],"category_scores_gemma":[0.009777119,0.00043204645,0.0015636933,0.0017730074,0.0022329595,0.006637732,0.003106293,0.0030625402,0.0034908394],"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.00005535772,0.00003876847,0.00025930267,0.00008831926,0.000013635645,0.00010274371,0.00023993768,0.0022698862,0.0022271725,0.93373644,0.003762792,0.057205662],"study_design_scores_gemma":[0.000039179045,0.00007329864,0.00039805003,0.000053448748,0.00003075075,0.00037661576,0.00019808345,0.04889252,0.006269176,0.9064236,0.0372116,0.000033796387],"about_ca_topic_score_codex":0.00089394546,"about_ca_topic_score_gemma":0.0007607061,"teacher_disagreement_score":0.018469969,"about_ca_system_score_codex":0.0016817149,"about_ca_system_score_gemma":0.0009964553,"threshold_uncertainty_score":0.06178814},"labels":[],"label_agreement":null},{"id":"W2170520620","doi":"10.1109/time.1997.600779","title":"Bidirectional inference in probabilistic temporal reasoning","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Saskatchewan; Wilfrid Laurier University","funders":"","keywords":"Probabilistic logic; Computer science; Belief propagation; Interleaving; Inference; Projection (relational algebra); Artificial intelligence; Causal reasoning; Probabilistic logic network; Causal structure; Probabilistic argumentation; Theoretical computer science; Algorithm; Multimodal logic; Cognition; Decoding methods; Description logic","score_opus":0.03256636259289956,"score_gpt":0.2521733287481588,"score_spread":0.21960696615525924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170520620","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.010689005,0.0015777735,0.9760149,0.0018045963,0.00008662099,0.000043863816,0.00012742239,0.0003663675,0.009289483],"genre_scores_gemma":[0.619795,0.0031168072,0.37018535,0.0005785355,0.0003220866,0.00025932814,0.00045182576,0.00015203793,0.0051390817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959054,0.0019650469,0.00026918843,0.0005744333,0.0010574018,0.00022855423],"domain_scores_gemma":[0.9890133,0.008460358,0.00059114624,0.0009657623,0.0007487177,0.00022075875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063727545,0.00063499267,0.0008295414,0.0017478499,0.0012653592,0.0033090448,0.0018321832,0.0020547358,0.0033148385],"category_scores_gemma":[0.020041939,0.0010278313,0.0017086149,0.0023089536,0.0036520043,0.008785464,0.0035761201,0.0032435344,0.00054394774],"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.000051012674,0.000022188322,0.00034179917,0.00011939642,0.00006344944,0.00014334255,0.00033630405,0.032337278,0.00035157715,0.933922,0.0011023935,0.031209169],"study_design_scores_gemma":[0.000010918489,0.0000052558726,0.00005972956,0.000018357714,0.000023160293,0.000040626615,0.00002762308,0.101427026,0.0002846436,0.89647436,0.001619326,0.000009108308],"about_ca_topic_score_codex":0.006379446,"about_ca_topic_score_gemma":0.0047575813,"teacher_disagreement_score":0.006379446,"about_ca_system_score_codex":0.0021246893,"about_ca_system_score_gemma":0.0014698223,"threshold_uncertainty_score":0.03370273},"labels":[],"label_agreement":null},{"id":"W2170782811","doi":"10.1017/s1471068413000112","title":"Editorial: 29th International Conference on Logic Programming special issue","year":2013,"lang":"en","type":"editorial","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Ulm; Università degli Studi di Udine; Università degli Studi di Ferrara; German University in Cairo; Università di Bologna; Universiteit Gent; Universität Potsdam; Università della Calabria; Ben-Gurion University of the Negev; KU Leuven; Universidad Complutense de Madrid; Universität Leipzig; Imperial College London; Università degli Studi di Parma; University of Alberta; Universiteit van Amsterdam; National University of Singapore; Universidade do Porto; University of Cambridge; Institut national de recherche en informatique et en automatique (INRIA); Simon Fraser University; Arizona State University; Texas Tech University","keywords":"Computer science; Publication; Library science; Logic programming; Engineering ethics; Programming language; Political science; Law","score_opus":0.025098588217902507,"score_gpt":0.31889151316123443,"score_spread":0.2937929249433319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170782811","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.000041361844,0.0036695236,0.00038222948,0.03821588,0.95081055,0.000032911314,0.00009959941,0.00009536218,0.0066526],"genre_scores_gemma":[0.0008572074,0.0056704953,0.00051266653,0.016968329,0.9306289,0.000055818902,0.00014556946,0.00019572325,0.044965286],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994323,0.00069422997,0.0005700022,0.0007214383,0.0032393313,0.00045191965],"domain_scores_gemma":[0.98214227,0.0033341548,0.0007880174,0.00047537492,0.010681284,0.0025788383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005940146,0.0027558815,0.0025480834,0.005013899,0.0032529507,0.010572519,0.0029058466,0.008328903,0.043239146],"category_scores_gemma":[0.017086672,0.0007290193,0.0027074264,0.0021442948,0.0023100798,0.004788895,0.0016258623,0.012181131,0.026385147],"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.000014209977,0.000009996136,0.00002060355,0.00008915894,0.00000790617,0.00005319305,0.000006457777,0.000030611583,0.000037452908,0.00068849436,0.9941071,0.0049348343],"study_design_scores_gemma":[0.000019234487,0.000009512484,0.00013130241,0.00021822887,0.000019696627,0.00013114185,0.000018007695,0.0001245554,0.00008626096,0.0018057913,0.9974274,0.0000089435525],"about_ca_topic_score_codex":0.00217924,"about_ca_topic_score_gemma":0.00535454,"teacher_disagreement_score":0.043239146,"about_ca_system_score_codex":0.0062334677,"about_ca_system_score_gemma":0.006807081,"threshold_uncertainty_score":0.14464933},"labels":[],"label_agreement":null},{"id":"W2171445608","doi":"10.1007/978-3-540-78913-0_27","title":"An Ordered Category of Processes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Dedekind cut; Monotone polygon; Mathematics; Pure mathematics; Lattice (music); Equivalence relation; Equivalence (formal languages); Algebra over a field; Geometry; Physics","score_opus":0.019056314321870767,"score_gpt":0.24493987322207905,"score_spread":0.22588355890020828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171445608","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.036653657,0.0038789492,0.57542807,0.0028857754,0.0007149863,0.00021294705,0.0010735232,0.0010473407,0.37810478],"genre_scores_gemma":[0.6483083,0.0028825514,0.21913128,0.0011972903,0.0007969799,0.00084696274,0.0022910957,0.00038708682,0.12415849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975817,0.0006976822,0.00018863405,0.00054243417,0.00070917746,0.00028035746],"domain_scores_gemma":[0.99808204,0.0007508973,0.00010148711,0.00034263206,0.0004825164,0.00024051811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018900458,0.0012018455,0.0008872362,0.003499993,0.0035584422,0.007072004,0.001605715,0.002022265,0.014339416],"category_scores_gemma":[0.0030283274,0.0009281686,0.0013482114,0.0037671758,0.006043167,0.012773045,0.0039094887,0.0031723147,0.003009426],"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.0000036948325,0.000003285525,0.000019528987,0.000009974593,0.0000017495881,0.000017370387,0.000109942004,0.00006843082,0.00008779697,0.9977387,0.0004199883,0.0015194078],"study_design_scores_gemma":[0.0000062423624,0.000006190843,0.00003151027,0.000009654272,0.000003476539,0.00004811808,0.00008021183,0.000515302,0.00012977728,0.98569715,0.013467472,0.000004751349],"about_ca_topic_score_codex":0.0016127696,"about_ca_topic_score_gemma":0.0010710552,"teacher_disagreement_score":0.014339416,"about_ca_system_score_codex":0.0019144736,"about_ca_system_score_gemma":0.0014771431,"threshold_uncertainty_score":0.047970116},"labels":[],"label_agreement":null},{"id":"W2172135039","doi":"","title":"On the limits of planning over belief states under strict uncertainty","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":29,"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 Toronto; York University","funders":"","keywords":"Planner; Plan (archaeology); Computer science; Work (physics); Simple (philosophy); Argument (complex analysis); State (computer science); Complete information; Mathematical optimization; Mathematics; Mathematical economics; Artificial intelligence; Algorithm; Engineering","score_opus":0.0258797626807171,"score_gpt":0.26051150713888477,"score_spread":0.23463174445816767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172135039","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.11145628,0.0122410245,0.7240882,0.01620438,0.00025188146,0.00021119957,0.00062815944,0.00062997185,0.13428895],"genre_scores_gemma":[0.88701546,0.004743416,0.099585146,0.001351537,0.0005251048,0.000663094,0.00037414714,0.0002489376,0.005493147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98525894,0.0078771105,0.00085960503,0.0013521966,0.0034781601,0.0011739653],"domain_scores_gemma":[0.8844609,0.101032756,0.0033958096,0.0061222143,0.0025037252,0.0024846261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014945239,0.0008811455,0.0016332577,0.0020777222,0.002711628,0.0055774627,0.0022384143,0.0024210426,0.0060726446],"category_scores_gemma":[0.057346866,0.0013216642,0.002057309,0.0020872224,0.013727245,0.01783623,0.0067506493,0.007856781,0.0006259138],"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.000118771,0.000040650484,0.00055974326,0.00011957132,0.000032869135,0.00011719208,0.0005870187,0.03095854,0.00027088297,0.9565744,0.00087488675,0.009745507],"study_design_scores_gemma":[0.00001899096,0.00002277933,0.00015753017,0.000043093223,0.000016501268,0.000039883842,0.00007212429,0.03769137,0.00016303448,0.9603601,0.0014028974,0.000011743073],"about_ca_topic_score_codex":0.0038072567,"about_ca_topic_score_gemma":0.0024026632,"teacher_disagreement_score":0.014945239,"about_ca_system_score_codex":0.0034423838,"about_ca_system_score_gemma":0.0018738582,"threshold_uncertainty_score":0.07903892},"labels":[],"label_agreement":null},{"id":"W2172181603","doi":"10.1016/j.artint.2007.02.002","title":"Inductive situation calculus","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Calculus (dental); Situation calculus; Rotation formalisms in three dimensions; Inductive logic programming; Many-valued logic; Monotone polygon; Inductive reasoning; Representation (politics); Algebra over a field; Computer science; Artificial intelligence; Pure mathematics; Description logic","score_opus":0.05741505432868664,"score_gpt":0.3118936394500684,"score_spread":0.2544785851213818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172181603","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.006228123,0.0017358606,0.6051375,0.0038025756,0.00043021076,0.00019285186,0.00086722284,0.0011546112,0.38045087],"genre_scores_gemma":[0.4988079,0.0034263406,0.34317553,0.0020854513,0.0009774942,0.0005638741,0.0034014622,0.00062036765,0.14694159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736685,0.0007855677,0.00017371654,0.0005856837,0.000826468,0.00026174093],"domain_scores_gemma":[0.9979867,0.0009794554,0.00007413386,0.00035032668,0.0004754693,0.00013393282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025166173,0.0009976394,0.00076461583,0.0025608148,0.0024727678,0.005274772,0.0026398394,0.0015576932,0.02815249],"category_scores_gemma":[0.0056903437,0.00091941445,0.0015764476,0.0019724644,0.0044210595,0.009520422,0.0034802577,0.004967642,0.007861235],"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.000009841251,0.000016470183,0.000051102725,0.000026997128,0.0000053809404,0.000032777025,0.00015660223,0.0002647641,0.00013508441,0.98947304,0.0025134075,0.007314475],"study_design_scores_gemma":[0.000010084926,0.000004310446,0.000048920883,0.000020478308,0.000011682753,0.00005965399,0.000055369528,0.0020499227,0.0003966868,0.97094315,0.026392464,0.000007361014],"about_ca_topic_score_codex":0.0021045553,"about_ca_topic_score_gemma":0.0016569116,"teacher_disagreement_score":0.02815249,"about_ca_system_score_codex":0.0027126574,"about_ca_system_score_gemma":0.0017912989,"threshold_uncertainty_score":0.09417945},"labels":[],"label_agreement":null},{"id":"W2172984480","doi":"","title":"Iterated Belief Change in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"RMIT Research Repository (RMIT University Library)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":70,"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":"Belief revision; Situation calculus; Introspection; Computer science; Iterated function; Formalism (music); Artificial intelligence; Action (physics); Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology","score_opus":0.04489300842060951,"score_gpt":0.2688608055038994,"score_spread":0.2239677970832899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172984480","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.052712288,0.004400056,0.7711805,0.010863994,0.0005536102,0.00019012357,0.00017067028,0.00047704342,0.15945171],"genre_scores_gemma":[0.87334037,0.0012221363,0.10879183,0.000721405,0.00043968443,0.00019568134,0.00009054544,0.00007275281,0.015125683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946103,0.002258758,0.00032770823,0.00069983664,0.0016652273,0.00043806108],"domain_scores_gemma":[0.99489933,0.0030943144,0.000376025,0.0005112745,0.00082680193,0.0002923048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005724949,0.000559677,0.000676107,0.0015350071,0.0021988866,0.0047178073,0.0013981909,0.0016473542,0.0030658906],"category_scores_gemma":[0.011180113,0.00059348554,0.0016631363,0.0010196388,0.008529039,0.008420968,0.002899902,0.0041429787,0.00042796973],"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.000012954259,0.000008496275,0.00008476927,0.000018553677,0.000011597769,0.000088392495,0.00059818255,0.0018454645,0.00015629329,0.9934864,0.0004075096,0.0032814685],"study_design_scores_gemma":[0.00001622353,0.000008854597,0.00006987166,0.0000130703565,0.000016071968,0.000045000772,0.0000776881,0.010044578,0.00016622119,0.9851099,0.004420437,0.000012087711],"about_ca_topic_score_codex":0.00615473,"about_ca_topic_score_gemma":0.003795694,"teacher_disagreement_score":0.00615473,"about_ca_system_score_codex":0.00467806,"about_ca_system_score_gemma":0.0020686453,"threshold_uncertainty_score":0.033941805},"labels":[],"label_agreement":null},{"id":"W2174235632","doi":"10.1017/s1471068402001539","title":"A framework for compiling preferences in logic programs","year":2003,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":129,"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":"Computer science; Logic programming; Logic program; Answer set programming; Programming language; Set (abstract data type); Stable model semantics; Semantics (computer science); Compiler; Theoretical computer science; Implementation; Preference; Range (aeronautics); Program transformation; Operational semantics; Mathematics","score_opus":0.06676812964106243,"score_gpt":0.3393231874155429,"score_spread":0.27255505777448047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174235632","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.0016447995,0.000072886294,0.99405116,0.00016299068,0.000032703698,0.00008551,0.00010256211,0.0017608417,0.0020863703],"genre_scores_gemma":[0.03849817,0.00024085976,0.9583648,0.00019073465,0.000072779454,0.00026791706,0.0002965922,0.00049930013,0.0015689705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970855,0.0007814928,0.00043421504,0.0005560017,0.0008554488,0.00028730478],"domain_scores_gemma":[0.9980077,0.00081741996,0.00019216929,0.00056496833,0.00032482843,0.00009303092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034069875,0.00087670906,0.00081892405,0.001791216,0.0010163205,0.002978705,0.0019191498,0.0010508577,0.004498132],"category_scores_gemma":[0.007546845,0.0010511721,0.0022713642,0.0017769743,0.0024549635,0.0048563504,0.002902479,0.0030917549,0.0013210694],"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.00005494448,0.00007444104,0.00055950775,0.00032493993,0.00005550935,0.0003008848,0.0008606255,0.04255792,0.0035065596,0.85409147,0.0032898947,0.09432341],"study_design_scores_gemma":[0.00005243809,0.00006896243,0.00018405596,0.0001388326,0.00007319425,0.00027706646,0.0001841104,0.10719547,0.0074738744,0.81767255,0.066625215,0.00005432119],"about_ca_topic_score_codex":0.0028379706,"about_ca_topic_score_gemma":0.0027757145,"teacher_disagreement_score":0.004498132,"about_ca_system_score_codex":0.0014705096,"about_ca_system_score_gemma":0.0022222945,"threshold_uncertainty_score":0.018018067},"labels":[],"label_agreement":null},{"id":"W2175700267","doi":"","title":"Generalized multi-context systems","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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":"Operational semantics; Well-founded semantics; Semantics (computer science); Context (archaeology); Computer science; Formal semantics (linguistics); Proof-theoretic semantics; Computational semantics; Denotational semantics; Action semantics; Theoretical computer science; Programming language","score_opus":0.04961093887796212,"score_gpt":0.2983021263901871,"score_spread":0.248691187512225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175700267","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.0507895,0.00637514,0.8941097,0.0030049768,0.00036633882,0.0003726041,0.0008423194,0.0009961537,0.04314318],"genre_scores_gemma":[0.7470256,0.0029612693,0.23979013,0.0007948857,0.00040190498,0.0004411948,0.00075875,0.00009968374,0.007726598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956275,0.0013856863,0.00045010724,0.0010478324,0.0010803037,0.00040863326],"domain_scores_gemma":[0.99688953,0.0010824723,0.00030624555,0.0008583812,0.00057430024,0.0002890871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002739829,0.0010921457,0.001252774,0.0026615139,0.0019354683,0.0053644716,0.0020025251,0.0020123387,0.00381494],"category_scores_gemma":[0.005363049,0.00049744034,0.0016048538,0.0027162859,0.0034753974,0.007455194,0.0060566203,0.0020714074,0.0006173321],"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.000025325658,0.000017718796,0.00053837785,0.00010798953,0.00007518572,0.00037222242,0.00039042367,0.01363488,0.0006257628,0.9713542,0.0010861652,0.011771787],"study_design_scores_gemma":[0.000028441102,0.000024196122,0.0002999595,0.000064344975,0.00005636502,0.00024289146,0.00021189572,0.049764987,0.0004818005,0.9232601,0.025533186,0.000031847634],"about_ca_topic_score_codex":0.0048030536,"about_ca_topic_score_gemma":0.0040439214,"teacher_disagreement_score":0.0053644716,"about_ca_system_score_codex":0.0022517082,"about_ca_system_score_gemma":0.0015450367,"threshold_uncertainty_score":0.016337395},"labels":[],"label_agreement":null},{"id":"W2176512423","doi":"10.2316/journal.201.2007.2.201-1337","title":"MARKER-AUGMENTED ROBOT-ENVIRONMENT INTERACTION","year":2007,"lang":"en","type":"article","venue":"Control and Intelligent Systems","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Human–computer interaction; Robot; Artificial intelligence","score_opus":0.015029458914506612,"score_gpt":0.23301612492079293,"score_spread":0.21798666600628633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176512423","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.047730472,0.00020803938,0.9415478,0.00017280459,0.0000717857,0.00004863711,0.00007109927,0.0017479605,0.008401467],"genre_scores_gemma":[0.67543125,0.00016308042,0.3175193,0.00007986686,0.000016247739,0.00009321616,0.00016600439,0.00015354769,0.0063775238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992237,0.00029194533,0.00005017148,0.00015358518,0.00020999015,0.00007061412],"domain_scores_gemma":[0.9988433,0.00051385816,0.000100591606,0.00034683937,0.00013333025,0.00006194297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061244454,0.0005054753,0.0006074665,0.00036390597,0.0005909937,0.0014145828,0.0012484542,0.00095520983,0.0050177085],"category_scores_gemma":[0.0025023418,0.00036228946,0.00062024494,0.0004084954,0.0014366371,0.0023735012,0.0029854479,0.00085050816,0.0006675883],"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.0009535767,0.000184048,0.0024997976,0.00046680032,0.00012132748,0.0018446859,0.0036470224,0.19666037,0.112795085,0.42194694,0.004282404,0.25459796],"study_design_scores_gemma":[0.00010341921,0.000409322,0.0017598215,0.000090113725,0.00013317577,0.0008181663,0.0005450833,0.6513158,0.08617123,0.1916049,0.06691192,0.00013706622],"about_ca_topic_score_codex":0.00092759967,"about_ca_topic_score_gemma":0.0014106991,"teacher_disagreement_score":0.0050177085,"about_ca_system_score_codex":0.00042922728,"about_ca_system_score_gemma":0.00046113352,"threshold_uncertainty_score":0.01678586},"labels":[],"label_agreement":null},{"id":"W2177386141","doi":"10.1007/bfb0022679","title":"Knowledge representation: Features of knowledge","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Representation (politics); Computer science; Political science","score_opus":0.024820775580343384,"score_gpt":0.2843790529783177,"score_spread":0.2595582773979743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177386141","genre_codex":"methods","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.016405134,0.012564182,0.82411647,0.004618443,0.00029693334,0.00015948588,0.0022117232,0.0025369504,0.13709073],"genre_scores_gemma":[0.50737727,0.010149443,0.44074145,0.0010067691,0.00064447353,0.00039923989,0.0064565316,0.0006571314,0.0325678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993793,0.00015817246,0.00007049357,0.0001583714,0.0001858305,0.00004773774],"domain_scores_gemma":[0.9986131,0.00068511144,0.00012806091,0.00037058556,0.00013421515,0.0000689479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079277286,0.0005912965,0.00055309664,0.0020566443,0.0008043381,0.008350553,0.0017310765,0.0013657934,0.0089063905],"category_scores_gemma":[0.0050205356,0.00054471585,0.0008282074,0.0037722297,0.002515709,0.014090224,0.0016931413,0.0015922012,0.002408363],"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.000034978686,0.000023026489,0.0004830312,0.00028031148,0.000024787523,0.00015152851,0.00087304524,0.0015284417,0.0010748337,0.8792502,0.010221925,0.10605387],"study_design_scores_gemma":[0.000008240404,0.000009953845,0.00038399547,0.00013422374,0.000030982857,0.0003065642,0.00020383442,0.0071330545,0.000918862,0.9209778,0.069877975,0.000014557036],"about_ca_topic_score_codex":0.0018236561,"about_ca_topic_score_gemma":0.0011055424,"teacher_disagreement_score":0.0089063905,"about_ca_system_score_codex":0.0009344496,"about_ca_system_score_gemma":0.0008177438,"threshold_uncertainty_score":0.029794872},"labels":[],"label_agreement":null},{"id":"W2177576448","doi":"","title":"Decidable reasoning in a fragment of the epistemic situation calculus","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","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":"University of Toronto","funders":"","keywords":"Situation calculus; Decidability; Undecidable problem; Fragment (logic); Calculus (dental); Formalism (music); Computer science; Frame problem; Circumscription; Knowledge representation and reasoning; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.022668286495043287,"score_gpt":0.2750889418451013,"score_spread":0.25242065535005803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177576448","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.021616913,0.0007187166,0.9560416,0.0016077936,0.00011904448,0.00017655303,0.00036790146,0.00097334664,0.018378232],"genre_scores_gemma":[0.6143344,0.0009979921,0.37431195,0.00078042643,0.00043603743,0.00047197184,0.0011332592,0.00019705697,0.007336894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916298,0.0025752096,0.0006146804,0.0014042292,0.0029002198,0.000875915],"domain_scores_gemma":[0.98962957,0.0072215335,0.00052989763,0.0014443287,0.000837209,0.0003374042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006565571,0.0009273933,0.0014588139,0.002040207,0.0029534341,0.0060370923,0.0033043346,0.002126024,0.0040098703],"category_scores_gemma":[0.015903512,0.001106526,0.004075114,0.0020401175,0.00854097,0.012320771,0.0049628597,0.0058059525,0.0006234269],"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.00005407531,0.00004256946,0.00012835827,0.00007221737,0.00003689572,0.0002864993,0.00063600484,0.014637657,0.0009954716,0.9738897,0.0010583762,0.008162053],"study_design_scores_gemma":[0.000038812286,0.000015392063,0.00006713251,0.00002757158,0.000038908347,0.00010524527,0.000072179384,0.05351655,0.000954033,0.93950886,0.005632423,0.000022883902],"about_ca_topic_score_codex":0.01091449,"about_ca_topic_score_gemma":0.0074021877,"teacher_disagreement_score":0.01091449,"about_ca_system_score_codex":0.004457988,"about_ca_system_score_gemma":0.0035900888,"threshold_uncertainty_score":0.034722447},"labels":[],"label_agreement":null},{"id":"W2181780560","doi":"10.1609/aaai.v28i1.8865","title":"PREGO: An Action Language for Belief-Based Cognitive Robotics in Continuous Domains","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","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":"University of Toronto","funders":"","keywords":"Robotics; Artificial intelligence; Cognitive robotics; Computer science; Successor cardinal; Context (archaeology); Axiom; Action (physics); Cognitive science; Cognition; Robot; Mathematics; Psychology","score_opus":0.06935904995918539,"score_gpt":0.3216811786343031,"score_spread":0.2523221286751177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181780560","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.0018244736,0.00009755497,0.99161494,0.00046375254,0.00009234928,0.000103797014,0.00017014341,0.0029554996,0.0026774926],"genre_scores_gemma":[0.13380317,0.0003261234,0.8589256,0.0008216604,0.00013164194,0.0005551875,0.00038045313,0.00060254463,0.0044535594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986981,0.0003721752,0.00015597751,0.00027216636,0.0003859498,0.00011560861],"domain_scores_gemma":[0.9984133,0.00081478123,0.00017962388,0.00023838821,0.000208527,0.00014534211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024311915,0.0008800484,0.0006337488,0.0008087253,0.0009306725,0.0032545943,0.0028119334,0.0018352651,0.0060347747],"category_scores_gemma":[0.0045318143,0.00078132324,0.0017583693,0.00049042667,0.0040542437,0.004971438,0.0032145677,0.004063756,0.0015321238],"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.00015584349,0.00004442662,0.0002482317,0.00034490094,0.00003920478,0.00023600706,0.0011341701,0.01650761,0.0047460077,0.93536305,0.005125586,0.03605506],"study_design_scores_gemma":[0.00010641222,0.00017741756,0.0002202922,0.00020058005,0.000080472906,0.00043818296,0.00025116425,0.21063009,0.009837383,0.6730873,0.10486577,0.00010500311],"about_ca_topic_score_codex":0.0014860153,"about_ca_topic_score_gemma":0.0019410012,"teacher_disagreement_score":0.0060347747,"about_ca_system_score_codex":0.0009118453,"about_ca_system_score_gemma":0.001736941,"threshold_uncertainty_score":0.020188272},"labels":[],"label_agreement":null},{"id":"W2182604253","doi":"","title":"On Ability to Autonomously Execute Agent Programs with Sensing — Extended Abstract","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","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":"York University; University of Toronto","funders":"","keywords":"Computer science; Deliberation; Set (abstract data type); Programming language; Semantics (computer science); Answer set programming; State (computer science); Situation calculus; Artificial intelligence; Theoretical computer science","score_opus":0.04886104234643238,"score_gpt":0.27673081927630583,"score_spread":0.22786977692987345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182604253","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.087821625,0.00017259919,0.8875805,0.0014804578,0.000067938956,0.000093144736,0.00014254765,0.0034076406,0.019233625],"genre_scores_gemma":[0.8499109,0.00020688523,0.14300507,0.00050191453,0.00007318651,0.0001746953,0.00021846851,0.00043914292,0.0054698237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638426,0.001247673,0.00033870677,0.00082110614,0.00074394105,0.00046424693],"domain_scores_gemma":[0.97703004,0.014805014,0.0014725786,0.004164772,0.0018543465,0.0006733185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003755139,0.00049172586,0.00041321368,0.0008734713,0.00096432434,0.0029796232,0.0016388241,0.001355177,0.0055943164],"category_scores_gemma":[0.019934604,0.0005544463,0.0011140094,0.0005820567,0.0063682157,0.0074132285,0.0052777203,0.0022386815,0.00067777594],"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.00027983732,0.00012075479,0.0026875914,0.00018241136,0.000049821898,0.00048670446,0.0015453127,0.045860045,0.008366016,0.9066329,0.0020344208,0.03175424],"study_design_scores_gemma":[0.00004950049,0.0001580049,0.00071028137,0.000066852524,0.000055857916,0.00022634573,0.00025788796,0.31876615,0.012203167,0.6599006,0.007534249,0.00007109062],"about_ca_topic_score_codex":0.0035977452,"about_ca_topic_score_gemma":0.0015044715,"teacher_disagreement_score":0.0055943164,"about_ca_system_score_codex":0.0008377419,"about_ca_system_score_gemma":0.001085283,"threshold_uncertainty_score":0.019859314},"labels":[],"label_agreement":null},{"id":"W2185574792","doi":"","title":"Belief change and base dependence","year":2014,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"University of Alberta; Simon Fraser University","funders":"","keywords":"Intuition; Formalism (music); Belief revision; Computer science; Mathematics; Artificial intelligence; Psychology; Cognitive science","score_opus":0.03483448430370639,"score_gpt":0.23200572472747588,"score_spread":0.1971712404237695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185574792","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.047067195,0.0006759715,0.8864053,0.0028580264,0.00014635173,0.00013354444,0.00035232425,0.00044375448,0.061917532],"genre_scores_gemma":[0.80487806,0.00045888894,0.18349767,0.0008869537,0.00022977103,0.00028883386,0.00037984786,0.00014677577,0.009233147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601716,0.0010291488,0.00036866302,0.0010683904,0.001131851,0.00038470782],"domain_scores_gemma":[0.9922362,0.0036470087,0.00049840857,0.002086103,0.0012330906,0.00029915222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004628064,0.000562004,0.0005739702,0.0016562254,0.0017209781,0.0026610442,0.0014603178,0.0016529473,0.0057684835],"category_scores_gemma":[0.010187106,0.00066225894,0.0013257413,0.0012753723,0.008241739,0.0111737475,0.00419672,0.00424202,0.00059938274],"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.000019550054,0.000013377677,0.00022212634,0.000028925144,0.000009665813,0.00006211442,0.00047711495,0.0008880907,0.0006576339,0.99015605,0.0003247299,0.0071406933],"study_design_scores_gemma":[0.00002348821,0.000027216985,0.000346916,0.000028248929,0.000025033156,0.0001494166,0.00012077055,0.007018604,0.0018627385,0.9794058,0.010974641,0.000017115877],"about_ca_topic_score_codex":0.0026897206,"about_ca_topic_score_gemma":0.0017590625,"teacher_disagreement_score":0.0057684835,"about_ca_system_score_codex":0.00278645,"about_ca_system_score_gemma":0.0013333616,"threshold_uncertainty_score":0.024475813},"labels":[],"label_agreement":null},{"id":"W2187289097","doi":"10.1109/iemcon.2015.7344487","title":"Instance transformation for declarative solvers or: Instant model finders","year":2015,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Instant; Computer science; Transformation (genetics); Model transformation; Programming language; Instant messaging; Theoretical computer science; Parallel computing; Artificial intelligence; World Wide Web","score_opus":0.12749544721254,"score_gpt":0.3056098349195037,"score_spread":0.17811438770696372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187289097","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.0018427918,0.00006231367,0.9737201,0.00023690441,0.000085964086,0.00014783251,0.00048309143,0.019016631,0.004404346],"genre_scores_gemma":[0.045889452,0.00019708762,0.9389797,0.00043517628,0.00005816705,0.00054647034,0.0018706938,0.005416566,0.0066067413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630994,0.00091135333,0.00035778273,0.0006531766,0.0014392543,0.000328537],"domain_scores_gemma":[0.994612,0.003018127,0.00025567203,0.0015584541,0.0004263068,0.00012953849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003775544,0.0012494191,0.00094747776,0.001134899,0.00072245795,0.0040339143,0.003951348,0.0019677035,0.02497918],"category_scores_gemma":[0.011948577,0.0011968993,0.0020936052,0.0010254185,0.0016861222,0.0068865917,0.005168881,0.004428065,0.0069531235],"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.00046768144,0.00033884658,0.000875266,0.0012306322,0.00016792724,0.00075447897,0.0015230229,0.017660316,0.019679138,0.634455,0.048002172,0.2748455],"study_design_scores_gemma":[0.0003805172,0.00009943273,0.00020344798,0.0002763535,0.00011760279,0.00083871844,0.00037034645,0.20208433,0.09865981,0.38259465,0.3142441,0.0001307688],"about_ca_topic_score_codex":0.00066159497,"about_ca_topic_score_gemma":0.0014604713,"teacher_disagreement_score":0.02497918,"about_ca_system_score_codex":0.0009920842,"about_ca_system_score_gemma":0.0013649715,"threshold_uncertainty_score":0.083563685},"labels":[],"label_agreement":null},{"id":"W2188435450","doi":"10.1609/aaai.v29i1.9665","title":"Planning Over Multi-Agent Epistemic States: A Classical Planning Approach","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":89,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plan (archaeology); Computer science; Task (project management); Perspective (graphical); Automated planning and scheduling; Management science; Artificial intelligence; Engineering; Systems engineering","score_opus":0.1946618284340639,"score_gpt":0.33756142513053866,"score_spread":0.14289959669647476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188435450","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.0029384096,0.0004777704,0.9866251,0.0010603869,0.000038624003,0.00006591508,0.000060451497,0.00011650753,0.008616837],"genre_scores_gemma":[0.2496613,0.0013200738,0.74294865,0.00040679888,0.00017364483,0.00040985382,0.00014952912,0.00007924312,0.0048509296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978516,0.0009140549,0.0001520854,0.00032348337,0.0006089705,0.0001497981],"domain_scores_gemma":[0.99592906,0.0028707364,0.00021780259,0.00057352864,0.00026234853,0.00014638326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031337438,0.0008896671,0.0007161088,0.0014048504,0.0013695603,0.0030149121,0.0030372778,0.0017994145,0.0031140388],"category_scores_gemma":[0.0064041247,0.0008742156,0.0024739937,0.0014419443,0.006487043,0.006402125,0.0035176356,0.0035286238,0.0005237467],"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.0000214125,0.000026407568,0.0001265219,0.00012478663,0.000038487444,0.000108212385,0.00028763467,0.094621114,0.00043805523,0.88862973,0.0007149961,0.01486252],"study_design_scores_gemma":[0.000016560898,0.00001538195,0.000039686558,0.00004519666,0.00001864604,0.000037531106,0.00005545966,0.22190732,0.00050344574,0.7730502,0.004295587,0.00001506941],"about_ca_topic_score_codex":0.005305467,"about_ca_topic_score_gemma":0.007583106,"teacher_disagreement_score":0.005305467,"about_ca_system_score_codex":0.0032651841,"about_ca_system_score_gemma":0.0026859434,"threshold_uncertainty_score":0.0236907},"labels":[],"label_agreement":null},{"id":"W2189980513","doi":"","title":"Forgetting in action","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Forgetting; Action (physics); Computer science; Belief revision; Operator (biology); Artificial intelligence; Cognitive science; Calculus (dental); Psychology; Cognitive psychology","score_opus":0.048302891363341906,"score_gpt":0.31641031960924526,"score_spread":0.26810742824590333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189980513","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.02234744,0.0012770348,0.93449795,0.0018764054,0.0003558129,0.00010267836,0.00014108892,0.0007118331,0.038689792],"genre_scores_gemma":[0.7215667,0.0014385936,0.25232476,0.0011788623,0.00043170096,0.00023124395,0.00045407773,0.0002915819,0.02208248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586415,0.0010123431,0.000299653,0.0013922827,0.0009854725,0.00044608544],"domain_scores_gemma":[0.99260217,0.003133883,0.0006019379,0.002443881,0.0008175526,0.0004005989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043578944,0.0012406985,0.0008183765,0.0012913174,0.0017575676,0.0037124893,0.0025041823,0.0021926225,0.00980439],"category_scores_gemma":[0.010408639,0.0007175968,0.0025460266,0.00074256235,0.007758748,0.013080698,0.0042630574,0.0030905085,0.0011300929],"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.000044451503,0.00002055594,0.0004258967,0.00010148004,0.000027845308,0.00026479986,0.001029639,0.0039807404,0.0008934265,0.9713558,0.00059048727,0.021264827],"study_design_scores_gemma":[0.000021143316,0.000051645326,0.0002485348,0.00007189958,0.000047793237,0.000271267,0.0001569741,0.014999886,0.0013400584,0.9665197,0.016239686,0.000031490443],"about_ca_topic_score_codex":0.0039085103,"about_ca_topic_score_gemma":0.0023059675,"teacher_disagreement_score":0.00980439,"about_ca_system_score_codex":0.0017883792,"about_ca_system_score_gemma":0.002055833,"threshold_uncertainty_score":0.032799006},"labels":[],"label_agreement":null},{"id":"W2190206316","doi":"10.1023/a:1014929916547","title":"Speaking Your Mind: Large Inarticulateness Constitutional and Circumstantial","year":2002,"lang":"en","type":"article","venue":"Argumentation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Utterance; Epistemology; Articulation (sociology); Phenomenon; Philosophy; Psychology; Sociology; Linguistics; Law; Politics","score_opus":0.03153362823316836,"score_gpt":0.26335414476723884,"score_spread":0.2318205165340705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190206316","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.2736987,0.0015319205,0.3118505,0.037792724,0.00049983314,0.00027343878,0.00046717844,0.0009002889,0.37298545],"genre_scores_gemma":[0.98247683,0.00017621936,0.012562569,0.00065114297,0.00019302077,0.0001252822,0.0000776274,0.00012551575,0.0036117902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9793539,0.01102686,0.0010812441,0.0038479352,0.0030917998,0.0015982403],"domain_scores_gemma":[0.90893376,0.058016792,0.0044761663,0.021950325,0.004408636,0.0022142967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020138778,0.0006147816,0.0020819244,0.002568496,0.006562104,0.008437138,0.00289684,0.0053525344,0.012697864],"category_scores_gemma":[0.09573089,0.0012232518,0.0018522473,0.001750036,0.021900916,0.02408696,0.010452605,0.008249351,0.001175359],"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.000057645615,0.000023634868,0.00046875744,0.000027317046,0.00002180879,0.00010062666,0.0009787552,0.0002525507,0.00016705974,0.9941301,0.0007604172,0.0030113412],"study_design_scores_gemma":[0.000021952208,0.000006228446,0.00023745676,0.000009257605,0.000014958104,0.00006398435,0.00024563968,0.0010361334,0.00014162096,0.99677783,0.0014368122,0.0000082],"about_ca_topic_score_codex":0.0019770155,"about_ca_topic_score_gemma":0.001632011,"teacher_disagreement_score":0.020138778,"about_ca_system_score_codex":0.0032851791,"about_ca_system_score_gemma":0.0023186633,"threshold_uncertainty_score":0.106505334},"labels":[],"label_agreement":null},{"id":"W2190961789","doi":"","title":"How to progress beliefs in continuous domains","year":2014,"lang":"en","type":"article","venue":"Edinburgh Research Explorer (University of Edinburgh)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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 Toronto","funders":"","keywords":"Probabilistic logic; Robotics; Noise (video); Artificial intelligence; Computer science; Action (physics); Situation calculus; Human–computer interaction; Robot; Cognitive science; Psychology","score_opus":0.047103050301256166,"score_gpt":0.2835222915514625,"score_spread":0.23641924125020636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190961789","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.04481706,0.00051918614,0.9412618,0.001920638,0.00008520768,0.00011696129,0.00021798586,0.0011607129,0.009900383],"genre_scores_gemma":[0.5434683,0.0011037359,0.44249427,0.00035455002,0.00009046956,0.00024431464,0.00064543623,0.00034686213,0.011252118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663025,0.0013240621,0.00027745304,0.00062192715,0.00081159204,0.000334775],"domain_scores_gemma":[0.99277544,0.0041320943,0.00037138292,0.0017268374,0.00072631915,0.0002679394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071423054,0.00088494015,0.00075783435,0.0013762271,0.0014415454,0.0035120656,0.0019466431,0.0019032113,0.005435675],"category_scores_gemma":[0.018358875,0.0007718123,0.0017012358,0.001130605,0.005327862,0.014963678,0.0059387237,0.0038553565,0.0012876587],"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.00008979791,0.00002651165,0.0003539124,0.00015108571,0.000025417276,0.00010354086,0.0014015671,0.018654872,0.0015981469,0.9450657,0.0011773106,0.031352248],"study_design_scores_gemma":[0.00004294985,0.000041540738,0.00009230385,0.00006272517,0.000027821867,0.000041102372,0.0002945678,0.05671618,0.0031419664,0.93125373,0.008262039,0.000023140004],"about_ca_topic_score_codex":0.0033629427,"about_ca_topic_score_gemma":0.002561525,"teacher_disagreement_score":0.0071423054,"about_ca_system_score_codex":0.0015545031,"about_ca_system_score_gemma":0.0016199882,"threshold_uncertainty_score":0.037772596},"labels":[],"label_agreement":null},{"id":"W2193302029","doi":"10.1017/s1471068402001540","title":"The witness properties and the semantics of the Prolog cut","year":2002,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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":"Western University","funders":"","keywords":"Prolog; Computer science; Logic programming; Programming language; Semantics (computer science); Negation; Generalization; Horn clause; Well-founded semantics; Context (archaeology); Witness; Consistency (knowledge bases); Stable model semantics; Theoretical computer science; Operational semantics; Mathematics; Artificial intelligence; Denotational semantics","score_opus":0.035912039209565476,"score_gpt":0.2516279599677328,"score_spread":0.2157159207581673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193302029","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.02883697,0.00049966737,0.9347609,0.0026587204,0.00016313574,0.00015006027,0.00023304488,0.0010442346,0.031653326],"genre_scores_gemma":[0.65406156,0.0005681959,0.33555,0.00097421743,0.000191596,0.0003293108,0.00035439027,0.00051929423,0.0074514304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968221,0.0012565794,0.00022693133,0.00048750205,0.0008378099,0.00036910264],"domain_scores_gemma":[0.99644035,0.0018521188,0.00029863784,0.00076205644,0.00047432623,0.0001725297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034911016,0.00041731758,0.00049385533,0.0009289529,0.0014726678,0.0053957696,0.0013592014,0.0015435206,0.004219513],"category_scores_gemma":[0.007408629,0.0008017267,0.0011092557,0.00094318064,0.0076545333,0.009027882,0.0034648723,0.004243209,0.00074951287],"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.000030013838,0.000009787327,0.000088529945,0.000049760067,0.0000051819293,0.00007556706,0.00055239,0.0011780955,0.00069492194,0.9912361,0.00047332532,0.0056062597],"study_design_scores_gemma":[0.00003403908,0.00004098776,0.00010217329,0.000045689143,0.000017784849,0.00015715841,0.00026270308,0.010681386,0.0022516241,0.96891785,0.017467767,0.000020772],"about_ca_topic_score_codex":0.0014562052,"about_ca_topic_score_gemma":0.0009486037,"teacher_disagreement_score":0.0053957696,"about_ca_system_score_codex":0.0014858666,"about_ca_system_score_gemma":0.0014677766,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2201157850","doi":"10.1016/j.jvlc.2008.05.001","title":"Special issue on selected papers from VL/HCC 2007: Guest Editors’ introduction","year":2008,"lang":"en","type":"article","venue":"Journal of Visual Languages & Computing","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Formalism (music); Notation; Programming language; Usability; Software engineering; Model checking; Compiler; Unified Modeling Language; Human–computer interaction; Software","score_opus":0.008942213947632347,"score_gpt":0.2713270251029434,"score_spread":0.26238481115531104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201157850","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.000674777,0.025558123,0.0015048409,0.019473858,0.9209702,0.00015211853,0.0012632116,0.00067189,0.029730907],"genre_scores_gemma":[0.0047360123,0.028513245,0.0018366157,0.008739042,0.64768547,0.0002071767,0.003964515,0.001309296,0.30300862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983707,0.00017655636,0.00017690576,0.00023162701,0.0008198736,0.00022440148],"domain_scores_gemma":[0.9908913,0.000939408,0.00048478716,0.0003745755,0.0051925075,0.0021175053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002561503,0.0022578838,0.0027936778,0.0069379816,0.0016579855,0.008336508,0.0023538107,0.0026654406,0.15740876],"category_scores_gemma":[0.005724745,0.0006335685,0.0014091199,0.004837486,0.0005412924,0.0033782143,0.0023657626,0.0027322867,0.077230126],"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.000039069142,0.000019353192,0.00003334668,0.00019386379,0.000007031805,0.00003439511,0.000006318906,0.00003379454,0.00016251246,0.00020970871,0.98252064,0.016739907],"study_design_scores_gemma":[0.000030867322,0.000042119307,0.00051105884,0.00020946766,0.000026621785,0.00010265281,0.000028760756,0.0001354503,0.00027668962,0.0005577453,0.99806446,0.000014065642],"about_ca_topic_score_codex":0.0016763102,"about_ca_topic_score_gemma":0.004426947,"teacher_disagreement_score":0.15740876,"about_ca_system_score_codex":0.0021651129,"about_ca_system_score_gemma":0.0022125843,"threshold_uncertainty_score":0.52658474},"labels":[],"label_agreement":null},{"id":"W2205601656","doi":"","title":"Addressing Preemption Costs in Multi-Agent Resource Allocation for Medical Applications","year":2013,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","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 Waterloo","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Task (project management); Resource allocation; Operations research; Budget constraint; Risk analysis (engineering); Resource use; Distributed computing; Operations management; Business; Engineering; Microeconomics; Economics; Computer network; Systems engineering","score_opus":0.23762634520700787,"score_gpt":0.3978710104169647,"score_spread":0.16024466520995684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205601656","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.04697629,0.0005474222,0.94766444,0.0009402778,0.000057943584,0.00018742614,0.00010818187,0.00026647263,0.0032515267],"genre_scores_gemma":[0.66899145,0.00039846794,0.32873505,0.0001440136,0.000073558316,0.00020503408,0.00008048601,0.00010889154,0.0012630532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965959,0.0014778742,0.00021829478,0.00039051636,0.0010522611,0.0002651882],"domain_scores_gemma":[0.9847875,0.011777772,0.0015271599,0.00075498526,0.00083151244,0.00032101962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004733196,0.0011652873,0.0011394481,0.0015176623,0.001259507,0.0021141598,0.002724704,0.001587974,0.0025877687],"category_scores_gemma":[0.019149138,0.0012557644,0.0009981418,0.0014329548,0.0013442189,0.0037953604,0.0016355017,0.002528523,0.00015167509],"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.00010364322,0.00006941647,0.002150062,0.00017078152,0.000085925785,0.00018886312,0.00019069597,0.92332834,0.001569729,0.038155667,0.00066658907,0.0333202],"study_design_scores_gemma":[0.000013601694,0.000022618753,0.00038416253,0.000017573419,0.000030791412,0.000046237266,0.00006333841,0.9710137,0.00103118,0.026303587,0.0010595912,0.000013514702],"about_ca_topic_score_codex":0.010099893,"about_ca_topic_score_gemma":0.0130811045,"teacher_disagreement_score":0.010099893,"about_ca_system_score_codex":0.002189019,"about_ca_system_score_gemma":0.0026744453,"threshold_uncertainty_score":0.025031805},"labels":[],"label_agreement":null},{"id":"W2208753292","doi":"10.1007/978-3-642-32024-8_12","title":"Plural Quantifications and Generalized Quantifiers","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Plural; Computer science; Programming language; Algorithm; Theoretical computer science; Linguistics; Philosophy","score_opus":0.03244236520865941,"score_gpt":0.2625550003105009,"score_spread":0.2301126351018415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208753292","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.07243712,0.04361361,0.2856369,0.012373211,0.0016706554,0.00009084551,0.0006199396,0.0007919437,0.5827659],"genre_scores_gemma":[0.8293709,0.011442839,0.072027035,0.0018463068,0.0023093026,0.00011250553,0.0005216593,0.0003825589,0.081986986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896896,0.0003213655,0.000087909335,0.00027161962,0.00024793402,0.000102192644],"domain_scores_gemma":[0.9990854,0.0004969575,0.000082576895,0.00019130889,0.00010510271,0.000038682785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014517135,0.0010572372,0.0009561513,0.0016216377,0.0020582569,0.00489211,0.0014793673,0.001595492,0.009303001],"category_scores_gemma":[0.0028455171,0.0009809742,0.0012939293,0.0017885043,0.009357517,0.0136817545,0.0029300048,0.0035708635,0.0013403122],"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.000004891477,0.0000031024115,0.0000320511,0.000030770312,0.000004939423,0.00003426805,0.00024653593,0.00011786357,0.00012299453,0.99385226,0.0010488329,0.0045016096],"study_design_scores_gemma":[0.0000030053925,0.0000016592686,0.00003845512,0.00001522181,0.0000031849372,0.000038035752,0.00003873748,0.00016861426,0.000064646214,0.993246,0.006378915,0.0000036271838],"about_ca_topic_score_codex":0.0012506215,"about_ca_topic_score_gemma":0.0015703636,"teacher_disagreement_score":0.009303001,"about_ca_system_score_codex":0.0017917278,"about_ca_system_score_gemma":0.0005151633,"threshold_uncertainty_score":0.031121671},"labels":[],"label_agreement":null},{"id":"W2209723504","doi":"","title":"On the use of holonic agents in the design of information fusion systems","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thales (Canada); Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Context (archaeology); Sensor fusion; Representation (politics); Information system; Information fusion; Fusion; Interpretation (philosophy); Context model; Knowledge representation and reasoning; Data modeling; Intelligent decision support system; Multi-agent system; Systems engineering; Artificial intelligence; Software engineering; Engineering; Programming language","score_opus":0.03590871436453831,"score_gpt":0.23222860355716307,"score_spread":0.19631988919262477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209723504","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.0033272654,0.00067811436,0.98334,0.001013726,0.00006180155,0.00006863574,0.000016383307,0.000109073255,0.0113849025],"genre_scores_gemma":[0.3181563,0.0018827323,0.6735869,0.000649368,0.00012460013,0.00038828244,0.00008494188,0.00009230507,0.0050345794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962316,0.0018732233,0.00027886496,0.00039932682,0.001008331,0.00020871722],"domain_scores_gemma":[0.996734,0.0018173819,0.00028131588,0.00055533473,0.00045063003,0.00016125229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006388923,0.000857913,0.0006714781,0.0015070747,0.0019769047,0.0049802773,0.0017626833,0.0014549916,0.0026361723],"category_scores_gemma":[0.0070292875,0.0005828847,0.0011873806,0.0012352996,0.007723743,0.0070242435,0.004845683,0.0023018727,0.00055008783],"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.00003193222,0.000015435113,0.0001595631,0.00010398635,0.000024310111,0.000102473336,0.00079397514,0.024189377,0.000940537,0.95044076,0.00054828165,0.022649467],"study_design_scores_gemma":[0.000031615797,0.000069868845,0.000106843334,0.00014868002,0.000036480527,0.00010374243,0.00029320698,0.1100491,0.0023888196,0.8487319,0.038001206,0.00003853729],"about_ca_topic_score_codex":0.0027901784,"about_ca_topic_score_gemma":0.0029954095,"teacher_disagreement_score":0.006388923,"about_ca_system_score_codex":0.002680723,"about_ca_system_score_gemma":0.0018772206,"threshold_uncertainty_score":0.033788204},"labels":[],"label_agreement":null},{"id":"W2209861091","doi":"10.1017/cbo9780511794797.009","title":"Planning with Certainty","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"","keywords":"Reign; Certainty; Thread (computing); Database transaction; Plan (archaeology); Morning; Operations research; Operations management; History; Management; Engineering; Computer science; Political science; Medicine; Philosophy; Law; Economics; Mechanical engineering; Archaeology; Database; Epistemology","score_opus":0.019876969157106246,"score_gpt":0.19378426306134147,"score_spread":0.17390729390423523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209861091","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.002308892,0.009773286,0.18501496,0.03227272,0.001038471,0.00011063568,0.00050509896,0.0003346674,0.76864135],"genre_scores_gemma":[0.59885454,0.022305578,0.11600095,0.009834718,0.0024559705,0.0005286432,0.0013692712,0.0006154339,0.24803492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996763,0.001263602,0.00018817949,0.00069687894,0.0008283989,0.0002598576],"domain_scores_gemma":[0.9965933,0.0016508423,0.0002161361,0.0008507148,0.0005074597,0.0001815794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00407422,0.0011385432,0.00074640306,0.00093749684,0.0026921828,0.0078108353,0.0014576071,0.0026774092,0.027146732],"category_scores_gemma":[0.012060782,0.00074939395,0.0007686825,0.0009254122,0.011507721,0.013168616,0.004241434,0.0045637586,0.006619471],"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.000010522588,0.0000037236982,0.000035566914,0.0000394627,0.000008019084,0.000027232833,0.00027801289,0.0009500706,0.000036368234,0.9810177,0.009089341,0.008503888],"study_design_scores_gemma":[0.000007402828,0.000006685513,0.000035414087,0.00009953139,0.000005544103,0.000037521848,0.0001253048,0.0006603887,0.0000968334,0.8722737,0.12664264,0.000009017739],"about_ca_topic_score_codex":0.0056110527,"about_ca_topic_score_gemma":0.0058646905,"teacher_disagreement_score":0.027146732,"about_ca_system_score_codex":0.0039612185,"about_ca_system_score_gemma":0.0046955813,"threshold_uncertainty_score":0.09081483},"labels":[],"label_agreement":null},{"id":"W2211620915","doi":"","title":"On the progression of knowledge in multiagent systems","year":2014,"lang":"en","type":"article","venue":"Edinburgh Research Explorer (University of Edinburgh)","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":"University of Toronto","funders":"","keywords":"Computer science; Action (physics); Situation calculus; Modalities; Multi-agent system; Artificial intelligence; Order (exchange); Cognitive science; Epistemology; Psychology; Philosophy; Sociology","score_opus":0.08765123382694083,"score_gpt":0.31727886815854783,"score_spread":0.229627634331607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211620915","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.031732537,0.00828575,0.89037836,0.005526663,0.00031737224,0.0002169486,0.00038916944,0.00042577338,0.062727295],"genre_scores_gemma":[0.7312084,0.0077539547,0.24489778,0.0008269812,0.00068858796,0.00048900663,0.0005698287,0.00015878127,0.013406716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562436,0.0015471178,0.000343025,0.00082273135,0.0012798212,0.0003829391],"domain_scores_gemma":[0.9910425,0.0060384544,0.0005860752,0.0008927219,0.0008857666,0.00055437366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065398943,0.00096781965,0.0010763931,0.0027374849,0.0024849074,0.0043354956,0.0021315475,0.0024575288,0.005996381],"category_scores_gemma":[0.01267438,0.0008085149,0.0016501185,0.0026731652,0.010460238,0.019161522,0.004929707,0.006362353,0.0009030883],"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.000013228773,0.000007992482,0.00008838964,0.000037607144,0.0000045676015,0.000069850525,0.0006247913,0.0032199787,0.00017049708,0.99132687,0.0002508792,0.00418532],"study_design_scores_gemma":[0.000011809793,0.000017407,0.000045218578,0.000033787954,0.0000050707376,0.000036542402,0.00006623667,0.008599645,0.00015234412,0.9853833,0.0056379703,0.000010704676],"about_ca_topic_score_codex":0.0044880905,"about_ca_topic_score_gemma":0.0018919567,"teacher_disagreement_score":0.0065398943,"about_ca_system_score_codex":0.0034825106,"about_ca_system_score_gemma":0.0018369404,"threshold_uncertainty_score":0.034586668},"labels":[],"label_agreement":null},{"id":"W2217140526","doi":"","title":"Modular systems with preferences","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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":"Rotation formalisms in three dimensions; Modular design; Formalism (music); Computer science; Preference; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.18571591018512967,"score_gpt":0.3284845900494835,"score_spread":0.14276867986435382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217140526","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.008321784,0.000152233,0.9828744,0.00036719305,0.000035281002,0.00007998884,0.0000725387,0.00028079058,0.007815885],"genre_scores_gemma":[0.32268423,0.0004008941,0.6684826,0.00034005955,0.0001593681,0.00037209154,0.00027361972,0.00010895597,0.007178182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965322,0.0012374826,0.00033999325,0.0006438056,0.00090266875,0.0003439129],"domain_scores_gemma":[0.9970433,0.0009820119,0.0003926918,0.0008641251,0.0004603365,0.0002574823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043375706,0.00072537136,0.0005240803,0.0015492965,0.0011434817,0.0026039665,0.0017094347,0.0010535391,0.0054561016],"category_scores_gemma":[0.006597974,0.00068980845,0.0018166112,0.0015556886,0.0024351268,0.006541499,0.005147651,0.0020336863,0.0010853491],"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.000018263569,0.000019284085,0.00024934823,0.000065877546,0.0000416818,0.00017044401,0.00034746545,0.009035399,0.0015195741,0.96707034,0.00070734863,0.020755002],"study_design_scores_gemma":[0.000028917144,0.00004900916,0.00016003172,0.0000404224,0.00005434663,0.00018737068,0.000119717246,0.053827003,0.0020219798,0.92471534,0.018769376,0.000026427342],"about_ca_topic_score_codex":0.0016016244,"about_ca_topic_score_gemma":0.0014736953,"teacher_disagreement_score":0.0054561016,"about_ca_system_score_codex":0.0010682436,"about_ca_system_score_gemma":0.001173872,"threshold_uncertainty_score":0.022939503},"labels":[],"label_agreement":null},{"id":"W2227054253","doi":"10.1007/s10458-015-9313-5","title":"Exact and heuristic methods for solving Boolean games","year":2015,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; Queen's University; Fonds Wetenschappelijk Onderzoek; Queen's University Belfast","keywords":"Computer science; Heuristic; Boolean expression; Theoretical computer science; Representation (politics); Boolean data type; Mathematics; Boolean function; Algorithm; Artificial intelligence","score_opus":0.08074663229481495,"score_gpt":0.34863336652353255,"score_spread":0.2678867342287176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227054253","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.005649361,0.00088700623,0.9854682,0.00037164902,0.000091503534,0.00007850634,0.00010715717,0.0002567651,0.007089864],"genre_scores_gemma":[0.21100536,0.0011839034,0.78026986,0.0003376033,0.00021073269,0.00040621654,0.00034648785,0.00018038027,0.006059447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976653,0.000940081,0.00013515848,0.00025323618,0.00076444005,0.00024187802],"domain_scores_gemma":[0.99144226,0.007276281,0.00026125155,0.000460643,0.00040882034,0.00015078204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033660799,0.0014276454,0.0018146167,0.00209664,0.00091266196,0.0021004544,0.0031183595,0.0017946614,0.00803981],"category_scores_gemma":[0.015890352,0.000805629,0.0014511946,0.002343478,0.0024293049,0.004079965,0.001883219,0.0031489204,0.0006724948],"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.00017918125,0.00020432136,0.0005911634,0.00044405827,0.000112588285,0.00006261649,0.0001909339,0.42753392,0.00054339383,0.4097198,0.0048683924,0.15554966],"study_design_scores_gemma":[0.00005918254,0.000022535834,0.00008652076,0.00003809022,0.00002481714,0.000017341488,0.00003351907,0.67583376,0.00019716378,0.32222825,0.001447255,0.000011642348],"about_ca_topic_score_codex":0.0102362465,"about_ca_topic_score_gemma":0.014640516,"teacher_disagreement_score":0.0102362465,"about_ca_system_score_codex":0.0027190347,"about_ca_system_score_gemma":0.0027991736,"threshold_uncertainty_score":0.026895821},"labels":[],"label_agreement":null},{"id":"W2228999052","doi":"10.1016/j.artint.2016.04.006","title":"Bounded situation calculus action theories","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Provincia autonoma di Bolzano - Alto Adige; Sapienza Università di Roma","keywords":"Decidability; Bounded function; Situation calculus; Action (physics); Extension (predicate logic); Action theory (sociology); Mathematics; Object (grammar); Calculus (dental); Tuple; Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Artificial intelligence; Epistemology","score_opus":0.06660637544232685,"score_gpt":0.3137446923820261,"score_spread":0.2471383169396993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228999052","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.01134643,0.0012703375,0.8653191,0.0039994107,0.0001827835,0.00012535897,0.0005573644,0.00084897433,0.116350316],"genre_scores_gemma":[0.6592203,0.0017459744,0.2954189,0.0009862719,0.0003115791,0.0004900532,0.00166011,0.00025629526,0.03991052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619293,0.0015520651,0.00025590457,0.000563977,0.0011082677,0.00032691387],"domain_scores_gemma":[0.9948955,0.0033132688,0.00019767975,0.000729559,0.0005999303,0.0002640746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003021995,0.0012477825,0.0008925306,0.0021005215,0.002040137,0.005577764,0.0032193277,0.002191027,0.013866372],"category_scores_gemma":[0.0087709045,0.00086893555,0.0016802545,0.0019086137,0.005544877,0.0090358425,0.002816296,0.0041825376,0.002257714],"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.000011009533,0.000011342018,0.000038232505,0.00002289602,0.0000054379393,0.00002634042,0.000120238365,0.0014395145,0.00006669807,0.99393505,0.00087838166,0.003444782],"study_design_scores_gemma":[0.0000087415,0.000002869511,0.000018130835,0.000010496585,0.0000057237476,0.000012739069,0.000028738586,0.006027277,0.00008600861,0.99109054,0.0027048043,0.000003904522],"about_ca_topic_score_codex":0.005787642,"about_ca_topic_score_gemma":0.004274846,"teacher_disagreement_score":0.013866372,"about_ca_system_score_codex":0.0032992158,"about_ca_system_score_gemma":0.0025589473,"threshold_uncertainty_score":0.046387613},"labels":[],"label_agreement":null},{"id":"W2229338148","doi":"10.5753/cbie.wcbie.2015.1434","title":"Sistema de Suporte Pedagógico para Resolução de Problemas de Construção de Tabelas-Verdade na Lógica Proposicional","year":2015,"lang":"pt","type":"article","venue":"Anais ... Workshops do Congresso Brasileiro de Informática na Educação","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Bureau for International Education","keywords":"Propositional calculus; Computer science; Resolution (logic); Logical reasoning; Interface (matter); Truth table; Artificial intelligence; Human–computer interaction; Programming language; Algorithm","score_opus":0.05620190066119537,"score_gpt":0.31506873846636346,"score_spread":0.2588668378051681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229338148","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.014798458,0.0007015507,0.94391876,0.001806915,0.00013371873,0.00031277357,0.00020817814,0.007041122,0.03107851],"genre_scores_gemma":[0.15226807,0.0012797153,0.8267451,0.00038889956,0.00009147218,0.00042872087,0.00078691874,0.00076483615,0.0172462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488294,0.002581535,0.00034598858,0.00072121184,0.0013070973,0.00016128102],"domain_scores_gemma":[0.9860129,0.009267717,0.0004527853,0.0024526576,0.001507745,0.00030622963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007444521,0.00093997474,0.0009783421,0.0030019116,0.0014926291,0.005681991,0.0019602224,0.0016167446,0.01669562],"category_scores_gemma":[0.025386766,0.00068507827,0.0011755432,0.0019567842,0.0024860993,0.0070691686,0.004313133,0.0032595003,0.005226275],"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.000165295,0.00042212053,0.003843418,0.0011099948,0.000049966035,0.0002528848,0.0048934673,0.004590057,0.00937231,0.2689565,0.011704002,0.69464],"study_design_scores_gemma":[0.0002463134,0.00034194862,0.0036122468,0.0012327478,0.00013992937,0.0013177411,0.003400199,0.1597953,0.023465592,0.40472132,0.40163404,0.000092601505],"about_ca_topic_score_codex":0.002560386,"about_ca_topic_score_gemma":0.00449863,"teacher_disagreement_score":0.01669562,"about_ca_system_score_codex":0.0015969374,"about_ca_system_score_gemma":0.00402723,"threshold_uncertainty_score":0.055852413},"labels":[],"label_agreement":null},{"id":"W22480628","doi":"10.1016/j.pec.2012.03.005","title":"Belief change based on global minimisation","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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":"Bundesministerium für Bildung und Forschung","keywords":"Minimisation (clinical trials); Locality; Computer science; Mathematics; Theoretical computer science; Mathematical optimization","score_opus":0.16717372049550958,"score_gpt":0.344579529904238,"score_spread":0.17740580940872844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22480628","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.01280611,0.00021433634,0.9830944,0.00044232258,0.000067726614,0.00019566252,0.00006149471,0.00021772036,0.0029001143],"genre_scores_gemma":[0.5568302,0.00026947932,0.43641928,0.00034328087,0.00008839262,0.0012332739,0.0002897122,0.0001955712,0.0043308116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950447,0.002712234,0.00027576328,0.0008831434,0.00082747964,0.00025658656],"domain_scores_gemma":[0.98640126,0.010575134,0.0007277071,0.0006537473,0.0014135008,0.00022856737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0099020135,0.0015790473,0.0023489504,0.0016520639,0.000540406,0.0022883313,0.0021497377,0.0017404949,0.004934554],"category_scores_gemma":[0.03504909,0.0005846396,0.0015075317,0.0012919933,0.0018847235,0.0027201702,0.0028918558,0.0029818267,0.00048223473],"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.00035433116,0.00020194148,0.0031258122,0.00044430836,0.0005648281,0.000086445325,0.00070227863,0.7324294,0.0013935185,0.08542945,0.002192325,0.17307545],"study_design_scores_gemma":[0.00007427382,0.00025963798,0.00065378455,0.00006603593,0.00008085339,0.000035944573,0.00008855854,0.93509364,0.0007830733,0.061842535,0.0009893302,0.00003236127],"about_ca_topic_score_codex":0.0035488717,"about_ca_topic_score_gemma":0.0029789358,"teacher_disagreement_score":0.0099020135,"about_ca_system_score_codex":0.0020545078,"about_ca_system_score_gemma":0.0018822083,"threshold_uncertainty_score":0.05236751},"labels":[],"label_agreement":null},{"id":"W2249954593","doi":"10.1109/kse.2015.64","title":"Analyzing Belief Re-revision by Consideration of Reliability Change in Legal Case","year":2015,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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":"Downgrade; Reliability (semiconductor); Belief revision; Operator (biology); Belief structure; Computer science; Multi-agent system; Permission; Reliability theory; Order (exchange); Artificial intelligence; Reliability engineering; Computer security; Engineering; Law; Power (physics)","score_opus":0.05189678951585678,"score_gpt":0.3022995071602207,"score_spread":0.2504027176443639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249954593","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.7469856,0.0005954116,0.22669944,0.0022122446,0.000059195758,0.00016491368,0.000110151836,0.00010281292,0.023070214],"genre_scores_gemma":[0.9900204,0.00007750766,0.009111765,0.000026390631,0.000015603533,0.000024043866,0.00002460227,0.000005718003,0.0006939697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955716,0.0015666892,0.00025367975,0.0005201399,0.001310253,0.0007776493],"domain_scores_gemma":[0.9757835,0.016144037,0.0027199234,0.0018237431,0.002811544,0.0007172258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005478337,0.00036316243,0.00048215888,0.002337223,0.001231091,0.0024535777,0.0012537834,0.0011791644,0.0016197846],"category_scores_gemma":[0.026126284,0.00026552533,0.0011280037,0.0014015511,0.0037011271,0.0037343306,0.0016328029,0.0012839106,0.00008565698],"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.00026573887,0.00028162228,0.044830773,0.0002033612,0.00020294735,0.0056688827,0.010366116,0.13055712,0.0043212916,0.7447486,0.0018296627,0.056724057],"study_design_scores_gemma":[0.00004591856,0.0001450888,0.020339955,0.00007194193,0.00020768585,0.0010687505,0.0059910235,0.6772076,0.0028097776,0.2870868,0.0048902626,0.00013527826],"about_ca_topic_score_codex":0.024796452,"about_ca_topic_score_gemma":0.013662124,"teacher_disagreement_score":0.024796452,"about_ca_system_score_codex":0.0042467196,"about_ca_system_score_gemma":0.0023796412,"threshold_uncertainty_score":0.049304247},"labels":[],"label_agreement":null},{"id":"W2252001768","doi":"","title":"Decidable reasoning in a logic of limited belief with introspection and unknown individuals","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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 Toronto","funders":"","keywords":"Decidability; Introspection; Semantics (computer science); Computer science; Identity (music); Artificial intelligence; Epistemology; Theoretical computer science; Programming language; Philosophy","score_opus":0.0531541692446631,"score_gpt":0.27813317067781607,"score_spread":0.22497900143315297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252001768","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.055263765,0.0009040458,0.91885597,0.0051563103,0.000102516424,0.00013770316,0.0005607486,0.0008907754,0.018128276],"genre_scores_gemma":[0.64241683,0.000679557,0.34688944,0.0014183263,0.0003819061,0.00027208394,0.0007905754,0.00011480189,0.0070364936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947377,0.0020640276,0.0004038985,0.00097505614,0.0011381096,0.00068115187],"domain_scores_gemma":[0.986021,0.011116091,0.00075713935,0.0009916275,0.0007340574,0.00038018764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007911269,0.0007884454,0.0009400786,0.0016051831,0.0021285869,0.005558042,0.0030020745,0.0018532606,0.002359674],"category_scores_gemma":[0.013432191,0.0010249662,0.003973198,0.0017053538,0.006324818,0.010986704,0.0052178605,0.004797416,0.00032420983],"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.00008115809,0.00005224163,0.00041273417,0.000118686534,0.00005968515,0.000535457,0.0012719105,0.012441897,0.0011083652,0.97338843,0.0013156228,0.0092137195],"study_design_scores_gemma":[0.000050928167,0.000021669812,0.00013725163,0.000035571633,0.00005773053,0.00017577801,0.00018109079,0.048015118,0.0013905464,0.94650054,0.0034065973,0.000027258195],"about_ca_topic_score_codex":0.008338917,"about_ca_topic_score_gemma":0.008104579,"teacher_disagreement_score":0.008338917,"about_ca_system_score_codex":0.0034952776,"about_ca_system_score_gemma":0.0024713813,"threshold_uncertainty_score":0.041839242},"labels":[],"label_agreement":null},{"id":"W2257625122","doi":"10.1007/978-3-319-24704-5_16","title":"Investigating and Computing Bipartitions with Algebraic Means","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Binary relation; Disjoint sets; Algebraic number; Mathematical proof; Mathematics; Relation (database); Set (abstract data type); Dedekind cut; Algebraic structure; Algebra over a field; Discrete mathematics; Bipartite graph; Computer science; Pure mathematics; Graph","score_opus":0.030317516764445857,"score_gpt":0.24980518052539447,"score_spread":0.2194876637609486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257625122","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.061451275,0.0014229361,0.9110923,0.0007053395,0.00011728492,0.00008019002,0.00037876645,0.0008715098,0.023880428],"genre_scores_gemma":[0.41249943,0.0013414352,0.5789066,0.00018601307,0.00023308737,0.00010635358,0.0012014358,0.00039120356,0.005134556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969695,0.00082697824,0.00027646913,0.0007975842,0.00085142156,0.00027808503],"domain_scores_gemma":[0.99318224,0.0039322134,0.00050308625,0.0015752548,0.00055078237,0.00025639028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240156,0.0011269683,0.0016301629,0.004181803,0.0026073484,0.007618015,0.0027958814,0.0018574576,0.010425395],"category_scores_gemma":[0.014263598,0.0010986734,0.002863257,0.0054533463,0.005654431,0.01817793,0.006536437,0.0037792372,0.00179128],"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.000058867347,0.00002083482,0.0005494657,0.00021492837,0.000030432433,0.000039799594,0.0004167387,0.005425916,0.0010983835,0.956291,0.0015303403,0.034323264],"study_design_scores_gemma":[0.0000037062373,0.0000107309515,0.00009786828,0.000028092756,0.0000120998975,0.00003628916,0.00011290705,0.009627185,0.0006179051,0.9861407,0.0033015588,0.000011012482],"about_ca_topic_score_codex":0.0010610102,"about_ca_topic_score_gemma":0.0015166879,"teacher_disagreement_score":0.010425395,"about_ca_system_score_codex":0.0014288396,"about_ca_system_score_gemma":0.00084231194,"threshold_uncertainty_score":0.034876406},"labels":[],"label_agreement":null},{"id":"W2258235760","doi":"10.5555/2772879.2773380","title":"Synchronous Games in the Situation Calculus","year":2015,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"York University","funders":"","keywords":"Situation calculus; Action (physics); Computer science; Calculus (dental); Order (exchange); Process calculus; First order; Algebra over a field; Theoretical computer science; Mathematics; Artificial intelligence; Applied mathematics; Pure mathematics","score_opus":0.06160522134338561,"score_gpt":0.307615845076174,"score_spread":0.2460106237327884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258235760","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.014037555,0.0023802666,0.86199796,0.0030565928,0.00036464768,0.00020995796,0.00032665572,0.00057787,0.11704851],"genre_scores_gemma":[0.56829655,0.0024481283,0.39332786,0.0008376148,0.0007588995,0.0006835663,0.0004627791,0.00019878823,0.032985765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997832,0.00085265486,0.00016633235,0.000291425,0.00058322115,0.000274384],"domain_scores_gemma":[0.9986558,0.0006476879,0.0001305985,0.0002033003,0.00020481001,0.00015783262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025570162,0.001012985,0.0007831805,0.0014249593,0.0018796669,0.004732203,0.0017550037,0.0012804784,0.006175623],"category_scores_gemma":[0.0029101367,0.00065391685,0.0018743845,0.0013178017,0.0045578093,0.0073998757,0.0025574104,0.0029240225,0.0012624628],"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.0000031108386,0.000004123503,0.000024556306,0.00000817419,0.0000025789784,0.000033821154,0.00011934524,0.001637169,0.00007011008,0.99681807,0.0002619434,0.0010168953],"study_design_scores_gemma":[0.000013831296,0.000010667712,0.00004049692,0.000017962158,0.000011098063,0.000052643398,0.00006116171,0.020819638,0.00019900614,0.9589514,0.019811735,0.000010355448],"about_ca_topic_score_codex":0.005130352,"about_ca_topic_score_gemma":0.003489997,"teacher_disagreement_score":0.006175623,"about_ca_system_score_codex":0.0028190692,"about_ca_system_score_gemma":0.002212386,"threshold_uncertainty_score":0.020659566},"labels":[],"label_agreement":null},{"id":"W2260577857","doi":"10.2178/bsl/1203350881","title":"Shawn Hedman. A first course in logic: an introduction to model theory, proof theory, computability, and complexity. Oxford Texts in Logic 1. Oxford University Press, 2004, xx + 431 pp.","year":2007,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Proof theory; Model theory; Computability; Mathematical logic; Computability theory; Mathematics; Calculus (dental); Computer science; Cognitive science; Discrete mathematics; Algorithm; Psychology; Mathematical proof","score_opus":0.024485806948020182,"score_gpt":0.25233560539622024,"score_spread":0.22784979844820005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260577857","genre_codex":"review","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.00074257987,0.785653,0.02201718,0.07443621,0.013374791,0.00008100512,0.0010108972,0.00046389006,0.10222035],"genre_scores_gemma":[0.024955187,0.59987956,0.042113375,0.03207649,0.015993698,0.00023740654,0.0016614286,0.00088290876,0.28219992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992384,0.00018288479,0.00006713957,0.00012558415,0.00032463338,0.00006138634],"domain_scores_gemma":[0.99764484,0.0015334032,0.0001035529,0.0000833805,0.0004350515,0.00019975063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012631032,0.0018735281,0.001214111,0.0036771114,0.0012091352,0.0018185073,0.001439448,0.0021996452,0.03844931],"category_scores_gemma":[0.0022028626,0.0012864224,0.001050674,0.002954843,0.0031162377,0.0074909227,0.0013247177,0.0051978114,0.020085603],"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.000038997725,0.000053749518,0.00016343403,0.0005424775,0.00002145944,0.00009425843,0.00036802763,0.00032549936,0.00026294024,0.052034806,0.8323143,0.11378013],"study_design_scores_gemma":[0.000016041306,0.000029951449,0.00049296493,0.0005696656,0.000013226274,0.00025583833,0.00009576569,0.0002624965,0.0002652242,0.11651211,0.8814613,0.000025493167],"about_ca_topic_score_codex":0.0044190665,"about_ca_topic_score_gemma":0.009357098,"teacher_disagreement_score":0.03844931,"about_ca_system_score_codex":0.0027390437,"about_ca_system_score_gemma":0.0017226542,"threshold_uncertainty_score":0.12862575},"labels":[],"label_agreement":null},{"id":"W2265087217","doi":"","title":"A knowledge-level approach for effective acting, sensing, and planning","year":2006,"lang":"en","type":"article","venue":"TSpace","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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 Toronto","funders":"","keywords":"Computer science; Correctness; Knowledge representation and reasoning; Construct (python library); Action (physics); Planner; Situation calculus; Set (abstract data type); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.03881837425726273,"score_gpt":0.31524261972578493,"score_spread":0.2764242454685222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265087217","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.0033205654,0.00074441434,0.9625876,0.004204766,0.0000861589,0.00007036438,0.00010971539,0.0002044987,0.028671894],"genre_scores_gemma":[0.25222737,0.0012269221,0.73105115,0.0011107005,0.00026763746,0.00043397731,0.00035295685,0.0001458547,0.013183494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959258,0.0014248198,0.0003220039,0.0008890097,0.0011033268,0.00033511542],"domain_scores_gemma":[0.9968334,0.0015201479,0.00019974107,0.0009725898,0.0003037783,0.00017034356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004177254,0.00091434666,0.00078316784,0.0018364079,0.0021184627,0.0070189275,0.003880073,0.0023994413,0.007439955],"category_scores_gemma":[0.006606368,0.00091784244,0.0026437454,0.0016400449,0.012954207,0.0137415975,0.005561899,0.004546871,0.0011124081],"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.0000052008936,0.0000071680943,0.000040331783,0.000027543361,0.000007088848,0.000026609192,0.00020864344,0.0034477029,0.00013755458,0.9908613,0.00037709693,0.0048537683],"study_design_scores_gemma":[0.000009006802,0.000011546756,0.000043415515,0.000037399932,0.000012308302,0.000033211505,0.00010133937,0.017183563,0.00052683917,0.9677742,0.014254501,0.000012667839],"about_ca_topic_score_codex":0.006259178,"about_ca_topic_score_gemma":0.00448958,"teacher_disagreement_score":0.007439955,"about_ca_system_score_codex":0.0042891754,"about_ca_system_score_gemma":0.0034095952,"threshold_uncertainty_score":0.0311203},"labels":[],"label_agreement":null},{"id":"W2270172784","doi":"","title":"Reasoning about continuous uncertainty in the situation calculus","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"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 Toronto","funders":"","keywords":"Formalism (music); Situation calculus; Computer science; Countable set; Action (physics); Theoretical computer science; Artificial intelligence; Calculus (dental); Algorithm; Mathematics; Discrete mathematics","score_opus":0.06629843824728475,"score_gpt":0.30250740203530324,"score_spread":0.23620896378801848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270172784","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.024925627,0.0011367624,0.95051247,0.0036630563,0.00012801646,0.00007162202,0.00029191354,0.00045984707,0.018810773],"genre_scores_gemma":[0.7429689,0.0011543824,0.24982616,0.0006362957,0.00034459349,0.00023035081,0.00035474615,0.00009994725,0.0043846117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921296,0.0030153212,0.0005626122,0.000974296,0.0025475982,0.0007705207],"domain_scores_gemma":[0.9924775,0.0052397633,0.00047614472,0.0007820656,0.00064284226,0.00038186726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009367282,0.0010117997,0.0012740011,0.0021774636,0.0028260641,0.0072918283,0.0027603353,0.0022076312,0.0030145296],"category_scores_gemma":[0.015745925,0.0010953748,0.0025831787,0.0023828084,0.008093439,0.012958147,0.0060834386,0.004715714,0.00044794887],"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.000025401165,0.000013346596,0.0001918018,0.000036452624,0.000025658266,0.00017993727,0.00039471657,0.011929376,0.00023505987,0.98280764,0.0004730112,0.003687504],"study_design_scores_gemma":[0.000014100113,0.0000070302267,0.0000466541,0.00001547952,0.00001830569,0.000051590778,0.00008638281,0.03443318,0.00018557109,0.96317756,0.0019500883,0.000014136816],"about_ca_topic_score_codex":0.0076452694,"about_ca_topic_score_gemma":0.00573117,"teacher_disagreement_score":0.009367282,"about_ca_system_score_codex":0.0043791775,"about_ca_system_score_gemma":0.0024490734,"threshold_uncertainty_score":0.049539566},"labels":[],"label_agreement":null},{"id":"W227147738","doi":"10.1016/s0004-3702(02)00227-8","title":"Abduction in logic programming: A new definition and an abductive procedure based on rewriting","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rewriting; Answer set programming; Logic programming; Stable model semantics; Computer science; Programming language; Semantics (computer science); Non-monotonic logic; Set (abstract data type); Abductive reasoning; Circumscription; Logic program; Theoretical computer science; Artificial intelligence; Operational semantics","score_opus":0.12085611922082151,"score_gpt":0.30549535592446425,"score_spread":0.18463923670364274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227147738","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.0016527917,0.002377062,0.99154234,0.001157561,0.00019647162,0.00006646406,0.000042885098,0.00016249328,0.002802006],"genre_scores_gemma":[0.06360321,0.0033959807,0.92693174,0.0011025273,0.0010495955,0.0003593122,0.00018775207,0.00018791186,0.0031820459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894048,0.0038422348,0.0015485116,0.001988425,0.0028894711,0.00032661174],"domain_scores_gemma":[0.98873925,0.0074890084,0.0006169953,0.0016678052,0.0012642716,0.0002227102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011179623,0.0018222036,0.0023049794,0.004147059,0.0012734369,0.0062118596,0.006170825,0.0044666347,0.0024732936],"category_scores_gemma":[0.0149446,0.0018067876,0.0051985015,0.0041665155,0.014658164,0.017603787,0.006732686,0.012704777,0.0009895104],"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.000041023002,0.000050932278,0.0002452474,0.00033888355,0.00008983623,0.00020204672,0.00095608423,0.00398674,0.0015383707,0.94597584,0.0013946558,0.045180287],"study_design_scores_gemma":[0.000033393735,0.00006330005,0.00012068986,0.00013963613,0.0001316682,0.00047912647,0.0001221264,0.026603919,0.002251363,0.9556785,0.014321013,0.000055072087],"about_ca_topic_score_codex":0.00094836106,"about_ca_topic_score_gemma":0.0005535231,"teacher_disagreement_score":0.011179623,"about_ca_system_score_codex":0.0015839721,"about_ca_system_score_gemma":0.0014485602,"threshold_uncertainty_score":0.05912423},"labels":[],"label_agreement":null},{"id":"W2277190316","doi":"10.1007/978-3-642-30353-1_41","title":"Generalizing and Executing Plans","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Formalism (music); Sequence (biology); Representation (politics); Set (abstract data type); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.022831748787847037,"score_gpt":0.23961424723406072,"score_spread":0.21678249844621367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277190316","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.019642007,0.00076750957,0.9434172,0.0009378038,0.00011556022,0.00033938032,0.0003084143,0.0043106982,0.030161528],"genre_scores_gemma":[0.19356866,0.0016254197,0.78294605,0.00028802268,0.00011188112,0.00027091982,0.0016125984,0.0011966284,0.018379752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977664,0.00061607367,0.00018296018,0.00054149784,0.000634846,0.0002583656],"domain_scores_gemma":[0.99733305,0.0013536563,0.00011794859,0.0009503244,0.00017750917,0.000067566245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025434338,0.0014312105,0.0007494675,0.0011598107,0.00091498066,0.0031577353,0.002018887,0.0012945789,0.007875283],"category_scores_gemma":[0.008031793,0.0010958925,0.002416829,0.0012244228,0.003819404,0.0049673095,0.003945982,0.0031537993,0.0020765755],"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.00017431559,0.00010469329,0.0011535268,0.00046016244,0.00011306093,0.00042445082,0.002295978,0.05430355,0.006625003,0.6630348,0.0073954267,0.263915],"study_design_scores_gemma":[0.00004818617,0.00006721951,0.00035997396,0.00015606098,0.00011121543,0.00020095446,0.0003793488,0.09500455,0.010668464,0.8541331,0.038834564,0.00003639073],"about_ca_topic_score_codex":0.0056367056,"about_ca_topic_score_gemma":0.005928964,"teacher_disagreement_score":0.007875283,"about_ca_system_score_codex":0.001212611,"about_ca_system_score_gemma":0.0019634622,"threshold_uncertainty_score":0.026345491},"labels":[],"label_agreement":null},{"id":"W2277828988","doi":"10.1007/978-3-642-38457-8_32","title":"An Application of Answer Set Programming for Situational Analysis in a Maritime Traffic Domain","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Answer set programming; Domain (mathematical analysis); Delegate; Situation awareness; Solver; Abstraction; Set (abstract data type); Component (thermodynamics); Programming language; Situation analysis; Theoretical computer science; Artificial intelligence; Software engineering; Data mining","score_opus":0.013070988883505517,"score_gpt":0.2567934255036776,"score_spread":0.2437224366201721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277828988","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.008549749,0.00021348205,0.9737907,0.00066463795,0.0000723514,0.00012617419,0.00021418663,0.0015450002,0.01482363],"genre_scores_gemma":[0.11517588,0.0003157276,0.877604,0.00023990033,0.000080941536,0.00013595603,0.0004576672,0.0003910572,0.0055988077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987268,0.0005263946,0.0000853813,0.00022434969,0.00033700722,0.00010008165],"domain_scores_gemma":[0.9985146,0.0011494173,0.00004018316,0.00011445623,0.00013297732,0.000048354857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632715,0.00077640987,0.0007996678,0.0013228285,0.0011929657,0.0025716885,0.0020509758,0.0013688202,0.009700535],"category_scores_gemma":[0.0046293973,0.00048269442,0.0018973291,0.0015217955,0.0014205944,0.0026302414,0.0029940684,0.0021711881,0.0011334615],"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.00020647894,0.00034872378,0.0012077425,0.0004929617,0.0001194047,0.00048096193,0.001427292,0.085680485,0.006344512,0.53314894,0.013301497,0.35724092],"study_design_scores_gemma":[0.000044798857,0.000056526656,0.00043590923,0.00009024736,0.000075319826,0.0001895508,0.00038381948,0.50266653,0.0031510063,0.46806663,0.024803974,0.000035632558],"about_ca_topic_score_codex":0.004954496,"about_ca_topic_score_gemma":0.0062640132,"teacher_disagreement_score":0.009700535,"about_ca_system_score_codex":0.0008136174,"about_ca_system_score_gemma":0.00088750303,"threshold_uncertainty_score":0.03245151},"labels":[],"label_agreement":null},{"id":"W2281514722","doi":"10.48550/arxiv.1506.04299","title":"Query-Answer Causality in Databases: Abductive Diagnosis and View-Updates","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Causality (physics); Consistency (knowledge bases); Computer science; Focus (optics); Information retrieval; Abductive reasoning; Query optimization; Data integrity; Query language; Database; Data mining; Artificial intelligence","score_opus":0.1285122116878516,"score_gpt":0.22955267833462756,"score_spread":0.10104046664677596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281514722","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.016636305,0.0023896962,0.97363156,0.004327478,0.00012291619,0.0001373234,0.00024580111,0.0002534818,0.0022554095],"genre_scores_gemma":[0.6138676,0.0045195594,0.37520856,0.0014509,0.0008412379,0.00035812752,0.0008652161,0.00016382059,0.0027249376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9782784,0.008338406,0.001953413,0.0034118607,0.0071187383,0.0008993068],"domain_scores_gemma":[0.84619296,0.12550278,0.0076870513,0.010823693,0.008400402,0.0013931963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01985058,0.0014978474,0.0018467895,0.004139842,0.0016139554,0.0066305865,0.0038760058,0.003473147,0.003307156],"category_scores_gemma":[0.10614386,0.0014566816,0.0033217822,0.005365021,0.009110265,0.019263005,0.008395338,0.007409485,0.00034629452],"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.00041748752,0.00021563192,0.0063793226,0.00085301494,0.0003189465,0.00072877045,0.0014841807,0.08226806,0.0013571744,0.78946805,0.0026150593,0.11389437],"study_design_scores_gemma":[0.000037677106,0.0000333907,0.0003503234,0.00007941677,0.000095361414,0.00021805285,0.00018589804,0.14254501,0.0013593284,0.8534589,0.0016053343,0.000031345266],"about_ca_topic_score_codex":0.0060414346,"about_ca_topic_score_gemma":0.0034983016,"teacher_disagreement_score":0.01985058,"about_ca_system_score_codex":0.003969688,"about_ca_system_score_gemma":0.0041050394,"threshold_uncertainty_score":0.104981184},"labels":[],"label_agreement":null},{"id":"W2283360360","doi":"","title":"A reasoning module for long-lived cognitive agents","year":2009,"lang":"en","type":"dissertation","venue":"TSpace","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":"University of Toronto","funders":"","keywords":"Situation calculus; Action (physics); Conjecture; Class (philosophy); Function (biology); Computer science; Cognition; Cognitive science; Order (exchange); Perception; Artificial intelligence; Mathematics; Calculus (dental); Epistemology; Psychology; Pure mathematics; Philosophy","score_opus":0.03488536258956003,"score_gpt":0.3490583104941777,"score_spread":0.31417294790461764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283360360","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.09725709,0.0002656698,0.8912423,0.0008280058,0.00003605067,0.00018559925,0.000157016,0.0010717651,0.00895643],"genre_scores_gemma":[0.47690272,0.00026242997,0.50822055,0.0002793414,0.00009467122,0.00032867564,0.00046848427,0.00012285379,0.013320235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831486,0.0003847244,0.00016050322,0.00050613744,0.00044869416,0.00018511938],"domain_scores_gemma":[0.99715173,0.0013982023,0.0003004817,0.0005472949,0.00035882564,0.0002433612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028628416,0.000589062,0.0006467797,0.00081694627,0.001121727,0.0033398564,0.00215641,0.0016656424,0.005579703],"category_scores_gemma":[0.0061952677,0.0005931002,0.0021874844,0.00065587106,0.0030292403,0.010904271,0.0037268784,0.002921303,0.001131073],"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.00006298151,0.00008269744,0.000974776,0.00016159858,0.000047141108,0.00039147175,0.0013034755,0.015785884,0.0055488707,0.95715886,0.0004933376,0.017988946],"study_design_scores_gemma":[0.0000858839,0.00022215233,0.00079535897,0.00009945581,0.000110784975,0.0006249256,0.00042130315,0.20982984,0.010969768,0.75013226,0.026643112,0.00006521613],"about_ca_topic_score_codex":0.0013171284,"about_ca_topic_score_gemma":0.0008908288,"teacher_disagreement_score":0.005579703,"about_ca_system_score_codex":0.0016609582,"about_ca_system_score_gemma":0.0016470279,"threshold_uncertainty_score":0.01866597},"labels":[],"label_agreement":null},{"id":"W2287742635","doi":"10.1007/s11225-015-9648-6","title":"Matching Topological and Frame Products of Modal Logics","year":2016,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Cartesian product; Product (mathematics); Combinatorics; Physics; Topology (electrical circuits); Mathematics; Geometry","score_opus":0.02234388495915967,"score_gpt":0.2438347671193651,"score_spread":0.22149088216020543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287742635","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.3019122,0.0010513057,0.6463995,0.0014960365,0.0001870927,0.00012922644,0.0007901059,0.0007920829,0.047242466],"genre_scores_gemma":[0.9007405,0.00056233065,0.08600013,0.00022544799,0.00015217203,0.00011764349,0.0010615749,0.00022897076,0.010911184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747497,0.0007808014,0.00021555298,0.0005082165,0.00064975885,0.00037073303],"domain_scores_gemma":[0.99346817,0.0031891183,0.00079945213,0.0010940563,0.0009845272,0.00046466844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003333252,0.00057050545,0.0009130529,0.0028920386,0.0018767464,0.006623639,0.001950824,0.0017896848,0.011847465],"category_scores_gemma":[0.013932285,0.0007673209,0.0012704591,0.0032221288,0.0028516203,0.016426183,0.0034345181,0.0019139288,0.0009694392],"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.00011126382,0.000032008364,0.00032177358,0.000032493237,0.000012876332,0.00004136766,0.00024274501,0.0012890622,0.0006346157,0.9876381,0.00052348233,0.009120218],"study_design_scores_gemma":[0.000021913616,0.000030338597,0.0001716281,0.00001435552,0.000023478353,0.000047074383,0.00017938575,0.0072546895,0.0010907558,0.98844844,0.0027056814,0.000012325857],"about_ca_topic_score_codex":0.0022975106,"about_ca_topic_score_gemma":0.0019386986,"teacher_disagreement_score":0.011847465,"about_ca_system_score_codex":0.0022329818,"about_ca_system_score_gemma":0.0010785337,"threshold_uncertainty_score":0.03963375},"labels":[],"label_agreement":null},{"id":"W2290471876","doi":"10.5555/2615731.2615789","title":"A logical theory of robot localization","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Robot; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Task (project management); Domain (mathematical analysis); Extension (predicate logic); Action (physics); Logical conjunction; Theoretical computer science; Mathematics; Programming language; Engineering; Machine learning; Systems engineering","score_opus":0.060617050818150615,"score_gpt":0.27013361654936147,"score_spread":0.20951656573121086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290471876","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.0053369543,0.002800622,0.88337374,0.012891298,0.000468956,0.00006653247,0.0003323259,0.00044108107,0.094288476],"genre_scores_gemma":[0.53015286,0.004008887,0.42880413,0.0054258914,0.0013308028,0.00062329177,0.0007459099,0.000226094,0.028682182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979767,0.000809311,0.00013950106,0.00038763825,0.0005053914,0.00018142024],"domain_scores_gemma":[0.9975662,0.0012550171,0.00018971051,0.00037593895,0.00043778153,0.00017540484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032643944,0.0007125522,0.0006661869,0.0019360587,0.002617381,0.0053851143,0.0022415067,0.0022790248,0.0071932157],"category_scores_gemma":[0.004425287,0.00057259406,0.0019755212,0.0014831822,0.012381539,0.011172235,0.0031857267,0.0042279684,0.0017437297],"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.0000024559477,0.000003219391,0.000022266058,0.00001572647,0.000002933677,0.000019006811,0.00008962189,0.0005504655,0.000072758,0.99682754,0.0006583812,0.0017355614],"study_design_scores_gemma":[0.000008134713,0.0000077112145,0.00002950704,0.000021128011,0.0000048713114,0.00003274262,0.00006329557,0.002891289,0.000107548905,0.98385435,0.01297295,0.000006498263],"about_ca_topic_score_codex":0.0032442329,"about_ca_topic_score_gemma":0.001678479,"teacher_disagreement_score":0.0071932157,"about_ca_system_score_codex":0.0034137669,"about_ca_system_score_gemma":0.0019841725,"threshold_uncertainty_score":0.02476871},"labels":[],"label_agreement":null},{"id":"W2292328972","doi":"","title":"ALLEGRO: belief-based programming in stochastic dynamical domains","year":2015,"lang":"en","type":"article","venue":"Lirias (KU Leuven)","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"KU Leuven; Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Probabilistic logic; Bridging (networking); Robotics; Artificial intelligence; Robot; Theoretical computer science; Programming language","score_opus":0.02883877078185404,"score_gpt":0.26414714016425056,"score_spread":0.23530836938239652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292328972","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.0029837976,0.0001528868,0.99280167,0.00051575043,0.000021948876,0.00003039411,0.00006178917,0.00048930774,0.0029425093],"genre_scores_gemma":[0.28947234,0.0005141143,0.7026383,0.0005474514,0.00007492974,0.00033999857,0.00021022883,0.0001966518,0.0060058637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983822,0.0008024214,0.000103916434,0.00022103776,0.00037247955,0.0001179446],"domain_scores_gemma":[0.99771935,0.0017638877,0.00014622953,0.00013534796,0.00012268107,0.00011259479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266867,0.00070801337,0.00061403227,0.00066120044,0.0007714663,0.003047858,0.0016033134,0.0015075173,0.0035647408],"category_scores_gemma":[0.0063085537,0.00055481534,0.0013052877,0.00073062105,0.0030404977,0.0032766666,0.0029490679,0.0032365771,0.00068658154],"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.000055069704,0.00003443437,0.000251974,0.00011185117,0.000023814899,0.0001213935,0.00044201902,0.123427756,0.0008463532,0.8419654,0.0018644026,0.03085556],"study_design_scores_gemma":[0.0000237565,0.000023013119,0.000042885364,0.00003500518,0.000008915266,0.00004154357,0.000049474565,0.450019,0.00067447335,0.54038084,0.008686126,0.000015067982],"about_ca_topic_score_codex":0.0024951012,"about_ca_topic_score_gemma":0.0032988505,"teacher_disagreement_score":0.0035647408,"about_ca_system_score_codex":0.0014226374,"about_ca_system_score_gemma":0.0014606807,"threshold_uncertainty_score":0.017277062},"labels":[],"label_agreement":null},{"id":"W2293106227","doi":"","title":"Trust-sensitive belief revision","year":2015,"lang":"en","type":"article","venue":"ORCA Online Research @Cardiff (Cardiff University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Computer science; Class (philosophy); Partition (number theory); Set (abstract data type); Incentive; Domain (mathematical analysis); Computer security; Artificial intelligence; Mathematics","score_opus":0.09978399022294424,"score_gpt":0.32773272991465785,"score_spread":0.22794873969171361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293106227","genre_codex":"methods","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.03483206,0.00082132913,0.9516857,0.0016756217,0.00016065675,0.00022160169,0.00013217986,0.0004446964,0.010026226],"genre_scores_gemma":[0.8610922,0.0004908173,0.13335653,0.00051595847,0.00020077663,0.00025316363,0.00012834907,0.00007057527,0.0038915242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9849953,0.0077480446,0.0009560635,0.0023299896,0.003249269,0.000721323],"domain_scores_gemma":[0.9619533,0.022653487,0.0034800218,0.0065899724,0.0043365946,0.0009866265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015272721,0.0010825513,0.0014403139,0.0015413844,0.0012208876,0.0034858685,0.0022271327,0.0018688116,0.0027156],"category_scores_gemma":[0.049542964,0.00058871706,0.0018204431,0.0012529315,0.0048078313,0.005553055,0.0038218452,0.0036003839,0.0004988056],"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.00028752114,0.00010033535,0.0015791886,0.0004205621,0.00034067512,0.00038886568,0.0023407417,0.06734489,0.0036964545,0.8343964,0.0030649477,0.08603942],"study_design_scores_gemma":[0.00009399131,0.00016060346,0.00044784718,0.000076684795,0.00009476382,0.00023206015,0.00019251714,0.20042217,0.0023086385,0.7905366,0.0053620306,0.000072203766],"about_ca_topic_score_codex":0.0017871802,"about_ca_topic_score_gemma":0.0011457168,"teacher_disagreement_score":0.015272721,"about_ca_system_score_codex":0.0027803392,"about_ca_system_score_gemma":0.0019360302,"threshold_uncertainty_score":0.08077085},"labels":[],"label_agreement":null},{"id":"W2293359051","doi":"10.1007/978-3-319-25524-8_37","title":"Real-Time Conditional Commitment Logic","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Temporal logic; Computer science; Executable; Interval temporal logic; Modalities; Linear temporal logic; Class (philosophy); Extension (predicate logic); Interval (graph theory); Point (geometry); Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.03137005660421021,"score_gpt":0.26670173282554416,"score_spread":0.23533167622133394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293359051","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.0069926605,0.006563896,0.6932321,0.0039223344,0.0011507286,0.00008534823,0.00050678,0.0015513065,0.28599483],"genre_scores_gemma":[0.5523484,0.007294211,0.19096732,0.0020281929,0.0013023821,0.00024782913,0.0014766341,0.0009198301,0.24341519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.0001975747,0.000050861334,0.00016009765,0.00029479418,0.00008364818],"domain_scores_gemma":[0.9991769,0.00041570593,0.000049251532,0.00015465813,0.0001448891,0.00005861356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321751,0.000754254,0.00039232124,0.00058562367,0.000734729,0.0027495734,0.0020509874,0.0010755125,0.016554123],"category_scores_gemma":[0.0022140592,0.0005228519,0.0006743123,0.00095588405,0.0022520123,0.004577035,0.0012967169,0.00413452,0.003940773],"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.000021453716,0.000011555534,0.000018699991,0.000069300884,0.0000076236174,0.00003599825,0.000086862456,0.0012520636,0.0008231007,0.97287107,0.0068809274,0.017921356],"study_design_scores_gemma":[0.000017127168,0.000011383179,0.000049246504,0.000046188703,0.000010702158,0.00008134179,0.000028930792,0.0068202615,0.0014364021,0.9317234,0.059758477,0.000016578484],"about_ca_topic_score_codex":0.000990304,"about_ca_topic_score_gemma":0.00092282356,"teacher_disagreement_score":0.016554123,"about_ca_system_score_codex":0.0021376375,"about_ca_system_score_gemma":0.0009643156,"threshold_uncertainty_score":0.055379033},"labels":[],"label_agreement":null},{"id":"W2294820799","doi":"","title":"A formal account of nondeterministic and failed actions","year":2013,"lang":"en","type":"article","venue":"","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":"University of Toronto; Simon Fraser University","funders":"","keywords":"Nondeterministic algorithm; Computer science; Action (physics); Probabilistic logic; Object (grammar); Phenomenon; Extension (predicate logic); Set (abstract data type); Epistemology; Epistemic modal logic; Categorical variable; Theoretical computer science; Mathematical economics; Artificial intelligence; Mathematics; Machine learning; Multimodal logic; Programming language; Philosophy; Description logic","score_opus":0.01845839931709251,"score_gpt":0.24069652605653516,"score_spread":0.22223812673944265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294820799","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.024553932,0.001163783,0.80769163,0.00831208,0.0002636404,0.0001337449,0.00040388908,0.00040613874,0.15707111],"genre_scores_gemma":[0.8586958,0.0006925973,0.10995812,0.00091919716,0.00028069885,0.0004383708,0.00025170587,0.00016060227,0.028602868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707055,0.0007975251,0.0002471803,0.0004996485,0.00091926154,0.00046572494],"domain_scores_gemma":[0.993947,0.0034777916,0.00047400466,0.0011654976,0.00057036453,0.00036532932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004833039,0.00088236335,0.00056917453,0.0014811779,0.0029432802,0.0051327622,0.0034084306,0.0034988536,0.010774611],"category_scores_gemma":[0.006912716,0.0008539415,0.0015434567,0.001052564,0.0113943145,0.011971957,0.004142471,0.0046050716,0.0008666265],"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.0000019102738,0.000002066289,0.000033873595,0.000006458369,0.0000013000613,0.000031046708,0.000121153746,0.00075346587,0.000042023665,0.9984664,0.00012824779,0.00041211702],"study_design_scores_gemma":[0.0000058559704,0.0000042716556,0.000030432353,0.000011145346,0.0000036357496,0.00004648512,0.00004068258,0.005771093,0.00010942016,0.9898808,0.004091132,0.0000050420467],"about_ca_topic_score_codex":0.0029768266,"about_ca_topic_score_gemma":0.0027026385,"teacher_disagreement_score":0.010774611,"about_ca_system_score_codex":0.0032618744,"about_ca_system_score_gemma":0.0027969263,"threshold_uncertainty_score":0.036044657},"labels":[],"label_agreement":null},{"id":"W2295763493","doi":"10.26686/ajl.v13i1.3926","title":"Relevance Logic: Problems Open and Closed","year":2016,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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 Toronto","funders":"","keywords":"Decidability; Relevance (law); Fragment (logic); Semilattice; Mathematics; Decision problem; Algebra over a field; Computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.04184020616646513,"score_gpt":0.2815974418179703,"score_spread":0.23975723565150517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295763493","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.026739901,0.045894574,0.71256614,0.09886366,0.002783464,0.0002594789,0.0005769966,0.0005456773,0.111770086],"genre_scores_gemma":[0.5942761,0.037840325,0.28978458,0.015481304,0.021371514,0.0007811353,0.0013015502,0.0005295441,0.038633987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98623496,0.0060080555,0.0007413257,0.0028758992,0.003107488,0.0010324032],"domain_scores_gemma":[0.92351466,0.069189206,0.0014750536,0.002274256,0.0024898548,0.0010569864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015791845,0.0011058557,0.0024118894,0.003049393,0.007203937,0.0131784165,0.0042471797,0.0075122337,0.013457105],"category_scores_gemma":[0.047352895,0.0013417444,0.0029747016,0.0051343106,0.017131697,0.041130684,0.008945553,0.014690024,0.0018420604],"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.000050524435,0.00006826653,0.00023226794,0.00038888433,0.000024673147,0.00015531693,0.00064044533,0.001671307,0.00019802086,0.95641655,0.008442357,0.03171142],"study_design_scores_gemma":[0.000009886047,0.000009219047,0.000051121064,0.000050876613,0.0000059514064,0.00008859671,0.00013362631,0.0015180993,0.000090426525,0.99143606,0.006596028,0.000010072653],"about_ca_topic_score_codex":0.0023580256,"about_ca_topic_score_gemma":0.0011055961,"teacher_disagreement_score":0.015791845,"about_ca_system_score_codex":0.0049645174,"about_ca_system_score_gemma":0.0028434047,"threshold_uncertainty_score":0.0835163},"labels":[],"label_agreement":null},{"id":"W2307382549","doi":"","title":"Proceedings of the International Workshop on Logic in Databases (LID 2009)","year":2010,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Database; Computer science; Data science","score_opus":0.030235007549575622,"score_gpt":0.27178297803785123,"score_spread":0.24154797048827562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2307382549","genre_codex":"methods","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.020789867,0.085811555,0.7045129,0.06337205,0.04060905,0.00063982664,0.0038902068,0.005311375,0.07506322],"genre_scores_gemma":[0.11472947,0.06645801,0.5954497,0.017495897,0.017832315,0.000577608,0.02002484,0.0034220673,0.1640101],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954176,0.0018845412,0.0004519441,0.0008685758,0.0010380147,0.0003392124],"domain_scores_gemma":[0.9918045,0.0035247912,0.00021424136,0.0017620956,0.001797862,0.00089651754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011714167,0.0011972073,0.0027939156,0.0015713711,0.0016184226,0.011824192,0.0030952017,0.0026977076,0.035489384],"category_scores_gemma":[0.01229884,0.0013089435,0.0016532337,0.00200056,0.0020550212,0.013819817,0.004922522,0.007195553,0.01068869],"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.0008883149,0.0006895456,0.0015940149,0.00080044696,0.00019524533,0.0003536952,0.0009568564,0.0018512281,0.005050371,0.09477333,0.52491176,0.36793524],"study_design_scores_gemma":[0.00016526815,0.00017993199,0.0015460193,0.00063107366,0.00021293426,0.0011119859,0.0006047948,0.014329323,0.0051018326,0.13113663,0.8448942,0.00008598614],"about_ca_topic_score_codex":0.0042712954,"about_ca_topic_score_gemma":0.0075582927,"teacher_disagreement_score":0.035489384,"about_ca_system_score_codex":0.0032432151,"about_ca_system_score_gemma":0.00379396,"threshold_uncertainty_score":0.11872381},"labels":[],"label_agreement":null},{"id":"W2309824995","doi":"10.1016/j.ic.2011.10.004","title":"Intuitionistic Modal Logic and Applications (IMLA 2008)","year":2011,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Normal modal logic; Modal logic; Intuitionistic logic; Computer science; Modal; Multimodal logic; Accessibility relation; Dynamic logic (digital electronics); Mathematics; Programming language; Description logic; Propositional calculus; Engineering; Materials science","score_opus":0.023205470046829255,"score_gpt":0.23611807894244424,"score_spread":0.21291260889561497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309824995","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.004840124,0.06713815,0.6584534,0.017767455,0.0032536017,0.00011025408,0.0011515763,0.0017545312,0.24553092],"genre_scores_gemma":[0.24679679,0.042569008,0.5404297,0.008879428,0.0060262326,0.0005389262,0.0023050082,0.0009996052,0.15145534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992275,0.0002401289,0.00005529214,0.00016897127,0.00025116233,0.00005690586],"domain_scores_gemma":[0.999328,0.00030869627,0.00003648533,0.00012358955,0.0001672814,0.000036055524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016494595,0.0008689604,0.00088549516,0.0018392745,0.0015095939,0.005310646,0.0013447873,0.002362154,0.018343465],"category_scores_gemma":[0.002927098,0.0008547548,0.0011728001,0.0029157263,0.0028243593,0.007968442,0.002505157,0.005879806,0.007136998],"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.00002134112,0.00003124018,0.00009088085,0.00015209302,0.000017252034,0.000048504142,0.00024100569,0.00051786524,0.0003174096,0.9046459,0.03818995,0.05572645],"study_design_scores_gemma":[0.000005927248,0.000005280795,0.000119736025,0.00008836969,0.000012181911,0.0001182833,0.00004568289,0.001628932,0.00034165784,0.9023666,0.09525419,0.000013233356],"about_ca_topic_score_codex":0.001825524,"about_ca_topic_score_gemma":0.0019037313,"teacher_disagreement_score":0.018343465,"about_ca_system_score_codex":0.0025378691,"about_ca_system_score_gemma":0.0014016811,"threshold_uncertainty_score":0.061365068},"labels":[],"label_agreement":null},{"id":"W2311043595","doi":"","title":"A consistency-based system for knowledge base merging","year":2006,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Knowledge base; Consistency (knowledge bases); Merge (version control); Belief revision; Computer science; Vocabulary; Propositional calculus; Problem solver; Base (topology); Theoretical computer science; Weak consistency; Knowledge-based systems; Process (computing); Solver; Artificial intelligence; Algorithm; Mathematics; Information retrieval; Strong consistency; Programming language; Software engineering; Linguistics","score_opus":0.01421867465797648,"score_gpt":0.21948690458907824,"score_spread":0.20526822993110178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311043595","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.0050316625,0.00014111039,0.9816078,0.00026272287,0.000059672402,0.00020780711,0.0002445206,0.01019333,0.002251405],"genre_scores_gemma":[0.0915217,0.00015834798,0.902801,0.00022274027,0.000071015216,0.0003100368,0.0010940644,0.0005700372,0.0032511447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942344,0.0014095149,0.00088480016,0.0012477468,0.0019087512,0.00031482938],"domain_scores_gemma":[0.98825014,0.005679165,0.0006152139,0.0026701905,0.0024519174,0.00033333022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00749489,0.00085543224,0.0013409595,0.0034381088,0.0026557837,0.0053765597,0.00445719,0.0024253353,0.00717229],"category_scores_gemma":[0.026911706,0.0013420889,0.0016478208,0.0032180334,0.0020713136,0.007008868,0.00618007,0.00244645,0.002589655],"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.0009993768,0.00049848156,0.0039813183,0.00077249156,0.00026149905,0.00092432083,0.0019339687,0.065192804,0.018721016,0.25522262,0.02201745,0.62947464],"study_design_scores_gemma":[0.00046291982,0.00019340849,0.0005587794,0.00015174439,0.00037513222,0.0007236521,0.00024325348,0.713327,0.04208053,0.18063831,0.06107019,0.00017508763],"about_ca_topic_score_codex":0.0063731233,"about_ca_topic_score_gemma":0.0046398635,"teacher_disagreement_score":0.00749489,"about_ca_system_score_codex":0.001912693,"about_ca_system_score_gemma":0.0040819976,"threshold_uncertainty_score":0.039637268},"labels":[],"label_agreement":null},{"id":"W2313787739","doi":"10.1017/s1079898600003620","title":"Peter Smith. An introduction to formal logic. Cambridge University Press, Cambridge, 2003, viii + 357 pp.","year":2004,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","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 Waterloo","funders":"","keywords":"Content (measure theory); Computer science; Philosophy; Mathematics","score_opus":0.011904907138235448,"score_gpt":0.21331617885033677,"score_spread":0.20141127171210133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313787739","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069499435,0.8464796,0.057655904,0.017406587,0.005088425,0.000067213725,0.0020995862,0.0018705778,0.068637066],"genre_scores_gemma":[0.023587307,0.76455814,0.07752663,0.005171137,0.008809027,0.0003004001,0.0033403106,0.0018984232,0.1148087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876153,0.00025653042,0.00019921738,0.00021397951,0.0004904462,0.00007842015],"domain_scores_gemma":[0.99707484,0.0018666984,0.00016335571,0.00020952975,0.00055974815,0.00012585479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018945335,0.0028246266,0.0019076257,0.006416653,0.0013163403,0.002376564,0.0016220409,0.0019062907,0.050378792],"category_scores_gemma":[0.0040364843,0.0024734924,0.001866632,0.00571511,0.0031403748,0.0094344,0.0015163111,0.00445741,0.03433636],"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.00006294333,0.000050522685,0.00033620605,0.001762839,0.0000690261,0.00019406166,0.00068767654,0.0008882118,0.00040968572,0.09671301,0.6630584,0.23576744],"study_design_scores_gemma":[0.000025975905,0.000021661537,0.0006758604,0.0007429485,0.00003058623,0.00049142743,0.00014786185,0.00046098244,0.0003618655,0.16524751,0.83176196,0.000031356743],"about_ca_topic_score_codex":0.00594649,"about_ca_topic_score_gemma":0.009105257,"teacher_disagreement_score":0.050378792,"about_ca_system_score_codex":0.0024769173,"about_ca_system_score_gemma":0.001756233,"threshold_uncertainty_score":0.16853386},"labels":[],"label_agreement":null},{"id":"W2319616089","doi":"","title":"A Practical Logic of Cognitive Systems, Volume 2: The Reach of Abduction: Insight and Trial","year":2005,"lang":"en","type":"book","venue":"Elsevier eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"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 Lethbridge","funders":"","keywords":"Nobel laureate; Library science; Volume (thermodynamics); Computer science; Art; Physics; Literature","score_opus":0.033912943472474096,"score_gpt":0.2831757531036468,"score_spread":0.2492628096311727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319616089","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.00363655,0.10055569,0.13773975,0.024340492,0.0020195495,0.0000715704,0.00022397756,0.00031255357,0.73109984],"genre_scores_gemma":[0.39627403,0.06561879,0.12320059,0.007892339,0.004532632,0.0004717191,0.00056996016,0.0007093972,0.40073058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956876,0.00018056988,0.000026637614,0.00006266448,0.00013440945,0.000026893402],"domain_scores_gemma":[0.99898225,0.00071452506,0.000040595765,0.00012394093,0.00010626434,0.000032458094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009838622,0.00073651696,0.00044191108,0.00111476,0.0010788748,0.0045807795,0.0010063129,0.0015083323,0.008353136],"category_scores_gemma":[0.0027158028,0.00039880534,0.0004887352,0.0011165672,0.008808032,0.007411597,0.0011410563,0.0029471084,0.0017915803],"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.000007247641,0.0000044892663,0.000035182748,0.00009069254,0.0000033962206,0.00001847336,0.00023857644,0.0006522569,0.00007381639,0.9626693,0.019726785,0.016479736],"study_design_scores_gemma":[0.0000045163797,0.000005389133,0.000056726938,0.000108344844,0.0000025370084,0.00005194963,0.000083289335,0.00082364737,0.00006509199,0.90609133,0.09270378,0.0000034599232],"about_ca_topic_score_codex":0.0015873559,"about_ca_topic_score_gemma":0.0022311956,"teacher_disagreement_score":0.008353136,"about_ca_system_score_codex":0.002792039,"about_ca_system_score_gemma":0.0015558952,"threshold_uncertainty_score":0.027944028},"labels":[],"label_agreement":null},{"id":"W2320353775","doi":"10.1007/s11787-016-0144-1","title":"A Square of Oppositions in Intuitionistic Logic with Strong Negation","year":2016,"lang":"en","type":"article","venue":"Logica Universalis","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Negation; Intuitionistic logic; Falsity; Law of excluded middle; Negation as failure; Mathematics; Calculus (dental); Paraconsistent logic; Axiom; Axiomatic system; Algebra over a field; Pure mathematics; Discrete mathematics; Propositional calculus; Epistemology; Autoepistemic logic; Linguistics; Computer science; Multimodal logic; Philosophy; Artificial intelligence","score_opus":0.01645153217185681,"score_gpt":0.21973946768171043,"score_spread":0.20328793550985363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320353775","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.23739117,0.0012123561,0.42073292,0.008559802,0.0012552919,0.00012088128,0.00045758247,0.0007620671,0.329508],"genre_scores_gemma":[0.9331007,0.00021599446,0.045081098,0.000762508,0.00025730507,0.000071966264,0.00019338957,0.0001403424,0.020176817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975222,0.00082437193,0.00016378614,0.0005268619,0.00065754814,0.00030524668],"domain_scores_gemma":[0.9961184,0.0024865079,0.00021026975,0.00029950152,0.00058293244,0.00030238787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022679316,0.00038665897,0.00074547215,0.0011735746,0.002995552,0.004910869,0.0011680896,0.0016518019,0.011360948],"category_scores_gemma":[0.007755313,0.00073535205,0.0012634961,0.0011646404,0.0055082524,0.009715617,0.0033855287,0.0038948485,0.0015004878],"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.00007412405,0.00001539478,0.00014452578,0.000027591146,0.000008467472,0.000096768315,0.00024240684,0.00032250167,0.0006826055,0.99301493,0.0011428674,0.0042278757],"study_design_scores_gemma":[0.000024488549,0.000019171797,0.00009678289,0.000009557213,0.0000137232,0.0001107243,0.00014993516,0.0035720211,0.0005872336,0.9914328,0.0039731916,0.0000103342945],"about_ca_topic_score_codex":0.001099541,"about_ca_topic_score_gemma":0.0013104322,"teacher_disagreement_score":0.011360948,"about_ca_system_score_codex":0.0010643931,"about_ca_system_score_gemma":0.000753499,"threshold_uncertainty_score":0.038006127},"labels":[],"label_agreement":null},{"id":"W2326566256","doi":"10.22329/il.v36i1.4575","title":"An Early Exchange on the Interpretation of Arguments in Texts","year":2016,"lang":"en","type":"article","venue":"Informal Logic","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":true,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Interpretation (philosophy); Epistemology; COPI; Philosophy; Sociology; Linguistics","score_opus":0.017593260104257887,"score_gpt":0.25088355818317093,"score_spread":0.23329029807891305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326566256","genre_codex":"commentary","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.018118165,0.03537456,0.07894604,0.45538396,0.030116202,0.00006682783,0.00037957868,0.00033805385,0.38127676],"genre_scores_gemma":[0.69846934,0.017394941,0.046966214,0.04757514,0.04424965,0.00020468314,0.0003253381,0.0012401011,0.14357454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856995,0.009432866,0.00047134658,0.0013010827,0.0023940036,0.00070122915],"domain_scores_gemma":[0.9317464,0.056753997,0.0015697395,0.0038669433,0.0048469547,0.0012158308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012075381,0.0009065264,0.0008440724,0.003214227,0.008071691,0.011862848,0.0019396279,0.0065944586,0.0102457],"category_scores_gemma":[0.046804767,0.00063118956,0.0006358299,0.0034786258,0.021964764,0.02238544,0.006097802,0.014351174,0.0015721845],"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.000077924575,0.000012256082,0.000049560505,0.00006647836,0.0000065481254,0.00008303837,0.007935462,0.00007836315,0.00019749759,0.95733505,0.026544396,0.0076134773],"study_design_scores_gemma":[0.000028622171,0.000030475932,0.000262672,0.0003622397,0.0000118065,0.00013891763,0.0021158042,0.000597662,0.00074379623,0.48966956,0.5059967,0.000041637784],"about_ca_topic_score_codex":0.0024890583,"about_ca_topic_score_gemma":0.003040443,"teacher_disagreement_score":0.012075381,"about_ca_system_score_codex":0.007862924,"about_ca_system_score_gemma":0.0024744845,"threshold_uncertainty_score":0.06386149},"labels":[],"label_agreement":null},{"id":"W2331073395","doi":"10.1017/s1755020314000021","title":"QUANTIFIED MODAL LOGIC ON THE RATIONAL LINE","year":2014,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Modal logic; Mathematics; Multimodal logic; Linear subspace; Normal modal logic; Class (philosophy); Real line; Line (geometry); Topological space; S5; Dynamic logic (digital electronics); Topology (electrical circuits); Modal; Pure mathematics; Discrete mathematics; Computer science; Theoretical computer science; Artificial intelligence; Combinatorics; Physics; Description logic","score_opus":0.04627299118960957,"score_gpt":0.28825335169868405,"score_spread":0.24198036050907448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331073395","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.1628334,0.017586017,0.60586363,0.010943096,0.0003190897,0.00013216842,0.0011166679,0.00060204737,0.200604],"genre_scores_gemma":[0.9486667,0.0043155374,0.037261624,0.00076386833,0.00029596663,0.00008374891,0.0004829758,0.00004902289,0.008080447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975763,0.0010986599,0.00015437578,0.00030091574,0.00070392666,0.0001658586],"domain_scores_gemma":[0.99805295,0.00086089113,0.00018832978,0.00019037501,0.00061791134,0.00008952564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023272233,0.00048925745,0.0007555309,0.0022063472,0.00088501186,0.003965672,0.0008709054,0.0008149403,0.0034485331],"category_scores_gemma":[0.0028314,0.0003103713,0.00086160476,0.002568391,0.0068035508,0.006281205,0.0018181249,0.0020411226,0.00051986275],"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.000011026618,0.0000034592651,0.00003898985,0.00004376991,0.000009042904,0.000032646247,0.00009571713,0.0014354114,0.0002030636,0.9952402,0.00042682246,0.002459894],"study_design_scores_gemma":[0.000012303262,0.0000071150016,0.00008573278,0.00003405343,0.000007427827,0.000024643618,0.00007354265,0.0055722576,0.00038409492,0.9865029,0.007287444,0.000008396051],"about_ca_topic_score_codex":0.0043575843,"about_ca_topic_score_gemma":0.00249081,"teacher_disagreement_score":0.0043575843,"about_ca_system_score_codex":0.0027464374,"about_ca_system_score_gemma":0.0013009333,"threshold_uncertainty_score":0.019926846},"labels":[],"label_agreement":null},{"id":"W2332702779","doi":"10.1007/s11225-016-9659-y","title":"Special Issue on Logical Aspects of Multi-Agent Systems","year":2016,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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; Computational linguistics; Theoretical computer science; Artificial intelligence; Programming language; Natural language processing; Cognitive science; Psychology","score_opus":0.041621150993247646,"score_gpt":0.2700030614398125,"score_spread":0.22838191044656486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332702779","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.0014366226,0.117946856,0.016876712,0.05712335,0.6355832,0.0002527636,0.001042577,0.00066218636,0.16907574],"genre_scores_gemma":[0.015433487,0.080127575,0.0065243538,0.0139581645,0.66837144,0.00032274416,0.0021168834,0.0011384955,0.2120068],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99638295,0.0007601976,0.00035212666,0.0006408295,0.0015768087,0.00028703883],"domain_scores_gemma":[0.9939023,0.0028914798,0.00032348512,0.0006223107,0.001491038,0.00076944847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031549986,0.0016256426,0.0018156593,0.0029026056,0.0021593948,0.0082008885,0.0020353876,0.0035198694,0.08914344],"category_scores_gemma":[0.007736248,0.00063204503,0.0019487954,0.002143599,0.001882116,0.006243661,0.0029689725,0.0062156166,0.021549834],"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.000036687565,0.000055995337,0.0001584361,0.00070807594,0.00004699554,0.00018692171,0.00016502061,0.00036688492,0.00039766118,0.044931658,0.9122027,0.040742975],"study_design_scores_gemma":[0.000009565188,0.000024510688,0.0002196861,0.0002673966,0.000014016779,0.00020618713,0.000042128147,0.00030052767,0.00009147483,0.017702192,0.9811133,0.000009058021],"about_ca_topic_score_codex":0.00095274847,"about_ca_topic_score_gemma":0.0011311544,"teacher_disagreement_score":0.08914344,"about_ca_system_score_codex":0.0033083807,"about_ca_system_score_gemma":0.0029295692,"threshold_uncertainty_score":0.2982145},"labels":[],"label_agreement":null},{"id":"W2335720172","doi":"10.1016/j.inffus.2016.02.006","title":"The basic principles of uncertain information fusion. An organised review of merging rules in different representation frameworks","year":2016,"lang":"en","type":"article","venue":"Information Fusion","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Formalism (music); Consistency (knowledge bases); Representation (politics); Set (abstract data type); Theoretical computer science; Complete information; Fusion rules; Possibility theory; Data mining; Artificial intelligence; Mathematics; Mathematical economics; Fuzzy set; Fuzzy logic","score_opus":0.018008982110879125,"score_gpt":0.2640093276521168,"score_spread":0.2460003455412377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335720172","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043249605,0.45583805,0.46156812,0.010691376,0.001136014,0.00019510656,0.00034907518,0.00037160594,0.065525725],"genre_scores_gemma":[0.19480108,0.4786898,0.30259782,0.0045195767,0.005318077,0.0007936901,0.0010698556,0.00040092162,0.011809155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99332243,0.0021846716,0.00089432683,0.0010560744,0.0022306717,0.00031172668],"domain_scores_gemma":[0.9946221,0.003527127,0.00049323053,0.0005470635,0.00071831106,0.00009219405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009795048,0.0015712954,0.0017285008,0.007814262,0.001608373,0.008908327,0.004052355,0.0045255674,0.0037947763],"category_scores_gemma":[0.012725452,0.0013041731,0.0026043754,0.007965563,0.0106619885,0.016799677,0.003924007,0.0046966444,0.0017179848],"study_design_candidate":"not_applicable","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.000019016865,0.000014351865,0.00018904044,0.0008800164,0.00007137874,0.00011317343,0.0006967836,0.0037150348,0.0003024888,0.91134065,0.0034909875,0.079166986],"study_design_scores_gemma":[0.000005392505,0.000023746154,0.00035615815,0.000997665,0.00004700326,0.0003309001,0.00021046645,0.004661685,0.0006215541,0.8991309,0.09356499,0.000049501803],"about_ca_topic_score_codex":0.0025115542,"about_ca_topic_score_gemma":0.00086204446,"teacher_disagreement_score":0.009795048,"about_ca_system_score_codex":0.004191196,"about_ca_system_score_gemma":0.0021204222,"threshold_uncertainty_score":0.0518018},"labels":[],"label_agreement":null},{"id":"W234643","doi":"10.1007/978-3-540-24627-5_18","title":"Challenges in Fixpoint Computation with Multisets","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computation; Formalism (music); Equivalence (formal languages); Fixed point; Theoretical computer science; Logic programming; Semantics (computer science); Context (archaeology); Programming language; Algorithm; Mathematics","score_opus":0.034256866764457196,"score_gpt":0.2560838604968646,"score_spread":0.2218269937324074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W234643","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.026184447,0.027903568,0.8691055,0.04039026,0.0016440765,0.00010390705,0.0004839157,0.00197002,0.032214276],"genre_scores_gemma":[0.3646986,0.021962665,0.57658,0.0049505983,0.005650063,0.00036905034,0.0011593205,0.0014371726,0.023192562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98859453,0.0040874137,0.00087108836,0.0021787973,0.0035188154,0.0007492026],"domain_scores_gemma":[0.9486034,0.040822133,0.0006797936,0.0064698253,0.0024712775,0.0009536451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017043695,0.0013247291,0.004234878,0.0027955994,0.0047204946,0.0136850225,0.009730249,0.006748955,0.019714622],"category_scores_gemma":[0.04646612,0.0024636174,0.004217236,0.0069579678,0.01268454,0.069828495,0.0135465935,0.013851483,0.0049146153],"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.00006139137,0.00003199501,0.00018689033,0.00029523586,0.000032369993,0.000043289037,0.0002555129,0.0039929547,0.00013882261,0.9537974,0.0052904133,0.035873853],"study_design_scores_gemma":[0.000006363139,0.0000043259543,0.000015076072,0.00003062003,0.000005240009,0.00002047321,0.000045928864,0.0029592756,0.00010156866,0.9931874,0.003614848,0.000008709564],"about_ca_topic_score_codex":0.0023542228,"about_ca_topic_score_gemma":0.002212101,"teacher_disagreement_score":0.019714622,"about_ca_system_score_codex":0.0038022213,"about_ca_system_score_gemma":0.0024510263,"threshold_uncertainty_score":0.09013677},"labels":[],"label_agreement":null},{"id":"W2381302819","doi":"10.4018/978-1-61520-859-3.ch003","title":"Exceptions in Ontologies","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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":"Université de Montréal","funders":"","keywords":"Axiom; Ontology; Formalism (music); Closure (psychology); Computer science; IDEF5; Ontology components; Inference; Class (philosophy); Knowledge representation and reasoning; Theoretical computer science; Representation (politics); Set (abstract data type); Mathematics; Algebra over a field; Process ontology; Pure mathematics; Semantic Web; Artificial intelligence; Programming language; Ontology alignment","score_opus":0.02336506506854115,"score_gpt":0.2535302405595612,"score_spread":0.23016517549102006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2381302819","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.008596046,0.030179925,0.59784335,0.018417142,0.0027041142,0.00028292128,0.0006976739,0.0016227206,0.3396561],"genre_scores_gemma":[0.35426092,0.041177608,0.4477723,0.008172367,0.0044240104,0.0009125427,0.0032152904,0.0011785127,0.13888638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532664,0.0014923243,0.00056357466,0.0009333713,0.0013812751,0.00030286328],"domain_scores_gemma":[0.99499375,0.0028403245,0.000397824,0.0010839149,0.0005047961,0.00017941595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003968939,0.0008005869,0.0011144255,0.002875112,0.003099215,0.0100621,0.0027313423,0.0030120641,0.007888252],"category_scores_gemma":[0.008582267,0.00075886276,0.0012715638,0.003544694,0.0078411475,0.017645571,0.0061099054,0.0038510442,0.0023390707],"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.0000034853647,0.000004545222,0.000057855883,0.00008158691,0.000004411047,0.00006801815,0.00039288195,0.0005654428,0.00006131096,0.97963345,0.004127499,0.014999521],"study_design_scores_gemma":[0.0000043838495,0.0000031987704,0.00005850593,0.00014471977,0.0000070520923,0.00013623523,0.00018033182,0.0015609722,0.00013658035,0.82149756,0.17626125,0.000009277583],"about_ca_topic_score_codex":0.0029370596,"about_ca_topic_score_gemma":0.0021028917,"teacher_disagreement_score":0.0100621,"about_ca_system_score_codex":0.003400322,"about_ca_system_score_gemma":0.002141711,"threshold_uncertainty_score":0.026388824},"labels":[],"label_agreement":null},{"id":"W2399684148","doi":"10.48550/arxiv.cs/0207071","title":"A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Simon Fraser University","funders":"","keywords":"Translation (biology); Computer science; Programming language; Logic program; Mathematics; Logic programming; Biology","score_opus":0.07103916910826698,"score_gpt":0.28011765511280756,"score_spread":0.2090784860045406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399684148","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.017519295,0.00021038004,0.9727853,0.0003285565,0.00007028231,0.00013727786,0.00019561217,0.0040829624,0.0046702055],"genre_scores_gemma":[0.18008357,0.0004560474,0.81036615,0.0002936806,0.00012312963,0.00016761656,0.0010628554,0.0017209335,0.0057260958],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762124,0.00041834154,0.00019166904,0.0005701541,0.000929144,0.0002693798],"domain_scores_gemma":[0.9958419,0.0021306414,0.00020123021,0.0010868588,0.0006132562,0.0001260813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017619318,0.0006212324,0.00047613517,0.00056712347,0.00039841738,0.0017515837,0.0012019817,0.00045898402,0.009646618],"category_scores_gemma":[0.007261922,0.00070655334,0.001419086,0.000844605,0.0012437855,0.0034714642,0.0023871048,0.0029767416,0.0026566756],"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.0004535766,0.0008113608,0.0019990802,0.0010205132,0.000078961995,0.00058408035,0.0011727053,0.056180455,0.055410136,0.35098717,0.014380515,0.51692134],"study_design_scores_gemma":[0.00029387468,0.00035593717,0.0012589055,0.00013187775,0.00015985248,0.0008757419,0.0001884429,0.5131157,0.11846149,0.25853622,0.10650143,0.00012054969],"about_ca_topic_score_codex":0.0025565992,"about_ca_topic_score_gemma":0.0021800708,"teacher_disagreement_score":0.009646618,"about_ca_system_score_codex":0.0014521761,"about_ca_system_score_gemma":0.0013476355,"threshold_uncertainty_score":0.032271147},"labels":[],"label_agreement":null},{"id":"W2399696728","doi":"10.1609/aaai.v29i1.9402","title":"A Syntax-Independent Approach to Forgetting in Disjunctive Logic Programs","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Forgetting; Computer science; Logic program; Characterization (materials science); Set (abstract data type); Programming language; Syntax; Atom (system on chip); Inference; Artificial intelligence; Linguistics; Logic programming; Philosophy; Operating system; Physics","score_opus":0.13896157369015405,"score_gpt":0.3008111010752447,"score_spread":0.16184952738509067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399696728","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.011111471,0.00023701035,0.9840943,0.00038812959,0.000060616832,0.00008317894,0.0001132949,0.001703039,0.0022088508],"genre_scores_gemma":[0.21650404,0.00052073324,0.77531016,0.00087425165,0.00031684726,0.00021373501,0.0006016872,0.0010085598,0.0046499996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925882,0.0013659213,0.0006332216,0.0014838293,0.003289261,0.0006395171],"domain_scores_gemma":[0.98342705,0.0075016757,0.000808304,0.0061385217,0.0018046868,0.00031977307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051567233,0.0010799633,0.0011361516,0.0022294142,0.0012141527,0.0035484387,0.005470442,0.0016030311,0.004257262],"category_scores_gemma":[0.0151228,0.0013520161,0.0044111474,0.0019898005,0.0047307573,0.011285913,0.0062330575,0.0068401783,0.000788014],"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.00036920872,0.00024144343,0.0022504402,0.00076310476,0.00018932912,0.00072236155,0.0018975092,0.04481166,0.020828892,0.69919974,0.0036580104,0.22506835],"study_design_scores_gemma":[0.00007246568,0.0001466155,0.00045557253,0.00011504987,0.00026432378,0.00059804606,0.00016549464,0.16516125,0.037779205,0.7739008,0.02123931,0.000101881495],"about_ca_topic_score_codex":0.0013930007,"about_ca_topic_score_gemma":0.0019753557,"teacher_disagreement_score":0.005470442,"about_ca_system_score_codex":0.001721645,"about_ca_system_score_gemma":0.00171673,"threshold_uncertainty_score":0.027271688},"labels":[],"label_agreement":null},{"id":"W2400133969","doi":"","title":"Independence Of Countable Sets Of Formulas Of The Propositional Logic.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Countable set; Independence (probability theory); Propositional calculus; Propositional variable; Zeroth-order logic; Discrete mathematics; Autoepistemic logic; Calculus (dental); Intermediate logic; Theoretical computer science; Computer science; Statistics; Description logic; Multimodal logic","score_opus":0.01090722998033623,"score_gpt":0.22822507375646303,"score_spread":0.2173178437761268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400133969","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.1834769,0.002982129,0.5500418,0.005189592,0.00049546146,0.00021068298,0.0037138814,0.0010038104,0.2528858],"genre_scores_gemma":[0.91274923,0.00097428955,0.053720757,0.000932142,0.00088606623,0.00027809292,0.0036426894,0.0003599569,0.026456818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99263036,0.0022756176,0.00062924187,0.001332889,0.002257694,0.000874135],"domain_scores_gemma":[0.97094077,0.02032413,0.0015378671,0.0032333757,0.002422644,0.0015411574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003967569,0.0007015457,0.0014846574,0.0036799805,0.0035479276,0.006832398,0.0022079065,0.0014795328,0.009140693],"category_scores_gemma":[0.019205213,0.0015660415,0.003779749,0.0018196442,0.0051125893,0.014091133,0.0050042355,0.006678411,0.0015466514],"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.00014819493,0.000080922946,0.0010805095,0.00008606344,0.000086299086,0.00015133154,0.00030797409,0.000614905,0.00080854335,0.9878015,0.0017484234,0.007085327],"study_design_scores_gemma":[0.000040264265,0.000017060347,0.0009873018,0.0000385658,0.00007312406,0.00020849587,0.00008956869,0.0052295453,0.001319641,0.98753417,0.004442702,0.000019598994],"about_ca_topic_score_codex":0.0028369196,"about_ca_topic_score_gemma":0.0040965155,"teacher_disagreement_score":0.009140693,"about_ca_system_score_codex":0.0025447372,"about_ca_system_score_gemma":0.001771146,"threshold_uncertainty_score":0.030578673},"labels":[],"label_agreement":null},{"id":"W2400415486","doi":"10.1007/978-3-319-26350-2_54","title":"Absorption for ABoxes and TBoxes with General Value Restrictions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Value (mathematics); Range (aeronautics); Domain (mathematical analysis); Work (physics); Base (topology); Theoretical computer science; Mathematics; Machine learning; Physics; Thermodynamics","score_opus":0.02610433299061919,"score_gpt":0.2565385743376311,"score_spread":0.23043424134701193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400415486","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.01199791,0.0043004067,0.92912984,0.0021139514,0.0005688304,0.00012502067,0.00043035715,0.0011336153,0.050200094],"genre_scores_gemma":[0.26842716,0.005775717,0.66405016,0.0016498646,0.001061113,0.0005231181,0.0014404344,0.0011818614,0.055890538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980793,0.0005030888,0.00025091416,0.00046884496,0.00045083734,0.00024699632],"domain_scores_gemma":[0.9964977,0.0021350763,0.00016899584,0.0007356778,0.0003704532,0.00009208188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030101587,0.001167777,0.00097586773,0.0015078355,0.0015170556,0.0044531906,0.0017879503,0.0019101141,0.011035599],"category_scores_gemma":[0.006328829,0.0014951684,0.00251268,0.0019208485,0.0031191378,0.01469641,0.003595138,0.006854602,0.0032207477],"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.000036983376,0.00003293714,0.00013256361,0.00025242285,0.000023597979,0.00013423564,0.0004901268,0.000623797,0.0015744295,0.94606066,0.004319387,0.046318978],"study_design_scores_gemma":[0.000015280562,0.000016504984,0.000089602676,0.00012080459,0.000030114777,0.00024656288,0.00009693323,0.002724854,0.0013980294,0.97029436,0.024951493,0.000015337619],"about_ca_topic_score_codex":0.000979013,"about_ca_topic_score_gemma":0.0009557965,"teacher_disagreement_score":0.011035599,"about_ca_system_score_codex":0.0013963418,"about_ca_system_score_gemma":0.0012319455,"threshold_uncertainty_score":0.036917746},"labels":[],"label_agreement":null},{"id":"W2400452393","doi":"","title":"Kernel contraction and base dependence: redundancy in the base resulting in different types of dependence","year":2015,"lang":"en","type":"article","venue":"","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":"University of Alberta; Simon Fraser University","funders":"","keywords":"Belief revision; Contraction (grammar); Knowledge base; Redundancy (engineering); Computer science; Mathematics; Base (topology); Theoretical computer science; Artificial intelligence","score_opus":0.03795989307581698,"score_gpt":0.2716025185068079,"score_spread":0.2336426254309909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400452393","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.23032714,0.00053199206,0.74623495,0.00094224035,0.000063282256,0.00012779661,0.0003096856,0.00052228436,0.020940548],"genre_scores_gemma":[0.9084162,0.00022071572,0.086328335,0.00019730999,0.000057802816,0.00014439678,0.00030080727,0.0001821359,0.004152322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965049,0.000814579,0.00028226155,0.0006493997,0.0013228493,0.00042600694],"domain_scores_gemma":[0.9770134,0.01224134,0.0016646815,0.0059828605,0.0024195174,0.0006781984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037893527,0.0006180945,0.000794986,0.001797479,0.0009431119,0.0020643284,0.0019153511,0.0011948148,0.0052378504],"category_scores_gemma":[0.02492327,0.0006310597,0.001300239,0.001536577,0.004289827,0.007401431,0.0045229876,0.0022973062,0.00050362566],"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.0004927028,0.000145722,0.008206409,0.00043604372,0.000104823885,0.001046012,0.0038084383,0.012545932,0.015875015,0.86712736,0.001756837,0.088454716],"study_design_scores_gemma":[0.00005080238,0.0001614367,0.00599057,0.000089432026,0.000119860706,0.0013565525,0.00072208606,0.10445934,0.01129955,0.8702101,0.005466959,0.00007334572],"about_ca_topic_score_codex":0.0011238599,"about_ca_topic_score_gemma":0.00075763545,"teacher_disagreement_score":0.0052378504,"about_ca_system_score_codex":0.0012863575,"about_ca_system_score_gemma":0.0008210533,"threshold_uncertainty_score":0.020040214},"labels":[],"label_agreement":null},{"id":"W2401141395","doi":"","title":"Towards a Rule-Based Interpretation of Conditional Defaults.","year":2006,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Defeasible estate; Interpretation (philosophy); Non-monotonic logic; Defeasible reasoning; Default logic; Inference; Property (philosophy); Computer science; Default; Rule of inference; Default rule; Artificial intelligence; Mathematics; Theoretical computer science; Mathematical economics; Description logic; Epistemology; Economics; Programming language; Philosophy","score_opus":0.008217641335574429,"score_gpt":0.23313109853844094,"score_spread":0.2249134572028665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401141395","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.0028718375,0.001572815,0.95381194,0.0038567225,0.00064636715,0.00011656004,0.00046681144,0.0009286257,0.035728287],"genre_scores_gemma":[0.12086471,0.0015047801,0.86347646,0.002551134,0.0008548045,0.00025653563,0.0010975947,0.0004665169,0.008927546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962788,0.0014470608,0.00038629788,0.00062782003,0.0010409865,0.00021898939],"domain_scores_gemma":[0.9949798,0.0021519114,0.00031450283,0.0012653488,0.000988401,0.0002999771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065274113,0.0009773807,0.0011543587,0.0027101908,0.0013095918,0.008328584,0.004705591,0.0044661085,0.010082583],"category_scores_gemma":[0.011684631,0.0015326287,0.0028722016,0.001720697,0.00742406,0.013596033,0.004814178,0.008449985,0.0039380905],"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.00004405458,0.00004359385,0.00013454615,0.00012197629,0.000038103237,0.00023141669,0.0005248452,0.0016400053,0.0009854555,0.9752356,0.005014639,0.015985709],"study_design_scores_gemma":[0.00003768389,0.000014375353,0.00009370503,0.00009553835,0.000032708467,0.00013959945,0.00009405446,0.013978497,0.0007654253,0.9585249,0.02620499,0.000018498306],"about_ca_topic_score_codex":0.0018851883,"about_ca_topic_score_gemma":0.0022775256,"teacher_disagreement_score":0.010082583,"about_ca_system_score_codex":0.0015021561,"about_ca_system_score_gemma":0.0012945345,"threshold_uncertainty_score":0.034520626},"labels":[],"label_agreement":null},{"id":"W2401244395","doi":"","title":"Extending AGM contraction to arbitrary logics","year":2015,"lang":"en","type":"article","venue":"Griffith Research Online (Griffith University, Queensland, Australia)","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Contraction (grammar); Conjunction (astronomy); Computer science; Mathematics; Algorithm; Mathematical economics; Theoretical computer science; Linguistics; Philosophy; Physics","score_opus":0.2948260427832511,"score_gpt":0.4045158067958292,"score_spread":0.10968976401257813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401244395","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.04014596,0.00028180302,0.9216676,0.0012760641,0.0001596589,0.00018782407,0.00014726601,0.0004986689,0.035635304],"genre_scores_gemma":[0.51362145,0.0004797096,0.47070318,0.0011008589,0.00030206004,0.0004939677,0.00042923776,0.00037516773,0.012494335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574125,0.0016314771,0.00025437737,0.0008595121,0.001075745,0.00043766337],"domain_scores_gemma":[0.9932904,0.0028826492,0.00035533932,0.0020522566,0.0011038011,0.0003155228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006065054,0.0006775102,0.00082678336,0.0014188401,0.0018320384,0.0017476518,0.0024679983,0.0012825112,0.004299106],"category_scores_gemma":[0.013769491,0.0004659853,0.0021976002,0.0016326257,0.004763265,0.0070139673,0.0071457047,0.004376295,0.00075228466],"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.000055642628,0.00004996438,0.00026813507,0.00006895972,0.000017475633,0.00019303507,0.00068812,0.008384594,0.0022743368,0.95248234,0.0018057156,0.03371177],"study_design_scores_gemma":[0.000037457197,0.000061394974,0.00019102049,0.00002987738,0.000017824206,0.00024921278,0.0002572215,0.091285095,0.002406565,0.88606805,0.019368459,0.000027882612],"about_ca_topic_score_codex":0.002056245,"about_ca_topic_score_gemma":0.001655698,"teacher_disagreement_score":0.006065054,"about_ca_system_score_codex":0.0016570449,"about_ca_system_score_gemma":0.0023602075,"threshold_uncertainty_score":0.032075465},"labels":[],"label_agreement":null},{"id":"W2402236082","doi":"10.48550/arxiv.1405.1229","title":"Three Semantics for Modular Systems","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Operational semantics; Computer science; Semantics (computer science); Programming language; Well-founded semantics; Action semantics; Computational semantics; Formal semantics (linguistics); Denotational semantics; Theoretical computer science","score_opus":0.07638819448597298,"score_gpt":0.1856909427067491,"score_spread":0.10930274822077612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402236082","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.014418082,0.0006626188,0.9391645,0.0028751655,0.00025122488,0.00015875604,0.00026424302,0.00075290335,0.04145262],"genre_scores_gemma":[0.6214098,0.0009113408,0.3609873,0.0014719423,0.0004966716,0.0007206337,0.00060322124,0.00043262957,0.01296643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962153,0.0010414533,0.00038049775,0.000764972,0.0011291298,0.00046862697],"domain_scores_gemma":[0.9974859,0.0008181277,0.00026126162,0.0005366137,0.00062472274,0.00027333936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040347786,0.0010492926,0.0005296481,0.0020281253,0.0021763956,0.0041012242,0.0018449655,0.0020902855,0.007681895],"category_scores_gemma":[0.0056169303,0.000591034,0.0022245168,0.0010674059,0.008049886,0.010546214,0.00557622,0.0033519268,0.001143778],"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.0000040833083,0.000003643071,0.000026807418,0.0000180982,0.0000039546903,0.000021645139,0.00017029751,0.00037882308,0.00021281911,0.99729973,0.00029526415,0.0015647958],"study_design_scores_gemma":[0.000015610201,0.000010923378,0.000035176323,0.000022557719,0.000011755206,0.000067438035,0.00008426042,0.003323639,0.00066504325,0.98161376,0.0141389305,0.000010977987],"about_ca_topic_score_codex":0.0014236213,"about_ca_topic_score_gemma":0.0008772631,"teacher_disagreement_score":0.007681895,"about_ca_system_score_codex":0.0027543842,"about_ca_system_score_gemma":0.0015745896,"threshold_uncertainty_score":0.025698543},"labels":[],"label_agreement":null},{"id":"W2403603339","doi":"","title":"An explicit model of belief change for cryptographic protocol verification","year":2007,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Protocol (science); Cryptographic protocol; Computer science; Theoretical computer science; Context (archaeology); Cryptographic primitive; Cryptography; Model checking; Computer security; Medicine","score_opus":0.0851541452225101,"score_gpt":0.34024748798896776,"score_spread":0.2550933427664577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403603339","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.008301393,0.0001920544,0.98120165,0.0018784279,0.00008180454,0.000098661745,0.00007919669,0.00038339116,0.0077834614],"genre_scores_gemma":[0.550633,0.00039062125,0.43844962,0.0007346598,0.0002950938,0.00046028517,0.0002240637,0.00014795786,0.008664704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906058,0.0041029453,0.0007082605,0.0011653628,0.0026391032,0.00077854545],"domain_scores_gemma":[0.97783375,0.013351985,0.001335901,0.004757874,0.0019308969,0.0007895425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010150002,0.0008261533,0.000734394,0.0013582568,0.0025461607,0.006004412,0.00415449,0.003997188,0.0058085816],"category_scores_gemma":[0.025651002,0.0012017385,0.002316242,0.0013148342,0.0076664514,0.016311236,0.0067605744,0.0073027886,0.0011856338],"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.00006201685,0.000048643244,0.00020134932,0.000066120934,0.000018726563,0.00023446379,0.00063554634,0.010327058,0.0010980172,0.9803462,0.0005006413,0.0064613335],"study_design_scores_gemma":[0.0000797382,0.00006937686,0.000081706006,0.000064488915,0.000055873235,0.00019747991,0.00013921225,0.16247462,0.0032315091,0.82475674,0.008805088,0.00004402806],"about_ca_topic_score_codex":0.0025648314,"about_ca_topic_score_gemma":0.0028602649,"teacher_disagreement_score":0.010150002,"about_ca_system_score_codex":0.0032442468,"about_ca_system_score_gemma":0.002851764,"threshold_uncertainty_score":0.05367899},"labels":[],"label_agreement":null},{"id":"W2403697717","doi":"","title":"Solving Non-clausal Formulas with DPLL search.","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"DPLL algorithm; Solver; Computer science; Conjunctive normal form; Exploit; Representation (politics); Propositional formula; Propositional calculus; Boolean satisfiability problem; Theoretical computer science; Algorithm; Propositional variable; Programming language","score_opus":0.012477848118410654,"score_gpt":0.22762869593873672,"score_spread":0.21515084782032606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403697717","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.038995724,0.0022006196,0.90537775,0.0026198507,0.00026777628,0.0003840997,0.0016069603,0.004509138,0.044038117],"genre_scores_gemma":[0.3037105,0.0008711122,0.67702174,0.00086713204,0.00015567167,0.00023131527,0.0034028539,0.0007013284,0.013038324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977825,0.0009408624,0.0001777376,0.00026085877,0.000570143,0.00026790856],"domain_scores_gemma":[0.99356776,0.0051714764,0.00017860746,0.00060370285,0.00037592484,0.00010256309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021420165,0.00082827645,0.0011412014,0.0010253184,0.0011961847,0.002568116,0.0027629435,0.0013865919,0.017780598],"category_scores_gemma":[0.014019885,0.0006503264,0.0014153052,0.0019817282,0.0010285969,0.0046582483,0.002979242,0.0026694885,0.0025618784],"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.00068840204,0.000524895,0.0014994271,0.0020497378,0.00028340708,0.0005365048,0.0007546395,0.034161367,0.0064642546,0.33141953,0.04565407,0.5759638],"study_design_scores_gemma":[0.0003603809,0.00010134525,0.00033085662,0.00021270923,0.00019402464,0.00041292448,0.0006142409,0.2677797,0.012495653,0.6821191,0.035342105,0.000037083086],"about_ca_topic_score_codex":0.004964779,"about_ca_topic_score_gemma":0.012697821,"teacher_disagreement_score":0.017780598,"about_ca_system_score_codex":0.0014609986,"about_ca_system_score_gemma":0.0023668108,"threshold_uncertainty_score":0.059482038},"labels":[],"label_agreement":null},{"id":"W2403928778","doi":"","title":"A rational extension of stable model semantics to the full propositional language","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Semantics (computer science); Stable model semantics; Computer science; Extension (predicate logic); Answer set programming; Well-founded semantics; Rationality; Non-monotonic logic; Monotonic function; Operational semantics; Programming language; Theoretical computer science; Computational semantics; Circumscription; Set (abstract data type); Denotational semantics; Mathematics; Epistemology; Philosophy","score_opus":0.07772773533962261,"score_gpt":0.3044125092816972,"score_spread":0.2266847739420746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403928778","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.010532861,0.0002874892,0.9663115,0.0017416893,0.00011744871,0.000086336215,0.00019644252,0.0007099741,0.020016389],"genre_scores_gemma":[0.58532816,0.0005964968,0.40234727,0.00094851,0.0003592942,0.00033512458,0.0005458132,0.00035310505,0.009186193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694186,0.0010243693,0.00018277517,0.00052635605,0.0010243518,0.0003003357],"domain_scores_gemma":[0.9978339,0.0008514977,0.00020531469,0.0005399024,0.00044802914,0.000121380486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032753216,0.0007687389,0.0006509133,0.0015366334,0.0012898933,0.0031043964,0.0023408039,0.0014590793,0.0055870367],"category_scores_gemma":[0.004372729,0.0006218982,0.0027046134,0.0009975248,0.004560872,0.008747166,0.003848566,0.0031184293,0.0010419958],"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.000011295091,0.000014172773,0.000045866433,0.00004207311,0.000011908714,0.00006954872,0.0002263411,0.0016989139,0.00069690146,0.9899794,0.00062356604,0.0065801595],"study_design_scores_gemma":[0.00001588842,0.0000315903,0.000043254164,0.000023365894,0.000013701378,0.000086639484,0.000051933417,0.016111663,0.0008717714,0.97318,0.009556966,0.00001322049],"about_ca_topic_score_codex":0.0016680752,"about_ca_topic_score_gemma":0.0016475627,"teacher_disagreement_score":0.0055870367,"about_ca_system_score_codex":0.0018284406,"about_ca_system_score_gemma":0.002055663,"threshold_uncertainty_score":0.018690526},"labels":[],"label_agreement":null},{"id":"W2404787561","doi":"10.3233/978-1-61499-098-7-498","title":"Efficient Reasoning in Multiagent Epistemic Logics","year":2012,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":23,"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","funders":"","keywords":"Epistemology; Computer science; Artificial intelligence; Multi-agent system; Cognitive science; Philosophy; Psychology","score_opus":0.04115961271224455,"score_gpt":0.2673035660861798,"score_spread":0.22614395337393522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404787561","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.013016156,0.00089901494,0.9744985,0.0010204992,0.0000329564,0.00012057272,0.000134277,0.0005917566,0.009686226],"genre_scores_gemma":[0.28326637,0.0010677364,0.7076425,0.0002833135,0.000111794616,0.00026562437,0.0004908703,0.00013636872,0.006735366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956097,0.0017078675,0.0003497542,0.0005927998,0.001422029,0.0003178527],"domain_scores_gemma":[0.9957119,0.0029798967,0.00022027256,0.00070000003,0.00029530536,0.00009257399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00495979,0.0009060662,0.0009389919,0.001086468,0.0011666735,0.0044170613,0.0020979154,0.0011980274,0.003423973],"category_scores_gemma":[0.008112506,0.00085471646,0.0015681402,0.0014711967,0.0024111427,0.007931943,0.0042604976,0.002864018,0.000710077],"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.00011373709,0.000094479656,0.00028250137,0.00031132845,0.00008421134,0.0002375753,0.00046514676,0.06837101,0.0023734127,0.8471883,0.0029152522,0.077562995],"study_design_scores_gemma":[0.000037280137,0.000015852613,0.00006939354,0.00003543738,0.000032083375,0.000057308152,0.00007024796,0.17473094,0.0020943866,0.81685627,0.005987103,0.000013703366],"about_ca_topic_score_codex":0.0029279748,"about_ca_topic_score_gemma":0.003111377,"teacher_disagreement_score":0.00495979,"about_ca_system_score_codex":0.0027118924,"about_ca_system_score_gemma":0.0012985193,"threshold_uncertainty_score":0.026230216},"labels":[],"label_agreement":null},{"id":"W2405978955","doi":"10.1007/978-3-319-23264-5_37","title":"Clause-Learning for Modular Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Modular design; Programming language; Artificial intelligence","score_opus":0.032841658742845295,"score_gpt":0.25861655091564645,"score_spread":0.22577489217280117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405978955","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.011157789,0.0013513155,0.96021926,0.0010652655,0.00009778512,0.000065582186,0.00021139864,0.0009534938,0.024878165],"genre_scores_gemma":[0.4483011,0.0020011147,0.517631,0.0005622172,0.0004484591,0.00028659336,0.0017779163,0.00081447704,0.028177153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900997,0.0003731233,0.00005528654,0.00017916443,0.00029904154,0.00008337444],"domain_scores_gemma":[0.9964651,0.0027360364,0.00009494906,0.0004217248,0.00020951289,0.00007266428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707261,0.0007844316,0.00062154804,0.00090482045,0.0006463139,0.0014250632,0.001992836,0.0009705547,0.020725168],"category_scores_gemma":[0.00841679,0.00063156843,0.0011310627,0.0011591226,0.0021023082,0.0062152576,0.0031074304,0.0038318625,0.0024990612],"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.00004150806,0.000038592552,0.00023248712,0.00019885639,0.000025654253,0.000035521338,0.00015960299,0.01629751,0.0007924182,0.8533961,0.0077981423,0.12098361],"study_design_scores_gemma":[0.000011165156,0.0000075864323,0.000050553623,0.000022449964,0.00000737082,0.00001540442,0.000014598303,0.036760043,0.00041357876,0.9590988,0.003593339,0.0000051247744],"about_ca_topic_score_codex":0.0010686483,"about_ca_topic_score_gemma":0.0017918549,"teacher_disagreement_score":0.020725168,"about_ca_system_score_codex":0.00131738,"about_ca_system_score_gemma":0.0006091017,"threshold_uncertainty_score":0.0693326},"labels":[],"label_agreement":null},{"id":"W2406651931","doi":"","title":"On forgetting postulates in answer set programming","year":2015,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Alberta","funders":"","keywords":"Forgetting; Answer set programming; Set (abstract data type); Operator (biology); Computer science; Logic program; Property (philosophy); Theoretical computer science; Logic programming; Programming language; Artificial intelligence","score_opus":0.03794572597603977,"score_gpt":0.276879381133437,"score_spread":0.23893365515739726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406651931","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.09064482,0.0010173786,0.89151305,0.0038387433,0.000114026334,0.00015440052,0.00031049285,0.0005574113,0.011849691],"genre_scores_gemma":[0.71198654,0.001379142,0.2796769,0.001084001,0.0006179386,0.00048443663,0.0008352062,0.00021154185,0.0037242272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925413,0.0023609838,0.00076536956,0.0014376645,0.002187849,0.0007067668],"domain_scores_gemma":[0.95075065,0.03792941,0.002111966,0.004420764,0.0035069778,0.0012802369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0132205635,0.00075150793,0.0013097984,0.0022937765,0.00194749,0.0046828827,0.0029633641,0.0025206495,0.0037819885],"category_scores_gemma":[0.03877375,0.00090000796,0.0025372945,0.0032316889,0.012266121,0.018932179,0.0068587027,0.008093611,0.0005228307],"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.00008092922,0.000046440196,0.00073832326,0.000119624216,0.000022447142,0.0001960583,0.0007103738,0.008623132,0.0013290155,0.9797809,0.00047983511,0.007872798],"study_design_scores_gemma":[0.000030785526,0.000067332316,0.00024639006,0.000035151,0.000024790144,0.00009252253,0.00012350941,0.036728654,0.0013506617,0.9592652,0.0020066942,0.000028360902],"about_ca_topic_score_codex":0.0021892649,"about_ca_topic_score_gemma":0.0013905991,"teacher_disagreement_score":0.0132205635,"about_ca_system_score_codex":0.002609271,"about_ca_system_score_gemma":0.0016852659,"threshold_uncertainty_score":0.06991786},"labels":[],"label_agreement":null},{"id":"W2407013441","doi":"10.48550/arxiv.1405.4228","title":"Unifying Causality, Diagnosis, Repairs and View-Updates in Databases","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Causality (physics); Computer science; Database; Data science","score_opus":0.09448014723167023,"score_gpt":0.21964960871169348,"score_spread":0.12516946148002325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407013441","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.0098987045,0.00437854,0.9773018,0.0043534036,0.00021934161,0.0000821921,0.00015831372,0.0002603189,0.0033474462],"genre_scores_gemma":[0.58354765,0.0075276364,0.40049314,0.0018731086,0.0012663122,0.00030019422,0.00069281895,0.00021729135,0.004081911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9799446,0.0076857144,0.002253492,0.0032627112,0.0059207003,0.00093274086],"domain_scores_gemma":[0.9463693,0.036999352,0.0043174042,0.00805091,0.003340074,0.00092303654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020176942,0.0011859642,0.001858716,0.0043598954,0.0020790594,0.008889402,0.0035335803,0.0037870961,0.0026864838],"category_scores_gemma":[0.057229877,0.0012221489,0.0022631148,0.0055365716,0.0150299305,0.032442797,0.009405554,0.00673838,0.00044451997],"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.00008140017,0.000047107387,0.0014812682,0.00026887364,0.00006514566,0.00031639665,0.0012816313,0.012710812,0.00041704375,0.9416759,0.00088237115,0.040772006],"study_design_scores_gemma":[0.000012100625,0.00001803103,0.00016040106,0.000053848482,0.000037767946,0.00013667502,0.00021631306,0.022272384,0.0005821363,0.9730452,0.0034417703,0.000023466311],"about_ca_topic_score_codex":0.005364621,"about_ca_topic_score_gemma":0.0029319196,"teacher_disagreement_score":0.020176942,"about_ca_system_score_codex":0.003093704,"about_ca_system_score_gemma":0.0035637533,"threshold_uncertainty_score":0.106707156},"labels":[],"label_agreement":null},{"id":"W2408652604","doi":"","title":"Towards a knowledge level analysis of forgetting","year":2014,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Forgetting; Computer science; Signature (topology); Description logic; Set (abstract data type); Logic programming; Modal logic; Multimodal logic; Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Modal; Linguistics; Philosophy","score_opus":0.037237341289510874,"score_gpt":0.2795750018950555,"score_spread":0.24233766060554465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408652604","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.027019652,0.00059299584,0.96601593,0.0006316536,0.000043805718,0.000057998517,0.00014447529,0.00042988913,0.005063581],"genre_scores_gemma":[0.59840953,0.0011015985,0.39370722,0.00047423822,0.0002942369,0.0001610091,0.0006195127,0.00033463095,0.004898074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948072,0.0009938318,0.0005003351,0.0011550577,0.0017983015,0.00074531516],"domain_scores_gemma":[0.98083705,0.008272845,0.0017433366,0.0053888904,0.003114,0.0006439497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065328404,0.001059316,0.001289862,0.0052799135,0.0015937855,0.0076180077,0.0037115384,0.0020436817,0.0036417993],"category_scores_gemma":[0.02102645,0.0011118222,0.0037266465,0.0032829598,0.008018182,0.023158623,0.0071747447,0.005101207,0.00052260474],"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.000069481954,0.000048845744,0.0021796152,0.00021404459,0.000089278554,0.00041235005,0.0011364424,0.021639593,0.0020577256,0.9419325,0.00071877206,0.029501317],"study_design_scores_gemma":[0.000009400198,0.000026772595,0.00046382583,0.000051908544,0.00007633956,0.00015922674,0.00016218986,0.062594034,0.0026159694,0.93003607,0.0037745568,0.000029821478],"about_ca_topic_score_codex":0.0022504753,"about_ca_topic_score_gemma":0.001281886,"teacher_disagreement_score":0.0076180077,"about_ca_system_score_codex":0.0025012554,"about_ca_system_score_gemma":0.0018266349,"threshold_uncertainty_score":0.034549356},"labels":[],"label_agreement":null},{"id":"W2411176276","doi":"","title":"What Does Consciousness Bring to CTS","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Consciousness; Computer science; TUTOR; Task (project management); Human–computer interaction; Context (archaeology); Simple (philosophy); Artificial intelligence; Space (punctuation); Psychology; Engineering; Systems engineering","score_opus":0.09538882220650284,"score_gpt":0.35214615156327655,"score_spread":0.2567573293567737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411176276","genre_codex":"commentary","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.06563452,0.03526247,0.012577289,0.51330113,0.0067124804,0.000043956745,0.00032356096,0.00029165944,0.365853],"genre_scores_gemma":[0.93497306,0.019050302,0.0022066645,0.025638763,0.002789065,0.000044220204,0.00015431923,0.00015404985,0.014989421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975534,0.00093597616,0.000088923116,0.0002965441,0.000495028,0.00063008047],"domain_scores_gemma":[0.9955018,0.0013299241,0.00046267628,0.0007782543,0.00093053747,0.0009968246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030701084,0.00039287514,0.00067363336,0.0014488099,0.0043233125,0.010839007,0.00115438,0.0039177346,0.010739711],"category_scores_gemma":[0.009853377,0.0002715344,0.00056735735,0.00095117075,0.024831103,0.012972011,0.0036204278,0.0035032707,0.0022049944],"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.00009908062,0.00005651358,0.0036585755,0.00039185164,0.00006350485,0.00050026237,0.0116175525,0.0001426233,0.0004714995,0.89098495,0.026220676,0.06579288],"study_design_scores_gemma":[0.00002644572,0.000047653124,0.0040605175,0.0007845681,0.00003757161,0.00081166555,0.012455115,0.00016910312,0.000492564,0.81125367,0.16981961,0.000041495594],"about_ca_topic_score_codex":0.005425212,"about_ca_topic_score_gemma":0.003662092,"teacher_disagreement_score":0.010839007,"about_ca_system_score_codex":0.0037823408,"about_ca_system_score_gemma":0.0050155907,"threshold_uncertainty_score":0.03592795},"labels":[],"label_agreement":null},{"id":"W2415711950","doi":"10.1609/aaai.v30i1.10117","title":"Verifying ConGolog Programs on Bounded Situation Calculus Theories","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"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","funders":"","keywords":"Bounded function; Situation calculus; Decidability; Computer science; Generality; Compiler; Domain (mathematical analysis); Semantics (computer science); Variable (mathematics); Calculus (dental); Action (physics); Programming language; Theoretical computer science; Mathematics","score_opus":0.07104795872369078,"score_gpt":0.28858675826953256,"score_spread":0.21753879954584177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415711950","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.23649092,0.00018089754,0.75116265,0.00050379685,0.00006933588,0.00014156247,0.00032341792,0.005252453,0.0058749677],"genre_scores_gemma":[0.8574443,0.00010701629,0.13988625,0.00015985117,0.000037395635,0.00012938712,0.00033623065,0.00032827278,0.0015714032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510807,0.0016206964,0.00032066982,0.00086524274,0.0013680274,0.000717307],"domain_scores_gemma":[0.9871295,0.008365993,0.0011313754,0.0021405802,0.0009110706,0.00032152538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004707773,0.0006223987,0.00065378036,0.001100319,0.0010949377,0.0023015244,0.0018426173,0.0010379791,0.00255212],"category_scores_gemma":[0.01907966,0.0008060725,0.0019011715,0.0007208937,0.0042643673,0.0052746697,0.0040498828,0.0019342399,0.0003699372],"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.00093824725,0.00031209792,0.01143428,0.0006266963,0.00027397307,0.0018321808,0.0019420218,0.21747495,0.031626195,0.6758784,0.0020226347,0.05563827],"study_design_scores_gemma":[0.000108931265,0.0002250547,0.0011620919,0.00009963098,0.00016628148,0.00024187435,0.00038777053,0.57443386,0.050968748,0.3660247,0.0061095315,0.00007147825],"about_ca_topic_score_codex":0.0049575428,"about_ca_topic_score_gemma":0.00555995,"teacher_disagreement_score":0.0049575428,"about_ca_system_score_codex":0.0020714318,"about_ca_system_score_gemma":0.0028002877,"threshold_uncertainty_score":0.024897337},"labels":[],"label_agreement":null},{"id":"W2434144965","doi":"10.1609/aaai.v30i1.10108","title":"A First-Order Logic of Probability and Only Knowing in Unbounded Domains","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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 Toronto","funders":"Vlaamse regering; University of Toronto; Fonds Wetenschappelijk Onderzoek","keywords":"Probabilistic logic; Knowledge base; Computer science; Belief revision; Order (exchange); Logical consequence; Base (topology); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.06535929149130568,"score_gpt":0.2797917303073284,"score_spread":0.21443243881602272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2434144965","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.012058364,0.00080708,0.9403859,0.004710681,0.00023463469,0.000084992505,0.00053723477,0.00043883486,0.04074237],"genre_scores_gemma":[0.61656266,0.0014089688,0.35857657,0.0021900032,0.0009088208,0.00031494495,0.0008329892,0.00017190262,0.019033158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963651,0.0011101105,0.00034620854,0.0008132314,0.0009687212,0.0003965385],"domain_scores_gemma":[0.9930951,0.004142547,0.00061798334,0.00090112025,0.00082910573,0.00041416264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051212357,0.00093617797,0.0010375861,0.0021014563,0.0028973815,0.00632724,0.0022676047,0.0026764888,0.0044445232],"category_scores_gemma":[0.0072021913,0.00093249517,0.0026085651,0.0021827943,0.008511677,0.015295952,0.003618825,0.005279826,0.00080539606],"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.0000065170047,0.000004990051,0.000052155556,0.00001657082,0.000006090915,0.000063071166,0.00012537517,0.0008201626,0.00009820167,0.9968148,0.00035307824,0.001638982],"study_design_scores_gemma":[0.0000090514195,0.000009064204,0.00005594969,0.000013976062,0.000014893794,0.00009490444,0.000028655639,0.0071154614,0.00027983598,0.9880151,0.0043500215,0.000013067524],"about_ca_topic_score_codex":0.004159373,"about_ca_topic_score_gemma":0.0048700115,"teacher_disagreement_score":0.00632724,"about_ca_system_score_codex":0.0034777315,"about_ca_system_score_gemma":0.0026547457,"threshold_uncertainty_score":0.027083993},"labels":[],"label_agreement":null},{"id":"W2465441781","doi":"10.1007/978-3-319-34111-8_28","title":"Flexible Approximators for Approximating Fixpoint Theory","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Fixed point; Non-monotonic logic; Operator (biology); Theoretical computer science; Knowledge representation and reasoning; Semantics (computer science); Default logic; Logical consequence; Algebra over a field; Negation; Algorithm; Artificial intelligence; Mathematics; Description logic; Programming language; Autoepistemic logic; Pure mathematics; Multimodal logic","score_opus":0.018962534733796284,"score_gpt":0.2474889166451792,"score_spread":0.22852638191138291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465441781","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.01310437,0.0009307036,0.9773548,0.00024823225,0.00014843192,0.000043647273,0.00012376784,0.001214065,0.0068319165],"genre_scores_gemma":[0.35554197,0.0014408126,0.6246254,0.00027554398,0.00029233148,0.00031265954,0.001060578,0.001232782,0.015218061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671906,0.00083747966,0.00022293242,0.0006443865,0.001257038,0.00031903764],"domain_scores_gemma":[0.99259126,0.0041995854,0.00024452776,0.002224092,0.00056119624,0.0001792222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033795168,0.00180724,0.0020431294,0.0023759753,0.0010518548,0.003601335,0.004070992,0.0019492778,0.009846644],"category_scores_gemma":[0.018239778,0.0011831429,0.0025523943,0.0026302014,0.00292943,0.0070546707,0.0053732255,0.007391397,0.0025181463],"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.00038550206,0.00008860781,0.00077730796,0.0003106284,0.00010935889,0.00010082734,0.00049404317,0.07029317,0.0030603854,0.74191666,0.0055981306,0.17686538],"study_design_scores_gemma":[0.0000393576,0.00006577231,0.00014297708,0.00010084745,0.00006805691,0.00009535796,0.00009558449,0.28047478,0.0022167838,0.708135,0.008535911,0.000029552071],"about_ca_topic_score_codex":0.0018491335,"about_ca_topic_score_gemma":0.002363006,"teacher_disagreement_score":0.009846644,"about_ca_system_score_codex":0.0027053542,"about_ca_system_score_gemma":0.001070643,"threshold_uncertainty_score":0.032940328},"labels":[],"label_agreement":null},{"id":"W2466797724","doi":"10.1609/aaai.v30i1.10111","title":"SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Academy of Finland","keywords":"Propagator; Computer science; Solver; Extension (predicate logic); Theoretical computer science; Declarative programming; Programming language; Mathematics; Programming paradigm; Inductive programming","score_opus":0.0643844141834685,"score_gpt":0.2730478353290722,"score_spread":0.20866342114560366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466797724","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.001155218,0.000059739814,0.99087685,0.00020999997,0.00006294102,0.000092064816,0.00017857479,0.005390166,0.0019744565],"genre_scores_gemma":[0.036911976,0.00016469738,0.9575561,0.0004378063,0.00008387263,0.0003315277,0.0008899776,0.0012350985,0.0023888736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577737,0.0017965634,0.00054655876,0.00067862304,0.0009418523,0.00025904572],"domain_scores_gemma":[0.99015373,0.005761753,0.000700612,0.0022489415,0.0009016831,0.00023321406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005632631,0.0013593497,0.001004113,0.0013471622,0.0008372555,0.0031298376,0.0054259035,0.0017448798,0.010146452],"category_scores_gemma":[0.011647756,0.0014712617,0.00300905,0.0014837013,0.0028211235,0.006023393,0.005977907,0.0062618745,0.0029313874],"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.0004668375,0.00043968434,0.0015704731,0.0012134992,0.00028916565,0.0007293801,0.0013487227,0.08762851,0.016937809,0.63713026,0.03208942,0.22015628],"study_design_scores_gemma":[0.0002602897,0.00012358568,0.0002255169,0.00019517046,0.00015151336,0.00047036287,0.000107246815,0.6316813,0.02042977,0.24082711,0.10543079,0.0000972986],"about_ca_topic_score_codex":0.0012747098,"about_ca_topic_score_gemma":0.0034721817,"teacher_disagreement_score":0.010146452,"about_ca_system_score_codex":0.0011061043,"about_ca_system_score_gemma":0.0025833172,"threshold_uncertainty_score":0.033943236},"labels":[],"label_agreement":null},{"id":"W2472468990","doi":"10.1093/jigpal/jzw017","title":"Does changing the subject from A to B really provide an enlarged understanding of A?","year":2016,"lang":"en","type":"article","venue":"Logic Journal of IGPL","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"","keywords":"Demotion; Predicate (mathematical logic); Subject (documents); Computer science; Representation (politics); Epistemology; Heuristic; Natural (archaeology); Linguistics; Value (mathematics); Expression (computer science); Artificial intelligence; Philosophy; History","score_opus":0.03799732256134044,"score_gpt":0.26043549398739924,"score_spread":0.2224381714260588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472468990","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.034461085,0.009267329,0.158215,0.13784248,0.008777989,0.000095717965,0.00046227584,0.00050068664,0.6503775],"genre_scores_gemma":[0.8573687,0.00704995,0.048532523,0.028096694,0.0070835785,0.0002577878,0.0006084035,0.0010052369,0.04999706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350595,0.0039303736,0.0002699233,0.0010324911,0.00076171133,0.00049955054],"domain_scores_gemma":[0.9919429,0.004314983,0.00068803004,0.0014229242,0.001069829,0.00056148815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008945996,0.0005528087,0.0010604403,0.0015426279,0.0033122369,0.007540351,0.001702143,0.0040046503,0.018258203],"category_scores_gemma":[0.012123881,0.00051253656,0.001053513,0.0014877194,0.020523695,0.03126376,0.0035784063,0.0061049243,0.006569559],"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.000026749904,0.000009655216,0.00016916248,0.00005543792,0.0000068195172,0.00005079537,0.003251983,0.000028368517,0.00019664387,0.98711246,0.004898935,0.004193021],"study_design_scores_gemma":[0.000023555225,0.000040880357,0.00059569045,0.0001330351,0.000019403276,0.00033473223,0.0039287442,0.00041243545,0.00032471685,0.76799524,0.2261616,0.00002992988],"about_ca_topic_score_codex":0.0025221366,"about_ca_topic_score_gemma":0.0019450124,"teacher_disagreement_score":0.018258203,"about_ca_system_score_codex":0.002535678,"about_ca_system_score_gemma":0.0020213951,"threshold_uncertainty_score":0.0610798},"labels":[],"label_agreement":null},{"id":"W24725980","doi":"10.1053/j.ajkd.2014.03.003","title":"Answer-Set Programming as a new Approach to Event-Sequence Testing","year":2011,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"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; Formalism (music); Sequence (biology); Answer set programming; Programming language; Set (abstract data type); Event (particle physics); Theoretical computer science; Representation (politics); Artificial intelligence","score_opus":0.14867798806213256,"score_gpt":0.2982431351070539,"score_spread":0.14956514704492135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24725980","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.001222079,0.0005886877,0.9877484,0.0035643508,0.0004246219,0.0004977424,0.00043869411,0.0024289326,0.0030864216],"genre_scores_gemma":[0.045769714,0.000625849,0.94488907,0.0030234726,0.00050524843,0.0017908274,0.0008327704,0.0005504082,0.0020127539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.94778186,0.037777983,0.0031327545,0.004268969,0.0061687687,0.0008697214],"domain_scores_gemma":[0.8031403,0.18184383,0.0031103713,0.0054786694,0.004873768,0.001553178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.046973433,0.0022707896,0.0028355508,0.0034651323,0.0013004817,0.005710316,0.0056940867,0.0031451539,0.027734585],"category_scores_gemma":[0.14515635,0.0015064534,0.004445872,0.002688157,0.0042690514,0.0070617525,0.0072265184,0.009779386,0.0036931129],"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.0023081324,0.00069181266,0.0035869756,0.0021576358,0.00090359827,0.00056610705,0.0012947764,0.11720458,0.0011706152,0.41548768,0.0339456,0.4206825],"study_design_scores_gemma":[0.00043797074,0.0002954468,0.0001802929,0.00034853615,0.000116527255,0.0001622705,0.00013185958,0.31321996,0.0009436849,0.66080844,0.02328526,0.000069753616],"about_ca_topic_score_codex":0.0042120144,"about_ca_topic_score_gemma":0.0048689116,"teacher_disagreement_score":0.046973433,"about_ca_system_score_codex":0.0025323106,"about_ca_system_score_gemma":0.0060744006,"threshold_uncertainty_score":0.24842227},"labels":[],"label_agreement":null},{"id":"W2482695635","doi":"10.1007/978-3-642-31570-1","title":"Deontic Logic in Computer Science","year":2012,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Deontic logic; Computer science; Philosophy; Epistemology","score_opus":0.01893637462282539,"score_gpt":0.25296174153744533,"score_spread":0.23402536691461995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482695635","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035000376,0.15680787,0.17804596,0.008199483,0.0039937412,0.0000817945,0.00040126807,0.00043123993,0.6485386],"genre_scores_gemma":[0.21574049,0.17387524,0.13348363,0.006054708,0.009860695,0.00040316684,0.001651932,0.00065880426,0.45827138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957603,0.000108290486,0.000029057594,0.000071169765,0.00018161743,0.000033794822],"domain_scores_gemma":[0.99949133,0.00031962738,0.000024903064,0.00006563731,0.00007261128,0.000025917201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077180937,0.00088501483,0.0007558611,0.0013459842,0.0012907954,0.0036904013,0.0009539779,0.0011531871,0.008307242],"category_scores_gemma":[0.0011880628,0.0005765705,0.00053878437,0.0027182915,0.0030787387,0.0051299892,0.0009080544,0.0036851694,0.0028563344],"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.0000060260027,0.000010321942,0.000025807083,0.00012374883,0.0000040951754,0.000021607313,0.00014000961,0.0004032036,0.00015549641,0.95073384,0.020723166,0.027652675],"study_design_scores_gemma":[0.0000058999585,0.000005577015,0.00007989342,0.000091719754,0.0000053106487,0.00008698922,0.000038064325,0.00082341867,0.00013300245,0.82250094,0.17622334,0.0000058636992],"about_ca_topic_score_codex":0.0018384597,"about_ca_topic_score_gemma":0.0020235626,"teacher_disagreement_score":0.008307242,"about_ca_system_score_codex":0.002178618,"about_ca_system_score_gemma":0.0013704645,"threshold_uncertainty_score":0.027790487},"labels":[],"label_agreement":null},{"id":"W2485494518","doi":"10.1016/j.mathsocsci.2017.08.003","title":"Inferring probability comparisons","year":2017,"lang":"en","type":"article","venue":"Mathematical Social Sciences","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Interpretation (philosophy); Extension (predicate logic); Intersection (aeronautics); Binary relation; Semantics (computer science); Set (abstract data type); Relation (database); Mathematics; Computer science; Measure (data warehouse); Probability measure; Artificial intelligence; Discrete mathematics; Data mining","score_opus":0.13503233844042034,"score_gpt":0.3585702472363137,"score_spread":0.22353790879589336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485494518","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.23297097,0.0021212376,0.69945437,0.0050637503,0.000440357,0.00029934634,0.0048879283,0.0019616997,0.052800413],"genre_scores_gemma":[0.8822663,0.0005170177,0.110679545,0.00030464245,0.00029703532,0.00011582071,0.00244776,0.0001806028,0.0031913088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98990226,0.0042589107,0.00051748974,0.0030669274,0.0018101716,0.00044428624],"domain_scores_gemma":[0.95418376,0.03820932,0.0018827033,0.003168182,0.0018381226,0.00071783696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055300174,0.0009859378,0.0012823708,0.0066855764,0.0016036234,0.006364759,0.0023246484,0.0023782707,0.021089641],"category_scores_gemma":[0.078702696,0.0008746202,0.0019292478,0.004054159,0.0017832562,0.0143731935,0.0032134585,0.0035537397,0.0022208844],"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.000972098,0.00043944505,0.037717216,0.0005658807,0.00047271297,0.0008361086,0.0011359879,0.022471381,0.0033482334,0.67735463,0.015021162,0.23966505],"study_design_scores_gemma":[0.00004803625,0.00008962567,0.005220167,0.000087347755,0.00015985717,0.0004379387,0.00034220866,0.10322778,0.0023843446,0.8794449,0.00851288,0.00004492402],"about_ca_topic_score_codex":0.002405544,"about_ca_topic_score_gemma":0.0031268217,"teacher_disagreement_score":0.021089641,"about_ca_system_score_codex":0.0020612394,"about_ca_system_score_gemma":0.0015938309,"threshold_uncertainty_score":0.07055187},"labels":[],"label_agreement":null},{"id":"W2486175468","doi":"10.1007/978-3-540-87803-2","title":"Logics in Artificial Intelligence","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science","score_opus":0.03455620486527994,"score_gpt":0.264253910527364,"score_spread":0.22969770566208408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486175468","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.002277989,0.26141205,0.097347006,0.017051622,0.0039637852,0.00007162847,0.00046596848,0.00071125437,0.61669874],"genre_scores_gemma":[0.21254699,0.21470593,0.10233811,0.012175166,0.012316445,0.00049869256,0.0026568582,0.00086885603,0.44189307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947256,0.0002024842,0.000028403634,0.00008002576,0.00017939755,0.000037198828],"domain_scores_gemma":[0.99934095,0.00040543766,0.000033456614,0.00009614141,0.000072945135,0.00005107639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008807388,0.0011063367,0.0010508382,0.0017148938,0.0011246407,0.00524723,0.0011037955,0.00127247,0.014353394],"category_scores_gemma":[0.0015186477,0.00056680414,0.00059353985,0.002405836,0.004449454,0.005987716,0.0015460227,0.0037982464,0.005370688],"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.000022904484,0.00002841151,0.00011241483,0.000207348,0.000019483101,0.00003587187,0.00033919187,0.000655337,0.00013214478,0.8545052,0.07431198,0.069629796],"study_design_scores_gemma":[0.000010446576,0.00000792173,0.000116759635,0.0001707163,0.0000069154285,0.00007569064,0.00008675401,0.000688242,0.00008923828,0.80305547,0.19568598,0.0000057695715],"about_ca_topic_score_codex":0.001364412,"about_ca_topic_score_gemma":0.00156954,"teacher_disagreement_score":0.014353394,"about_ca_system_score_codex":0.0019379561,"about_ca_system_score_gemma":0.0010381745,"threshold_uncertainty_score":0.048016906},"labels":[],"label_agreement":null},{"id":"W2490626787","doi":"10.1017/cbo9780511780448.006","title":"Proof Theory","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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 Toronto","funders":"","keywords":"Structural proof theory; Mathematical proof; Proof theory; Proof complexity; Sequent calculus; Calculus (dental); Axiom; Propositional calculus; Mathematics; Analytic proof; Natural deduction; Proof calculus; Axiomatic system; Pigeonhole principle; Propositional variable; Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Theoretical computer science; Intermediate logic","score_opus":0.01630171775253676,"score_gpt":0.18876607789463337,"score_spread":0.17246436014209662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490626787","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.0009112936,0.04841347,0.34514216,0.009516736,0.0021165179,0.00027394883,0.0017356487,0.001932972,0.5899572],"genre_scores_gemma":[0.106134586,0.07482222,0.4666011,0.009050888,0.0047023217,0.001072168,0.0053753564,0.0015982707,0.3306431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997324,0.0007751659,0.00023788729,0.0004487373,0.001052862,0.00016125634],"domain_scores_gemma":[0.9969843,0.0016836692,0.0000972647,0.00056560343,0.0005680111,0.00010124043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002757549,0.0012466273,0.0010693948,0.0029650636,0.0023170344,0.0065974584,0.0032890115,0.0022036247,0.056279536],"category_scores_gemma":[0.0054637087,0.00093623146,0.0011520573,0.0033559406,0.004162592,0.008786864,0.0029472862,0.003931187,0.027178561],"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.0000059714434,0.000010349758,0.00004037394,0.00029258503,0.000010502342,0.00004330467,0.00015043559,0.00040631558,0.00011517337,0.9114876,0.039999958,0.047437523],"study_design_scores_gemma":[0.0000082904835,0.0000050116,0.000040568826,0.00015932295,0.000005332379,0.00012344206,0.000034795492,0.00071608846,0.00016749097,0.63225853,0.36647406,0.000007011586],"about_ca_topic_score_codex":0.0016249152,"about_ca_topic_score_gemma":0.001226111,"teacher_disagreement_score":0.056279536,"about_ca_system_score_codex":0.0039133606,"about_ca_system_score_gemma":0.002139063,"threshold_uncertainty_score":0.18827385},"labels":[],"label_agreement":null},{"id":"W2491665791","doi":"10.1016/s1874-5075(03)80016-5","title":"Formal Model of Agenda Relevance","year":2003,"lang":"en","type":"book-chapter","venue":"˜A œpractical logic of cognitive systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relevance (law); Computer science; Political science; Law","score_opus":0.08118793157885867,"score_gpt":0.3018674302203812,"score_spread":0.22067949864152253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491665791","genre_codex":"methods","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.012914734,0.0010056826,0.6225545,0.0101415925,0.0003542842,0.0002477249,0.00082174706,0.00085599883,0.35110366],"genre_scores_gemma":[0.64424574,0.00086105365,0.25757432,0.001656508,0.00070978183,0.00072299794,0.001182554,0.00037425818,0.09267275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979413,0.0007443664,0.00013475334,0.0004816422,0.00044431153,0.00025357452],"domain_scores_gemma":[0.99795413,0.0009185774,0.00014982634,0.00047243634,0.00034818097,0.0001567934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002449488,0.0007410365,0.0006644587,0.0022140804,0.002464303,0.0065588253,0.0031109198,0.0036440492,0.0285456],"category_scores_gemma":[0.0076446114,0.00094244623,0.0011680869,0.0018364884,0.0063165794,0.011561408,0.0030014252,0.0039861016,0.0045273183],"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.0000049016485,0.0000054309103,0.000019822393,0.000009554069,0.0000015044894,0.000020536114,0.00011269052,0.00039982083,0.000097239936,0.9974112,0.00059677043,0.0013205316],"study_design_scores_gemma":[0.000016435843,0.0000041533417,0.000025603851,0.000009241609,0.0000047716303,0.000028776285,0.00004984293,0.0053548375,0.000109246794,0.9861696,0.008221983,0.000005482777],"about_ca_topic_score_codex":0.00416361,"about_ca_topic_score_gemma":0.0043437574,"teacher_disagreement_score":0.0285456,"about_ca_system_score_codex":0.0038399966,"about_ca_system_score_gemma":0.002183351,"threshold_uncertainty_score":0.09549451},"labels":[],"label_agreement":null},{"id":"W2493444241","doi":"10.1017/cbo9780511794797.003","title":"Agent Architectures and Hierarchical Control","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hierarchy; Simplicity; Complex system; Hierarchical control system; Computer science; Theoretical computer science; Control (management); Artificial intelligence; Physics; Quantum mechanics","score_opus":0.01254910942674866,"score_gpt":0.18680500706283965,"score_spread":0.17425589763609098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493444241","genre_codex":"methods","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.014888188,0.01829833,0.48695973,0.012778322,0.0005029745,0.000104246465,0.00016495255,0.0008055416,0.4654977],"genre_scores_gemma":[0.7777174,0.0090427995,0.12014964,0.0019026693,0.00046617442,0.0003249581,0.00027568423,0.00016731654,0.08995324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999382,0.00021310427,0.000025178557,0.00011479143,0.0001834997,0.0000814581],"domain_scores_gemma":[0.9994981,0.00016342806,0.000051534455,0.00009897328,0.00011423587,0.00007359483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087348704,0.00046697198,0.00029403565,0.00041389707,0.0009086204,0.003113984,0.0009482255,0.0014651832,0.0070271273],"category_scores_gemma":[0.0014645082,0.00026518808,0.0002633141,0.00059919484,0.0038599756,0.0029483614,0.0016107293,0.0016300194,0.0010235591],"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.000006803896,0.0000054238253,0.000057933696,0.00002636892,0.000006823716,0.000021537207,0.00019713365,0.006025128,0.00014317835,0.97900337,0.0030652627,0.011441026],"study_design_scores_gemma":[0.000014549875,0.000011208414,0.00010938383,0.000042586285,0.0000055939845,0.000023902689,0.00007159201,0.01686468,0.000170508,0.9251558,0.05752296,0.0000070926535],"about_ca_topic_score_codex":0.0066020167,"about_ca_topic_score_gemma":0.005743092,"teacher_disagreement_score":0.0070271273,"about_ca_system_score_codex":0.0024540443,"about_ca_system_score_gemma":0.0013152437,"threshold_uncertainty_score":0.023508072},"labels":[],"label_agreement":null},{"id":"W2496588690","doi":"10.1016/s1874-5075(05)80023-3","title":"Non-Plausibilistic Abduction","year":2005,"lang":"en","type":"book-chapter","venue":"˜A œpractical logic of cognitive systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Psychology","score_opus":0.047278059270075765,"score_gpt":0.30118241517311,"score_spread":0.25390435590303423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496588690","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.0056601004,0.0064746276,0.80487543,0.0057378765,0.0005277165,0.000082679915,0.00024674556,0.00045811932,0.17593664],"genre_scores_gemma":[0.38685867,0.0065808394,0.5285656,0.0015143395,0.0010198875,0.00024181762,0.0007995964,0.00018955031,0.0742297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726474,0.00089623115,0.00024626715,0.00042688815,0.0010784537,0.00008735597],"domain_scores_gemma":[0.99487925,0.0033489019,0.00019494098,0.0009361675,0.0005611065,0.000079599806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004234439,0.0012510117,0.0008867731,0.002207934,0.0011623291,0.005389882,0.0034460532,0.002746905,0.011644847],"category_scores_gemma":[0.010578626,0.0010279298,0.001204194,0.0016505098,0.007957548,0.00985562,0.0031024946,0.0051012966,0.0028327978],"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.000016925873,0.000014228147,0.000060542014,0.0001281303,0.000014225312,0.000045414414,0.00011358515,0.0013592691,0.00023585024,0.9703251,0.0023458856,0.025340827],"study_design_scores_gemma":[0.0000061374503,0.000003894851,0.000021020578,0.00003662175,0.00000511703,0.000046025216,0.0000127969015,0.0033790413,0.00021246336,0.9899811,0.0062914356,0.0000042801794],"about_ca_topic_score_codex":0.00068357406,"about_ca_topic_score_gemma":0.0012564295,"teacher_disagreement_score":0.011644847,"about_ca_system_score_codex":0.0021205028,"about_ca_system_score_gemma":0.0013819463,"threshold_uncertainty_score":0.038955867},"labels":[],"label_agreement":null},{"id":"W2496718596","doi":"10.1007/978-3-319-30262-1_10","title":"Strong Connectedness Revisited","year":2016,"lang":"en","type":"book-chapter","venue":"Intelligent systems reference library","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Social connectedness; Computer science; Psychology; Social psychology","score_opus":0.04701322591494249,"score_gpt":0.24278370038101965,"score_spread":0.19577047446607715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496718596","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03281245,0.0068686777,0.07023851,0.011805649,0.0009340635,0.000050757666,0.00030745254,0.00026871607,0.8767138],"genre_scores_gemma":[0.7877362,0.00627503,0.024099706,0.0040172236,0.0017981632,0.0002822443,0.0006099515,0.0004862635,0.17469525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988539,0.0003164231,0.00004692905,0.00037977748,0.00030504295,0.0000978494],"domain_scores_gemma":[0.99789065,0.001118679,0.000104933475,0.0004012856,0.00035353162,0.00013095462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202816,0.0006941133,0.00082411105,0.0026177957,0.003328981,0.00430279,0.0013844051,0.0023195855,0.029020699],"category_scores_gemma":[0.0068213767,0.000634059,0.00089123886,0.0026710709,0.00785016,0.013883102,0.003958943,0.0057716947,0.0036807377],"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.0000045223032,0.0000024664648,0.00002936424,0.000014133904,0.0000028616078,0.000013652437,0.00009144644,0.00006119292,0.00003497134,0.9954717,0.001705045,0.0025686712],"study_design_scores_gemma":[0.0000029886364,0.0000024495716,0.000052920313,0.000014579286,0.0000039801557,0.000030661304,0.000050444694,0.00024121768,0.00005499327,0.9918172,0.007726474,0.0000022122208],"about_ca_topic_score_codex":0.001109299,"about_ca_topic_score_gemma":0.0009020293,"teacher_disagreement_score":0.029020699,"about_ca_system_score_codex":0.0018876222,"about_ca_system_score_gemma":0.0007429782,"threshold_uncertainty_score":0.097083926},"labels":[],"label_agreement":null},{"id":"W2496770778","doi":"10.1017/cbo9780511794797.015","title":"Relational Planning, Learning, and Probabilistic Reasoning","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"","keywords":"Certainty; Foundation (evidence); Probabilistic logic; Epistemology; Computer science; Epoch (astronomy); Artificial intelligence; Management science; Philosophy; Engineering; Political science; Law","score_opus":0.023838381712599034,"score_gpt":0.20754175683850268,"score_spread":0.18370337512590365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496770778","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.010216838,0.12224315,0.32673186,0.021041984,0.00074378814,0.00007534529,0.0005270416,0.000592087,0.51782787],"genre_scores_gemma":[0.6862997,0.05813338,0.14350964,0.0024074845,0.0017174842,0.00019266993,0.00094245636,0.00021781371,0.10657943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991647,0.00034584166,0.00003466396,0.00015426001,0.00023777602,0.00006283462],"domain_scores_gemma":[0.99920017,0.00054845266,0.00005145501,0.000105453444,0.000057220757,0.000037347843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014852774,0.0008537597,0.00054137135,0.0008965792,0.0009150268,0.0038247523,0.0013251196,0.0012971282,0.0061996086],"category_scores_gemma":[0.0027891265,0.00045376626,0.000630833,0.0018672532,0.007478421,0.005951667,0.0013962374,0.0027823958,0.0011408493],"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.0000066880634,0.0000066808734,0.0000558091,0.000054346434,0.0000076073597,0.000020676463,0.0001557667,0.003289721,0.000031583277,0.97502,0.0043158685,0.017035311],"study_design_scores_gemma":[0.0000020245475,0.0000019399822,0.00004406352,0.000022838933,0.0000019446538,0.000016906188,0.00003533072,0.0019197367,0.000026074178,0.9837066,0.014219566,0.0000030396463],"about_ca_topic_score_codex":0.01067736,"about_ca_topic_score_gemma":0.010135438,"teacher_disagreement_score":0.01067736,"about_ca_system_score_codex":0.0038575158,"about_ca_system_score_gemma":0.0018264358,"threshold_uncertainty_score":0.027988315},"labels":[],"label_agreement":null},{"id":"W2496865676","doi":"10.1017/cbo9780511615566.004","title":"The Axioms of Set Theory","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"York University","funders":"","keywords":"Axiom; Zermelo–Fraenkel set theory; Set (abstract data type); Computer science; Set theory; Mathematical economics; Mathematics; Axiom of choice; Programming language; Geometry","score_opus":0.02006166709262359,"score_gpt":0.19491526483732075,"score_spread":0.17485359774469716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496865676","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.0015668058,0.03043034,0.06833358,0.008977756,0.001320202,0.000055774774,0.00091494527,0.00025724922,0.88814336],"genre_scores_gemma":[0.24233969,0.060813118,0.10994663,0.008097102,0.0038701291,0.00070753647,0.0026928505,0.0005790105,0.5709539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989371,0.00035701154,0.0000726557,0.00016314017,0.00039844232,0.00007173572],"domain_scores_gemma":[0.9992046,0.00041958853,0.000034760153,0.00013722417,0.0001601314,0.00004372717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012703218,0.00069985917,0.0007780134,0.0016447479,0.0019503494,0.004257952,0.00089306943,0.0012194396,0.018396454],"category_scores_gemma":[0.0022202705,0.00043047074,0.0009159641,0.0018180591,0.007517996,0.0059222006,0.0016112092,0.0038299833,0.006511644],"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.0000022281542,0.0000020406092,0.000024429593,0.00005029339,0.0000022653476,0.00001180123,0.00015482726,0.00009833492,0.00005440595,0.9766297,0.014769269,0.008200433],"study_design_scores_gemma":[0.0000028515833,0.0000036396002,0.00008915117,0.00008361244,0.000002915648,0.000060599472,0.000075461,0.00018117264,0.00008059393,0.79552966,0.20388652,0.000003856706],"about_ca_topic_score_codex":0.0029184655,"about_ca_topic_score_gemma":0.003350995,"teacher_disagreement_score":0.018396454,"about_ca_system_score_codex":0.003136238,"about_ca_system_score_gemma":0.0023246196,"threshold_uncertainty_score":0.061542332},"labels":[],"label_agreement":null},{"id":"W2502059287","doi":"","title":"Generation and verification of plans with loops","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Property (philosophy); Plan (archaeology); Computer science; Finite-state machine; Generalization; State (computer science); Representation (politics); Theoretical computer science; Mathematics; Algorithm","score_opus":0.025475833980599997,"score_gpt":0.24696561119870866,"score_spread":0.22148977721810867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502059287","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.07531655,0.00013590006,0.9191076,0.0002936676,0.00003424625,0.00022520636,0.00017350017,0.0016018371,0.003111365],"genre_scores_gemma":[0.4670829,0.00021478822,0.52930254,0.000113654656,0.000026168258,0.00028616042,0.0006104086,0.00019932867,0.0021640193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977118,0.0006455273,0.00014269768,0.00046362603,0.00079229433,0.00024413079],"domain_scores_gemma":[0.9933327,0.0049479413,0.00052151387,0.0007261574,0.00037109095,0.00010059679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002250441,0.0005515061,0.0005185256,0.0005804313,0.000650133,0.0012411795,0.0014371976,0.00069390034,0.0020314066],"category_scores_gemma":[0.011657938,0.00053268985,0.0017585199,0.00042917678,0.0027398316,0.0021903838,0.0020706938,0.0014306689,0.0002768729],"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.00028247174,0.00017533616,0.0034587549,0.0004252406,0.00010677306,0.00065600965,0.00093763595,0.48612827,0.02072338,0.3960308,0.0014052794,0.08967005],"study_design_scores_gemma":[0.00007792249,0.0001359879,0.00038086844,0.00006344291,0.000045686065,0.00012361688,0.00012301146,0.72350454,0.024849454,0.24539664,0.005265085,0.000033663797],"about_ca_topic_score_codex":0.003022123,"about_ca_topic_score_gemma":0.0024559726,"teacher_disagreement_score":0.003022123,"about_ca_system_score_codex":0.0010428166,"about_ca_system_score_gemma":0.0024623708,"threshold_uncertainty_score":0.011901677},"labels":[],"label_agreement":null},{"id":"W2502630482","doi":"10.1016/s1874-5075(03)80004-9","title":"Logic as a Description of a Logical Agent","year":2003,"lang":"en","type":"book-chapter","venue":"˜A œpractical logic of cognitive systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.09436894990003361,"score_gpt":0.3067966920190655,"score_spread":0.2124277421190319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502630482","genre_codex":"methods","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.006020575,0.004439806,0.6890943,0.011324868,0.0006882217,0.00017425563,0.00073550426,0.00057262834,0.28694987],"genre_scores_gemma":[0.35129216,0.0047113867,0.55166465,0.0039281948,0.0011387346,0.0009082708,0.0010637837,0.00035026445,0.08494254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876046,0.00056656677,0.00010357847,0.00017567395,0.00030937654,0.00008444876],"domain_scores_gemma":[0.99895465,0.0005957525,0.00007324024,0.00015676931,0.00013540739,0.00008422427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018318718,0.00085533195,0.00059111055,0.001873604,0.0018608973,0.0092848325,0.0026423188,0.0031431525,0.010380455],"category_scores_gemma":[0.0022860072,0.0007823104,0.0010999003,0.0017141005,0.010563793,0.01170872,0.0020093648,0.0044129677,0.0024571645],"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.0000017888183,0.0000022653878,0.000007218824,0.000010798413,0.0000013933296,0.000009413693,0.00008799268,0.00024267471,0.000045261764,0.9981974,0.0005626354,0.0008313274],"study_design_scores_gemma":[0.0000051786988,0.0000035943951,0.000009137613,0.00001331088,0.0000029011603,0.00002625392,0.000043300835,0.001665157,0.00006243716,0.98081344,0.017351517,0.0000036611027],"about_ca_topic_score_codex":0.0029376238,"about_ca_topic_score_gemma":0.002558525,"teacher_disagreement_score":0.010380455,"about_ca_system_score_codex":0.0024669608,"about_ca_system_score_gemma":0.002198895,"threshold_uncertainty_score":0.034726083},"labels":[],"label_agreement":null},{"id":"W2512200334","doi":"10.1007/978-3-319-45276-0_10","title":"Extending Weakly-Sticky Datalog $$^\\pm $$ : Query-Answering Tractability and Optimizations","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Datalog; Computer science; Chase; Rewriting; Class (philosophy); Property (philosophy); MAGIC (telescope); Theoretical computer science; Programming language; Range (aeronautics); Database; Artificial intelligence","score_opus":0.017282461370689554,"score_gpt":0.24678532354316035,"score_spread":0.2295028621724708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512200334","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.032952145,0.0010165289,0.93743825,0.0028967096,0.00026088886,0.00025265635,0.0019761682,0.0059784963,0.017228138],"genre_scores_gemma":[0.42095545,0.0011559234,0.5501638,0.001957022,0.0006826972,0.0005570578,0.004554411,0.0035228159,0.01645083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99074334,0.0021345722,0.0007492042,0.001405135,0.0039294334,0.0010382924],"domain_scores_gemma":[0.98027736,0.0114144515,0.0004954978,0.006088793,0.0013681577,0.00035570492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006353541,0.0015468156,0.0022576025,0.0017887844,0.0018276437,0.005269146,0.0058901277,0.0019374524,0.013603505],"category_scores_gemma":[0.023559608,0.0017472127,0.0048418217,0.0041137016,0.0034809075,0.018216796,0.011720517,0.008071271,0.0036861296],"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.0009823976,0.00046678685,0.0015052466,0.0011381002,0.00019554132,0.000268961,0.00087236246,0.064995244,0.009661284,0.64974743,0.026434116,0.2437326],"study_design_scores_gemma":[0.0000680445,0.000048076967,0.00019250366,0.000054367894,0.00007578066,0.00007744706,0.000079862984,0.13307907,0.0046133073,0.85463417,0.0070403065,0.000037069814],"about_ca_topic_score_codex":0.006681265,"about_ca_topic_score_gemma":0.008066466,"teacher_disagreement_score":0.013603505,"about_ca_system_score_codex":0.003434841,"about_ca_system_score_gemma":0.0039042654,"threshold_uncertainty_score":0.045508265},"labels":[],"label_agreement":null},{"id":"W2512497766","doi":"","title":"Deliberation in agent programming languages","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Deliberation; Computer science; Situation calculus; Rotation formalisms in three dimensions; Artificial intelligence; Action (physics); Cognitive science; Programming language; Software engineering; Mathematics","score_opus":0.013957216472493894,"score_gpt":0.2655017659650315,"score_spread":0.25154454949253763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512497766","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.0071735485,0.0010868718,0.9716736,0.0012568514,0.000125268,0.00011997787,0.00012535127,0.001973918,0.016464597],"genre_scores_gemma":[0.21780886,0.0015315505,0.7625027,0.0011032439,0.00024125194,0.000781625,0.00036250835,0.00075133884,0.014917081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624807,0.0017063877,0.00045893178,0.00051149743,0.00075131736,0.0003238101],"domain_scores_gemma":[0.9975091,0.0014591339,0.00027850264,0.00038227852,0.00025123786,0.00011965656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036177095,0.00092183973,0.0007029243,0.0008954074,0.0012862575,0.0051443945,0.0017267985,0.0013124808,0.0037442073],"category_scores_gemma":[0.0046789814,0.0010199288,0.0015494728,0.0012828467,0.004414864,0.0056133308,0.0029684461,0.003899304,0.0012690738],"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.000026646707,0.000014428633,0.000108529144,0.00008639414,0.000013433326,0.000090496265,0.00080527546,0.0063579963,0.0006876223,0.9785597,0.0012285433,0.01202088],"study_design_scores_gemma":[0.000047897192,0.000030541563,0.00005566811,0.00007122593,0.00002167273,0.00015803294,0.00015726587,0.039855216,0.0015886525,0.9027043,0.055285376,0.000024051124],"about_ca_topic_score_codex":0.0011917453,"about_ca_topic_score_gemma":0.0011040259,"teacher_disagreement_score":0.0051443945,"about_ca_system_score_codex":0.0014959039,"about_ca_system_score_gemma":0.0017084903,"threshold_uncertainty_score":0.019132495},"labels":[],"label_agreement":null},{"id":"W2540738838","doi":"10.1007/978-3-319-48758-8_40","title":"GenB: A General Solver for AGM Revision","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Solver; Simple (philosophy); Set (abstract data type); User interface; Operator (biology); Range (aeronautics); Problem solver; Interface (matter); Programming language; Selection (genetic algorithm); Human–computer interaction; Software engineering; Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.020541649251697817,"score_gpt":0.25716990182890437,"score_spread":0.23662825257720654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540738838","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.0051611895,0.0006514692,0.90248483,0.0012224697,0.0005894814,0.00035981028,0.0032214455,0.048612624,0.037696756],"genre_scores_gemma":[0.118242316,0.00072167674,0.8163664,0.0011408554,0.0003426892,0.0004771261,0.007056994,0.01445858,0.041193377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983405,0.00040159168,0.00016935922,0.00037059182,0.00050664763,0.00021134058],"domain_scores_gemma":[0.99840885,0.0007286796,0.00007203829,0.0004319897,0.00028852603,0.000070032635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667468,0.0017274126,0.001477309,0.0013793954,0.0011066757,0.0035488533,0.0038143613,0.0025461281,0.04893115],"category_scores_gemma":[0.006105763,0.0012986438,0.002457017,0.001419547,0.0014072612,0.0055145305,0.0053720637,0.0038257902,0.01802052],"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.00044795984,0.00018350079,0.0006792732,0.0014103246,0.00014981083,0.00047026738,0.00049229665,0.012493148,0.00740368,0.30455643,0.19245405,0.4792592],"study_design_scores_gemma":[0.00037708433,0.000060335675,0.00023483111,0.00024702476,0.00014101704,0.00060119113,0.00021362396,0.13498503,0.016937794,0.65989256,0.18622176,0.00008781703],"about_ca_topic_score_codex":0.0021595336,"about_ca_topic_score_gemma":0.004141761,"teacher_disagreement_score":0.04893115,"about_ca_system_score_codex":0.001080918,"about_ca_system_score_gemma":0.0021336316,"threshold_uncertainty_score":0.16369098},"labels":[],"label_agreement":null},{"id":"W2548683791","doi":"10.7202/1037106ar","title":"Quelle logique pour la complexité?","year":2016,"lang":"fr","type":"article","venue":"Nouvelles perspectives en sciences sociales","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.06990098969789175,"score_gpt":0.33412760781207435,"score_spread":0.2642266181141826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548683791","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.048996463,0.012607392,0.32489038,0.11710344,0.0017549713,0.00013786413,0.00062069367,0.00062369736,0.4932651],"genre_scores_gemma":[0.84914684,0.0061697518,0.058634672,0.008763965,0.0012323128,0.00034120047,0.0004488102,0.00053815014,0.07472422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967758,0.0011624123,0.00012114936,0.0008121272,0.0007799945,0.00034848935],"domain_scores_gemma":[0.99693596,0.0013433839,0.00027668293,0.0006181823,0.0006221663,0.00020361281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034372313,0.00084454304,0.0009456555,0.0023492957,0.003954378,0.009885729,0.0015162599,0.0028090163,0.013046449],"category_scores_gemma":[0.006262381,0.00052432314,0.0011480269,0.0016542964,0.02951748,0.017391678,0.004339301,0.006271094,0.0021277019],"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.000004147195,0.0000029882747,0.00010352466,0.000017244422,0.0000029037117,0.000023849008,0.00046099705,0.00009801574,0.000070085305,0.9971027,0.00082394946,0.001289577],"study_design_scores_gemma":[0.000008556418,0.0000065407544,0.00020312172,0.000035454508,0.000004090099,0.00007110266,0.0005162304,0.00075509655,0.00011356203,0.9605248,0.037750304,0.0000111376],"about_ca_topic_score_codex":0.009557223,"about_ca_topic_score_gemma":0.0063710343,"teacher_disagreement_score":0.013046449,"about_ca_system_score_codex":0.008539041,"about_ca_system_score_gemma":0.0053600236,"threshold_uncertainty_score":0.061955333},"labels":[],"label_agreement":null},{"id":"W2552400520","doi":"","title":"Some Remarks on Relations between Proofs and Games","year":2010,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Computer science; Mathematical economics; Mathematics; Geometry","score_opus":0.014472289466776757,"score_gpt":0.23294143109602156,"score_spread":0.2184691416292448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552400520","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.025486166,0.019976597,0.5784868,0.13960233,0.003620008,0.0003405913,0.0008945873,0.000892961,0.23070005],"genre_scores_gemma":[0.6706331,0.017590526,0.22480379,0.030612756,0.008208566,0.0014331258,0.0007099313,0.00093689933,0.045071337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894846,0.005856338,0.00064977835,0.0014203575,0.0017479435,0.00084086764],"domain_scores_gemma":[0.9678812,0.027241291,0.0011269856,0.0014335512,0.0015193217,0.0007975688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011214837,0.0014352697,0.0013557632,0.0025559112,0.0038800766,0.007196097,0.003871667,0.0048417663,0.02506395],"category_scores_gemma":[0.029940091,0.00079228583,0.0026136965,0.0023611574,0.01529114,0.02548191,0.0056991186,0.008636711,0.002046058],"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.000015749305,0.000011199863,0.00010122602,0.00007331722,0.0000059396884,0.00006882111,0.0004689137,0.0005848353,0.000052811585,0.9945235,0.0020039072,0.0020898145],"study_design_scores_gemma":[0.000009868389,0.000012616567,0.00009086735,0.000044421497,0.00000448447,0.000034886623,0.00016186564,0.0008638134,0.000061031114,0.99005973,0.008648058,0.000008250428],"about_ca_topic_score_codex":0.0042698137,"about_ca_topic_score_gemma":0.0025464576,"teacher_disagreement_score":0.02506395,"about_ca_system_score_codex":0.0030562747,"about_ca_system_score_gemma":0.0013452196,"threshold_uncertainty_score":0.083847284},"labels":[],"label_agreement":null},{"id":"W2554048096","doi":"10.1016/j.ijar.2017.07.010","title":"Causes for query answers from databases: Datalog abduction, view-updates, and integrity constraints","year":2017,"lang":"en","type":"preprint","venue":"International Journal of Approximate Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Causality (physics); Datalog; Data integrity; Constraint (computer-aided design); Computer science; Consistency (knowledge bases); Connection (principal bundle); Theoretical computer science; Database; Data mining; Mathematics; Artificial intelligence","score_opus":0.05219284208451504,"score_gpt":0.3314246874115469,"score_spread":0.2792318453270319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554048096","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.08270874,0.0022739314,0.894403,0.010788877,0.00030468957,0.00026220383,0.0015244072,0.0015124532,0.0062217517],"genre_scores_gemma":[0.7741275,0.0014702571,0.21642344,0.001347769,0.00059241784,0.0002590996,0.001714633,0.0004416222,0.0036231838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98126537,0.005557865,0.0021750107,0.0021742466,0.0075493986,0.0012781078],"domain_scores_gemma":[0.89955485,0.07281447,0.0066826856,0.011403262,0.008450596,0.0010941108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01497651,0.001168748,0.0018758229,0.0046801562,0.0020428426,0.008785497,0.0036088082,0.0035349089,0.0038600343],"category_scores_gemma":[0.11233256,0.0019735394,0.0035679822,0.00392743,0.0037322484,0.01419667,0.006717499,0.0063591944,0.0003804958],"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.0009913911,0.00027362982,0.019981125,0.0010855921,0.00064654864,0.002208564,0.002950602,0.08506434,0.0021656968,0.7660049,0.011323694,0.10730395],"study_design_scores_gemma":[0.000106795334,0.000029669685,0.00087760744,0.00013802113,0.00028018205,0.00045404708,0.0006329675,0.23400159,0.0036812364,0.75702536,0.0027201923,0.000052273033],"about_ca_topic_score_codex":0.007914451,"about_ca_topic_score_gemma":0.009560614,"teacher_disagreement_score":0.01497651,"about_ca_system_score_codex":0.00294446,"about_ca_system_score_gemma":0.0044392413,"threshold_uncertainty_score":0.07920432},"labels":[],"label_agreement":null},{"id":"W2554766785","doi":"10.22215/etd/2011-09309","title":"Achieving data privacy through virtual updates","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Political science; Internet privacy","score_opus":0.06338384151175548,"score_gpt":0.30232899414229014,"score_spread":0.23894515263053467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554766785","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.04478968,0.001200088,0.9151386,0.003386815,0.00042169777,0.0001803776,0.00052199257,0.0018139419,0.03254673],"genre_scores_gemma":[0.7947715,0.0011798833,0.17775446,0.0012574564,0.00046484865,0.00027226098,0.00063566427,0.000457622,0.023206325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890893,0.004399709,0.00078053045,0.001743969,0.002984076,0.0010023534],"domain_scores_gemma":[0.96990675,0.009944927,0.0012180561,0.016721908,0.0015637235,0.0006446741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070303557,0.0007728832,0.0011967215,0.0013266312,0.002296999,0.009271911,0.0026302075,0.0016378594,0.0062944875],"category_scores_gemma":[0.027307315,0.0009588306,0.0010875723,0.0021493512,0.0037388788,0.017317679,0.009642764,0.0038785841,0.0017137978],"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.00081807777,0.00015546619,0.0016954174,0.00014843095,0.00009133723,0.00022190386,0.000830332,0.020241829,0.0050572944,0.79859275,0.010299672,0.16184755],"study_design_scores_gemma":[0.000105834115,0.00016180897,0.00034438062,0.00007357202,0.000097158496,0.0005358083,0.00031153153,0.15985821,0.01966074,0.7635768,0.05522604,0.00004821341],"about_ca_topic_score_codex":0.00089600607,"about_ca_topic_score_gemma":0.0009857232,"teacher_disagreement_score":0.009271911,"about_ca_system_score_codex":0.0014181128,"about_ca_system_score_gemma":0.002434059,"threshold_uncertainty_score":0.037180483},"labels":[],"label_agreement":null},{"id":"W2557915038","doi":"10.1007/978-3-319-50127-7_31","title":"Ontology Based Data Access with Referring Expressions for Logics with the Tree Model Property","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Ontology; Property (philosophy); Theoretical computer science; Object (grammar); Tree (set theory); Knowledge base; Domain (mathematical analysis); Computation; Identity (music); Information retrieval; Base (topology); Artificial intelligence; Algorithm; Mathematics","score_opus":0.09659244244260456,"score_gpt":0.29838707553978916,"score_spread":0.2017946330971846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557915038","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.0051977253,0.0006312876,0.9822066,0.001028916,0.00006924658,0.000102186495,0.00012826866,0.0006751491,0.009960711],"genre_scores_gemma":[0.1489656,0.002085059,0.83553314,0.0010638755,0.00024858842,0.0003159611,0.0007226203,0.00048733698,0.010577843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948886,0.0017474162,0.0005454854,0.0008899371,0.0015773129,0.00035131045],"domain_scores_gemma":[0.9956993,0.0022386687,0.00025891452,0.0013235118,0.0003620033,0.000117635725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004497135,0.0005653239,0.0009777104,0.0016346695,0.0017588774,0.0064509283,0.0022930794,0.0017795576,0.0070539494],"category_scores_gemma":[0.011815286,0.00065456214,0.0034761194,0.0037253615,0.004344929,0.016913295,0.006183421,0.0040574814,0.0015981474],"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.00003579301,0.000023824306,0.00015745997,0.00014875318,0.000019093575,0.00015947582,0.0008781432,0.0014141452,0.0021844115,0.9515612,0.0026292705,0.040788405],"study_design_scores_gemma":[0.000022756845,0.00004097232,0.00021092284,0.0001250814,0.000118086115,0.0007730902,0.00044081462,0.04592417,0.007172696,0.8856533,0.05944612,0.000072017785],"about_ca_topic_score_codex":0.002693366,"about_ca_topic_score_gemma":0.0022302298,"teacher_disagreement_score":0.0070539494,"about_ca_system_score_codex":0.002548807,"about_ca_system_score_gemma":0.0016901136,"threshold_uncertainty_score":0.023783445},"labels":[],"label_agreement":null},{"id":"W2558161679","doi":"10.4230/lipics.icdt.2015.342","title":"From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Consistency (knowledge bases); Causality (physics); Database theory; Database; Information retrieval; Data mining; Database design; Artificial intelligence","score_opus":0.0445754772296752,"score_gpt":0.28253670423893745,"score_spread":0.23796122700926226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558161679","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.019115906,0.0008698975,0.96841484,0.0043515284,0.0001620367,0.00011822489,0.00030851737,0.00050977437,0.0061493516],"genre_scores_gemma":[0.624981,0.0020342297,0.35994586,0.0015741587,0.0005223816,0.0003966376,0.0011147738,0.00035645912,0.0090744635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990301,0.0027910455,0.00067308574,0.0018562042,0.0036009375,0.00077765004],"domain_scores_gemma":[0.9422949,0.04485261,0.0031180985,0.005388061,0.0035056083,0.0008407893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070893867,0.0010757165,0.0011007116,0.0037982122,0.0021120652,0.005435621,0.003288916,0.0026159438,0.009380499],"category_scores_gemma":[0.05083539,0.0011401626,0.0036022745,0.002857534,0.006662125,0.01575966,0.0058866497,0.0055160713,0.0006767359],"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.0000917134,0.0000644416,0.0019077744,0.00026861936,0.000058999067,0.0003591629,0.0007966189,0.03917984,0.00059771375,0.92237425,0.0019240938,0.032376874],"study_design_scores_gemma":[0.000018500707,0.000018820889,0.00024084284,0.000053484324,0.000056817684,0.00017941583,0.0002597482,0.070444,0.0013272924,0.9241361,0.003239022,0.000025898451],"about_ca_topic_score_codex":0.005920225,"about_ca_topic_score_gemma":0.0046196626,"teacher_disagreement_score":0.009380499,"about_ca_system_score_codex":0.004651245,"about_ca_system_score_gemma":0.0041501145,"threshold_uncertainty_score":0.037492752},"labels":[],"label_agreement":null},{"id":"W2561059964","doi":"10.1007/978-1-4020-2808-3_16","title":"Belief Contraction, Anti-Formulae and Resource Overdraft:Part II Deletion In Resource Unbounded Logics","year":2009,"lang":"en","type":"book-chapter","venue":"Logic, epistemology, and the unity of science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Object (grammar); Resource (disambiguation); Computer science; Overdraft; Theoretical computer science; Bounded function; Algorithm; Mathematics; Artificial intelligence; Computer security; Computer network","score_opus":0.018285264919014353,"score_gpt":0.23238211082946328,"score_spread":0.21409684591044892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561059964","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.06365035,0.00391935,0.77154624,0.010518535,0.0004494082,0.00018273322,0.0002818339,0.00040367068,0.14904793],"genre_scores_gemma":[0.82319015,0.0021641196,0.12866458,0.0017879109,0.00059766823,0.0005890622,0.00040850547,0.00051047246,0.04208764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958631,0.0017436941,0.0003058535,0.00065928535,0.0009902659,0.0004379282],"domain_scores_gemma":[0.98826015,0.008331299,0.0005266998,0.0018333227,0.00083115173,0.00021732235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006076217,0.00060033234,0.0011740269,0.0011789337,0.0021748813,0.006106489,0.0036772995,0.0024677059,0.0064528575],"category_scores_gemma":[0.015853781,0.0009100158,0.0016366169,0.002413107,0.011964705,0.021391835,0.0048961155,0.008331341,0.00074245833],"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.000018740991,0.000009029794,0.000082544546,0.000033361157,0.0000047768312,0.000038987455,0.0005787678,0.0006842636,0.0002486891,0.9924912,0.00064142526,0.005168184],"study_design_scores_gemma":[0.0000079684905,0.0000068811814,0.0000638498,0.000024039728,0.000009834603,0.00005427143,0.00016167248,0.0033759803,0.0004892764,0.9913748,0.0044230805,0.000008492944],"about_ca_topic_score_codex":0.0025198872,"about_ca_topic_score_gemma":0.0013800011,"teacher_disagreement_score":0.0064528575,"about_ca_system_score_codex":0.003349965,"about_ca_system_score_gemma":0.0024411215,"threshold_uncertainty_score":0.032134473},"labels":[],"label_agreement":null},{"id":"W2571755757","doi":"10.3166/isi.21.2.39-63","title":"Vérification automatique d’exigences pour les politiques d’échange d’information. Exigences de diffusion et de non-diffusion d'information","year":2016,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.026260884719010377,"score_gpt":0.27191485697775347,"score_spread":0.24565397225874308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571755757","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.038949355,0.00045437893,0.9471386,0.0023064949,0.00022935281,0.00020598892,0.00044592205,0.0018687107,0.008401167],"genre_scores_gemma":[0.7502036,0.00058936985,0.232976,0.0010566149,0.00022909137,0.00051986164,0.0010945913,0.000905769,0.012425063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9816381,0.0046863067,0.0012566954,0.00373014,0.0068943137,0.0017945264],"domain_scores_gemma":[0.8749585,0.10200192,0.0037723621,0.0075247847,0.01060001,0.0011424549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013870775,0.0012700133,0.0016885343,0.0022507613,0.001892433,0.0060781445,0.002403747,0.0031412558,0.01037779],"category_scores_gemma":[0.09606258,0.001482755,0.004885362,0.0013808176,0.0073028295,0.010053456,0.0057887095,0.0070075137,0.0017421957],"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.0015877177,0.00027889558,0.005359303,0.0008976621,0.00037025753,0.0011630112,0.0013876683,0.086860225,0.017897457,0.7863691,0.0065872385,0.091241546],"study_design_scores_gemma":[0.00026686525,0.00015522381,0.0013283499,0.00018580674,0.00013465465,0.00036445836,0.0002368653,0.39821327,0.02350978,0.57014745,0.0053800484,0.00007722285],"about_ca_topic_score_codex":0.008447332,"about_ca_topic_score_gemma":0.0071456265,"teacher_disagreement_score":0.013870775,"about_ca_system_score_codex":0.0054833037,"about_ca_system_score_gemma":0.0063153575,"threshold_uncertainty_score":0.07335657},"labels":[],"label_agreement":null},{"id":"W2572706305","doi":"","title":"Decidable reasoning in a logic of limited belief with function symbols","year":2016,"lang":"en","type":"article","venue":"RWTH Publications (RWTH Aachen)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Decidability; Non-monotonic logic; Computer science; Function (biology); Completeness (order theory); Deductive reasoning; Semantics (computer science); Description logic; Class (philosophy); Mathematics; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.017787349989252257,"score_gpt":0.23288110875898674,"score_spread":0.21509375876973447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572706305","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.026745282,0.00040009496,0.96226823,0.0015491219,0.00004394858,0.00008001849,0.00020660485,0.000289424,0.008417227],"genre_scores_gemma":[0.5036443,0.0006505683,0.48941934,0.00076102675,0.00021108636,0.0003458724,0.00052899803,0.000085411295,0.004353312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949398,0.0022221392,0.00045317024,0.0007648875,0.0011472475,0.00047270855],"domain_scores_gemma":[0.9872273,0.010200062,0.000658873,0.0009876156,0.0006236743,0.00030236845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075358204,0.00073937915,0.0010068858,0.0016788994,0.0016581804,0.004993679,0.0025406713,0.001825957,0.0023648818],"category_scores_gemma":[0.014054969,0.0007535492,0.0033833925,0.0018017465,0.0065059834,0.012036739,0.004198269,0.004384255,0.00037133077],"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.00003668083,0.000034197208,0.00015212268,0.00008062849,0.000033909895,0.00021800959,0.00045661096,0.008841089,0.0010581462,0.98224074,0.0005042821,0.0063435948],"study_design_scores_gemma":[0.000035820976,0.00002279151,0.0000645519,0.000025360865,0.00003259597,0.00011157429,0.000075323645,0.0453698,0.001360613,0.95068675,0.0021962835,0.00001853267],"about_ca_topic_score_codex":0.0027049142,"about_ca_topic_score_gemma":0.0025080757,"teacher_disagreement_score":0.0075358204,"about_ca_system_score_codex":0.0024739054,"about_ca_system_score_gemma":0.0018748787,"threshold_uncertainty_score":0.039853692},"labels":[],"label_agreement":null},{"id":"W2572958716","doi":"10.3233/978-1-61499-672-9-408","title":"Situation Calculus Game Structures and GDL","year":2022,"lang":"en","type":"article","venue":"Minerva Access (University of Melbourne)","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Correctness; Situation calculus; Computer science; Action (physics); Translation (biology); Calculus (dental); Programming language","score_opus":0.021529962771615865,"score_gpt":0.2274170165466668,"score_spread":0.20588705377505093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572958716","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.013744435,0.00089020835,0.9059925,0.0031912287,0.00017772283,0.00016665657,0.00047978506,0.0011316435,0.07422584],"genre_scores_gemma":[0.5670289,0.0011341949,0.3991472,0.0013382969,0.000259782,0.0006134844,0.0006920696,0.000377326,0.029408814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979964,0.0006199799,0.00015582987,0.0003473154,0.0005431419,0.00033732358],"domain_scores_gemma":[0.9987991,0.0005470756,0.00012030947,0.00023859928,0.00018405443,0.00011094447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021594728,0.00081750733,0.0005591361,0.001565718,0.0014682008,0.004235139,0.0021006023,0.0015108185,0.0064465143],"category_scores_gemma":[0.0029067835,0.0006868584,0.0015352637,0.0013379323,0.007032853,0.006544366,0.002424078,0.0033108364,0.0011050076],"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.0000045937645,0.0000048215616,0.00004204725,0.000015733036,0.0000021743033,0.000051315543,0.0002603298,0.0018149918,0.00013979708,0.9953217,0.00037398527,0.0019685144],"study_design_scores_gemma":[0.000016029197,0.000010741521,0.000064849446,0.000024049783,0.000007960497,0.00008567191,0.000112324116,0.015591374,0.00050664716,0.95417124,0.029395409,0.000013746228],"about_ca_topic_score_codex":0.010091564,"about_ca_topic_score_gemma":0.006030515,"teacher_disagreement_score":0.010091564,"about_ca_system_score_codex":0.0046147318,"about_ca_system_score_gemma":0.0024885908,"threshold_uncertainty_score":0.033482313},"labels":[],"label_agreement":null},{"id":"W2573027291","doi":"","title":"Negation without negation in probabilistic logic programming","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"","keywords":"Negation; Probabilistic logic; Computer science; Conditional probability; Mathematics; Joint probability distribution; Algorithm; Theoretical computer science; Artificial intelligence; Algebra over a field; Programming language; Pure mathematics; Statistics","score_opus":0.039872233386709144,"score_gpt":0.302820400739416,"score_spread":0.2629481673527069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573027291","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.009032471,0.00056837086,0.978573,0.0011936144,0.00008272046,0.000061271174,0.00013246972,0.00031389378,0.0100421],"genre_scores_gemma":[0.39340246,0.0014819136,0.59598124,0.0009824489,0.00033041832,0.00043257835,0.00044492213,0.00024319437,0.006700828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939996,0.0023692965,0.0005244677,0.001032541,0.0017137736,0.00036035827],"domain_scores_gemma":[0.99385923,0.0043235193,0.0003809023,0.00065597077,0.00058491883,0.00019547199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005881141,0.0008057285,0.0007584514,0.0012144309,0.0011678938,0.0045949323,0.0017599327,0.001289467,0.0026349574],"category_scores_gemma":[0.012473578,0.000843832,0.0016698772,0.002089291,0.006527189,0.009865355,0.0035196503,0.0032809929,0.00061408407],"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.000021208838,0.000011869699,0.0001655849,0.00006339541,0.000013859125,0.000079899924,0.0002057405,0.009056987,0.0003460066,0.9744091,0.0005630359,0.015063349],"study_design_scores_gemma":[0.000008491836,0.000009766841,0.000033425807,0.000028012788,0.00001387428,0.000056978963,0.000026704636,0.02554754,0.00046790656,0.968491,0.0053044637,0.000011716666],"about_ca_topic_score_codex":0.00320504,"about_ca_topic_score_gemma":0.002356375,"teacher_disagreement_score":0.005881141,"about_ca_system_score_codex":0.0023857302,"about_ca_system_score_gemma":0.0016407938,"threshold_uncertainty_score":0.031102836},"labels":[],"label_agreement":null},{"id":"W2573558938","doi":"","title":"Online agent supervision in the situation calculus","year":2016,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Supervisor; Computer science; Construct (python library); Personalization; Control (management); Autonomy; Point (geometry); Multi-agent system; Human–computer interaction; Programming language; Software engineering; Artificial intelligence; World Wide Web; Mathematics","score_opus":0.06239937185319282,"score_gpt":0.31163504546413473,"score_spread":0.2492356736109419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573558938","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.01876425,0.00019136384,0.9694308,0.0004081095,0.00004460229,0.00009286629,0.00010338487,0.00085903134,0.010105592],"genre_scores_gemma":[0.5654037,0.0003642617,0.4255455,0.00023974486,0.000120886936,0.00026662435,0.0002002218,0.00018117882,0.0076779258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971271,0.00080842536,0.00022019658,0.000516825,0.00091419474,0.0004132527],"domain_scores_gemma":[0.99748707,0.0013299653,0.00022616635,0.00047211951,0.00029718544,0.00018749025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027513602,0.000449276,0.0005603258,0.00059578597,0.0013264643,0.0025080338,0.001621471,0.0008912583,0.0032795176],"category_scores_gemma":[0.0041510644,0.0006304916,0.0014466605,0.00071551604,0.0046645957,0.004674864,0.0023865565,0.002929813,0.0005606517],"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.000062869214,0.000039397743,0.0002863448,0.00005641378,0.000013467628,0.00019564167,0.0006228604,0.017332677,0.0021763167,0.96721095,0.00060556905,0.011397431],"study_design_scores_gemma":[0.000069848145,0.000052337542,0.00019592143,0.000040137777,0.00005135531,0.00015348336,0.00017344902,0.171063,0.004414808,0.80961865,0.014129238,0.000037792855],"about_ca_topic_score_codex":0.0066100205,"about_ca_topic_score_gemma":0.0052732388,"teacher_disagreement_score":0.0066100205,"about_ca_system_score_codex":0.0018265557,"about_ca_system_score_gemma":0.0028337543,"threshold_uncertainty_score":0.014550805},"labels":[],"label_agreement":null},{"id":"W2575334674","doi":"","title":"Improved heuristic and tie-breaking for optimally solving Sokoban","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Consistent heuristic; Domain (mathematical analysis); Mathematics; Algorithm; Incremental heuristic search; Theoretical computer science; Search algorithm; Beam search","score_opus":0.09008996914440243,"score_gpt":0.3091966442554555,"score_spread":0.21910667511105308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575334674","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.1219388,0.00052553794,0.85365254,0.0006755603,0.00021724108,0.0006258192,0.00035566185,0.001273789,0.020735016],"genre_scores_gemma":[0.41287518,0.00029145874,0.58031374,0.00037620447,0.000041910265,0.0006963909,0.0008300461,0.00032967617,0.0042454144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.0003772037,0.000103522994,0.00023817907,0.0003395107,0.00023800672],"domain_scores_gemma":[0.9982224,0.0009328257,0.00015301541,0.0003794608,0.00017444555,0.00013778791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333395,0.0009896981,0.0013958765,0.0012231522,0.00097269355,0.0014085666,0.0026540363,0.0017343285,0.0064909654],"category_scores_gemma":[0.005390212,0.00066081074,0.0014294916,0.001394911,0.0011039776,0.0023261772,0.0023338508,0.002171002,0.000888292],"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.0006308485,0.0008911445,0.0023270994,0.0005752103,0.00016028146,0.00052230543,0.0004349106,0.6180687,0.009527273,0.102494344,0.0079454575,0.2564225],"study_design_scores_gemma":[0.00016739174,0.00023207285,0.00027049778,0.00006513441,0.000047518657,0.00017140612,0.00020665332,0.91704935,0.004737068,0.06982055,0.007194684,0.000037602258],"about_ca_topic_score_codex":0.0020903451,"about_ca_topic_score_gemma":0.0023638795,"teacher_disagreement_score":0.0064909654,"about_ca_system_score_codex":0.00075598137,"about_ca_system_score_gemma":0.0019082633,"threshold_uncertainty_score":0.021714449},"labels":[],"label_agreement":null},{"id":"W2575628753","doi":"10.29007/976n","title":"An Algebra of Combined Constraint Solving","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rotation formalisms in three dimensions; Mathematical proof; Algebra over a field; Computer science; Formalism (music); Relational algebra; Constraint satisfaction problem; Universal algebra; Relation algebra; Algebraic structure; Modular design; Theoretical computer science; Programming language; Relational database; Mathematics; Algebra representation; Pure mathematics; Cellular algebra; Artificial intelligence","score_opus":0.015341149201505108,"score_gpt":0.2653032240207558,"score_spread":0.24996207481925067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575628753","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.010924788,0.001653946,0.8597693,0.0014482988,0.00033846867,0.00019189522,0.0006467027,0.0008057446,0.124220856],"genre_scores_gemma":[0.39033893,0.0020744165,0.5579329,0.0015025239,0.00091098103,0.00074668456,0.0017628723,0.00039619068,0.044334404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454606,0.0014352271,0.0004756347,0.0011311405,0.002018432,0.0003934383],"domain_scores_gemma":[0.9979113,0.000574577,0.00023657785,0.00035669663,0.00067797984,0.00024289663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566167,0.0006484576,0.0008092013,0.0024407476,0.0024342523,0.0056350026,0.0021250087,0.0010548974,0.014396301],"category_scores_gemma":[0.0034897963,0.0006307227,0.0017941146,0.0037780292,0.0045174435,0.008667378,0.00514898,0.0036872993,0.0023629463],"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.000009414705,0.000009114818,0.000056565914,0.00003634727,0.000010302666,0.000040726274,0.00012672429,0.0004442125,0.00029378533,0.9923304,0.0007897973,0.00585275],"study_design_scores_gemma":[0.000022517708,0.000024359199,0.00011210137,0.000031298237,0.000027541531,0.00015480186,0.00010756847,0.009531293,0.000979829,0.9404902,0.048495296,0.000023293638],"about_ca_topic_score_codex":0.0023628867,"about_ca_topic_score_gemma":0.0020139702,"teacher_disagreement_score":0.014396301,"about_ca_system_score_codex":0.0024545032,"about_ca_system_score_gemma":0.0021812515,"threshold_uncertainty_score":0.048160434},"labels":[],"label_agreement":null},{"id":"W2576180133","doi":"10.3233/978-1-61499-672-9-1221","title":"A Minimization-Based Approach to Iterated Multi-Agent Belief Change","year":2016,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","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":"Simon Fraser University","funders":"","keywords":"Iterated function; Minification; Computer science; Mathematical optimization; Mathematics; Mathematical analysis","score_opus":0.08063657668702144,"score_gpt":0.27759676242095,"score_spread":0.19696018573392854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576180133","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.0043372903,0.00037631424,0.9841652,0.00054972153,0.000044166034,0.000045167508,0.000028272194,0.00009317655,0.010360666],"genre_scores_gemma":[0.35349622,0.0006264099,0.63304794,0.00044637686,0.00018619977,0.00035671736,0.00011678205,0.00017138451,0.0115519455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973133,0.0013046083,0.00013838267,0.00039917222,0.00068107067,0.00016339494],"domain_scores_gemma":[0.9967315,0.0020755616,0.0002485926,0.00039449095,0.00043221982,0.00011765979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028804552,0.000820923,0.00079954736,0.0010483434,0.00090239156,0.0025274865,0.0032380493,0.0015025911,0.0040548076],"category_scores_gemma":[0.007933257,0.0005595712,0.0016518822,0.0011185346,0.0033922151,0.0039310767,0.0026426744,0.0029958738,0.0008105399],"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.00003681649,0.000035884426,0.00035409266,0.00012127557,0.00006523486,0.000120902456,0.0006038526,0.08804606,0.0013354239,0.8756439,0.0014859958,0.032150548],"study_design_scores_gemma":[0.0000137489815,0.00003757947,0.00009464937,0.00003060234,0.000021355401,0.000063185864,0.000061817955,0.38686258,0.001159069,0.6056659,0.0059674233,0.000022163475],"about_ca_topic_score_codex":0.0023043577,"about_ca_topic_score_gemma":0.001890547,"teacher_disagreement_score":0.0040548076,"about_ca_system_score_codex":0.0024403227,"about_ca_system_score_gemma":0.0009571421,"threshold_uncertainty_score":0.017705858},"labels":[],"label_agreement":null},{"id":"W2576517076","doi":"","title":"Strong-Cyclic Planning when Fairness is Not a Valid Assumption.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fairness measure; Max-min fairness; Mathematical optimization; Microeconomics; Economics; Mathematics; Computer network; Resource allocation","score_opus":0.1960748712451184,"score_gpt":0.3507000163299686,"score_spread":0.1546251450848502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576517076","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.066736735,0.00046979875,0.8373501,0.0067082704,0.0008799432,0.00067135185,0.001370616,0.0016589002,0.08415429],"genre_scores_gemma":[0.8082754,0.00021761602,0.17754267,0.0013873908,0.00028440816,0.0004301489,0.00091062055,0.00033603254,0.0106156645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920203,0.003177346,0.0005395261,0.0016465362,0.0013041437,0.001312145],"domain_scores_gemma":[0.95808184,0.025481699,0.0020385492,0.009069076,0.0034998297,0.0018290795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010757624,0.0006904438,0.00081680465,0.00089738384,0.0024345904,0.0031370972,0.0026990564,0.002128745,0.011730463],"category_scores_gemma":[0.055490404,0.0009325938,0.0013148711,0.0010174032,0.0034460202,0.0083688665,0.0049648313,0.003889443,0.0011634461],"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.0007198939,0.00014883971,0.002607645,0.00029552163,0.00014591384,0.0006656759,0.0005664562,0.02825738,0.0014884151,0.9248283,0.010478841,0.029797174],"study_design_scores_gemma":[0.000052200132,0.000039895185,0.00019083638,0.000039360515,0.000038892824,0.000118851545,0.00012064077,0.058034983,0.0009534355,0.93632597,0.004062372,0.000022521635],"about_ca_topic_score_codex":0.010210452,"about_ca_topic_score_gemma":0.014675869,"teacher_disagreement_score":0.011730463,"about_ca_system_score_codex":0.0024684644,"about_ca_system_score_gemma":0.008238727,"threshold_uncertainty_score":0.056892455},"labels":[],"label_agreement":null},{"id":"W2576694059","doi":"10.3233/978-1-61499-672-9-671","title":"Reconsidering AGM-Style Belief Revision in the Context of Logic Programs","year":2016,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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":"Style (visual arts); Belief revision; Context (archaeology); Epistemology; Psychology; Computer science; Philosophy; History; Archaeology","score_opus":0.08222638669784947,"score_gpt":0.27823135719221964,"score_spread":0.19600497049437016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576694059","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.05546997,0.0023911013,0.89426863,0.0048854277,0.00032325013,0.00007382737,0.00009120628,0.0003635394,0.04213302],"genre_scores_gemma":[0.7972316,0.0011230056,0.18694691,0.0006641293,0.0005313992,0.0001409793,0.000107746244,0.00012843903,0.013125886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971462,0.0016084237,0.00012142715,0.0003687912,0.0005378222,0.00021732344],"domain_scores_gemma":[0.99586064,0.0024950944,0.0002328934,0.0007876225,0.00047110414,0.0001527409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00482151,0.000550835,0.00057186704,0.0008633709,0.0010259291,0.004447237,0.001943457,0.0021289445,0.0026625213],"category_scores_gemma":[0.00982311,0.00038815028,0.0013035969,0.0009760965,0.0047063753,0.007816976,0.00287308,0.0042733303,0.0004853089],"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.00001582603,0.000010118638,0.00008686927,0.000032313073,0.000007351952,0.00008714717,0.00046800982,0.0022275404,0.0004117181,0.98631734,0.00043142377,0.009904382],"study_design_scores_gemma":[0.00001300714,0.000022099066,0.00009332696,0.000025476946,0.00001319554,0.00010377453,0.00012756635,0.03397068,0.00057056267,0.9601871,0.0048607728,0.000012418924],"about_ca_topic_score_codex":0.00113015,"about_ca_topic_score_gemma":0.0008491501,"teacher_disagreement_score":0.00482151,"about_ca_system_score_codex":0.0021523037,"about_ca_system_score_gemma":0.0009793941,"threshold_uncertainty_score":0.025498867},"labels":[],"label_agreement":null},{"id":"W2579770559","doi":"","title":"Online situation-determined agents and their supervision","year":2016,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","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":"York University","funders":"","keywords":"Supervisor; Computer science; Autonomy; Personalization; Multi-agent system; Point (geometry); Control (management); Intelligent agent; Sequence (biology); Human–computer interaction; Software engineering; Artificial intelligence; World Wide Web","score_opus":0.05808159817082645,"score_gpt":0.30085165269326497,"score_spread":0.24277005452243852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579770559","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.07040571,0.00025575107,0.9047587,0.00078891683,0.000049806134,0.00013749895,0.00011736853,0.0010344523,0.022451812],"genre_scores_gemma":[0.7885332,0.00016815221,0.20474656,0.00015669773,0.00004544487,0.00019000773,0.00014473939,0.000115573836,0.00589958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670035,0.0010401416,0.000265258,0.00077204965,0.0008096661,0.00041253056],"domain_scores_gemma":[0.9950494,0.0019865527,0.00070284173,0.0012800047,0.00059941655,0.00038182279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029904025,0.00037900155,0.00036717136,0.0006963365,0.0012303249,0.0024955391,0.0016861799,0.0010897742,0.0028964642],"category_scores_gemma":[0.0064559886,0.0005627552,0.0009570117,0.00041239613,0.005671234,0.0044656233,0.0029759197,0.0020547034,0.00043677006],"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.00006431994,0.000052195985,0.001201314,0.000061113504,0.00002614576,0.0003609213,0.002067248,0.017454952,0.0026504945,0.9584816,0.00053362077,0.017046073],"study_design_scores_gemma":[0.00005229865,0.00008031872,0.0007416556,0.00006253868,0.000047030528,0.00027209384,0.0005689183,0.15364565,0.006894753,0.8188086,0.018769119,0.000056952766],"about_ca_topic_score_codex":0.0042185592,"about_ca_topic_score_gemma":0.002921827,"teacher_disagreement_score":0.0042185592,"about_ca_system_score_codex":0.0014046778,"about_ca_system_score_gemma":0.0022698413,"threshold_uncertainty_score":0.01581496},"labels":[],"label_agreement":null},{"id":"W2583189786","doi":"10.1007/b100989","title":"Algorithmic Learning Theory","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Cognitive science; Psychology","score_opus":0.009120299820187654,"score_gpt":0.23121412187479512,"score_spread":0.22209382205460745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583189786","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.0031552296,0.053347435,0.43182474,0.011920108,0.0019911667,0.000095585936,0.00080295274,0.0011462707,0.49571657],"genre_scores_gemma":[0.23817676,0.056662243,0.25647408,0.005932282,0.0065653985,0.0006139847,0.004306675,0.0012271284,0.43004146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.00019742135,0.000032521675,0.00015039621,0.00026186448,0.000043089112],"domain_scores_gemma":[0.99927086,0.00035178923,0.00002947788,0.0001810797,0.00012552635,0.00004135016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088805833,0.0009823106,0.0011172817,0.001133265,0.0009003729,0.00344321,0.0014531486,0.0012202081,0.020068737],"category_scores_gemma":[0.002294317,0.0005171125,0.0007623426,0.0015739504,0.0023518126,0.003578248,0.0013908248,0.0040720575,0.008492776],"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.000010835261,0.00002743671,0.00016202743,0.00016291044,0.000031161937,0.000029173434,0.00009440049,0.00209239,0.00016454335,0.8360487,0.068480946,0.0926954],"study_design_scores_gemma":[0.000006178655,0.0000056194503,0.00012289219,0.000049451428,0.0000082050765,0.000052299154,0.000017334301,0.002512872,0.000103531296,0.9092927,0.08782365,0.000005227205],"about_ca_topic_score_codex":0.0009550292,"about_ca_topic_score_gemma":0.0011585073,"teacher_disagreement_score":0.020068737,"about_ca_system_score_codex":0.0014128475,"about_ca_system_score_gemma":0.0010936346,"threshold_uncertainty_score":0.067136586},"labels":[],"label_agreement":null},{"id":"W2585300201","doi":"","title":"A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report","year":2002,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Stable model semantics; Programming language; Theoretical computer science; Logic programming; Algorithm; Description logic; Multimodal logic","score_opus":0.09032722991893816,"score_gpt":0.20775001165061016,"score_spread":0.117422781731672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585300201","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.03976635,0.0002667446,0.9383159,0.0013007814,0.00027365919,0.00026019276,0.000661039,0.0050289608,0.014126381],"genre_scores_gemma":[0.28780276,0.0003749169,0.69552237,0.000565465,0.000336793,0.00021496123,0.001633491,0.0019267264,0.011622562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972831,0.00043702914,0.00023289844,0.0008707325,0.0007491594,0.00042697336],"domain_scores_gemma":[0.99140745,0.005342198,0.00039751554,0.0015924448,0.0009851478,0.00027514124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019859257,0.00074982963,0.00096998713,0.00075334887,0.0010307835,0.0028453358,0.0022647402,0.0008953076,0.015962027],"category_scores_gemma":[0.010326573,0.00087822735,0.0024362344,0.0014283016,0.0019399131,0.0068765343,0.0031379606,0.0043950253,0.004641487],"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.0010790229,0.0012910636,0.0018641754,0.0011034588,0.00011337639,0.00048688205,0.0017764962,0.030243574,0.03138016,0.57232696,0.029049583,0.32928526],"study_design_scores_gemma":[0.00047707694,0.00032093292,0.0011283556,0.00012909017,0.0002664376,0.0004403883,0.0004641973,0.24078406,0.050319843,0.66734964,0.038171,0.00014900744],"about_ca_topic_score_codex":0.0042714677,"about_ca_topic_score_gemma":0.0051279822,"teacher_disagreement_score":0.015962027,"about_ca_system_score_codex":0.0020826892,"about_ca_system_score_gemma":0.0025932405,"threshold_uncertainty_score":0.05339831},"labels":[],"label_agreement":null},{"id":"W2592122521","doi":"10.5555/3329995.3330087","title":"Unrestricted stone duality for Markov processes","year":2017,"lang":"en","type":"article","venue":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Security Agency; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Duality (order theory); Mathematics; Markov chain; Generality; Dual (grammatical number); Probabilistic logic; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.022561681655415187,"score_gpt":0.2228040533554826,"score_spread":0.2002423717000674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592122521","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.11516766,0.0013267492,0.7764991,0.0021409432,0.00027084776,0.000101433754,0.00031417346,0.00030595774,0.103873216],"genre_scores_gemma":[0.9089303,0.00090616534,0.06830288,0.00041582296,0.00032845087,0.0001728886,0.0003107401,0.0000952081,0.020537537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970245,0.00094126456,0.00021336712,0.0005213478,0.0009074954,0.0003920565],"domain_scores_gemma":[0.99748343,0.0010694802,0.00024340453,0.000322899,0.00054512516,0.00033574353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027754493,0.0004352319,0.0007398133,0.001628752,0.0019736888,0.004931036,0.0007491276,0.0010929565,0.0054290695],"category_scores_gemma":[0.0057480168,0.00040009888,0.0016054728,0.0010576128,0.003915309,0.007799819,0.004133744,0.0030951765,0.00069543684],"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.000004734191,0.0000045723114,0.00004237645,0.0000062382474,0.000002211255,0.000017954477,0.000063151805,0.00031362765,0.00012826013,0.9985044,0.000081194536,0.0008313175],"study_design_scores_gemma":[0.000004414381,0.0000065462564,0.000042517735,0.0000060498996,0.000003830251,0.000037278412,0.00004015077,0.0048656305,0.00033973763,0.992301,0.0023478365,0.0000050914755],"about_ca_topic_score_codex":0.0011974924,"about_ca_topic_score_gemma":0.00086016476,"teacher_disagreement_score":0.0054290695,"about_ca_system_score_codex":0.002337492,"about_ca_system_score_gemma":0.0015380058,"threshold_uncertainty_score":0.018162012},"labels":[],"label_agreement":null},{"id":"W2602470723","doi":"","title":"Bounded situation calculus action theories (Extended abstract)","year":2012,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","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":"York University","funders":"","keywords":"Bounded function; Situation calculus; Action (physics); Calculus (dental); Computer science; Mathematics; Artificial intelligence; Mathematical analysis; Physics; Medicine","score_opus":0.06084916203720669,"score_gpt":0.3237478127590275,"score_spread":0.2628986507218208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602470723","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.008430872,0.0016095052,0.9014901,0.0031673203,0.00048646764,0.00016772276,0.00085092045,0.0011108092,0.08268625],"genre_scores_gemma":[0.5009268,0.0017286488,0.4651738,0.0015605622,0.00073684525,0.00067506963,0.001525117,0.00037501348,0.027298141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972746,0.00087289663,0.00022229536,0.00045857122,0.00081592216,0.0003557399],"domain_scores_gemma":[0.9975351,0.0011017864,0.00023589784,0.0005181679,0.00042923188,0.00017972536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002578768,0.0010256574,0.00066052173,0.001568737,0.0017573661,0.0040745027,0.002304006,0.0015459594,0.011939782],"category_scores_gemma":[0.0047863303,0.00065950275,0.002248384,0.001789884,0.0052047046,0.007718767,0.0031386735,0.0039176825,0.0022829322],"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.000010303517,0.000009099883,0.00006002041,0.000037634534,0.000006398398,0.00008482384,0.0002667695,0.001174159,0.00022880409,0.9923366,0.0014518313,0.0043335846],"study_design_scores_gemma":[0.000013539572,0.000009607132,0.000071094466,0.000032049127,0.000011675136,0.00009510915,0.00006386082,0.0072983108,0.0004775131,0.9695738,0.022341965,0.000011521533],"about_ca_topic_score_codex":0.0041008038,"about_ca_topic_score_gemma":0.0027028597,"teacher_disagreement_score":0.011939782,"about_ca_system_score_codex":0.002332964,"about_ca_system_score_gemma":0.0016327166,"threshold_uncertainty_score":0.039942563},"labels":[],"label_agreement":null},{"id":"W2602990746","doi":"10.1613/jair.5287","title":"Managing Different Sources of Uncertainty in a BDI Framework in a Principled Way with Tractable Fragments","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Commensurability (mathematics); Implementation; Artificial intelligence; Semantics (computer science); Belief revision; Set (abstract data type); Theoretical computer science; Machine learning; Software engineering; Programming language; Mathematics","score_opus":0.1210226174125115,"score_gpt":0.3976935111396156,"score_spread":0.2766708937271041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602990746","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.005117936,0.00022953835,0.9903527,0.00041006852,0.000029532575,0.00015010042,0.00013458342,0.00062022096,0.0029552805],"genre_scores_gemma":[0.23380615,0.00067808374,0.7600631,0.00041292314,0.000100611156,0.00062402803,0.00061950134,0.00038218623,0.0033135086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540496,0.001158235,0.0003667406,0.00069729774,0.001981587,0.00039114876],"domain_scores_gemma":[0.99394566,0.0036475214,0.0004413078,0.0011646011,0.00063419674,0.00016672382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00542762,0.0017132742,0.0013545416,0.0015633026,0.0019293525,0.005855146,0.003099666,0.0017834515,0.0037636326],"category_scores_gemma":[0.0134417685,0.00145933,0.0039583296,0.0014499796,0.004724798,0.0077158865,0.0057564764,0.0057015913,0.0008086868],"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.0002151679,0.00007991382,0.00094688777,0.00039547365,0.00015756198,0.0004375689,0.0011267203,0.28606123,0.0042237896,0.633262,0.0026654406,0.07042829],"study_design_scores_gemma":[0.00008195284,0.00005738055,0.000106266256,0.000092915136,0.00013491035,0.00014779351,0.00012640629,0.48032537,0.0036474604,0.5046187,0.010615927,0.00004487229],"about_ca_topic_score_codex":0.007547534,"about_ca_topic_score_gemma":0.008742879,"teacher_disagreement_score":0.007547534,"about_ca_system_score_codex":0.0029665173,"about_ca_system_score_gemma":0.003932511,"threshold_uncertainty_score":0.028704286},"labels":[],"label_agreement":null},{"id":"W2604635684","doi":"10.1609/aaai.v31i1.11031","title":"Logical Filtering and Smoothing: State Estimation in Partially Observable Domains","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Smoothing; Observable; State (computer science); Computer science; State space; Algorithm; Logical framework; Estimation; Dynamical systems theory; Dynamical system (definition); Theoretical computer science; Mathematics; Computer vision","score_opus":0.1056481588798765,"score_gpt":0.311098857837069,"score_spread":0.20545069895719248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604635684","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.004612211,0.00011420896,0.99422944,0.00015681957,0.000015460246,0.000022584052,0.000037315003,0.00035186086,0.00046011488],"genre_scores_gemma":[0.35913295,0.0004377341,0.6381346,0.00020680211,0.0000928838,0.00016487717,0.00031728408,0.00015032753,0.0013625477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649614,0.001223328,0.0002735146,0.0008131771,0.000980298,0.00021364773],"domain_scores_gemma":[0.9794516,0.015275985,0.0013082295,0.0026764318,0.0010128528,0.00027496126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055416124,0.0010533956,0.0012850111,0.0016270563,0.0011591337,0.0026286533,0.0028417704,0.0016655006,0.0024512387],"category_scores_gemma":[0.026108425,0.00097194646,0.0018396815,0.0016843547,0.0032038868,0.00667217,0.0028264755,0.002894944,0.00039002488],"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.00040674533,0.00010904073,0.0026249199,0.00032731428,0.00014776894,0.00023126625,0.00061163184,0.5272977,0.004552051,0.29734355,0.001984487,0.16436362],"study_design_scores_gemma":[0.000024445613,0.000032656575,0.00023416849,0.000032449232,0.000029165023,0.000045834342,0.000043603417,0.8329971,0.002887263,0.16194735,0.0016995755,0.000026445725],"about_ca_topic_score_codex":0.00886863,"about_ca_topic_score_gemma":0.007505862,"teacher_disagreement_score":0.00886863,"about_ca_system_score_codex":0.0020408216,"about_ca_system_score_gemma":0.002889264,"threshold_uncertainty_score":0.029307187},"labels":[],"label_agreement":null},{"id":"W2605723560","doi":"10.1007/978-3-319-57351-9_20","title":"On the Role of Possibility in Action Execution and Knowledge in the Situation Calculus","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Situation calculus; Successor cardinal; Axiom; Action (physics); Computer science; Calculus (dental); Projection (relational algebra); Axiomatic system; Mathematics; Artificial intelligence; Algorithm","score_opus":0.02628031287152494,"score_gpt":0.27591058523533435,"score_spread":0.2496302723638094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605723560","genre_codex":"methods","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.024509985,0.009448202,0.7462837,0.009103221,0.00072264404,0.00010749558,0.00025217907,0.00035210862,0.2092204],"genre_scores_gemma":[0.7658076,0.006629443,0.19761334,0.001038031,0.0013143822,0.0003544979,0.0003477746,0.00027644352,0.02661851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960663,0.0018535221,0.00029872736,0.0005095274,0.00083511655,0.0004368803],"domain_scores_gemma":[0.9931109,0.0054968596,0.00020847179,0.00061349454,0.00030694524,0.0002632818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00633948,0.0013552551,0.0014149427,0.0019461226,0.0033387488,0.0072776587,0.0032692836,0.0035298064,0.006591842],"category_scores_gemma":[0.008680195,0.0013396178,0.0031879959,0.0024949627,0.018076796,0.019514415,0.004714848,0.007981578,0.0010338653],"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.000011842479,0.000005037226,0.000023286233,0.000017205892,0.000004086559,0.000034999906,0.00018817425,0.00075245666,0.000056357763,0.99667263,0.00024489293,0.0019890806],"study_design_scores_gemma":[0.0000038277612,0.0000031751724,0.0000151985605,0.000010756271,0.0000042953357,0.000014556039,0.000016421545,0.0016259052,0.00003857825,0.99718684,0.0010755513,0.0000048742813],"about_ca_topic_score_codex":0.005540138,"about_ca_topic_score_gemma":0.003144904,"teacher_disagreement_score":0.0072776587,"about_ca_system_score_codex":0.0037586729,"about_ca_system_score_gemma":0.0021159933,"threshold_uncertainty_score":0.03352678},"labels":[],"label_agreement":null},{"id":"W2607656057","doi":"10.1007/s10516-017-9339-1","title":"Solving Smullyan Puzzles with Formal Systems","year":2017,"lang":"en","type":"article","venue":"Axiomathes","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gödel; Escher; Gödel's incompleteness theorems; Wonder; Paraphrase; Computer science; Mathematical logic; Epistemology; Classical logic; Mathematics; Artificial intelligence; Philosophy; Calculus (dental); Algorithm; Programming language","score_opus":0.020567868222480266,"score_gpt":0.23631937729352953,"score_spread":0.21575150907104926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607656057","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.070020355,0.00050043676,0.8943822,0.0032886479,0.00020110166,0.00012469693,0.0001782272,0.0011016534,0.030202702],"genre_scores_gemma":[0.5082843,0.0004843767,0.4807051,0.00041581967,0.00013632765,0.00014086686,0.0004066896,0.00023747524,0.009188989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997647,0.0010868333,0.00021533413,0.00041056715,0.00036864562,0.00027158967],"domain_scores_gemma":[0.9931554,0.004921365,0.00030187855,0.0011462548,0.00028769925,0.00018736524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027908194,0.0009901272,0.0009849886,0.0011368786,0.0020435164,0.003469782,0.0028353324,0.002228185,0.014178377],"category_scores_gemma":[0.020000478,0.00071716914,0.0021770876,0.0011139086,0.0049801567,0.011450544,0.0070535988,0.0044348263,0.0013039428],"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.00012982324,0.00007938176,0.00057249895,0.00026622633,0.000041224997,0.00013610772,0.00078083976,0.02883126,0.0010234065,0.921305,0.0032118403,0.04362244],"study_design_scores_gemma":[0.00004179683,0.000017941824,0.00005593717,0.000034268265,0.00001520094,0.000039617946,0.00014549443,0.04641642,0.0008556375,0.94730055,0.0050623585,0.000014716771],"about_ca_topic_score_codex":0.0021239887,"about_ca_topic_score_gemma":0.0036177111,"teacher_disagreement_score":0.014178377,"about_ca_system_score_codex":0.001543686,"about_ca_system_score_gemma":0.0016688553,"threshold_uncertainty_score":0.04743135},"labels":[],"label_agreement":null},{"id":"W2610204387","doi":"10.1007/978-3-319-57837-8_8","title":"Reasoning in Epistemic Contexts","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Introspection; Computer science; Epistemology; Epistemic modal logic; Closure (psychology); Artificial intelligence; Philosophy; Description logic","score_opus":0.017853667270208852,"score_gpt":0.25720584221088527,"score_spread":0.23935217494067643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610204387","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.008434612,0.016384635,0.4752857,0.008170827,0.00087148004,0.000075900534,0.00043650757,0.00065295055,0.48968735],"genre_scores_gemma":[0.641384,0.014788333,0.22145577,0.0021467563,0.0017516526,0.0003057036,0.0020064993,0.0005017009,0.11565962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977604,0.0010742372,0.00016845789,0.00037078926,0.0004830901,0.00014301541],"domain_scores_gemma":[0.9981996,0.0011736195,0.00006802903,0.00033255073,0.00016196443,0.00006419672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118341,0.0014451307,0.0008614287,0.0016729031,0.0018703367,0.0074499943,0.0015555203,0.0021254052,0.0136327185],"category_scores_gemma":[0.005462675,0.00096066133,0.0016213445,0.0015657322,0.0061607417,0.012411646,0.003769582,0.0050489176,0.004076124],"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.000009306181,0.000008881679,0.000038264763,0.00007185339,0.000011924465,0.000030979656,0.0003181618,0.0005135086,0.00011746049,0.9835894,0.0035319617,0.011758355],"study_design_scores_gemma":[0.0000029458251,0.0000019462434,0.000018152208,0.00004068972,0.00000550319,0.000028237677,0.00005176303,0.00068415387,0.0001272361,0.98545945,0.013576532,0.0000033534172],"about_ca_topic_score_codex":0.0009912617,"about_ca_topic_score_gemma":0.0010765443,"teacher_disagreement_score":0.0136327185,"about_ca_system_score_codex":0.0016895965,"about_ca_system_score_gemma":0.00089649286,"threshold_uncertainty_score":0.045605958},"labels":[],"label_agreement":null},{"id":"W2610547149","doi":"","title":"Introduction to ''Interactive models of computation and program behaviour\"","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Computation; Programming language","score_opus":0.015016164264593594,"score_gpt":0.25829243799241336,"score_spread":0.24327627372781976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610547149","genre_codex":"methods","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.0026735833,0.13953261,0.42283928,0.083427824,0.020100633,0.000110313085,0.0016152413,0.0017192276,0.32798138],"genre_scores_gemma":[0.25781962,0.16888101,0.21805829,0.047599453,0.0432978,0.000939303,0.0026504698,0.0016685674,0.25908554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850154,0.0004994969,0.00008049701,0.00029421283,0.00046319212,0.00016118154],"domain_scores_gemma":[0.9971065,0.0021445693,0.0001076483,0.00029323806,0.00021222705,0.00013581301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014751793,0.0013495429,0.00097471033,0.0013648765,0.0014055878,0.0036110894,0.0022693812,0.0024426582,0.021335032],"category_scores_gemma":[0.0036760387,0.0007569351,0.0013187476,0.0024426547,0.0068169455,0.0063342527,0.00311222,0.007759361,0.0033987535],"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.000012420702,0.000011921247,0.00007223445,0.0001901127,0.000012429874,0.000068279085,0.00039627403,0.0006406979,0.00025384006,0.9097557,0.07231064,0.016275428],"study_design_scores_gemma":[0.0000050396698,0.000013613378,0.00013296395,0.00019467792,0.000008377933,0.0001953533,0.000054356282,0.0011816932,0.00013823122,0.43711278,0.5609501,0.000012779332],"about_ca_topic_score_codex":0.0022876519,"about_ca_topic_score_gemma":0.002231078,"teacher_disagreement_score":0.021335032,"about_ca_system_score_codex":0.0024882264,"about_ca_system_score_gemma":0.0016024475,"threshold_uncertainty_score":0.07137281},"labels":[],"label_agreement":null},{"id":"W2611392997","doi":"10.3934/bdia.2016013","title":"A testbed to enable comparisons between competing approaches for computational social choice","year":2017,"lang":"en","type":"article","venue":"Big Data and Information Analytics","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 Waterloo","funders":"","keywords":"Testbed; Computer science; Rank (graph theory); Context (archaeology); Domain (mathematical analysis); Preference; Voting; Action (physics); Social choice theory; Order (exchange); Field (mathematics); Group decision-making; Artificial intelligence; Operations research; Data science; Machine learning; Engineering","score_opus":0.26739060138568005,"score_gpt":0.3367448301259789,"score_spread":0.06935422874029884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611392997","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.3489812,0.0011954487,0.583236,0.005842229,0.00086835446,0.003285212,0.010289048,0.0028959427,0.043406587],"genre_scores_gemma":[0.69878954,0.0004664186,0.2907859,0.0003632129,0.00008670679,0.0024270408,0.004585171,0.0001580266,0.0023378392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944253,0.004252242,0.00025475668,0.00032285965,0.0005522622,0.00019256449],"domain_scores_gemma":[0.9788163,0.014622742,0.00072774856,0.003870263,0.0011144965,0.0008484846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006235409,0.00046615902,0.0005614544,0.0011425137,0.0012251415,0.0016684685,0.0019116548,0.0015197846,0.004798247],"category_scores_gemma":[0.020141479,0.00030894982,0.0005816125,0.0020012418,0.002241863,0.0027303956,0.0018826938,0.0014710628,0.0008022747],"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.0025161298,0.0043345513,0.016819963,0.0012701947,0.00030383086,0.0005922859,0.0019640578,0.379617,0.010100332,0.4577966,0.03156177,0.09312331],"study_design_scores_gemma":[0.0007241297,0.0021926234,0.006272184,0.00018835672,0.00007393395,0.00025814606,0.0014847334,0.71190083,0.008392986,0.20911653,0.059287533,0.0001079803],"about_ca_topic_score_codex":0.0029980224,"about_ca_topic_score_gemma":0.00341299,"teacher_disagreement_score":0.006235409,"about_ca_system_score_codex":0.0016875484,"about_ca_system_score_gemma":0.0014634604,"threshold_uncertainty_score":0.03297639},"labels":[],"label_agreement":null},{"id":"W2613955803","doi":"","title":"Rewriting and Multisets in Rho-calculus and ELAN","year":2001,"lang":"en","type":"article","venue":"","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":"Prevention of Organ Failure","funders":"","keywords":"Rewriting; Confluence; Lambda calculus; Syntax; Computer science; Semantics (computer science); Calculus (dental); Simple (philosophy); Programming language; Typed lambda calculus; Operational semantics; Simply typed lambda calculus; Mathematics; Artificial intelligence","score_opus":0.011609300594369943,"score_gpt":0.2341510372011131,"score_spread":0.22254173660674317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613955803","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.025385113,0.005404624,0.8366282,0.0032056966,0.0010006478,0.00012407012,0.00021806783,0.0010410788,0.1269925],"genre_scores_gemma":[0.52872103,0.0030407542,0.40539473,0.0023249248,0.0012925314,0.00047007142,0.00030430284,0.0006079714,0.05784377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606687,0.0013526762,0.0003011532,0.0006411172,0.0012487727,0.0003894139],"domain_scores_gemma":[0.9983882,0.0007713756,0.00014675241,0.0003447179,0.00023702747,0.00011188913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00427029,0.0005316931,0.00084840646,0.0013723484,0.0020384367,0.0035156992,0.0011299143,0.0013583053,0.0035371988],"category_scores_gemma":[0.0033946892,0.0005229997,0.0013555889,0.0012629601,0.006360719,0.0058157123,0.003491735,0.003348803,0.0011946384],"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.000005142732,0.0000044948247,0.000023886467,0.0000128284955,0.0000023621567,0.00004967137,0.0001828916,0.0003865313,0.00024008134,0.9960777,0.00028095936,0.0027334436],"study_design_scores_gemma":[0.000009239883,0.000012544735,0.0000735481,0.000017175882,0.000007899915,0.00010868938,0.00005862206,0.0029764848,0.0012067498,0.9723594,0.023151223,0.000018426734],"about_ca_topic_score_codex":0.0020478424,"about_ca_topic_score_gemma":0.001604879,"teacher_disagreement_score":0.00427029,"about_ca_system_score_codex":0.002047824,"about_ca_system_score_gemma":0.0016930833,"threshold_uncertainty_score":0.022583723},"labels":[],"label_agreement":null},{"id":"W2614154661","doi":"","title":"Kripke Models of Boolean BI and Invertible Resources","year":2008,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Invertible matrix; Computer science; Boolean algebra; Theoretical computer science; Mathematics; Boolean expression; Discrete mathematics; Algebra over a field; Calculus (dental); Boolean function; Pure mathematics","score_opus":0.020598107799597636,"score_gpt":0.21580480036881236,"score_spread":0.19520669256921472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614154661","genre_codex":"methods","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.16255084,0.0017008212,0.6995658,0.0045175026,0.00019348961,0.00019261823,0.0022541902,0.0012402694,0.12778445],"genre_scores_gemma":[0.89635855,0.0010500934,0.06070893,0.00041528657,0.00016937018,0.00026379753,0.001118367,0.000283163,0.03963242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975515,0.0005713454,0.00023979585,0.00044839815,0.00071571994,0.0004732527],"domain_scores_gemma":[0.99458766,0.002672088,0.00048568269,0.0010997305,0.00071169395,0.0004431682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018647629,0.0011669836,0.0014869714,0.0022402038,0.0022415707,0.0077644875,0.0022910405,0.0024710286,0.018395089],"category_scores_gemma":[0.007573448,0.0010581047,0.0016473118,0.0038079584,0.0043625687,0.01727853,0.0039795986,0.004429816,0.002158948],"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.00001946046,0.0000074819473,0.000040908115,0.000021490432,0.0000059200847,0.000050429437,0.00009197596,0.003031854,0.00018603253,0.99548715,0.00025764195,0.0007996228],"study_design_scores_gemma":[0.000017076844,0.00000545369,0.000025408122,0.000009249971,0.000008484399,0.000043738026,0.000060690483,0.012104741,0.00021276092,0.9856754,0.0018258572,0.000011244291],"about_ca_topic_score_codex":0.0072511593,"about_ca_topic_score_gemma":0.007435499,"teacher_disagreement_score":0.018395089,"about_ca_system_score_codex":0.003392586,"about_ca_system_score_gemma":0.0016404118,"threshold_uncertainty_score":0.061537743},"labels":[],"label_agreement":null},{"id":"W2615306226","doi":"10.1145/3091119","title":"Progression of Decomposed Local-Effect Action Theories","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","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":"Toronto Metropolitan University","funders":"","keywords":"Situation calculus; Forgetting; Action (physics); Bridging (networking); Computer science; Representation (politics); Decomposition; Subject (documents); Modularity (biology); Belief revision; Theory; Mathematics; Artificial intelligence; Cognitive science; Theoretical computer science; Cognitive psychology; Psychology","score_opus":0.03292469093502936,"score_gpt":0.33700050771135626,"score_spread":0.3040758167763269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615306226","genre_codex":"methods","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.08955528,0.000598746,0.881891,0.0008356545,0.0000836735,0.00024608214,0.0002698076,0.0008733118,0.025646528],"genre_scores_gemma":[0.70348555,0.000759091,0.2833981,0.0002467577,0.00010541057,0.0002820481,0.0006504616,0.00025651153,0.010816114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968869,0.00081820786,0.00022157644,0.00062430475,0.0011099149,0.0003389969],"domain_scores_gemma":[0.9953318,0.0021694507,0.0003948801,0.000991498,0.00077314844,0.00033917866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004760404,0.00086222193,0.0006592171,0.0026927076,0.0014696304,0.0031084556,0.0017570674,0.0012502255,0.006941405],"category_scores_gemma":[0.010036883,0.0007437645,0.0027596701,0.0012094617,0.005925677,0.010029295,0.0047353394,0.003879113,0.00081180944],"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.000061212144,0.000027405855,0.00063343276,0.00010351398,0.000028736378,0.00042540938,0.0016738332,0.008412669,0.0020978693,0.9734995,0.00033408316,0.012702287],"study_design_scores_gemma":[0.000031696673,0.00004975594,0.00026206675,0.000055783137,0.00004161072,0.00015624221,0.00021209117,0.026993152,0.0017629409,0.96540105,0.0050102468,0.000023421506],"about_ca_topic_score_codex":0.0031289852,"about_ca_topic_score_gemma":0.002798,"teacher_disagreement_score":0.006941405,"about_ca_system_score_codex":0.0024950325,"about_ca_system_score_gemma":0.0016402698,"threshold_uncertainty_score":0.02517569},"labels":[],"label_agreement":null},{"id":"W2616737215","doi":"10.1016/s0304-3975(02)00737-5","title":"Scalar aggregation in inconsistent databases","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Scalar (mathematics); Database; Computer science; Mathematics; Set (abstract data type); Characterization (materials science); Theoretical computer science; Programming language","score_opus":0.0173094157674278,"score_gpt":0.2560617708558215,"score_spread":0.23875235508839368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616737215","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.095295675,0.002561873,0.8892129,0.0027172735,0.00026581544,0.00010372519,0.0003953112,0.0010513224,0.008395994],"genre_scores_gemma":[0.69123524,0.0013548415,0.3000718,0.0004679625,0.0004570077,0.000119755096,0.00089300156,0.0002352077,0.005165121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98881114,0.0037831273,0.0017252892,0.0013373337,0.0037537639,0.0005893234],"domain_scores_gemma":[0.9633762,0.0194973,0.0030583183,0.008567402,0.004844104,0.0006567057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014117011,0.0005084894,0.002052038,0.0032182196,0.002605929,0.007421826,0.002476498,0.0017970069,0.003713013],"category_scores_gemma":[0.045773152,0.0012497326,0.0011869898,0.0067717424,0.0027829516,0.0155935995,0.0049420823,0.002540907,0.0005400417],"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.0005505206,0.00010031339,0.00518444,0.00033786971,0.000111855385,0.0005878178,0.0009965589,0.01902268,0.0013703705,0.8864556,0.0048925527,0.08038944],"study_design_scores_gemma":[0.000059362177,0.00004510944,0.0005172955,0.0000630635,0.00013453623,0.0005083852,0.00035156155,0.118212864,0.0025288507,0.8703769,0.0071668094,0.00003517324],"about_ca_topic_score_codex":0.0016897556,"about_ca_topic_score_gemma":0.0015541569,"teacher_disagreement_score":0.014117011,"about_ca_system_score_codex":0.0015541384,"about_ca_system_score_gemma":0.0016743555,"threshold_uncertainty_score":0.07465881},"labels":[],"label_agreement":null},{"id":"W2620404370","doi":"10.1007/978-3-319-30526-4_6","title":"Reorienting the Logic of Abduction","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.03500488587464762,"score_gpt":0.25012373859718434,"score_spread":0.21511885272253672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620404370","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.002386442,0.051425956,0.5749448,0.011690236,0.0026498972,0.00006162588,0.0002798287,0.0008657285,0.3556956],"genre_scores_gemma":[0.19322424,0.07546929,0.5168299,0.0067555206,0.0061202548,0.00024486447,0.0012746938,0.0014319799,0.19864933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985885,0.00044565968,0.00010249145,0.00023711551,0.0005540609,0.00007218275],"domain_scores_gemma":[0.99812084,0.0012217981,0.000056310626,0.00033652506,0.00022062864,0.00004392939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021686514,0.0013106806,0.0009199949,0.0022447319,0.0009963395,0.005485379,0.0025541782,0.0016288606,0.011662709],"category_scores_gemma":[0.0040123584,0.0010426934,0.0015273868,0.002298278,0.008249546,0.011618408,0.0026886603,0.0071334145,0.0046697566],"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.000008427287,0.000006435718,0.00003179066,0.00012902419,0.000009056001,0.00002135672,0.00013890359,0.0008261302,0.00016076614,0.95141584,0.008641462,0.038610764],"study_design_scores_gemma":[0.0000033350284,0.0000033773924,0.000023428329,0.00009058154,0.000006747365,0.000053649466,0.000025131812,0.0014394743,0.00018184049,0.93122584,0.066938676,0.000007950195],"about_ca_topic_score_codex":0.0020367585,"about_ca_topic_score_gemma":0.0022555366,"teacher_disagreement_score":0.011662709,"about_ca_system_score_codex":0.0030082446,"about_ca_system_score_gemma":0.0014743522,"threshold_uncertainty_score":0.03901571},"labels":[],"label_agreement":null},{"id":"W2620654674","doi":"","title":"On the Replaceability of Computational Agents in an Ethical Theory.","year":2017,"lang":"en","type":"article","venue":"International Conference on Agents and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.2014167404858015,"score_gpt":0.4047048867892766,"score_spread":0.20328814630347508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620654674","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.04124764,0.002879956,0.304416,0.04631151,0.0011638931,0.00018956243,0.00018181825,0.00010967517,0.6034998],"genre_scores_gemma":[0.9336084,0.0007717997,0.043188892,0.002949508,0.00056489493,0.00029038423,0.000089954345,0.00007065784,0.01846533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99016213,0.006855068,0.0004272385,0.00080776407,0.0009884326,0.0007593204],"domain_scores_gemma":[0.9796005,0.01412097,0.0011788034,0.0029710701,0.0014367856,0.0006918784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009433616,0.00061260624,0.0009863122,0.0013037081,0.0043806145,0.0055245105,0.0025945825,0.006297104,0.00999034],"category_scores_gemma":[0.03151276,0.0005515863,0.0015491304,0.0009828948,0.025363335,0.01741207,0.004960472,0.0061980924,0.0009143205],"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.0000037667237,0.000003351299,0.000029126826,0.000006404456,0.0000020746172,0.000014324638,0.00008365952,0.00020735513,0.000012295224,0.9988092,0.00032328497,0.00050512416],"study_design_scores_gemma":[0.0000057666693,0.0000029881016,0.000019325293,0.00000922524,0.000002622212,0.00001990838,0.000042555945,0.0008988117,0.000019367766,0.99725693,0.0017205427,0.000002049435],"about_ca_topic_score_codex":0.0022880635,"about_ca_topic_score_gemma":0.0020642125,"teacher_disagreement_score":0.00999034,"about_ca_system_score_codex":0.00348406,"about_ca_system_score_gemma":0.0022451133,"threshold_uncertainty_score":0.04989028},"labels":[],"label_agreement":null},{"id":"W2620811500","doi":"","title":"Labelled Structures and Provability in Resource Logics - extended abstract","year":2005,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Linear logic; Context (archaeology); Computer science; Connection (principal bundle); Structural proof theory; Characterization (materials science); Proof complexity; Multiplicative function; Proof theory; Intuitionistic logic; Theoretical computer science; Mathematics; Mill; Algorithm; Calculus (dental)","score_opus":0.015473929181690198,"score_gpt":0.23673206863144863,"score_spread":0.22125813944975845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620811500","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.057294477,0.00030992122,0.9160854,0.0011571333,0.000060129583,0.00014534223,0.0002819191,0.00071451825,0.023951005],"genre_scores_gemma":[0.7072632,0.00033448287,0.28287295,0.0005306775,0.0001218337,0.00035720167,0.0005302015,0.00034315372,0.007646338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548966,0.0018376074,0.00025092252,0.00069164747,0.0013202811,0.00040988682],"domain_scores_gemma":[0.98419595,0.01154013,0.0012407483,0.0013678645,0.0012465088,0.00040891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043759374,0.0005385915,0.00048410697,0.0027845826,0.0018096683,0.0037976834,0.0020894571,0.0015906881,0.0078615695],"category_scores_gemma":[0.015061115,0.00095903623,0.0016131235,0.002550681,0.004696328,0.010045073,0.0039481455,0.0033433326,0.00085279864],"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.00005418312,0.000033875254,0.00020828196,0.00008021007,0.000019557334,0.00014818543,0.00031124026,0.006164006,0.001173105,0.9814255,0.0004845232,0.009897234],"study_design_scores_gemma":[0.00001677832,0.000014363977,0.00008668289,0.000023541681,0.000014037566,0.000043479282,0.000050557297,0.015656775,0.0017274227,0.97994995,0.0024028437,0.000013525286],"about_ca_topic_score_codex":0.0023455836,"about_ca_topic_score_gemma":0.002237178,"teacher_disagreement_score":0.0078615695,"about_ca_system_score_codex":0.003206544,"about_ca_system_score_gemma":0.0013655976,"threshold_uncertainty_score":0.026299596},"labels":[],"label_agreement":null},{"id":"W2621159380","doi":"10.5555/3091125.3091358","title":"interActors: A Model for Separating Complex Communication Concerns in Multiagent Computations","year":2017,"lang":"en","type":"article","venue":"","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":"University of Saskatchewan","funders":"","keywords":"Computer science; Initialization; Computation; Distributed computing; Class (philosophy); Models of communication; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.1708540270570854,"score_gpt":0.3997426623527785,"score_spread":0.2288886352956931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621159380","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.003647209,0.00013928943,0.98910904,0.00061081897,0.00005657242,0.00013759316,0.0001118426,0.0014354235,0.004752148],"genre_scores_gemma":[0.17705299,0.0006466775,0.7985323,0.0008783146,0.0001686142,0.0011784597,0.00054010755,0.0009655036,0.020037087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967823,0.0012806781,0.00031599702,0.0005257206,0.00076085737,0.0003344792],"domain_scores_gemma":[0.9965605,0.0013875491,0.00038370694,0.0010465094,0.00029588165,0.00032571977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036778327,0.001347649,0.0007256614,0.0011391618,0.001966201,0.0050989017,0.0032003834,0.003330093,0.0057556825],"category_scores_gemma":[0.0063329535,0.0012391042,0.0022535932,0.0009055501,0.0047954493,0.010941388,0.0056245364,0.0049854238,0.0017198978],"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.00012948271,0.00006407194,0.0005376125,0.00014980718,0.000048840055,0.00032150256,0.0012154018,0.024746088,0.002629357,0.9481475,0.0032881903,0.018722223],"study_design_scores_gemma":[0.00013689433,0.00012891542,0.00019793145,0.00018234093,0.00012046989,0.00043995888,0.0003405243,0.20682158,0.008426673,0.6530924,0.13002081,0.00009145718],"about_ca_topic_score_codex":0.004447442,"about_ca_topic_score_gemma":0.00541495,"teacher_disagreement_score":0.0057556825,"about_ca_system_score_codex":0.0017197112,"about_ca_system_score_gemma":0.003016406,"threshold_uncertainty_score":0.019450486},"labels":[],"label_agreement":null},{"id":"W2621292429","doi":"","title":"Abstract Canonical Inference Systems","year":2002,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Inference; Computer science; Redundancy (engineering); Theoretical computer science; Calculus (dental); Mathematics; Algorithm; Artificial intelligence; Medicine","score_opus":0.021427662519608866,"score_gpt":0.2253968641722122,"score_spread":0.20396920165260332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621292429","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.011682435,0.021683203,0.75115967,0.011597442,0.005196324,0.0002365323,0.0026973116,0.0066333166,0.18911384],"genre_scores_gemma":[0.484732,0.021242553,0.33446023,0.0044092387,0.0061198766,0.0006816153,0.010487278,0.0026169722,0.13525023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350184,0.0017872213,0.0006183662,0.0017466795,0.0017845201,0.0005613405],"domain_scores_gemma":[0.9926978,0.003165769,0.0002558652,0.0016272183,0.0019684688,0.00028491198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006138278,0.0012885971,0.0014297032,0.0030577602,0.00249848,0.0100744385,0.0024475348,0.0020869244,0.033751775],"category_scores_gemma":[0.013368676,0.0010178036,0.0015126005,0.0034546312,0.006668454,0.014515622,0.00579694,0.0051675914,0.009808456],"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.00004740327,0.000023164104,0.00018528607,0.0001553997,0.000025052437,0.00009308811,0.00024388585,0.0015527771,0.0003343617,0.9404998,0.020896051,0.035943694],"study_design_scores_gemma":[0.000017786324,0.000012139426,0.00007769673,0.000087656714,0.00002674391,0.00011647899,0.0000990869,0.005658156,0.0009824551,0.9176776,0.0752256,0.000018609304],"about_ca_topic_score_codex":0.003712577,"about_ca_topic_score_gemma":0.0029205354,"teacher_disagreement_score":0.033751775,"about_ca_system_score_codex":0.0031714826,"about_ca_system_score_gemma":0.0030540396,"threshold_uncertainty_score":0.112910986},"labels":[],"label_agreement":null},{"id":"W2628734318","doi":"","title":"STRIP: Structural sharing and intuitionistic proof-search","year":2000,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Sequent; Intuitionistic logic; Gas meter prover; Structural proof theory; Curry–Howard correspondence; Cut-elimination theorem; Sequent calculus; Proof complexity; Implementation; Proof theory; Automated theorem proving; Computer science; Propositional calculus; Linear logic; Mathematics; Programming language; Discrete mathematics; Theoretical computer science; Natural deduction; Calculus (dental); Proof calculus; Mathematical proof","score_opus":0.013607601865108834,"score_gpt":0.22934069197170442,"score_spread":0.21573309010659558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2628734318","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.014840969,0.0022569436,0.9280681,0.0041526314,0.00054879725,0.00016831314,0.00069164403,0.0055049798,0.0437676],"genre_scores_gemma":[0.47599888,0.003028391,0.4728477,0.0018164288,0.0008770133,0.00039095542,0.0025270295,0.0028361345,0.03967754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485505,0.0022576659,0.00028602855,0.0007070537,0.001449632,0.00044458793],"domain_scores_gemma":[0.9901366,0.006819063,0.00022024404,0.0019660518,0.0005659974,0.0002920493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058743483,0.0009733453,0.0011909322,0.0016144264,0.0016473064,0.005401607,0.0030748404,0.0017314473,0.035199024],"category_scores_gemma":[0.013873416,0.0012719793,0.0018018682,0.0023528836,0.0031796137,0.013853534,0.0064303875,0.0040428615,0.0071774363],"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.00075086986,0.00016061547,0.00044505307,0.00057131227,0.00013329225,0.00017248065,0.0005510458,0.0172068,0.0029196716,0.7661657,0.03570295,0.17522019],"study_design_scores_gemma":[0.00012215332,0.00007698694,0.00017145449,0.000083945546,0.000063101834,0.00015198602,0.00009023546,0.04835469,0.003681521,0.9152145,0.031945318,0.00004401644],"about_ca_topic_score_codex":0.0012703006,"about_ca_topic_score_gemma":0.0015255597,"teacher_disagreement_score":0.035199024,"about_ca_system_score_codex":0.0020817916,"about_ca_system_score_gemma":0.0024841416,"threshold_uncertainty_score":0.11775243},"labels":[],"label_agreement":null},{"id":"W267725155","doi":"","title":"Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Combinatorics; Mathematics; Discrete mathematics; Function (biology); Variable (mathematics); Propositional variable; Integer (computer science); Exponential function; Boolean satisfiability problem; Conjunctive normal form; Upper and lower bounds; Propositional formula; Exponential time hypothesis; Time complexity; Computer science; Theoretical computer science","score_opus":0.011207325327943019,"score_gpt":0.22194141198756934,"score_spread":0.2107340866596263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W267725155","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.6621508,0.0003756498,0.32936513,0.0010892346,0.00007246189,0.00007231967,0.0004645666,0.0018762976,0.0045335353],"genre_scores_gemma":[0.8476098,0.00017248678,0.14903757,0.00020120335,0.000060264316,0.00006346578,0.0011456351,0.00023584963,0.0014737531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998372,0.00046035694,0.00016597223,0.00038583076,0.00029199597,0.00032382956],"domain_scores_gemma":[0.98408186,0.013153099,0.0008577998,0.0011630851,0.00038695493,0.00035713974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216225,0.00080202933,0.0013827323,0.001133157,0.001062894,0.0032885487,0.0021301412,0.00135535,0.004118082],"category_scores_gemma":[0.01978036,0.0008624101,0.0011953703,0.002264989,0.0020390383,0.0067470917,0.0020838282,0.002146361,0.00069962814],"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.0026728346,0.0005129885,0.015362065,0.00068728277,0.00021276767,0.0006674695,0.00065480487,0.70945877,0.019827407,0.14212899,0.005692001,0.10212269],"study_design_scores_gemma":[0.000081162325,0.000062122046,0.00077523594,0.000023153485,0.000050561397,0.00010766184,0.00011559951,0.86835736,0.0069622914,0.12277308,0.0006708414,0.000020963302],"about_ca_topic_score_codex":0.0030181962,"about_ca_topic_score_gemma":0.0048155626,"teacher_disagreement_score":0.004118082,"about_ca_system_score_codex":0.0019262056,"about_ca_system_score_gemma":0.0018731859,"threshold_uncertainty_score":0.01397562},"labels":[],"label_agreement":null},{"id":"W2703543743","doi":"","title":"Towards Tractable Inference for Resource-Bounded Agents","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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 Toronto","funders":"","keywords":"Computer science; Inference; sort; Commonsense reasoning; Epistemic modal logic; Commonsense knowledge; Semantics (computer science); Non-monotonic logic; Artificial intelligence; Common sense; Rule of inference; Epistemology; Theoretical computer science; Description logic; Cognitive science; Knowledge representation and reasoning; Programming language; Multimodal logic; Psychology; Philosophy; Information retrieval","score_opus":0.28474744631534155,"score_gpt":0.3935910568604578,"score_spread":0.10884361054511626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2703543743","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.012280637,0.00031232438,0.972283,0.00278556,0.000075606,0.00007340142,0.00018069915,0.00070738146,0.011301381],"genre_scores_gemma":[0.4149593,0.0006461908,0.5719245,0.00118646,0.00034212728,0.00036273952,0.00069020776,0.00036083913,0.009527587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946102,0.0023405077,0.00034665808,0.00093798287,0.0013748314,0.0003898135],"domain_scores_gemma":[0.9783418,0.016859254,0.0007064693,0.0022612861,0.0013208437,0.00051045953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007640167,0.0008823377,0.00138049,0.0020590434,0.0021192692,0.0050392416,0.0035050889,0.0027376802,0.0053456663],"category_scores_gemma":[0.03224565,0.0011395501,0.0043248627,0.0014384703,0.0043304926,0.010645532,0.0077271573,0.0059334175,0.00093105296],"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.000032914722,0.000029560277,0.00020373163,0.0000874716,0.000045632765,0.00019465292,0.00038634456,0.030144697,0.00047432308,0.9592614,0.0014451636,0.0076940292],"study_design_scores_gemma":[0.000013959132,0.0000053335734,0.000028072569,0.000014418872,0.000018718882,0.000024459749,0.000052557567,0.12184891,0.0003254505,0.87533206,0.0023271071,0.000009077665],"about_ca_topic_score_codex":0.0084935,"about_ca_topic_score_gemma":0.012048324,"teacher_disagreement_score":0.0084935,"about_ca_system_score_codex":0.004529371,"about_ca_system_score_gemma":0.0029056312,"threshold_uncertainty_score":0.04040557},"labels":[],"label_agreement":null},{"id":"W2725233680","doi":"10.1016/j.artint.2018.10.007","title":"Gelfond–Zhang aggregates as propositional formulas","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre International de Mathématiques et Informatique de Toulouse; Ministerio de Economía y Competitividad; Xunta de Galicia; Simon Fraser University; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Answer set programming; Propositional calculus; Aggregate (composite); Syntax; Equivalence (formal languages); Semantics (computer science); Stable model semantics; Representation (politics); Propositional formula; Class (philosophy); Logical equivalence; Mathematics; Propositional variable; Computer science; Set (abstract data type); Discrete mathematics; Programming language; Artificial intelligence; Operational semantics; Intermediate logic; Description logic","score_opus":0.02289904309344189,"score_gpt":0.270212057011926,"score_spread":0.24731301391848412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725233680","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.1698311,0.0030852128,0.73036534,0.005829447,0.000425696,0.00009858261,0.00061242783,0.00095412956,0.08879809],"genre_scores_gemma":[0.79620373,0.0011644702,0.18246827,0.00068400655,0.00046854472,0.0001370336,0.00067195215,0.00025270885,0.017949387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728787,0.0007558201,0.00021608571,0.00045128097,0.000997937,0.00029103618],"domain_scores_gemma":[0.9966844,0.0016493005,0.00036452428,0.00058532116,0.00054738595,0.0001690952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030292645,0.0007069221,0.0010494081,0.0041918806,0.0014865778,0.0051612854,0.0020056933,0.0017882361,0.0045995167],"category_scores_gemma":[0.010292327,0.00055466837,0.0012895119,0.0037075116,0.0020548746,0.011402918,0.0029007378,0.0024254243,0.0007763178],"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.00004647676,0.000014271921,0.00030388244,0.00004057492,0.000022602348,0.000081981416,0.00016746602,0.0025066882,0.00042351228,0.9845769,0.0017211686,0.010094452],"study_design_scores_gemma":[0.000013504546,0.000008191803,0.00012355408,0.000016240141,0.00002866655,0.000044985496,0.000049700087,0.025649566,0.00083859835,0.96933883,0.0038791539,0.000009049315],"about_ca_topic_score_codex":0.0020833078,"about_ca_topic_score_gemma":0.0019239883,"teacher_disagreement_score":0.0051612854,"about_ca_system_score_codex":0.0030230698,"about_ca_system_score_gemma":0.00077389873,"threshold_uncertainty_score":0.021934032},"labels":[],"label_agreement":null},{"id":"W2731872586","doi":"","title":"Raisonnement sur les actions : de Toronto à Amsterdam","year":2007,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Philosophy; Modal logic; Humanities; Mathematics; Modal","score_opus":0.028936475566574988,"score_gpt":0.2572370943000714,"score_spread":0.2283006187334964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731872586","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023648972,0.13523363,0.027369386,0.051396113,0.0033616545,0.000066142245,0.0023254142,0.0005054309,0.7560933],"genre_scores_gemma":[0.23528843,0.054901283,0.015197404,0.0013832751,0.0004582421,0.000057736095,0.0014155548,0.00032891656,0.6909692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992459,0.0001979082,0.00004007626,0.00024187732,0.00016130107,0.00011306837],"domain_scores_gemma":[0.999595,0.00017979996,0.00004099458,0.00003561545,0.00007446238,0.0000740922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061591726,0.00069798256,0.00041417143,0.0008864639,0.0021125025,0.003626808,0.0005218693,0.0014224926,0.05060601],"category_scores_gemma":[0.0014378327,0.0005246151,0.0004392084,0.0021728002,0.002326849,0.0026086671,0.0014745888,0.0017152106,0.0048361956],"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.00016896444,0.000038229748,0.0007471399,0.00038173038,0.000028719065,0.0009019639,0.0024893302,0.004756313,0.001411065,0.7266559,0.11983541,0.14258532],"study_design_scores_gemma":[0.000007446865,0.000006719116,0.0007554862,0.00015994099,0.00000787831,0.0000880517,0.000407876,0.0007443458,0.000547142,0.024208164,0.97305363,0.0000133367],"about_ca_topic_score_codex":0.2537299,"about_ca_topic_score_gemma":0.34868848,"teacher_disagreement_score":0.2537299,"about_ca_system_score_codex":0.010979158,"about_ca_system_score_gemma":0.004545346,"threshold_uncertainty_score":0.5045061},"labels":[],"label_agreement":null},{"id":"W2735368507","doi":"","title":"Quantification And Predication In Modal Predicative Propositional Logic","year":2015,"lang":"fr","type":"article","venue":"Logique et analyse/Logique et analyse. Nouvelle série","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Predicative expression; Propositional variable; S5; Modal logic; Intermediate logic; Dynamic logic (digital electronics); Propositional calculus; Tautology (logic); Well-formed formula; Intuitionistic logic; Predicate (mathematical logic); Predicate variable; Computer science; Linguistics; Modal; Mathematics; Sequent; Normal modal logic; Zeroth-order logic; Artificial intelligence; Multimodal logic; Description logic; Discrete mathematics; Philosophy; Programming language","score_opus":0.058029832904945684,"score_gpt":0.3185953043427358,"score_spread":0.26056547143779013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735368507","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.07053382,0.008227628,0.7912324,0.008140467,0.00047442273,0.00007939988,0.00035136813,0.00061487505,0.120345645],"genre_scores_gemma":[0.8570534,0.0029747174,0.12384086,0.0013471663,0.0006220095,0.00017556081,0.00021199387,0.000122054276,0.01365228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975299,0.0011672879,0.0001393805,0.00031088208,0.0005666869,0.0002859095],"domain_scores_gemma":[0.9977054,0.00166955,0.00013439273,0.0001869128,0.00024163735,0.000062042694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003949509,0.00050785166,0.00053815637,0.0017529682,0.0017043096,0.0040311757,0.0009171898,0.0010563713,0.002864221],"category_scores_gemma":[0.003986291,0.0005840125,0.0012217485,0.002052617,0.009369641,0.009408891,0.0024523118,0.0025511647,0.00041176763],"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.0000046711366,0.0000034921093,0.00004692548,0.000014869551,0.0000026966845,0.000029302242,0.0002808666,0.00041365117,0.00008702501,0.9973036,0.00026331886,0.0015496283],"study_design_scores_gemma":[0.000004123952,0.0000054025363,0.0000686316,0.0000126582245,0.000005781893,0.00003414697,0.000058762304,0.0030484595,0.00021762082,0.99191916,0.0046183295,0.0000067547494],"about_ca_topic_score_codex":0.0033457645,"about_ca_topic_score_gemma":0.0019074461,"teacher_disagreement_score":0.0040311757,"about_ca_system_score_codex":0.0036590917,"about_ca_system_score_gemma":0.0012636123,"threshold_uncertainty_score":0.026548624},"labels":[],"label_agreement":null},{"id":"W2736770525","doi":"","title":"Merging the Local and Global Approaches to Probabilistic Satisfiability","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Probabilistic logic; Satisfiability; Consistency (knowledge bases); Mathematics; Logical consequence; Set (abstract data type); Mathematical optimization; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.02820314155902571,"score_gpt":0.21046074507494203,"score_spread":0.18225760351591633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736770525","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.0039315713,0.0005938121,0.9880592,0.000775085,0.000028798122,0.000068985464,0.000049488135,0.00052139274,0.005971712],"genre_scores_gemma":[0.15112723,0.0011834594,0.84140074,0.0008719698,0.00015666467,0.00037228322,0.00029842873,0.00052041555,0.004068864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899698,0.0050877933,0.00050216995,0.0013682018,0.00257161,0.00050045573],"domain_scores_gemma":[0.9861267,0.0069323936,0.0005640962,0.004648207,0.0014018085,0.00032668468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007041012,0.0015124666,0.0020594343,0.0028308495,0.0011107197,0.004962379,0.0043828962,0.002138202,0.0069582155],"category_scores_gemma":[0.017882146,0.0014435992,0.0022619814,0.0030618694,0.004982272,0.010596878,0.008487454,0.006854076,0.0014533631],"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.00014783505,0.00019695301,0.0010739552,0.0006627125,0.00026290736,0.00023069991,0.0013994873,0.06718393,0.0054480266,0.58910537,0.0048845834,0.32940352],"study_design_scores_gemma":[0.000056872574,0.00016738991,0.00049793953,0.00015220021,0.00021668372,0.00020725696,0.0004274394,0.27016884,0.008409276,0.70363224,0.015979588,0.000084240884],"about_ca_topic_score_codex":0.0017626456,"about_ca_topic_score_gemma":0.006039628,"teacher_disagreement_score":0.007041012,"about_ca_system_score_codex":0.0019487288,"about_ca_system_score_gemma":0.0027552382,"threshold_uncertainty_score":0.03723687},"labels":[],"label_agreement":null},{"id":"W2738946037","doi":"","title":"Calculi with dependency relations for Mixed Linear Logic","year":2001,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Logic, Reasoning, and Knowledge","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":"Prevention of Organ Failure","funders":"","keywords":"Linear logic; Sequent calculus; Dependency (UML); Proof theory; Sequent; Mathematics; Structural proof theory; Multiplicative function; Commutative property; Natural deduction; Substructural logic; Fragment (logic); Discrete mathematics; Algorithm; Algebra over a field; Theoretical computer science; Calculus (dental); Computer science; Intermediate logic; Description logic; Pure mathematics; Artificial intelligence; Mathematical proof","score_opus":0.01680040917571893,"score_gpt":0.23179119949609184,"score_spread":0.2149907903203729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738946037","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.021164587,0.0017879447,0.93559164,0.0019583262,0.00027470698,0.00012218354,0.0003933863,0.0014356547,0.037271626],"genre_scores_gemma":[0.45022625,0.0013092777,0.5060931,0.00076040643,0.00067919964,0.00041750463,0.00073764194,0.00058818865,0.03918838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753535,0.0008209269,0.00026930674,0.00039346304,0.0007117103,0.0002692248],"domain_scores_gemma":[0.9955813,0.003131003,0.0002267546,0.0004752937,0.00042990997,0.0001556774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029313609,0.00080031843,0.00091757916,0.0018728389,0.0021520385,0.004632215,0.002041618,0.0013252818,0.009305286],"category_scores_gemma":[0.0059016254,0.0013760456,0.0026818975,0.0022729535,0.0031947782,0.009917602,0.0039246464,0.003992396,0.0016352229],"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.000031085372,0.000023086459,0.00010469884,0.000062634244,0.00001734566,0.00007616203,0.00017368396,0.0025191186,0.00071988144,0.98475707,0.0010317992,0.010483343],"study_design_scores_gemma":[0.000026701571,0.000015478048,0.00005551896,0.00003062413,0.000029922856,0.00009537447,0.000042826025,0.029287728,0.0015897715,0.9571253,0.011680455,0.000020240235],"about_ca_topic_score_codex":0.004162074,"about_ca_topic_score_gemma":0.0075070164,"teacher_disagreement_score":0.009305286,"about_ca_system_score_codex":0.002890855,"about_ca_system_score_gemma":0.0016709691,"threshold_uncertainty_score":0.0311293},"labels":[],"label_agreement":null},{"id":"W2740289278","doi":"10.24963/ijcai.2017/115","title":"Reasoning about Probabilities in Unbounded First-Order Dynamical Domains","year":2017,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"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 Toronto","funders":"","keywords":"Probabilistic logic; Computer science; Belief revision; Introspection; Modal operator; Formalism (music); Modal; Expressive power; Artificial intelligence; Situation calculus; Modal logic; Theoretical computer science; Action (physics); Knowledge base; Knowledge representation and reasoning; Logical consequence; Epistemology; Description logic; Multimodal logic","score_opus":0.01507632479789188,"score_gpt":0.25924374532341504,"score_spread":0.24416742052552315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740289278","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.04639099,0.00050428876,0.9453487,0.0015006637,0.000056614743,0.000046254165,0.0002089274,0.0003198939,0.005623718],"genre_scores_gemma":[0.809631,0.0008453496,0.18605596,0.0002646164,0.00020694493,0.00014040945,0.00034076607,0.00007031023,0.0024446147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966252,0.0012758126,0.00028845892,0.0005503862,0.0009619736,0.0002981946],"domain_scores_gemma":[0.98557764,0.011338205,0.0010495355,0.0009891245,0.0006354688,0.00041005033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054576616,0.0009849538,0.0010333275,0.0018458853,0.0018098354,0.004871944,0.0022467235,0.0016884659,0.00203274],"category_scores_gemma":[0.019223781,0.0009655433,0.0021275694,0.0015583268,0.005375596,0.013378453,0.004387416,0.0036015096,0.00025285725],"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.000035490895,0.000016411475,0.00049691607,0.00006140259,0.000040150422,0.0003077546,0.00049177074,0.050081443,0.0005714167,0.9421079,0.00034439185,0.005444998],"study_design_scores_gemma":[0.000011911049,0.000008658475,0.00010124507,0.000012651972,0.000013952279,0.000052046515,0.00006950347,0.10154223,0.00037766245,0.8968022,0.0009929946,0.000014935358],"about_ca_topic_score_codex":0.004985204,"about_ca_topic_score_gemma":0.0051583922,"teacher_disagreement_score":0.0054576616,"about_ca_system_score_codex":0.002556332,"about_ca_system_score_gemma":0.0009822344,"threshold_uncertainty_score":0.028863192},"labels":[],"label_agreement":null},{"id":"W2741637477","doi":"10.24963/ijcai.2017/154","title":"Belief Manipulation Through Propositional Announcements","year":2017,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Undecidable problem; Decidability; Computer science; Set (abstract data type); Modal logic; Modal; Belief revision; Natural (archaeology); Mathematical economics; Artificial intelligence; Theoretical computer science; Mathematics; Programming language","score_opus":0.04429722583284479,"score_gpt":0.2979485658981614,"score_spread":0.2536513400653166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741637477","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.061687928,0.00018753359,0.92087597,0.001054552,0.00008795777,0.00014160274,0.00015262667,0.0037827664,0.012029175],"genre_scores_gemma":[0.76972497,0.00020924228,0.2238941,0.00027324137,0.00007556883,0.00023813294,0.0001907807,0.00028628312,0.00510777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996381,0.0013352752,0.00023163985,0.00071559846,0.00089835876,0.00043819688],"domain_scores_gemma":[0.98830414,0.007948231,0.0011450743,0.0015815705,0.0006539159,0.00036712555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00419291,0.0006434679,0.0005276954,0.0008858167,0.0011716265,0.0028446324,0.0018080014,0.0011499341,0.0043630097],"category_scores_gemma":[0.017999455,0.00058958854,0.0010156773,0.0005608356,0.0033442338,0.0046024797,0.003982081,0.0020763802,0.00061096024],"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.0006522787,0.00025116355,0.0030018017,0.00036441293,0.00011107931,0.000752151,0.0026373088,0.048217215,0.026556293,0.79059273,0.0044365274,0.12242698],"study_design_scores_gemma":[0.00015926635,0.00016756098,0.0008625354,0.00009670875,0.00015186588,0.00022707373,0.00038732908,0.47265595,0.03602237,0.4661161,0.023063902,0.00008934327],"about_ca_topic_score_codex":0.0018181483,"about_ca_topic_score_gemma":0.0018098037,"teacher_disagreement_score":0.0043630097,"about_ca_system_score_codex":0.0014658176,"about_ca_system_score_gemma":0.0013953296,"threshold_uncertainty_score":0.022174478},"labels":[],"label_agreement":null},{"id":"W2749312524","doi":"10.1007/978-3-662-55665-8_37","title":"Testing Minimax for Rational Ignorant Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Minimax; Computer science; Mathematical economics; Mathematical optimization; Mathematics","score_opus":0.05487108017068307,"score_gpt":0.2854569867356643,"score_spread":0.2305859065649812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749312524","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.47534698,0.0014904626,0.46366748,0.019844016,0.00065220945,0.00038699314,0.0009724511,0.0030217653,0.034617696],"genre_scores_gemma":[0.93632513,0.00022265442,0.05711237,0.00090782926,0.00019982475,0.00017827663,0.0006043293,0.00023222005,0.004217402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893993,0.004657348,0.00060125004,0.0021378775,0.0021584234,0.0010458448],"domain_scores_gemma":[0.90377206,0.087430626,0.0020123248,0.0034047044,0.0019327549,0.0014476231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010548149,0.0017254453,0.0024603268,0.0010978401,0.0014701406,0.004134343,0.0036587166,0.0053165783,0.0073987753],"category_scores_gemma":[0.08088372,0.0012373899,0.0025838064,0.00086205435,0.0060963975,0.010671563,0.005134903,0.0065989494,0.0006537358],"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.0041553406,0.00080960564,0.014123429,0.0011898623,0.00097270554,0.0012349327,0.0013050158,0.23172188,0.005343094,0.6410008,0.015746668,0.08239679],"study_design_scores_gemma":[0.00029635467,0.00020098136,0.0004756741,0.00008645832,0.00006533932,0.00011167377,0.00017544306,0.30935988,0.002143829,0.68616104,0.0008927723,0.000030597825],"about_ca_topic_score_codex":0.0017641581,"about_ca_topic_score_gemma":0.002372755,"teacher_disagreement_score":0.010548149,"about_ca_system_score_codex":0.002314167,"about_ca_system_score_gemma":0.0028121823,"threshold_uncertainty_score":0.055784583},"labels":[],"label_agreement":null},{"id":"W2750078980","doi":"10.1016/j.artint.2017.08.003","title":"Three-valued semantics for hybrid MKNF knowledge bases revisited","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semantics (computer science); Computer science; Programming language; Computational semantics; Artificial intelligence; Natural language processing; Cognitive science; Operational semantics; Psychology","score_opus":0.10308097849777433,"score_gpt":0.34667545679557993,"score_spread":0.24359447829780562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750078980","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.04427191,0.0009432843,0.93126273,0.0020892022,0.00015129094,0.00010803041,0.0006797689,0.00042363917,0.020070212],"genre_scores_gemma":[0.65986735,0.00056617835,0.33384547,0.0003614162,0.00011191135,0.00017098132,0.0007359333,0.000083624276,0.0042570336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696046,0.0008572515,0.00045790465,0.00043975026,0.0009695732,0.0003150739],"domain_scores_gemma":[0.99398166,0.0026845897,0.00036498925,0.0013816323,0.0012527514,0.00033443267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045699603,0.0004184164,0.0008054022,0.0031386453,0.0019123518,0.0073466576,0.0038414889,0.0015854842,0.0050653783],"category_scores_gemma":[0.009465055,0.0006082304,0.0016523013,0.0040311757,0.0039999345,0.015952017,0.0039834804,0.0027937696,0.0007462921],"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.00005842121,0.000022025415,0.00019884256,0.00008651065,0.000029155679,0.00012987456,0.000629896,0.0037938065,0.00042459895,0.97626954,0.0005399561,0.01781742],"study_design_scores_gemma":[0.000017336628,0.000012323771,0.00010167006,0.000066950706,0.000033148444,0.00012437349,0.00034498726,0.025897156,0.00056790834,0.96690804,0.0059061632,0.00002000609],"about_ca_topic_score_codex":0.0049118805,"about_ca_topic_score_gemma":0.0039709457,"teacher_disagreement_score":0.0073466576,"about_ca_system_score_codex":0.0025028107,"about_ca_system_score_gemma":0.0015742952,"threshold_uncertainty_score":0.024168551},"labels":[],"label_agreement":null},{"id":"W2754065268","doi":"10.1080/11663081.2017.1368844","title":"The monadic hybrid calculus","year":2017,"lang":"en","type":"article","venue":"Journal of Applied Non-Classical Logics","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 Victoria","funders":"","keywords":"Soundness; Computer science; Calculus (dental); Metatheory; Programming language; Natural deduction; Monadic predicate calculus; Algebra over a field; Mathematics; Higher-order logic; Pure mathematics; Description logic","score_opus":0.016660840920077077,"score_gpt":0.25120992480194076,"score_spread":0.23454908388186368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754065268","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.011171093,0.0037519657,0.8879468,0.0037096508,0.00062174664,0.00011997383,0.00046745027,0.0013258711,0.090885505],"genre_scores_gemma":[0.4438979,0.003727598,0.5034375,0.0019337593,0.000748111,0.0004648885,0.00047754656,0.000345003,0.044967685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815184,0.00053980184,0.00012028852,0.00030543935,0.0006313393,0.00025119146],"domain_scores_gemma":[0.9989222,0.0004975681,0.00007640266,0.000205589,0.00019288505,0.00010528365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025904186,0.00059184176,0.00069252425,0.0014341773,0.0024967492,0.0036880122,0.0015382394,0.0011352012,0.0060134716],"category_scores_gemma":[0.0024223952,0.0005721486,0.0012456586,0.0012956318,0.004331276,0.0052204626,0.0030687996,0.0025800574,0.0011174073],"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.000004868644,0.0000034282903,0.00002216617,0.000019587356,0.0000037951731,0.000029656097,0.0000876888,0.00036178,0.00025074638,0.9958806,0.0007477962,0.0025879475],"study_design_scores_gemma":[0.000017113041,0.000016468033,0.00011873867,0.00004114824,0.000030207306,0.0001870289,0.00008776558,0.007907219,0.0017042155,0.9135879,0.076276526,0.000025799465],"about_ca_topic_score_codex":0.0042758347,"about_ca_topic_score_gemma":0.004429837,"teacher_disagreement_score":0.0060134716,"about_ca_system_score_codex":0.002720437,"about_ca_system_score_gemma":0.0020993664,"threshold_uncertainty_score":0.020117104},"labels":[],"label_agreement":null},{"id":"W2759829967","doi":"10.1613/jair.5496","title":"Kernel Contraction and Base Dependence","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","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; University of Alberta; University of British Columbia","funders":"","keywords":"Belief revision; Intuition; Mathematics; Generalization; Contraction (grammar); Base (topology); Computer science; Artificial intelligence; Cognitive science; Psychology; Philosophy","score_opus":0.20579334039473401,"score_gpt":0.4328956141131965,"score_spread":0.22710227371846248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759829967","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.26308388,0.00060479325,0.70774937,0.0010617682,0.000054346583,0.000101214144,0.00031506273,0.0005472174,0.026482385],"genre_scores_gemma":[0.9344654,0.0002365274,0.059213486,0.00025561833,0.00006565391,0.00013607142,0.00027981403,0.00014550395,0.005201921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738544,0.00056623697,0.00019400258,0.0006813691,0.0008115566,0.0003613188],"domain_scores_gemma":[0.9911187,0.0042882157,0.00063400524,0.0021438717,0.0014838866,0.00033132033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025156324,0.00048427703,0.0006774763,0.0014012627,0.0009492949,0.0015812869,0.0014856594,0.00097419927,0.0040121414],"category_scores_gemma":[0.012896024,0.00046576015,0.0011677687,0.0010265167,0.0033333583,0.0069961385,0.00337938,0.0026362212,0.00043674553],"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.00010420662,0.000054320913,0.0020612301,0.00010672573,0.000035264697,0.00027734792,0.0010272674,0.0077425754,0.00512977,0.9533692,0.0006889796,0.029403191],"study_design_scores_gemma":[0.000025653311,0.00007864442,0.0017416283,0.000031238258,0.00003470022,0.0003519486,0.00021490626,0.08037929,0.0055137626,0.9070092,0.00458784,0.000031210864],"about_ca_topic_score_codex":0.0017367632,"about_ca_topic_score_gemma":0.0008847922,"teacher_disagreement_score":0.0040121414,"about_ca_system_score_codex":0.0018861899,"about_ca_system_score_gemma":0.0008895692,"threshold_uncertainty_score":0.013685346},"labels":[],"label_agreement":null},{"id":"W2771250101","doi":"","title":"Why Rules are Complex: Real-Valued Probabilistic Logic Programs are not Fully Expressive.","year":2017,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Programming language; Probabilistic argumentation; Theoretical computer science; Logic program; Probabilistic logic network; Description logic; Logic programming; Artificial intelligence; Multimodal logic; Autoepistemic logic","score_opus":0.1345770587479101,"score_gpt":0.33336050070344564,"score_spread":0.19878344195553554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771250101","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.0688198,0.0028300933,0.8456652,0.027813317,0.00036982744,0.0001223087,0.0013431108,0.0013184252,0.05171788],"genre_scores_gemma":[0.82924813,0.0017433371,0.16032796,0.0028036234,0.0002720758,0.00018067964,0.00096212246,0.00034093062,0.004121154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944448,0.0019590864,0.00050358113,0.0011275365,0.0015311034,0.00043387155],"domain_scores_gemma":[0.9646045,0.025933115,0.0023230696,0.004415453,0.00204561,0.00067828404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066399714,0.0005135943,0.001010106,0.0013046955,0.00129893,0.009373823,0.0025238,0.0031448922,0.0061286367],"category_scores_gemma":[0.044501007,0.0010041595,0.0016904885,0.0014380477,0.0070574535,0.022963427,0.0034936836,0.0055233478,0.0012647852],"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.00006649075,0.000030278903,0.0011061787,0.0002105992,0.00008357085,0.00021649008,0.0006083101,0.008001926,0.00084637076,0.9594779,0.0038971077,0.025454683],"study_design_scores_gemma":[0.000009047198,0.0000031821862,0.00013050578,0.000029310351,0.0000131668085,0.00007968306,0.00010020865,0.00850206,0.0002905923,0.9883768,0.0024551952,0.000010297726],"about_ca_topic_score_codex":0.0028415043,"about_ca_topic_score_gemma":0.002407858,"teacher_disagreement_score":0.009373823,"about_ca_system_score_codex":0.0011751003,"about_ca_system_score_gemma":0.0016980739,"threshold_uncertainty_score":0.035115957},"labels":[],"label_agreement":null},{"id":"W2772933217","doi":"10.4230/lipics.disc.2017.12","title":"On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Linearizability; Computer science; Set (abstract data type); Algorithm; Programming language","score_opus":0.014070423245765592,"score_gpt":0.2588253246099194,"score_spread":0.24475490136415382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772933217","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.3913379,0.0008701417,0.5706154,0.0035707785,0.000121951794,0.00039985808,0.00080839667,0.0011146707,0.031160928],"genre_scores_gemma":[0.90315825,0.00050369353,0.08447947,0.0004783101,0.00025557078,0.00093464466,0.000662902,0.00032810992,0.009199057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98210126,0.004162144,0.0022382187,0.004655009,0.0038986602,0.0029447023],"domain_scores_gemma":[0.8472782,0.11828173,0.009536893,0.016118597,0.0047242655,0.0040604006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009086299,0.001134745,0.002793569,0.0028113052,0.0048176674,0.013199306,0.0049006734,0.0028977175,0.0091155665],"category_scores_gemma":[0.056328006,0.0019189682,0.003922885,0.003127076,0.018984446,0.039397202,0.013868819,0.007563871,0.0012770803],"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.0004556206,0.00014462494,0.003836752,0.00032868536,0.000062322346,0.00039744104,0.0018866705,0.012540189,0.0032605568,0.96538734,0.0008113954,0.0108883325],"study_design_scores_gemma":[0.000109719156,0.00010464674,0.0005924863,0.000098550656,0.00011485032,0.00047424948,0.00047090848,0.03857527,0.0063860132,0.94952404,0.0034708714,0.000078233476],"about_ca_topic_score_codex":0.0014617139,"about_ca_topic_score_gemma":0.0007216924,"teacher_disagreement_score":0.013199306,"about_ca_system_score_codex":0.0038090602,"about_ca_system_score_gemma":0.002766668,"threshold_uncertainty_score":0.048053503},"labels":[],"label_agreement":null},{"id":"W2773658508","doi":"10.1007/s11225-017-9775-3","title":"Topological-Frame Products of Modal Logics","year":2017,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Star product; Product (mathematics); Mathematics; Product topology; Combinatorics; Discrete mathematics; Topology (electrical circuits); Geometry","score_opus":0.04643960969552468,"score_gpt":0.28818951012914185,"score_spread":0.24174990043361716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773658508","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.12515031,0.0040178816,0.77025604,0.002569989,0.00033497214,0.00008241979,0.00072287663,0.0005705392,0.096294954],"genre_scores_gemma":[0.84867734,0.0021564586,0.1266613,0.00043080395,0.0005250342,0.00016637381,0.0008838372,0.0002444273,0.020254409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985909,0.00047915304,0.00010278633,0.0002860845,0.00037564026,0.00016538615],"domain_scores_gemma":[0.9971209,0.0014578715,0.0003140413,0.000335344,0.00046063718,0.00031117813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024180894,0.00084354565,0.0010428593,0.0032795942,0.0019353125,0.006169802,0.0014630145,0.00131813,0.010982343],"category_scores_gemma":[0.0042405343,0.00070169044,0.0014773513,0.0028806634,0.003670972,0.013464234,0.002856101,0.0027356655,0.0009609533],"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.000017567774,0.000008140586,0.00004759785,0.00001422622,0.000005493381,0.0000147777855,0.00008407968,0.0002851571,0.000118081945,0.9970409,0.00026417602,0.002099796],"study_design_scores_gemma":[0.000010150545,0.000009260818,0.000055748882,0.000007446501,0.000010099868,0.00002038479,0.000051754865,0.0020959124,0.00018901088,0.99544686,0.002097677,0.0000056663125],"about_ca_topic_score_codex":0.0015207828,"about_ca_topic_score_gemma":0.0017285855,"teacher_disagreement_score":0.010982343,"about_ca_system_score_codex":0.0023683063,"about_ca_system_score_gemma":0.00079306454,"threshold_uncertainty_score":0.036739588},"labels":[],"label_agreement":null},{"id":"W2778562959","doi":"10.1613/jair.5530","title":"A Knowledge Level Account of Forgetting","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Computer science; Equivalence (formal languages); Rotation formalisms in three dimensions; Non-monotonic logic; Logical consequence; Set (abstract data type); Classical logic; Description logic; Relation (database); Knowledge representation and reasoning; Theoretical computer science; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Linguistics","score_opus":0.41054957748030213,"score_gpt":0.48030359708273684,"score_spread":0.06975401960243471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778562959","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.04636739,0.003998628,0.7970407,0.0077329185,0.00035163993,0.00008378811,0.00035809423,0.00040662385,0.14366023],"genre_scores_gemma":[0.90317285,0.0017079561,0.0750961,0.0015862115,0.00062541047,0.00010831355,0.000378992,0.00012512051,0.017199038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979976,0.00042488266,0.00015406511,0.00046358217,0.00064341084,0.0003165012],"domain_scores_gemma":[0.9954312,0.0018477734,0.0003402866,0.0015183846,0.000687544,0.00017483257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025489295,0.0005854493,0.0004910877,0.0024683764,0.0019547364,0.004994651,0.002398315,0.002257235,0.005231712],"category_scores_gemma":[0.005031308,0.00044963165,0.001642707,0.0018870789,0.010444047,0.017318726,0.0041999896,0.0036859752,0.00057236676],"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.0000065445233,0.000005459035,0.00011127392,0.000021992091,0.00000646581,0.00009687175,0.0004475779,0.0010382682,0.000161624,0.99432474,0.00034558016,0.003433539],"study_design_scores_gemma":[0.000005854375,0.00001079194,0.00013195712,0.000024949464,0.000015700176,0.0001252855,0.00007521186,0.004296965,0.0004025371,0.98858297,0.006318596,0.000009157866],"about_ca_topic_score_codex":0.0024776445,"about_ca_topic_score_gemma":0.0016178964,"teacher_disagreement_score":0.005231712,"about_ca_system_score_codex":0.0024856026,"about_ca_system_score_gemma":0.0013717964,"threshold_uncertainty_score":0.018034399},"labels":[],"label_agreement":null},{"id":"W2788936316","doi":"10.1609/aaai.v32i1.11561","title":"Situation Calculus Semantics for Actual Causality","year":2018,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterfactual thinking; Causality (physics); Context (archaeology); Computer science; Action (physics); Counterfactual conditional; Possible world; Situation calculus; Semantics (computer science); Pearl; Propositional calculus; Epistemology; Calculus (dental); Artificial intelligence; Theoretical computer science; Programming language; Philosophy","score_opus":0.03196946170056348,"score_gpt":0.2939528793221528,"score_spread":0.26198341762158933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788936316","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.008785474,0.0010384665,0.9314377,0.0038036655,0.0003294193,0.00010403231,0.0003037463,0.00061549345,0.053581886],"genre_scores_gemma":[0.64910644,0.0014965696,0.33233252,0.0016363873,0.0005494452,0.0006221246,0.0005712787,0.00032361233,0.013361528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945015,0.0021797037,0.000552128,0.0008241541,0.0014515374,0.000491004],"domain_scores_gemma":[0.99471986,0.0027745506,0.00036794328,0.00094003597,0.00093743345,0.0002600707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005974188,0.00094872614,0.0008031375,0.0025330358,0.0025109893,0.0053290324,0.0023003817,0.0027727108,0.0069913175],"category_scores_gemma":[0.008214408,0.00076960895,0.0026142658,0.001846873,0.010809135,0.01080182,0.0043535456,0.0053823004,0.0008780149],"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.0000016172265,0.0000023614182,0.00001572236,0.000009686589,0.0000018220636,0.000016088452,0.00010835463,0.0004967057,0.000035329056,0.99859256,0.00013175863,0.0005879316],"study_design_scores_gemma":[0.0000068310073,0.0000035892945,0.000015162409,0.0000119535825,0.0000046331593,0.000028799303,0.000042535914,0.003200872,0.00011368575,0.99175334,0.004813556,0.0000050076287],"about_ca_topic_score_codex":0.0032086314,"about_ca_topic_score_gemma":0.0022348356,"teacher_disagreement_score":0.0069913175,"about_ca_system_score_codex":0.003912396,"about_ca_system_score_gemma":0.0031108416,"threshold_uncertainty_score":0.031594932},"labels":[],"label_agreement":null},{"id":"W2790113318","doi":"10.1007/978-3-319-72658-8_10","title":"Models and Formal Representations","year":2018,"lang":"en","type":"book-chapter","venue":"Synthese Library/Synthese library","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Prima facie; Epistemology; Inference; Resistance (ecology); Philosophy; Flexibility (engineering); Mathematics","score_opus":0.02460775995619818,"score_gpt":0.21941707662471946,"score_spread":0.19480931666852128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790113318","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.002406141,0.091263354,0.2377182,0.013165154,0.0017104062,0.000075795055,0.0010853377,0.0014784372,0.6510972],"genre_scores_gemma":[0.20780732,0.09160472,0.14244004,0.005292819,0.0032380822,0.0006729016,0.004918771,0.0018657331,0.5421597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.00023746885,0.00004527407,0.00011889515,0.00025229994,0.000045625813],"domain_scores_gemma":[0.99944264,0.00029167585,0.000031759897,0.00014136168,0.00006989734,0.00002252565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082970114,0.0012040472,0.00094881066,0.0016226356,0.000986152,0.0066521983,0.0013184701,0.001864061,0.02957899],"category_scores_gemma":[0.0026122513,0.000763221,0.0008320759,0.0022063083,0.0041084895,0.0075564403,0.0017332343,0.0037782858,0.011168817],"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.0000043343534,0.00000868118,0.000021757047,0.00008151143,0.000005287618,0.000013844096,0.0001391533,0.00045649635,0.000091081245,0.9519853,0.02460834,0.022584168],"study_design_scores_gemma":[0.000004359667,0.0000033404897,0.000031369847,0.00010280697,0.0000040963755,0.00004004455,0.00006159845,0.0007854296,0.00011892224,0.8189847,0.17985833,0.0000050518256],"about_ca_topic_score_codex":0.0024260518,"about_ca_topic_score_gemma":0.0023725936,"teacher_disagreement_score":0.02957899,"about_ca_system_score_codex":0.0023437587,"about_ca_system_score_gemma":0.0013516222,"threshold_uncertainty_score":0.09895158},"labels":[],"label_agreement":null},{"id":"W2792754795","doi":"10.1093/oso/9780198748991.003.0008","title":"Unfolding FOLDS: A Foundational Framework for Abstract Mathematical Concepts","year":2018,"lang":"en","type":"book","venue":"Oxford University Press eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Salient; Epistemology; Computer science; Cognitive science; Artificial intelligence; Philosophy; Psychology","score_opus":0.039792296844333455,"score_gpt":0.2748146137096418,"score_spread":0.23502231686530833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792754795","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.0075059766,0.008770904,0.82976466,0.0054354165,0.000978299,0.000068701185,0.00062054134,0.0019222996,0.1449332],"genre_scores_gemma":[0.40004644,0.014289794,0.44848323,0.0026736541,0.0020499753,0.00048151688,0.0014487578,0.0015475752,0.12897903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994593,0.00019493247,0.0000361996,0.000093892464,0.0001591645,0.00005641427],"domain_scores_gemma":[0.99935323,0.00035402493,0.00003707391,0.00012607334,0.00008217554,0.000047462316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015803815,0.00093358284,0.0005905182,0.0020207595,0.0018381928,0.004661263,0.0010634647,0.0012745204,0.008865411],"category_scores_gemma":[0.0018931249,0.000629108,0.0012381709,0.0016715466,0.0068882057,0.012248484,0.0026306165,0.0038844596,0.002497746],"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.0000028515872,0.0000012703416,0.000012718842,0.000022835498,0.0000013087856,0.000014717437,0.00012880217,0.00028578303,0.000094622,0.99340785,0.001583664,0.004443599],"study_design_scores_gemma":[0.0000020689404,0.0000041327758,0.000035601366,0.00002731305,0.0000025030529,0.000059875827,0.000037746686,0.0010726483,0.00017192193,0.9503229,0.048257828,0.0000053627095],"about_ca_topic_score_codex":0.0011543868,"about_ca_topic_score_gemma":0.0013128964,"teacher_disagreement_score":0.008865411,"about_ca_system_score_codex":0.0019348605,"about_ca_system_score_gemma":0.0013029638,"threshold_uncertainty_score":0.029657781},"labels":[],"label_agreement":null},{"id":"W2794051391","doi":"10.1007/978-3-319-69917-2_3","title":"Larisa Maksimova’s Early Contributions to Relevance Logic","year":2018,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relevance (law); Logical consequence; Ackermann function; Relation (database); Semantics (computer science); Computer science; Epistemology; Programming language; Philosophy; Artificial intelligence; Linguistics; Political science; Data mining","score_opus":0.02551498888633602,"score_gpt":0.2981960977255037,"score_spread":0.2726811088391677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794051391","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.00653763,0.10701738,0.24407604,0.060740307,0.012029283,0.00012045201,0.0006604964,0.0009838984,0.5678346],"genre_scores_gemma":[0.33681974,0.07687925,0.13004237,0.015958698,0.018081482,0.00042817392,0.0011762802,0.0010011101,0.41961294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790287,0.0006811673,0.00011728947,0.00044801718,0.00073086494,0.00011978487],"domain_scores_gemma":[0.99733233,0.0019285724,0.0000718947,0.00020479232,0.0003616577,0.00010072856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019486451,0.0010022154,0.0009412989,0.0023594417,0.002085619,0.004740536,0.0010613514,0.001611411,0.008770429],"category_scores_gemma":[0.0076458273,0.000715424,0.0009922925,0.002352005,0.006576011,0.0076938854,0.00309914,0.0055344244,0.004291756],"study_design_candidate":"not_applicable","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.000017349576,0.000013585928,0.00007121892,0.00015420934,0.000009992684,0.000043140964,0.00036890467,0.00048098387,0.00024278612,0.9426963,0.029499946,0.026401684],"study_design_scores_gemma":[0.0000075915077,0.000006412915,0.000096053416,0.00012580778,0.0000093147855,0.00008810231,0.000052830263,0.0006797104,0.0003323872,0.78396535,0.21462014,0.00001620345],"about_ca_topic_score_codex":0.0016632299,"about_ca_topic_score_gemma":0.0013757102,"teacher_disagreement_score":0.008770429,"about_ca_system_score_codex":0.0038976579,"about_ca_system_score_gemma":0.0023574985,"threshold_uncertainty_score":0.029340029},"labels":[],"label_agreement":null},{"id":"W2795456052","doi":"10.1017/s1471068415000150","title":"Abstract gringo","year":2015,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Griffith University; Deutsche Forschungsgemeinschaft; Simon Fraser University; National Science Foundation","keywords":"Computer science; Programming language; ASCII; Semantics (computer science); Syntax; Operational semantics; Natural language processing","score_opus":0.04921704846220617,"score_gpt":0.3125891107936691,"score_spread":0.26337206233146293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795456052","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.028961798,0.00080085127,0.73185873,0.0062912134,0.00092135003,0.0003467782,0.0034048904,0.014710308,0.2127041],"genre_scores_gemma":[0.5248279,0.0014891365,0.37492272,0.003822306,0.000565533,0.0005181634,0.0062963003,0.005981827,0.081576146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977537,0.00062207,0.00017946397,0.0004437747,0.0007031929,0.00029779915],"domain_scores_gemma":[0.9982382,0.0004493029,0.000121441706,0.000491611,0.0005603163,0.00013898207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018222627,0.0005879993,0.0006022066,0.00084934273,0.00086624967,0.0037451787,0.001641068,0.000908697,0.017390732],"category_scores_gemma":[0.0047406326,0.00037259416,0.00070275686,0.0008409863,0.0019865723,0.005989671,0.0031698926,0.0025464564,0.0061476408],"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.00018577745,0.000038528597,0.0005722889,0.00023660513,0.000011000606,0.00034294362,0.0006707409,0.0032348572,0.0028237898,0.9128391,0.02788967,0.05115468],"study_design_scores_gemma":[0.000065254426,0.000068948124,0.00043431553,0.00030202005,0.000026171576,0.00050530786,0.0002772385,0.019109124,0.009209407,0.48164156,0.48829994,0.000060722392],"about_ca_topic_score_codex":0.0024085648,"about_ca_topic_score_gemma":0.0010685658,"teacher_disagreement_score":0.017390732,"about_ca_system_score_codex":0.0017371924,"about_ca_system_score_gemma":0.0014085021,"threshold_uncertainty_score":0.05817777},"labels":[],"label_agreement":null},{"id":"W2796076122","doi":"","title":"Clauses as Semantic Predicates: Difficulties for Possible-Worlds Semantics","year":2018,"lang":"en","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Computer science; Semantics (computer science); Programming language; Natural language processing; Linguistics; Philosophy","score_opus":0.016494814506840018,"score_gpt":0.22971045793769873,"score_spread":0.21321564343085872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796076122","genre_codex":"methods","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.011097786,0.0074872063,0.79978096,0.027951855,0.0009575835,0.00023611993,0.0009865258,0.0008493045,0.15065268],"genre_scores_gemma":[0.5565849,0.009736657,0.3806134,0.00484584,0.0027292601,0.0011035871,0.003189076,0.0017215732,0.039475758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916856,0.0045466814,0.0007172087,0.000883682,0.0017649258,0.00040188088],"domain_scores_gemma":[0.9863452,0.010518174,0.00040148283,0.001328051,0.0010582578,0.0003488087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0097787725,0.0017483924,0.0026902796,0.0038252904,0.0051600467,0.018414102,0.0062713497,0.0073343995,0.015495943],"category_scores_gemma":[0.02249912,0.0026879841,0.0035543984,0.006801554,0.015190996,0.06691075,0.007872128,0.013775347,0.0030083447],"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.0000041378717,0.0000035739295,0.000008758261,0.000022811248,0.0000021748915,0.000013214861,0.00018545052,0.0001623704,0.00001583314,0.99670815,0.0010105667,0.0018629926],"study_design_scores_gemma":[0.00000521349,9.583923e-7,0.000005872713,0.000014027,0.0000033391957,0.000014930839,0.0000793124,0.0011172134,0.000038383525,0.99534154,0.003376092,0.000003111422],"about_ca_topic_score_codex":0.004286531,"about_ca_topic_score_gemma":0.0037157054,"teacher_disagreement_score":0.018414102,"about_ca_system_score_codex":0.004016816,"about_ca_system_score_gemma":0.0021500804,"threshold_uncertainty_score":0.051839113},"labels":[],"label_agreement":null},{"id":"W2798436609","doi":"10.1007/978-3-030-00461-3_26","title":"Measuring and Computing Database Inconsistency via Repairs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Measure (data warehouse); Cardinality (data modeling); Data integrity; Database; Computer science; Set (abstract data type); Semantics (computer science); Database administrator; Database testing; Data mining; Database schema; Database design; Programming language","score_opus":0.032554588805135266,"score_gpt":0.26141273087544403,"score_spread":0.22885814207030877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798436609","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.31174305,0.002709633,0.67787564,0.0012460651,0.00019234506,0.000265256,0.0011371517,0.003056749,0.0017741624],"genre_scores_gemma":[0.77913517,0.00042202228,0.21864755,0.000105048945,0.000095844014,0.00009466635,0.00084846915,0.00019107742,0.00046015746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9609807,0.011485088,0.004336575,0.007315194,0.014302636,0.0015798272],"domain_scores_gemma":[0.80149144,0.12092837,0.02116708,0.037454017,0.016723258,0.002235848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017297355,0.001812123,0.0036507898,0.008638986,0.0014084311,0.005488267,0.0054464717,0.0033839697,0.0014269882],"category_scores_gemma":[0.16735055,0.0016039403,0.0020130742,0.007017684,0.0032236425,0.015633196,0.0045905528,0.0035122843,0.00039012512],"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.0026489457,0.0007931467,0.10808123,0.0014647874,0.0013640552,0.000546743,0.001738304,0.41223034,0.011575532,0.05064624,0.0040826,0.40482807],"study_design_scores_gemma":[0.000084623905,0.000377577,0.008491895,0.00012244997,0.00044767407,0.0004520022,0.0006344539,0.8792248,0.010441026,0.098157115,0.0014615712,0.00010481705],"about_ca_topic_score_codex":0.00570561,"about_ca_topic_score_gemma":0.004848434,"teacher_disagreement_score":0.017297355,"about_ca_system_score_codex":0.0021781973,"about_ca_system_score_gemma":0.0029904963,"threshold_uncertainty_score":0.09147829},"labels":[],"label_agreement":null},{"id":"W2807139533","doi":"10.1007/s10670-018-0006-8","title":"On the Ramsey Test Analysis of ‘Because’","year":2018,"lang":"en","type":"article","venue":"Erkenntnis","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Counterfactual conditional; Epistemology; Philosophy; Ontology; Test (biology); Semantics (computer science); Mathematical economics; Counterfactual thinking; Mathematics; Computer science","score_opus":0.01779501630102527,"score_gpt":0.24659712468608244,"score_spread":0.22880210838505716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807139533","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.16701181,0.0018725694,0.65750784,0.01970851,0.00062319916,0.0001674441,0.0008052415,0.0013402321,0.15096314],"genre_scores_gemma":[0.92734665,0.0004766267,0.053723946,0.0019330318,0.00040652778,0.00011613397,0.00074637384,0.00039340594,0.014857254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939757,0.0026824404,0.00025137592,0.001008928,0.0012198458,0.00086172036],"domain_scores_gemma":[0.96682703,0.025058592,0.00096077746,0.003161051,0.0030070907,0.0009854301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006984756,0.0010122451,0.0020360171,0.004780832,0.0027459643,0.0041088327,0.0037937528,0.0023189038,0.019359266],"category_scores_gemma":[0.0493964,0.000745539,0.0033365628,0.0032623003,0.012229616,0.022049742,0.007131169,0.00684345,0.0012733527],"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.00007499551,0.00003006449,0.0006779039,0.00004925474,0.000026315935,0.00006475297,0.0002339723,0.0015763826,0.00018109054,0.9861963,0.002684453,0.008204425],"study_design_scores_gemma":[0.000009580273,0.000010869899,0.00026747293,0.000017080818,0.000016070215,0.000037946153,0.00010205245,0.009898,0.00028143477,0.9880084,0.0013385674,0.000012553641],"about_ca_topic_score_codex":0.0064145983,"about_ca_topic_score_gemma":0.0053142845,"teacher_disagreement_score":0.019359266,"about_ca_system_score_codex":0.0025862309,"about_ca_system_score_gemma":0.0022690876,"threshold_uncertainty_score":0.06476319},"labels":[],"label_agreement":null},{"id":"W2807275039","doi":"10.31144/bncc.cs.2542-1972.2012.n34.p105-133","title":"COMPONENT PROPERTIES OF FORGETTING AND PROGRESSION IN THE SITUATION CALCULUS","year":2012,"lang":"en","type":"article","venue":"Bulletin of the Novosibirsk Computing Center Series Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Russian Academy of Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Situation calculus; Action (physics); Scope (computer science); Computer science; Decomposition; Calculus (dental); Logical framework; Subject (documents); Component (thermodynamics); Relation (database); Mathematics; Epistemology; Artificial intelligence; Cognitive psychology; Psychology; Philosophy","score_opus":0.01739273574781714,"score_gpt":0.23470505685549034,"score_spread":0.2173123211076732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807275039","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.12792663,0.0012103841,0.82189256,0.00079123775,0.00016194127,0.00026312345,0.0003748653,0.0019894275,0.04538982],"genre_scores_gemma":[0.8218682,0.0010161601,0.15874593,0.0002211257,0.0002742969,0.000344328,0.0006133559,0.00062083395,0.01629572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964141,0.00058256235,0.0003410751,0.0008061502,0.0012224378,0.0006337486],"domain_scores_gemma":[0.99354833,0.0030170062,0.00046296974,0.001451035,0.0009921672,0.00052850624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386822,0.0010752482,0.0014307759,0.0036622938,0.0028300001,0.0053939577,0.002329239,0.001606095,0.009115037],"category_scores_gemma":[0.01205997,0.0015242188,0.004024295,0.0026700976,0.0067520565,0.016499097,0.0051817866,0.004926165,0.0010902009],"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.000057047542,0.000021072616,0.00036849215,0.0000519347,0.000021868796,0.00024723602,0.00069123483,0.0019056016,0.0006327853,0.98874,0.00027161694,0.006991058],"study_design_scores_gemma":[0.000027879729,0.000024714915,0.0002547003,0.000023596953,0.000052576375,0.00016028856,0.00007261985,0.009068266,0.000847952,0.9864938,0.002947288,0.00002626923],"about_ca_topic_score_codex":0.0057830014,"about_ca_topic_score_gemma":0.0036331306,"teacher_disagreement_score":0.009115037,"about_ca_system_score_codex":0.0021396584,"about_ca_system_score_gemma":0.0019187288,"threshold_uncertainty_score":0.030492842},"labels":[],"label_agreement":null},{"id":"W2808680436","doi":"10.24963/ijcai.2018/235","title":"Abstraction of Agents Executing Online and their Abilities in the Situation Calculus","year":2018,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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","funders":"","keywords":"Situation calculus; Computer science; Abstraction; Task (project management); Action (physics); Pi calculus; Artificial intelligence; Theoretical computer science; Programming language; Human–computer interaction","score_opus":0.03153144025626907,"score_gpt":0.27571774015429124,"score_spread":0.24418629989802215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808680436","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.01718365,0.00049978046,0.95846474,0.0007972996,0.000061402716,0.000100511956,0.00016428945,0.00043957683,0.02228871],"genre_scores_gemma":[0.49329844,0.0008963759,0.494692,0.00039610072,0.00017734317,0.0003259824,0.0003487741,0.00011379242,0.009751176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980021,0.0005820775,0.0002022509,0.00029742141,0.0005411519,0.000374935],"domain_scores_gemma":[0.9983369,0.00065227837,0.000188846,0.00037253142,0.00020440495,0.0002449535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026038503,0.0010552347,0.000707618,0.001682269,0.0015398337,0.0041359845,0.0023528624,0.0012255949,0.0045482055],"category_scores_gemma":[0.0028610632,0.0006805048,0.002901967,0.0012507949,0.0050250655,0.007529878,0.0039554504,0.0033663388,0.0008222508],"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.000010701574,0.000019135217,0.00019094047,0.000028692537,0.00001378914,0.00013968944,0.00046733223,0.008480302,0.0004914579,0.9863782,0.00024498475,0.003534647],"study_design_scores_gemma":[0.000019397088,0.000027380038,0.00022056118,0.000029998077,0.000043044703,0.000101100624,0.0001391415,0.051768146,0.0005795522,0.93623716,0.010810015,0.000024540264],"about_ca_topic_score_codex":0.009349498,"about_ca_topic_score_gemma":0.005363128,"teacher_disagreement_score":0.009349498,"about_ca_system_score_codex":0.0021518653,"about_ca_system_score_gemma":0.0019337614,"threshold_uncertainty_score":0.018590152},"labels":[],"label_agreement":null},{"id":"W2810243590","doi":"10.1016/j.artint.2018.06.003","title":"Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Formalism (music); Computer science; Dynamical systems theory; Artificial intelligence; Action (physics); Theoretical computer science; Mathematics; Algorithm; Physics","score_opus":0.016584897036570435,"score_gpt":0.27190308727807794,"score_spread":0.2553181902415075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810243590","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.06094181,0.00078807917,0.93203026,0.0017941106,0.00010962807,0.000045819874,0.0003044353,0.00030477662,0.0036811128],"genre_scores_gemma":[0.90005434,0.0006025004,0.096565336,0.00027665248,0.0001334257,0.00007178704,0.0003608962,0.000052090443,0.0018830057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694806,0.0010345901,0.00033313365,0.0006687009,0.00075713603,0.00025833197],"domain_scores_gemma":[0.9870323,0.010691024,0.00079453,0.000730025,0.00048481574,0.0002672696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036307147,0.0010325138,0.0015350035,0.001292082,0.001116026,0.005884859,0.0029169228,0.0032302912,0.0024828115],"category_scores_gemma":[0.017575987,0.0011997427,0.0022145398,0.00096343353,0.0054723956,0.011625852,0.0031440551,0.0038891328,0.00026924827],"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.00033294692,0.000108933484,0.0027687652,0.00038453456,0.00020332228,0.00094359927,0.00078490167,0.42296726,0.0020476351,0.54389334,0.0011196065,0.024445187],"study_design_scores_gemma":[0.000046853136,0.000023574248,0.00023062782,0.00002926773,0.0000468241,0.00007969729,0.00011319072,0.52020466,0.0008741681,0.47776124,0.000565226,0.000024713192],"about_ca_topic_score_codex":0.0054379287,"about_ca_topic_score_gemma":0.0044022147,"teacher_disagreement_score":0.005884859,"about_ca_system_score_codex":0.0016653513,"about_ca_system_score_gemma":0.0012051178,"threshold_uncertainty_score":0.019201279},"labels":[],"label_agreement":null},{"id":"W2874049253","doi":"10.26686/ajl.v15i2.4066","title":"Two Manuscripts, One by Routley, One by Meyer: The Origins of the Routley-Meyer Semantics for Relevance Logics","year":2018,"lang":"en","type":"article","venue":"The Australasian Journal of Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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 Alberta","funders":"","keywords":"Relevance (law); Semantics (computer science); Proof-theoretic semantics; Relation (database); Set (abstract data type); Kripke semantics; Presentation (obstetrics); Mathematics; Computer science; Natural language processing; Epistemology; Algebra over a field; Artificial intelligence; Programming language; Operational semantics; Philosophy; Description logic; Pure mathematics; Denotational semantics; Data mining; Intermediate logic","score_opus":0.037993253544921106,"score_gpt":0.27567773915424004,"score_spread":0.23768448560931893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2874049253","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.016755115,0.088576384,0.33717355,0.33649024,0.09185498,0.0002079771,0.0008982787,0.001140592,0.12690298],"genre_scores_gemma":[0.3659883,0.05673532,0.20999005,0.067334175,0.06311117,0.00061182084,0.0008683641,0.0029559245,0.23240484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996216,0.0017847314,0.000250878,0.00061697874,0.00096366263,0.00016769406],"domain_scores_gemma":[0.9903702,0.0049943808,0.000616325,0.0009108767,0.0025325778,0.00057566684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005353141,0.0007973208,0.00056050345,0.002033307,0.00288868,0.006718002,0.0011211049,0.00247385,0.0041173506],"category_scores_gemma":[0.026792921,0.00044402762,0.0008792739,0.0017437082,0.00870277,0.0102355555,0.0027278946,0.006367108,0.0014960471],"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.00006130283,0.000019672461,0.000095140655,0.00015505837,0.000020351727,0.00012649439,0.0021156538,0.00033084306,0.00082631066,0.8681025,0.102182426,0.025964253],"study_design_scores_gemma":[0.000024949357,0.000038109643,0.00019442546,0.00029165376,0.000029735718,0.00022600814,0.000575576,0.00068145595,0.0018737064,0.40936112,0.5866303,0.00007293013],"about_ca_topic_score_codex":0.0020883738,"about_ca_topic_score_gemma":0.0019415019,"teacher_disagreement_score":0.006718002,"about_ca_system_score_codex":0.0043558693,"about_ca_system_score_gemma":0.0036997912,"threshold_uncertainty_score":0.03160417},"labels":[],"label_agreement":null},{"id":"W2876344336","doi":"10.24963/ijcai.2018/798","title":"Three-Valued Semantics for Hybrid MKNF Knowledge Bases Revisited (Extended Abstract)","year":2018,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Formalism (music); Negation; Computer science; Semantics (computer science); Hierarchy; Well-founded semantics; Theoretical computer science; Programming language; Operational semantics; Artificial intelligence; Algorithm; Discrete mathematics; Mathematics; Denotational semantics","score_opus":0.032875949565537556,"score_gpt":0.29380162357464873,"score_spread":0.26092567400911115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2876344336","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.030225653,0.0004231886,0.95986634,0.0012280212,0.000062807616,0.000091694106,0.0002825522,0.00033855232,0.0074811648],"genre_scores_gemma":[0.60163325,0.00038118387,0.39348507,0.0005144488,0.00006763401,0.00019820362,0.000429594,0.00010718951,0.003183459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972107,0.00076556153,0.00031076124,0.00052247755,0.000889529,0.00030101146],"domain_scores_gemma":[0.9962296,0.0015293862,0.0003184233,0.0007139466,0.000987988,0.00022066195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032804422,0.0005514917,0.0005374687,0.0016701635,0.0013177735,0.0044321385,0.0020484643,0.0012935811,0.0027962509],"category_scores_gemma":[0.0051391115,0.0005834269,0.0019264347,0.0018131324,0.0045302506,0.0112627065,0.0038264336,0.0034455536,0.00047889852],"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.00003297739,0.000019188197,0.00020958036,0.00007896001,0.000021741978,0.00012496082,0.0008722187,0.0048300535,0.0016861245,0.98242605,0.00040480707,0.009293273],"study_design_scores_gemma":[0.000018033494,0.000024432033,0.00015539612,0.000055818273,0.000029763727,0.00014980056,0.00027262207,0.030067155,0.0024978647,0.9589341,0.007764873,0.000030177589],"about_ca_topic_score_codex":0.005934106,"about_ca_topic_score_gemma":0.0045334753,"teacher_disagreement_score":0.005934106,"about_ca_system_score_codex":0.002921489,"about_ca_system_score_gemma":0.001267554,"threshold_uncertainty_score":0.021197021},"labels":[],"label_agreement":null},{"id":"W2889830614","doi":"","title":"Modal and Relevance Logics for Qualitative Spatial Reasoning","year":2018,"lang":"en","type":"dissertation","venue":"Brock University Digital Repository (Brock University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Brock University","keywords":"Relevance (law); Modal; Computer science; Qualitative reasoning; Epistemology; Artificial intelligence; Cognitive science; Psychology; Philosophy; Political science; Materials science","score_opus":0.014269306195245565,"score_gpt":0.2312612097978765,"score_spread":0.21699190360263093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889830614","genre_codex":"methods","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.0072619063,0.0030504859,0.9278122,0.0043195295,0.00023247776,0.000111544476,0.0005056413,0.00073131063,0.055974897],"genre_scores_gemma":[0.466117,0.003058607,0.50668025,0.0022665951,0.0008627765,0.00042226145,0.00077189645,0.00017749029,0.019643104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964845,0.0014566999,0.00021422387,0.00046382716,0.0011238634,0.0002569304],"domain_scores_gemma":[0.9971589,0.0016801502,0.00020433478,0.0003209445,0.0004849788,0.00015070135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047713015,0.0007463145,0.0005273917,0.002377669,0.0014521339,0.0040602935,0.0016739699,0.0012135047,0.0074340007],"category_scores_gemma":[0.0067554084,0.00064081454,0.0020226403,0.001977361,0.004803188,0.0058263256,0.0032907892,0.0038510754,0.00093800155],"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.000008900491,0.000009546193,0.00003446392,0.000050182927,0.000006531778,0.000040311814,0.00015400765,0.002486015,0.0003106261,0.9901252,0.0010037083,0.0057704872],"study_design_scores_gemma":[0.000010230049,0.000006088866,0.00004750399,0.000026116768,0.000008782948,0.000027959733,0.000055297798,0.019337922,0.0003798904,0.97043365,0.0096544875,0.000012019163],"about_ca_topic_score_codex":0.006754001,"about_ca_topic_score_gemma":0.0050615473,"teacher_disagreement_score":0.0074340007,"about_ca_system_score_codex":0.006023927,"about_ca_system_score_gemma":0.002135719,"threshold_uncertainty_score":0.043706894},"labels":[],"label_agreement":null},{"id":"W2890178860","doi":"10.1145/3203409","title":"General Belief Revision","year":2018,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Belief revision; Iterated function; Possible world; Propositional calculus; Classical logic; Computer science; Representation (politics); Literal (mathematical logic); Mathematics; Artificial intelligence; Algorithm; Programming language; Epistemology; Philosophy","score_opus":0.02115725974050229,"score_gpt":0.2720268880641111,"score_spread":0.2508696283236088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890178860","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.010654315,0.020255722,0.7652341,0.02056924,0.0012765697,0.00034675057,0.0007635992,0.0005765192,0.18032312],"genre_scores_gemma":[0.7613434,0.012255311,0.1814862,0.0061738035,0.003402886,0.0010087641,0.00094915804,0.00016165219,0.033218805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927856,0.0034279213,0.0004526067,0.0013874108,0.001611326,0.00033526885],"domain_scores_gemma":[0.99365777,0.0035446563,0.0004006772,0.001198801,0.0009952438,0.00020283609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069968947,0.0013904487,0.0014152338,0.0017882216,0.0013849548,0.0042980225,0.0026832714,0.0034136872,0.007879599],"category_scores_gemma":[0.014430821,0.0005287323,0.001713001,0.0017093444,0.00656092,0.005819002,0.0032386573,0.0044144723,0.0016297571],"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.000012374989,0.0000087979815,0.00008828689,0.000121626596,0.0000351496,0.000045968798,0.00017689716,0.0020791206,0.000077298624,0.98431075,0.0024787986,0.010564932],"study_design_scores_gemma":[0.000013744878,0.000009364106,0.0000450157,0.00003049673,0.000008048794,0.00005159983,0.00002142897,0.0030519962,0.00003819329,0.9902762,0.0064472547,0.0000067012425],"about_ca_topic_score_codex":0.0019413291,"about_ca_topic_score_gemma":0.0013377437,"teacher_disagreement_score":0.007879599,"about_ca_system_score_codex":0.0042883446,"about_ca_system_score_gemma":0.0017055634,"threshold_uncertainty_score":0.037003577},"labels":[],"label_agreement":null},{"id":"W2890251009","doi":"10.1215/00294527-2018-0011","title":"Second-Order Logic of Paradox","year":2018,"lang":"fr","type":"article","venue":"Notre Dame Journal of Formal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"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 Alberta","funders":"","keywords":"Interpretation (philosophy); Order (exchange); Epistemology; Metaphysics; Appeal; Higher-order logic; Term logic; Computer science; Philosophy of logic; Philosophy; Computational logic; Mathematics; Artificial intelligence; Description logic; Programming language; Law","score_opus":0.038528760449590145,"score_gpt":0.28381338543847745,"score_spread":0.2452846249888873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890251009","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.027894584,0.014118331,0.333205,0.066383906,0.0021654563,0.00012289704,0.00055631815,0.0005204605,0.55503297],"genre_scores_gemma":[0.86620814,0.0045684776,0.067065686,0.011223534,0.0017429473,0.000291804,0.0002844046,0.0002088285,0.04840617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966066,0.0017244803,0.00017361855,0.00047905723,0.00072556606,0.00029082515],"domain_scores_gemma":[0.9965886,0.0019247906,0.00020090939,0.00044616734,0.0005739128,0.00026565403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005615021,0.00053410075,0.0006965489,0.0013464489,0.003209992,0.00709707,0.0014297154,0.002518944,0.004943159],"category_scores_gemma":[0.007986914,0.0003849631,0.0009924108,0.0012789097,0.0136430655,0.0107240835,0.004009389,0.0053300536,0.0007874431],"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.0000023974628,0.0000015945343,0.000011996657,0.0000059797003,0.0000016264798,0.000020496273,0.00009479694,0.00013057634,0.00002193293,0.99838924,0.0008378476,0.0004816142],"study_design_scores_gemma":[0.0000040386562,0.0000015579216,0.000010474489,0.0000065892455,0.000001527557,0.000026041791,0.000032469612,0.00057863974,0.000035697605,0.9933031,0.0059966166,0.0000031613283],"about_ca_topic_score_codex":0.0028773795,"about_ca_topic_score_gemma":0.0017990798,"teacher_disagreement_score":0.00709707,"about_ca_system_score_codex":0.00480358,"about_ca_system_score_gemma":0.0028045068,"threshold_uncertainty_score":0.034852624},"labels":[],"label_agreement":null},{"id":"W2893109491","doi":"10.1017/s1755020318000229","title":"COMPLETENESS OF SECOND-ORDER PROPOSITIONAL S4 AND H IN TOPOLOGICAL SEMANTICS","year":2018,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Propositional variable; Axiom; Intermediate logic; Intuitionistic logic; Well-formed formula; Modal logic; Propositional calculus; Mathematics; S5; Autoepistemic logic; Zeroth-order logic; Semantics (computer science); Discrete mathematics; Dynamic logic (digital electronics); T-norm fuzzy logics; Normal modal logic; Modal; Multimodal logic; Computer science; Theoretical computer science; Description logic; Artificial intelligence; Programming language; Fuzzy logic","score_opus":0.025659756564900844,"score_gpt":0.2890374436040479,"score_spread":0.26337768703914705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893109491","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.34001234,0.010431281,0.5734304,0.0067580333,0.00041901178,0.00013991649,0.0009550166,0.0010259383,0.06682812],"genre_scores_gemma":[0.9353204,0.0021459027,0.055779874,0.00084512593,0.00019711517,0.00010822033,0.00077383156,0.00007084407,0.004758667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586797,0.0015898214,0.00031673434,0.00059844396,0.0012374459,0.00038951632],"domain_scores_gemma":[0.99363834,0.0036621739,0.0005339737,0.00092513487,0.0010149598,0.00022539233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004844591,0.0006150429,0.0011343029,0.0023088765,0.001744272,0.005267896,0.0018976108,0.0017913977,0.00294228],"category_scores_gemma":[0.0060305805,0.00065555604,0.0018260378,0.002201777,0.009074208,0.00900379,0.004286052,0.0028026483,0.00042556273],"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.00004942824,0.000015743422,0.00025592963,0.0001753045,0.00005128883,0.00008060536,0.0003168143,0.0030914536,0.0005863044,0.98507303,0.00081769296,0.009486508],"study_design_scores_gemma":[0.000025801934,0.000019077113,0.00022540275,0.000032137246,0.000021442143,0.00006494305,0.00012715632,0.007591591,0.0011124171,0.98559225,0.005169307,0.000018551216],"about_ca_topic_score_codex":0.0057442794,"about_ca_topic_score_gemma":0.0031407839,"teacher_disagreement_score":0.0057442794,"about_ca_system_score_codex":0.0026528174,"about_ca_system_score_gemma":0.003020833,"threshold_uncertainty_score":0.025620937},"labels":[],"label_agreement":null},{"id":"W2893802702","doi":"10.1016/j.jlamp.2018.09.004","title":"Cryptomorphic topological structures: A computational, relation-algebraic approach","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relation (database); Closure (psychology); Topology (electrical circuits); Mathematics; Closed set; Algebraic number; Topological space; Algebraic topology; Irreducible component; Set (abstract data type); Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Combinatorics; Homotopy; Data mining","score_opus":0.050155184558743106,"score_gpt":0.3599268618012973,"score_spread":0.30977167724255417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893802702","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.078291945,0.001452767,0.84004104,0.0068815653,0.0002845453,0.00014380322,0.00041426488,0.00025007673,0.07224002],"genre_scores_gemma":[0.76431197,0.001630814,0.21737476,0.00043169825,0.0005112631,0.00015704197,0.0004231323,0.000091575654,0.015067761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895704,0.0004104513,0.00008841848,0.00016952911,0.00028257156,0.000091988724],"domain_scores_gemma":[0.99614584,0.00207326,0.0003874865,0.0007528781,0.0004324077,0.00020815819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013874691,0.000608822,0.00094858697,0.003293873,0.0021011103,0.007969656,0.0022305215,0.0015048591,0.00811464],"category_scores_gemma":[0.008339327,0.00045098382,0.0011757363,0.0027325763,0.0074245273,0.016041245,0.0035600269,0.0030391756,0.0007927524],"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.000004867533,0.000005965567,0.000056330213,0.000013360459,0.0000019069137,0.000019515754,0.00005630395,0.0009024131,0.000052551168,0.9968772,0.00020750245,0.0018021878],"study_design_scores_gemma":[0.00000537963,0.0000067653514,0.000031436746,0.000008324033,0.0000036625202,0.000050390667,0.00007973117,0.010005949,0.00009714,0.9878802,0.0018258203,0.0000052094533],"about_ca_topic_score_codex":0.0009847056,"about_ca_topic_score_gemma":0.001040881,"teacher_disagreement_score":0.00811464,"about_ca_system_score_codex":0.0019386995,"about_ca_system_score_gemma":0.0011296716,"threshold_uncertainty_score":0.02714616},"labels":[],"label_agreement":null},{"id":"W2895195227","doi":"10.1007/978-3-030-02149-8_22","title":"Calculational Relation-Algebraic Proofs in the Teaching Tool CalcCheck","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematical proof; Rewriting; Computer science; Relation (database); Associative property; Algebraic number; Algebra over a field; Proof assistant; Programming language; Calculus (dental); Mathematics; Pure mathematics","score_opus":0.018319600958911872,"score_gpt":0.25453226405161905,"score_spread":0.23621266309270716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895195227","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.009418768,0.001402251,0.888499,0.0017002899,0.00033136737,0.000092379654,0.00021003738,0.007599031,0.09074688],"genre_scores_gemma":[0.32781264,0.0019126681,0.6067322,0.00054973346,0.00029996014,0.00018737632,0.0005739082,0.004295137,0.05763625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798274,0.00071557786,0.00011831574,0.00028058703,0.0007658525,0.00013695002],"domain_scores_gemma":[0.99434847,0.0044118133,0.000109825676,0.00069075054,0.00031305166,0.00012598086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021364794,0.00073828927,0.0006792766,0.0012734133,0.0014384106,0.004731552,0.0025079802,0.0011668392,0.02556874],"category_scores_gemma":[0.010783311,0.0010206078,0.0009215609,0.0018439735,0.0028744082,0.008607365,0.0037460579,0.004512174,0.007527038],"study_design_candidate":"not_applicable","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.000048382495,0.000044190776,0.000154581,0.00020256522,0.000009414162,0.000062620675,0.00061832485,0.0028834702,0.0014526346,0.8792378,0.009038063,0.10624802],"study_design_scores_gemma":[0.000036260113,0.000021931335,0.0001250656,0.00018082227,0.00001682862,0.00027309128,0.00015754324,0.024267849,0.008086116,0.8507735,0.1160273,0.000033746415],"about_ca_topic_score_codex":0.0010402075,"about_ca_topic_score_gemma":0.0017564804,"teacher_disagreement_score":0.02556874,"about_ca_system_score_codex":0.0020377783,"about_ca_system_score_gemma":0.0025231696,"threshold_uncertainty_score":0.085536},"labels":[],"label_agreement":null},{"id":"W2896430270","doi":"10.1007/s11787-018-0214-7","title":"Pecularities of Some Three- and Four-Valued Second Order Logics","year":2018,"lang":"en","type":"article","venue":"Logica Universalis","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Statement (logic); Order (exchange); Mathematics; Propositional calculus; Many-valued logic; T-norm fuzzy logics; Truth value; Mathematical economics; Discrete mathematics; Computer science; Description logic; Calculus (dental); Artificial intelligence; Epistemology; Philosophy; Programming language; Fuzzy logic","score_opus":0.02407551781598009,"score_gpt":0.21851114767710342,"score_spread":0.19443562986112334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896430270","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.43795803,0.0033453496,0.21800861,0.017921716,0.0002630907,0.00008856575,0.00087120314,0.00037289798,0.32117054],"genre_scores_gemma":[0.9681247,0.0008424558,0.017704295,0.0008591422,0.0001828867,0.00006651031,0.00029675505,0.000046947873,0.011876255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980895,0.0005984682,0.000118212214,0.000252412,0.00058066915,0.00036071552],"domain_scores_gemma":[0.99318427,0.004630244,0.0005009998,0.00055458845,0.00057940144,0.00055044424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003664664,0.00048769743,0.0009341434,0.0017819707,0.0030278177,0.0075877584,0.0013907844,0.0017858504,0.009070878],"category_scores_gemma":[0.0077773673,0.0006339061,0.001490148,0.0022199547,0.0065623997,0.011561756,0.0030741831,0.0043025347,0.0005693012],"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.000018138375,0.000006338204,0.000066750945,0.0000068030267,0.0000030963024,0.000020365285,0.00008243482,0.00023992865,0.00006631952,0.99842095,0.00022736359,0.00084154675],"study_design_scores_gemma":[0.00000988105,0.0000025545194,0.000045744047,0.000004584972,0.0000037347045,0.000022157494,0.000042082516,0.0018011461,0.0000951877,0.9971222,0.000846925,0.000003889071],"about_ca_topic_score_codex":0.0019849034,"about_ca_topic_score_gemma":0.0015111465,"teacher_disagreement_score":0.009070878,"about_ca_system_score_codex":0.0037856535,"about_ca_system_score_gemma":0.001562789,"threshold_uncertainty_score":0.030345082},"labels":[],"label_agreement":null},{"id":"W2898889105","doi":"","title":"Incorporating Relevance in Epistemic States in Belief Revision","year":2018,"lang":"en","type":"article","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relevance (law); Epistemology; Computer science; Artificial intelligence; Philosophy; Political science","score_opus":0.009023929696790127,"score_gpt":0.2135538949087017,"score_spread":0.20452996521191155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898889105","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.038397595,0.0006321113,0.9528731,0.001820516,0.00019100153,0.000088751905,0.00008790759,0.0002455286,0.0056634108],"genre_scores_gemma":[0.8525709,0.00028276228,0.14426082,0.00027217448,0.00029972047,0.00012753242,0.00010560786,0.000088349145,0.0019921781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9836199,0.011533695,0.0009859004,0.0013693826,0.0019350881,0.00055602955],"domain_scores_gemma":[0.92796963,0.06010588,0.0018091637,0.0051125013,0.003958766,0.0010441146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015412007,0.00075195066,0.0014631755,0.0019848193,0.0015940616,0.0063373204,0.002010546,0.003278282,0.004265275],"category_scores_gemma":[0.09824573,0.0013674331,0.0018445239,0.0014364498,0.0036203314,0.01715683,0.0058300607,0.005599751,0.00051723176],"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.0007667161,0.0002880794,0.0017073724,0.0006071196,0.00020725583,0.00023248658,0.0021152918,0.08217591,0.0018346523,0.81152886,0.0017036234,0.096832685],"study_design_scores_gemma":[0.000055613753,0.00007821718,0.00022679237,0.000062196836,0.00007383663,0.000035093122,0.00007954764,0.17834215,0.00084078,0.81914026,0.0010199489,0.000045618974],"about_ca_topic_score_codex":0.0020300343,"about_ca_topic_score_gemma":0.002976228,"teacher_disagreement_score":0.015412007,"about_ca_system_score_codex":0.0020169185,"about_ca_system_score_gemma":0.001930642,"threshold_uncertainty_score":0.081507444},"labels":[],"label_agreement":null},{"id":"W2899509916","doi":"","title":"Specifying Plausibility Levels for Iterated Belief Change in the Situation Calculus.","year":2018,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Belief revision; Computer science; Calculus (dental); Situation calculus; Theoretical computer science; Mathematics; Artificial intelligence; Medicine","score_opus":0.15139629189528303,"score_gpt":0.37167727085933766,"score_spread":0.22028097896405463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899509916","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.029284183,0.0005459496,0.9356049,0.0018173679,0.00013375373,0.00017864224,0.0002855381,0.00070152554,0.031448215],"genre_scores_gemma":[0.6891655,0.00027219093,0.30415642,0.0003379333,0.00012697201,0.00025309867,0.00032876138,0.00016080643,0.0051983814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923838,0.0032364905,0.00076585554,0.0010092854,0.0019461984,0.00065841863],"domain_scores_gemma":[0.9825691,0.012923393,0.000800814,0.0015314787,0.0015250935,0.0006501433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009245238,0.00093887653,0.0009664577,0.0022424625,0.0023119398,0.008289666,0.0028578872,0.0035542601,0.009088459],"category_scores_gemma":[0.043290712,0.0015298715,0.0028896264,0.0012880033,0.0056550903,0.015090734,0.0047533903,0.0059732,0.001227505],"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.00009899439,0.000042128744,0.0003494753,0.00007301149,0.000044263485,0.00019925646,0.0007122982,0.007990809,0.0007480371,0.98012084,0.00062190025,0.008998906],"study_design_scores_gemma":[0.000029969997,0.000019809997,0.0000880093,0.000029265108,0.000031880176,0.000057024317,0.00009659885,0.029653074,0.0005888016,0.9680296,0.0013565295,0.000019374404],"about_ca_topic_score_codex":0.0035231907,"about_ca_topic_score_gemma":0.0044575795,"teacher_disagreement_score":0.009245238,"about_ca_system_score_codex":0.0030440916,"about_ca_system_score_gemma":0.0020550624,"threshold_uncertainty_score":0.048894048},"labels":[],"label_agreement":null},{"id":"W2903150012","doi":"10.65109/yymz7756","title":"A logical theory of robot localization","year":2014,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Robot; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Task (project management); Extension (predicate logic); Domain (mathematical analysis); Logical conjunction; Action (physics); Logical consequence; Theoretical computer science; Mathematics; Programming language; Engineering; Machine learning","score_opus":0.01821368675568126,"score_gpt":0.22985526558549602,"score_spread":0.21164157882981477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903150012","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.0049297824,0.002790139,0.8787082,0.01376039,0.00051683164,0.00006473862,0.00038650178,0.00050933374,0.09833409],"genre_scores_gemma":[0.51017827,0.0041695875,0.4433479,0.0059891483,0.0015420326,0.00064400525,0.00094456587,0.00026830265,0.032916125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772686,0.0008970938,0.00015335718,0.00044300777,0.00056855776,0.00021121028],"domain_scores_gemma":[0.9974203,0.0012975142,0.00018572768,0.00041612773,0.00048755252,0.00019283545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035952437,0.00076385145,0.00070759887,0.0020822443,0.0028872848,0.005848544,0.0024285412,0.0025161623,0.007936857],"category_scores_gemma":[0.0045719068,0.0006410769,0.0021451705,0.0016311714,0.012926178,0.012322785,0.0034388506,0.0045821103,0.0020787832],"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.0000024405638,0.0000029906234,0.000018468123,0.000014550033,0.000002555324,0.00001808263,0.000084270876,0.00044647217,0.00006382026,0.9970131,0.00070899975,0.0016242234],"study_design_scores_gemma":[0.000007974696,0.0000070597134,0.000025906536,0.000020289739,0.0000045219326,0.000030033427,0.00006033793,0.0022283199,0.000100662866,0.9846598,0.012848808,0.0000062408258],"about_ca_topic_score_codex":0.0034548498,"about_ca_topic_score_gemma":0.0017701624,"teacher_disagreement_score":0.007936857,"about_ca_system_score_codex":0.0035698982,"about_ca_system_score_gemma":0.0022447063,"threshold_uncertainty_score":0.026551485},"labels":[],"label_agreement":null},{"id":"W2908230245","doi":"10.48550/arxiv.1810.04316","title":"Convex Functions in ACL2(r)","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"","keywords":"Regular polygon; Lipschitz continuity; Convex set; Convex analysis; Set (abstract data type); Computer science; Danskin's theorem; Convex function; Metric (unit); Proper convex function; Subderivative; Discrete mathematics; Mathematics; Convex optimization; Algebra over a field; Pure mathematics; Brouwer fixed-point theorem; Fixed-point theorem","score_opus":0.0570811679550669,"score_gpt":0.1732313134221095,"score_spread":0.11615014546704261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908230245","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.009938438,0.0011956999,0.89197433,0.0038664031,0.00038466402,0.000071469345,0.000838337,0.00066383503,0.09106687],"genre_scores_gemma":[0.4803184,0.0020159334,0.46767282,0.0035968553,0.00094909995,0.00048081076,0.0022816653,0.0010011566,0.041683253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949915,0.0018195084,0.00043378564,0.00094082317,0.0014838985,0.00033046084],"domain_scores_gemma":[0.99476516,0.0024418565,0.00042684277,0.00063964346,0.0014489129,0.00027760759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004679719,0.0008656374,0.00060900685,0.00215324,0.001252211,0.004767648,0.0020157152,0.0011131385,0.012831279],"category_scores_gemma":[0.008503813,0.00040148065,0.0013865505,0.0015342911,0.004840673,0.0086465515,0.004286034,0.0039048549,0.0035985867],"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.000008043507,0.0000033059096,0.000050299397,0.00003461078,0.000003846442,0.000042635165,0.00010630667,0.00066108775,0.00013108556,0.9933549,0.0018200644,0.0037838032],"study_design_scores_gemma":[0.000009182906,0.000016410317,0.00015066947,0.000038929087,0.0000096746935,0.00015963406,0.00010248421,0.008624281,0.0005657013,0.93206406,0.058236904,0.000021992355],"about_ca_topic_score_codex":0.004876075,"about_ca_topic_score_gemma":0.0028385862,"teacher_disagreement_score":0.012831279,"about_ca_system_score_codex":0.002775981,"about_ca_system_score_gemma":0.001017738,"threshold_uncertainty_score":0.04292488},"labels":[],"label_agreement":null},{"id":"W2911930742","doi":"10.1613/jair.1.11337","title":"A Generalisation of AGM Contraction and Revision to Fragments of First-Order Logic","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Griffith University","keywords":"Contraction (grammar); Logical equivalence; Propositional calculus; Horn clause; Classical logic; Mathematics; Non-monotonic logic; Many-valued logic; Intermediate logic; Equivalence (formal languages); Substructural logic; Expressive power; Description logic; Algorithm; Computer science; Discrete mathematics; Theoretical computer science; Prolog; Linguistics; Philosophy","score_opus":0.1294825634957763,"score_gpt":0.4023719552677477,"score_spread":0.2728893917719714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911930742","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.030709248,0.00045326725,0.93535,0.001152464,0.00010321083,0.00017956308,0.0001494575,0.00043883262,0.031463973],"genre_scores_gemma":[0.6446765,0.00042229364,0.33989465,0.0006750866,0.00028444946,0.00028805452,0.0002120607,0.00017051959,0.013376455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996849,0.0009399248,0.00018251881,0.00066135597,0.0010828449,0.00028431858],"domain_scores_gemma":[0.9953903,0.0017481532,0.00035830744,0.0016044847,0.0006933952,0.00020527063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004510775,0.00059781724,0.0005001902,0.0013806656,0.0010227379,0.0021522269,0.0021262455,0.0013155155,0.0040757316],"category_scores_gemma":[0.010060462,0.00039418292,0.0017427049,0.0011730007,0.004587142,0.0057952194,0.0029255382,0.003372946,0.00057838054],"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.000033708155,0.000020015927,0.00030993365,0.000045080782,0.00001532016,0.00011591795,0.0007968029,0.004077212,0.0019751505,0.95812124,0.0008225252,0.033667192],"study_design_scores_gemma":[0.00003693821,0.00010507586,0.0006400463,0.000040489842,0.000030407735,0.0004988713,0.00018958224,0.053609885,0.004086105,0.91727066,0.023444967,0.000046927707],"about_ca_topic_score_codex":0.001923755,"about_ca_topic_score_gemma":0.0013266666,"teacher_disagreement_score":0.004510775,"about_ca_system_score_codex":0.0023036113,"about_ca_system_score_gemma":0.0014927144,"threshold_uncertainty_score":0.023855567},"labels":[],"label_agreement":null},{"id":"W2913147510","doi":"","title":"Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics","year":2008,"lang":"en","type":"article","venue":"Theorem Proving in Higher Order Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Order (exchange); Automated theorem proving; Computer science; Calculus (dental); Mathematical economics; Mathematics; Discrete mathematics; Theoretical computer science; Business; Medicine","score_opus":0.056843874740344816,"score_gpt":0.25342045705631266,"score_spread":0.19657658231596786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913147510","genre_codex":"methods","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.020300653,0.07539285,0.63546425,0.024203205,0.049659457,0.0005486801,0.0012767765,0.0030156851,0.19013844],"genre_scores_gemma":[0.16636431,0.061794907,0.47455302,0.0073288223,0.032090437,0.00066974945,0.008558013,0.002872552,0.24576823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99477684,0.0019251889,0.00047667834,0.00086530455,0.0014848494,0.00047112646],"domain_scores_gemma":[0.9884115,0.0063470122,0.00023300848,0.0018879701,0.0023437098,0.0007767791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011100207,0.0014894841,0.002771539,0.0022126662,0.0018795559,0.0100367125,0.0031232433,0.0020296392,0.04816966],"category_scores_gemma":[0.010647211,0.0011647614,0.0024551677,0.0028414084,0.0038659007,0.010029702,0.0038750945,0.006509716,0.0070613143],"study_design_candidate":"not_applicable","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.0011636963,0.000829126,0.0014630583,0.0011837026,0.00042469185,0.0004861152,0.0013121162,0.0059772837,0.005078945,0.24695884,0.30086005,0.43426242],"study_design_scores_gemma":[0.0002660047,0.00018710291,0.0013559527,0.0005886171,0.00022806705,0.00070054975,0.0002968832,0.031698722,0.0041384483,0.24592872,0.71452,0.00009098272],"about_ca_topic_score_codex":0.005493738,"about_ca_topic_score_gemma":0.0056158146,"teacher_disagreement_score":0.04816966,"about_ca_system_score_codex":0.004125696,"about_ca_system_score_gemma":0.004646645,"threshold_uncertainty_score":0.1611436},"labels":[],"label_agreement":null},{"id":"W2913899044","doi":"10.1093/jigpal/jzy065","title":"A note on logics of essence and accident","year":2018,"lang":"en","type":"article","venue":"Logic Journal of IGPL","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Accident (philosophy); Computer science; Epistemology; Philosophy","score_opus":0.020744347894011847,"score_gpt":0.2805839512455312,"score_spread":0.25983960335151934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913899044","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.07433828,0.005014694,0.6656893,0.056306895,0.0015161191,0.000112757574,0.00030155666,0.0007495477,0.19597095],"genre_scores_gemma":[0.9345735,0.0018349162,0.051747415,0.0037542009,0.0010367095,0.0000960291,0.000110231544,0.00009845667,0.006748596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913812,0.004173402,0.0005363205,0.0008309983,0.0021152438,0.00096279976],"domain_scores_gemma":[0.9741994,0.019271689,0.0014512556,0.0022012796,0.001840147,0.0010362812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012339035,0.00047101785,0.0010739634,0.0024833702,0.004115779,0.0071434276,0.0023515811,0.0033494732,0.0065798336],"category_scores_gemma":[0.020223072,0.0005454731,0.0020435532,0.0026966713,0.022618055,0.029350298,0.008148542,0.0076381788,0.00034576838],"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.000009775881,0.000003400396,0.000076284115,0.000011879725,0.0000021196536,0.000022124952,0.00023324466,0.00022079582,0.000039811435,0.9981658,0.00029103606,0.00092367054],"study_design_scores_gemma":[0.000010257214,0.0000109647235,0.00007566893,0.000014774023,0.0000076323195,0.00004456937,0.00034655395,0.0013114649,0.00014716123,0.9925005,0.005519041,0.000011263014],"about_ca_topic_score_codex":0.008044168,"about_ca_topic_score_gemma":0.0039442205,"teacher_disagreement_score":0.012339035,"about_ca_system_score_codex":0.004376303,"about_ca_system_score_gemma":0.0028959173,"threshold_uncertainty_score":0.06525588},"labels":[],"label_agreement":null},{"id":"W2914643333","doi":"10.1017/s1755020319000054","title":"BUNDER’S PARADOX","year":2019,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Toronto","funders":"","keywords":"Prima facie; Class (philosophy); Resolution (logic); Logical consequence; Consistency (knowledge bases); Calculus (dental); Mathematics; Non-classical logic; Mathematical economics; Computer science; Discrete mathematics; Philosophy; Epistemology; Programming language","score_opus":0.016844996660568608,"score_gpt":0.26312019735235864,"score_spread":0.24627520069179004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914643333","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.0659707,0.033070724,0.13531429,0.12834837,0.0022656054,0.000068826135,0.00034126482,0.00054650166,0.63407373],"genre_scores_gemma":[0.89286065,0.010993994,0.02749956,0.01554078,0.0012341443,0.00013643246,0.00015516987,0.0002364337,0.051342834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696225,0.0012757244,0.00013412969,0.0005082513,0.00090571604,0.00021390265],"domain_scores_gemma":[0.99760854,0.001313662,0.00017475542,0.0004151819,0.0003160633,0.00017175001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037748325,0.0003573229,0.00072592736,0.0015370928,0.0027642616,0.005434412,0.0012886077,0.0030571567,0.005766498],"category_scores_gemma":[0.007239683,0.00040170577,0.00061762315,0.0012185466,0.010911442,0.010522193,0.004172094,0.005429129,0.0010288797],"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.0000042664738,0.0000033272295,0.000026612264,0.000014204215,0.000002778223,0.000027435957,0.00018065973,0.00014906781,0.000048862606,0.9953269,0.0021757055,0.002040192],"study_design_scores_gemma":[0.0000056719523,0.0000027896915,0.000029634424,0.000033621218,0.0000025991205,0.000053901404,0.00008064503,0.0006987508,0.00010100502,0.974968,0.024017392,0.000006039766],"about_ca_topic_score_codex":0.0035830066,"about_ca_topic_score_gemma":0.002797018,"teacher_disagreement_score":0.005766498,"about_ca_system_score_codex":0.0039249854,"about_ca_system_score_gemma":0.0020974772,"threshold_uncertainty_score":0.028477848},"labels":[],"label_agreement":null},{"id":"W2914998942","doi":"","title":"Goal change","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"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 Toronto; York University","funders":"","keywords":"Situation calculus; Action (physics); Belief revision; Computer science; Calculus (dental); Contraction (grammar); Mathematical economics; Artificial intelligence; Epistemology; Mathematics; Philosophy; Linguistics; Physics","score_opus":0.1718701374104723,"score_gpt":0.3329877338590056,"score_spread":0.1611175964485333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914998942","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.014710581,0.0006537697,0.7868192,0.0039942786,0.0004673866,0.00063813204,0.000263287,0.0016479245,0.19080546],"genre_scores_gemma":[0.5748085,0.0006311265,0.35583705,0.0024495365,0.00018586688,0.0011952082,0.00062270585,0.0009046563,0.063365445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369353,0.002185727,0.00031798365,0.0017228833,0.001594638,0.00048523402],"domain_scores_gemma":[0.99046564,0.0032342605,0.0007361978,0.003108155,0.0019476229,0.00050815596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057918658,0.0011017155,0.000576684,0.0010884125,0.0017075154,0.0030669752,0.002439798,0.002362263,0.014386291],"category_scores_gemma":[0.021123447,0.00046385988,0.0019668739,0.0008034904,0.0036243587,0.006284754,0.005918403,0.0034110232,0.0033785948],"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.00009459555,0.00010572236,0.0011384581,0.00023598142,0.00005661809,0.00012763795,0.0027537225,0.0018794792,0.0019679929,0.892814,0.0062848907,0.09254097],"study_design_scores_gemma":[0.00007847019,0.00016844369,0.0011919668,0.00018082971,0.00009502485,0.000344182,0.0013136428,0.011312771,0.00512962,0.82945263,0.15068264,0.000049702994],"about_ca_topic_score_codex":0.0018059778,"about_ca_topic_score_gemma":0.0015789218,"teacher_disagreement_score":0.014386291,"about_ca_system_score_codex":0.0020328504,"about_ca_system_score_gemma":0.0020237013,"threshold_uncertainty_score":0.048126936},"labels":[],"label_agreement":null},{"id":"W2921568387","doi":"10.13130/2037-4445/11095","title":"The Link between Misinterpretation, Intentionality, and Mental Agency in the Natural Language Interpretation of “Fake”","year":2018,"lang":"en","type":"article","venue":"Riviste UNIMI (Università degli studi di Milano)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Intentionality; Interpretation (philosophy); Epistemology; Misrepresentation; Philosophy of language; Attribution; Natural (archaeology); Natural language; Philosophy; Linguistics; Psychology; Social psychology; Metaphysics","score_opus":0.010865284779403388,"score_gpt":0.25089623778883435,"score_spread":0.24003095300943098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921568387","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.202133,0.0045649703,0.64260817,0.037081964,0.00059341907,0.000102524275,0.00029724283,0.00062433485,0.11199445],"genre_scores_gemma":[0.97197324,0.0004901921,0.024873232,0.0008044192,0.00019262088,0.00005927533,0.000071061986,0.00010185276,0.0014340692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98851866,0.0070981057,0.000748263,0.0014584375,0.0014729521,0.0007035057],"domain_scores_gemma":[0.9873396,0.00790853,0.0015468746,0.001927446,0.0009573771,0.00032008503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008634201,0.000993723,0.00080155785,0.004046782,0.004202513,0.0094712665,0.002206109,0.0048448835,0.0031518869],"category_scores_gemma":[0.013478043,0.0009326258,0.0022393665,0.0023501173,0.042778917,0.025979972,0.006893218,0.0050832336,0.00039870956],"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.000021048018,0.000009909788,0.00042763012,0.000044037304,0.000014342418,0.000093905226,0.006211677,0.00032025282,0.00029543336,0.9900849,0.00035606223,0.0021208015],"study_design_scores_gemma":[0.000013109128,0.000016698883,0.0005203262,0.000043852895,0.000028771172,0.00023613035,0.0019346343,0.002490585,0.0006047918,0.9892107,0.004864823,0.00003557607],"about_ca_topic_score_codex":0.0033243073,"about_ca_topic_score_gemma":0.002026386,"teacher_disagreement_score":0.0094712665,"about_ca_system_score_codex":0.0050959582,"about_ca_system_score_gemma":0.0014514558,"threshold_uncertainty_score":0.045662522},"labels":[],"label_agreement":null},{"id":"W2921605904","doi":"10.5539/jmr.v11n2p92","title":"Dialectical Logic and Boolean Algebra","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dialectic; Mathematics; Truth value; Many-valued logic; Boolean algebra; Predicate logic; Intuitionistic logic; Algebra over a field; Philosophy of logic; Truth table; Calculus (dental); Discrete mathematics; Epistemology; Pure mathematics; Algorithm; Philosophy; Computer science; Theoretical computer science; Description logic; Propositional calculus; Programming language","score_opus":0.08188865844464233,"score_gpt":0.3705062322240649,"score_spread":0.2886175737794226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921605904","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.04522389,0.089135595,0.33882093,0.027139803,0.0011469238,0.00009125187,0.00060912606,0.00037890612,0.49745354],"genre_scores_gemma":[0.89872605,0.017601795,0.045033854,0.002582039,0.0011690364,0.00015613202,0.00035411498,0.00006959428,0.034307323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850035,0.000638003,0.000088874775,0.0002462809,0.000385418,0.0001409933],"domain_scores_gemma":[0.9989981,0.0005724894,0.000094757015,0.00007461769,0.00019850589,0.00006150845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015674536,0.000439498,0.00053905864,0.0020490394,0.0015955255,0.003365739,0.00064782356,0.0008238861,0.005018787],"category_scores_gemma":[0.0022233753,0.00019709874,0.00058516196,0.0027193152,0.0059586647,0.006780568,0.0016485952,0.0021529447,0.00079084426],"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.0000017962016,0.0000016633725,0.000026794061,0.0000142084,0.0000017755563,0.0000128459915,0.000091194335,0.00011323101,0.00004500352,0.99767214,0.00046861995,0.0015506636],"study_design_scores_gemma":[0.0000020569685,0.0000024432625,0.0000352834,0.0000108407085,0.0000015948317,0.000028669778,0.000056962257,0.0007043915,0.000051846127,0.9885337,0.010569855,0.0000023605492],"about_ca_topic_score_codex":0.0030645179,"about_ca_topic_score_gemma":0.001444381,"teacher_disagreement_score":0.005018787,"about_ca_system_score_codex":0.004126903,"about_ca_system_score_gemma":0.001080536,"threshold_uncertainty_score":0.02994293},"labels":[],"label_agreement":null},{"id":"W2924586844","doi":"10.1007/s11098-019-01275-3","title":"Causation in terms of production","year":2019,"lang":"en","type":"article","venue":"Philosophical Studies","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Causation; Judgement; Philosophy of language; Event (particle physics); Epistemology; Philosophy of mind; Production (economics); Semantics (computer science); Philosophy; Metaphysics; Test (biology); Computer science; Economics; Physics","score_opus":0.05111199831809888,"score_gpt":0.29743400202177184,"score_spread":0.24632200370367296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924586844","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.030500555,0.018477792,0.5632327,0.03281301,0.0010190319,0.00012666052,0.00047005236,0.0002458239,0.3531144],"genre_scores_gemma":[0.89340323,0.0057211993,0.076364145,0.0019418286,0.0013435514,0.00032655944,0.0003110218,0.00014349594,0.020444993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962748,0.0020826338,0.00020454981,0.0005962151,0.00061311334,0.00022873825],"domain_scores_gemma":[0.9928336,0.0052957805,0.00037672409,0.0008463779,0.00048282222,0.00016468641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046405173,0.00080833695,0.0010115192,0.0033425097,0.0022933097,0.0066012945,0.001846444,0.0024305808,0.00902984],"category_scores_gemma":[0.008900154,0.0007359161,0.0012890581,0.002065414,0.016048126,0.012965834,0.002457723,0.0036254264,0.0009161985],"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.0000020648968,0.0000024423139,0.000041365183,0.000009476837,0.0000028225568,0.000014587737,0.00008970106,0.00013223042,0.000017734397,0.99887437,0.00017480637,0.0006382283],"study_design_scores_gemma":[0.0000026766418,0.0000018160252,0.000046563437,0.00000948088,0.0000028521413,0.000022142694,0.000028279454,0.0003802536,0.00003009514,0.99771607,0.0017579657,0.0000019564643],"about_ca_topic_score_codex":0.002629901,"about_ca_topic_score_gemma":0.0018683707,"teacher_disagreement_score":0.00902984,"about_ca_system_score_codex":0.0028621245,"about_ca_system_score_gemma":0.0016268463,"threshold_uncertainty_score":0.030207813},"labels":[],"label_agreement":null},{"id":"W2935729958","doi":"10.1017/s1755020319000170","title":"QUANTIFIED INTUITIONISTIC LOGIC OVER METRIZABLE SPACES","year":2019,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Metrization theorem; Mathematics; Separable space; Countable set; Cardinality (data modeling); Constant (computer programming); Space (punctuation); Domain (mathematical analysis); Zero (linguistics); Real line; Zero-dimensional space; Discrete mathematics; Pure mathematics; Topological space; Topological vector space; Mathematical analysis; Computer science","score_opus":0.025079249016283587,"score_gpt":0.2841647421312685,"score_spread":0.2590854931149849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935729958","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.27369434,0.022778427,0.59214944,0.01040124,0.00027387196,0.000096246855,0.0007539708,0.0003600769,0.09949242],"genre_scores_gemma":[0.9553256,0.0035692817,0.03584909,0.0006048689,0.00023957425,0.00005661066,0.00026480568,0.000023815468,0.0040663383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975616,0.00085421494,0.00020183065,0.00035181368,0.0008538289,0.00017675075],"domain_scores_gemma":[0.997279,0.0015230357,0.0002737527,0.0002626808,0.00051295507,0.0001485234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002749244,0.00044441276,0.00062082364,0.0019680744,0.0008803533,0.0035058318,0.0009774007,0.0007309863,0.0013961098],"category_scores_gemma":[0.003787789,0.0003880315,0.0007731667,0.0024118586,0.0063792346,0.0070965867,0.0022292167,0.0024922714,0.00020404003],"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.000012689962,0.0000069322773,0.0001221549,0.00008794855,0.000016682341,0.00003313765,0.00017243039,0.0014976384,0.00033706715,0.99414355,0.00028871812,0.0032811302],"study_design_scores_gemma":[0.000011894483,0.000010703058,0.0002712537,0.000048787606,0.00001263494,0.000046233577,0.00007566743,0.005482164,0.0005539438,0.9887925,0.004683517,0.000010730562],"about_ca_topic_score_codex":0.0027129177,"about_ca_topic_score_gemma":0.0017149631,"teacher_disagreement_score":0.0035058318,"about_ca_system_score_codex":0.0032189696,"about_ca_system_score_gemma":0.0013001338,"threshold_uncertainty_score":0.023355305},"labels":[],"label_agreement":null},{"id":"W2945261847","doi":"10.1007/978-3-030-20528-7_20","title":"Verifying Strong Equivalence of Programs in the Input Language of gringo","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Equivalence (formal languages); Programming language; Automated theorem proving; Set (abstract data type); Dynamic and formal equivalence; Logical equivalence; Well-formed formula; Vampire; Artificial intelligence; Natural language processing; Algebra over a field; Algorithm; Propositional variable; Discrete mathematics; Machine translation; Mathematics; Description logic; Intermediate logic; Pure mathematics","score_opus":0.03437507202296265,"score_gpt":0.26434250428505013,"score_spread":0.2299674322620875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945261847","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.18519059,0.00026020253,0.7786702,0.002142687,0.00036726895,0.00034036883,0.00079415285,0.007923789,0.024310773],"genre_scores_gemma":[0.8651996,0.00013928254,0.12742643,0.00060248404,0.00013239602,0.00019970852,0.0012200244,0.0011054826,0.003974609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895844,0.002909489,0.0006581935,0.0019026743,0.0033837354,0.0015614565],"domain_scores_gemma":[0.98242885,0.011706462,0.0007850777,0.0029392669,0.0017155581,0.00042480318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005549883,0.0008586834,0.0012996311,0.0009357593,0.0012927183,0.0036791798,0.0026522346,0.0018084017,0.005163911],"category_scores_gemma":[0.02318697,0.001011196,0.0025801936,0.0006109882,0.004330192,0.0076282388,0.0070379293,0.0047658454,0.0009226658],"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.0020716283,0.00078618515,0.0066076615,0.0010606513,0.0002638287,0.0016971123,0.0033388515,0.04171563,0.03698542,0.8268902,0.00705044,0.07153234],"study_design_scores_gemma":[0.00036385885,0.00040397103,0.001347959,0.00016660342,0.00018739479,0.0003493252,0.0005942893,0.11817919,0.04894988,0.81910634,0.010272282,0.00007891719],"about_ca_topic_score_codex":0.0021787384,"about_ca_topic_score_gemma":0.0019457123,"teacher_disagreement_score":0.005549883,"about_ca_system_score_codex":0.00193145,"about_ca_system_score_gemma":0.0023354215,"threshold_uncertainty_score":0.029350936},"labels":[],"label_agreement":null},{"id":"W2945270526","doi":"10.1007/978-3-030-20528-7_21","title":"The Return of xorro","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Parity (physics); Theoretical computer science; Gauss; Variety (cybernetics); Artificial intelligence","score_opus":0.0142038248691278,"score_gpt":0.2328176265358851,"score_spread":0.2186138016667573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945270526","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.02768052,0.004963309,0.15598822,0.013063683,0.00447563,0.000085713924,0.0010329908,0.0037611132,0.78894883],"genre_scores_gemma":[0.35079584,0.0033281152,0.04544219,0.004616635,0.0016653746,0.00015329037,0.0014048001,0.0035187015,0.5890751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986331,0.00025037245,0.000060874925,0.0002937419,0.00049434375,0.0002674951],"domain_scores_gemma":[0.99813384,0.00047329033,0.000095363,0.0008580199,0.00032513385,0.00011440483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012810901,0.0006430323,0.0006234519,0.001054808,0.0018161591,0.0049384516,0.0015225635,0.0013686012,0.049327753],"category_scores_gemma":[0.0061043566,0.00048510707,0.00066380453,0.0013263108,0.0031303596,0.012184223,0.0038767532,0.0023457464,0.014680124],"study_design_candidate":"not_applicable","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.00015063478,0.000022582086,0.0003353136,0.00008203143,0.000013035265,0.00008774959,0.00020797968,0.00052178866,0.0011887792,0.8909085,0.030900925,0.07558069],"study_design_scores_gemma":[0.000019048635,0.000042968535,0.00027855698,0.000111324436,0.000031668635,0.00040128714,0.0002723058,0.0034400213,0.005424909,0.5074224,0.48252425,0.000031311327],"about_ca_topic_score_codex":0.0014393616,"about_ca_topic_score_gemma":0.0019351587,"teacher_disagreement_score":0.049327753,"about_ca_system_score_codex":0.0015221839,"about_ca_system_score_gemma":0.001136295,"threshold_uncertainty_score":0.16501778},"labels":[],"label_agreement":null},{"id":"W2945789544","doi":"10.5539/jmr.v11n3p50","title":"Atomic Proposition and 1-Order Predicate Function for Dialectical Logic","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Proposition; Predicate logic; Dialectic; Mathematics; Contradiction; First-order logic; Predicate variable; Atomic sentence; Many-valued logic; Predicate (mathematical logic); Higher-order logic; Calculus (dental); Algebra over a field; Epistemology; Discrete mathematics; Zeroth-order logic; Computer science; Pure mathematics; Theoretical computer science; Multimodal logic; Artificial intelligence; Programming language; Description logic; Philosophy","score_opus":0.07008111503639396,"score_gpt":0.3630954509942305,"score_spread":0.29301433595783655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945789544","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.023243245,0.0044041327,0.8953058,0.0032701278,0.00044963683,0.00007112544,0.0002729363,0.00053023227,0.07245275],"genre_scores_gemma":[0.7340801,0.003695236,0.23807505,0.0012405239,0.000629765,0.00025173236,0.00049265183,0.00019795053,0.021337045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852943,0.00049265334,0.00013423755,0.00030937226,0.0004059426,0.00012832673],"domain_scores_gemma":[0.99931467,0.00033006747,0.00004650081,0.00012884043,0.0001317555,0.00004820944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021224339,0.0005321765,0.00055882765,0.0014919328,0.0014316161,0.0035469215,0.00069913757,0.0010454243,0.0037232738],"category_scores_gemma":[0.0023997827,0.0002637249,0.0010321814,0.001365117,0.0043772236,0.008661439,0.0024118,0.0027754745,0.0009664251],"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.000003782248,0.0000028700106,0.000041206094,0.000018701117,0.0000024599965,0.0000145057265,0.00013394032,0.00022464007,0.00016688705,0.9955747,0.000284854,0.003531428],"study_design_scores_gemma":[0.000003382691,0.00000816132,0.000060261336,0.000011634474,0.000008224789,0.00006273829,0.000042727854,0.0028788215,0.00049071613,0.98414534,0.012279873,0.000008079595],"about_ca_topic_score_codex":0.0012431476,"about_ca_topic_score_gemma":0.00063066767,"teacher_disagreement_score":0.0037232738,"about_ca_system_score_codex":0.0024600225,"about_ca_system_score_gemma":0.0011577724,"threshold_uncertainty_score":0.01784879},"labels":[],"label_agreement":null},{"id":"W2946162694","doi":"10.1007/978-3-030-20528-7_12","title":"Towards Dynamic Answer Set Programming over Finite Traces","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Linear temporal logic; Dynamic logic (digital electronics); Temporal logic; Converse; Set (abstract data type); Context (archaeology); Answer set programming; Theoretical computer science; Interval temporal logic; Temporal logic of actions; Dynamic programming; Logic programming; Programming language; Algorithm; Mathematics","score_opus":0.015763986132803807,"score_gpt":0.2569358012840304,"score_spread":0.24117181515122657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946162694","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.004025455,0.0002044663,0.98714614,0.0005799964,0.00007450829,0.000060888844,0.00013723645,0.001627919,0.0061434526],"genre_scores_gemma":[0.12399912,0.0005964671,0.85962945,0.0005318761,0.00018682078,0.00027530128,0.0009577588,0.0011037021,0.012719476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504095,0.001180958,0.00041383773,0.0010913133,0.0016920944,0.0005808404],"domain_scores_gemma":[0.993937,0.0040057544,0.00019314715,0.0009940587,0.0006382801,0.00023167803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005149825,0.0013313771,0.001724185,0.0022431102,0.0016456555,0.0067652124,0.005476448,0.002289321,0.009614649],"category_scores_gemma":[0.011731176,0.0018995246,0.0033853804,0.0031140966,0.004162517,0.013633641,0.008314296,0.0086274445,0.002577065],"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.000068706024,0.00006234131,0.0001702048,0.00018702347,0.000037758473,0.00006416235,0.00046991784,0.011563649,0.0014377661,0.91667265,0.0027875,0.06647839],"study_design_scores_gemma":[0.00001734091,0.000012441281,0.000027891383,0.000050573402,0.000023540606,0.000033378048,0.000085484484,0.041479804,0.0015378464,0.9475347,0.009182638,0.000014414546],"about_ca_topic_score_codex":0.003282749,"about_ca_topic_score_gemma":0.0039155395,"teacher_disagreement_score":0.009614649,"about_ca_system_score_codex":0.0027970138,"about_ca_system_score_gemma":0.0023208405,"threshold_uncertainty_score":0.032164216},"labels":[],"label_agreement":null},{"id":"W2949214568","doi":"10.48550/arxiv.1509.02012","title":"Bounded Situation Calculus Action Theories","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"York University","funders":"","keywords":"Decidability; Bounded function; Action (physics); Extension (predicate logic); Situation calculus; Action theory (sociology); Object (grammar); Calculus (dental); Mathematics; Tuple; Computer science; Algebra over a field; Mathematical economics; Discrete mathematics; Pure mathematics; Epistemology; Artificial intelligence; Philosophy","score_opus":0.1107812676465257,"score_gpt":0.21931301268465314,"score_spread":0.10853174503812744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949214568","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.025944188,0.0011855486,0.9166302,0.002808417,0.00021685947,0.00021568692,0.00046926152,0.0010066007,0.051523305],"genre_scores_gemma":[0.59372455,0.0010195918,0.3889439,0.00094949576,0.0003537551,0.0006238807,0.00075209036,0.00026495857,0.013367795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99444604,0.0017882085,0.00040437165,0.0010448329,0.0015734748,0.00074302655],"domain_scores_gemma":[0.9917589,0.0048765005,0.00058668514,0.0014378442,0.0008688151,0.00047130373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005451614,0.0011537826,0.0010301066,0.0018705584,0.0030261816,0.0044187056,0.0032546392,0.0019321662,0.007334115],"category_scores_gemma":[0.01125743,0.00086560973,0.0026263113,0.0014810256,0.008505611,0.01096286,0.004835498,0.0047565135,0.0010600939],"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.00001041662,0.000009039541,0.000113317095,0.000031250976,0.0000072702182,0.000075054835,0.00026143226,0.0014469433,0.00022822192,0.99532557,0.0003444639,0.00214693],"study_design_scores_gemma":[0.000015463911,0.00001196829,0.00007338924,0.000027480208,0.000016320177,0.00006638573,0.000085315136,0.013600778,0.00052391336,0.9775099,0.008055513,0.00001345998],"about_ca_topic_score_codex":0.005401705,"about_ca_topic_score_gemma":0.0031718893,"teacher_disagreement_score":0.007334115,"about_ca_system_score_codex":0.0035915321,"about_ca_system_score_gemma":0.002474149,"threshold_uncertainty_score":0.028831244},"labels":[],"label_agreement":null},{"id":"W2949282174","doi":"10.48550/arxiv.1106.3457","title":"Extensional Higher-Order Logic Programming","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Victoria","funders":"","keywords":"Extensional definition; Logic programming; Semantics (computer science); Stable model semantics; Tuple; Well-founded semantics; Programming language; Resolution (logic); Computer science; Mathematics; Order (exchange); Operator (biology); Higher-order logic; Algorithm; Theoretical computer science; Discrete mathematics; Operational semantics; Denotational semantics; Description logic","score_opus":0.11137449646984258,"score_gpt":0.19753888871066289,"score_spread":0.0861643922408203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949282174","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.009119827,0.00044177484,0.9753925,0.0010035494,0.00011381685,0.00006450726,0.0001491601,0.00034450967,0.013370262],"genre_scores_gemma":[0.36673567,0.00074917264,0.6215029,0.00078047416,0.00035162712,0.00020304845,0.0003781164,0.00013819669,0.009160857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973091,0.00093865354,0.00021944741,0.00042965042,0.00092092156,0.00018220558],"domain_scores_gemma":[0.99803656,0.0008235713,0.00016185461,0.000524644,0.00032418573,0.00012925948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039572055,0.0007241419,0.0006597281,0.0015347002,0.0009114045,0.0035263058,0.0026966366,0.0008633763,0.004487081],"category_scores_gemma":[0.003210332,0.0004118383,0.0018361823,0.0015665106,0.0034072646,0.007811238,0.0035340926,0.0031661747,0.0006876742],"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.000010944729,0.000027175978,0.000090558606,0.000056987497,0.000011727255,0.00006148194,0.00013937015,0.002016994,0.0006069509,0.9858031,0.00047480347,0.010699886],"study_design_scores_gemma":[0.000018295217,0.000021417894,0.000072814,0.00002280284,0.000014549238,0.00012871232,0.00004557118,0.017767405,0.00095291104,0.9695087,0.011435003,0.000011826123],"about_ca_topic_score_codex":0.0005523499,"about_ca_topic_score_gemma":0.0009854616,"teacher_disagreement_score":0.004487081,"about_ca_system_score_codex":0.0015263981,"about_ca_system_score_gemma":0.0010749768,"threshold_uncertainty_score":0.020927966},"labels":[],"label_agreement":null},{"id":"W2949547536","doi":"10.48550/arxiv.1809.10106","title":"Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Workflow; PSPACE; Hierarchy; Computer science; Theoretical computer science; Polynomial hierarchy; Time complexity; Computational complexity theory; Algorithm; Database","score_opus":0.11579858459840973,"score_gpt":0.21846389457781396,"score_spread":0.10266530997940422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949547536","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.01864998,0.002428743,0.93973625,0.009919875,0.0003199263,0.00023846432,0.0012038922,0.0008697336,0.026633149],"genre_scores_gemma":[0.4505309,0.006229715,0.5177117,0.0035892108,0.001646605,0.0006467493,0.0033375183,0.0007910064,0.015516618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423414,0.0014093505,0.00045354143,0.0013924895,0.0018964126,0.00061392074],"domain_scores_gemma":[0.9796326,0.015798317,0.0008574394,0.0021297415,0.0011475291,0.0004344202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054623308,0.0017935478,0.0014211161,0.0022696047,0.0016174444,0.0057528038,0.0029939204,0.0020958758,0.008387422],"category_scores_gemma":[0.0253039,0.0009010221,0.004278188,0.0036472501,0.00481719,0.01536379,0.005061693,0.01149205,0.0010805705],"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.00014834928,0.00012055617,0.0004912469,0.00056678866,0.00007648655,0.0002052974,0.00039825772,0.07249,0.0010095208,0.8745676,0.009050229,0.04087568],"study_design_scores_gemma":[0.000023425957,0.00002925074,0.00012485286,0.000073390074,0.00004513534,0.00012355973,0.00007890406,0.09041149,0.0009824832,0.90090483,0.0071787555,0.000023840792],"about_ca_topic_score_codex":0.00454688,"about_ca_topic_score_gemma":0.0029319925,"teacher_disagreement_score":0.008387422,"about_ca_system_score_codex":0.0057273842,"about_ca_system_score_gemma":0.0029416543,"threshold_uncertainty_score":0.041555226},"labels":[],"label_agreement":null},{"id":"W2949892358","doi":"10.1088/1742-6596/67/1/012018","title":"An exercise in \"anhomomorphic logic\"","year":2007,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Boolean algebra; Homomorphism; Algebra over a field; Truth value; Set (abstract data type); Quantum logic; Mathematics; Space (punctuation); Simple (philosophy); Pure mathematics; Free Boolean algebra; Discrete mathematics; Two-element Boolean algebra; Computer science; Quantum; Epistemology; Physics; Programming language; Philosophy; Quantum computer; Algebra representation; Quantum mechanics","score_opus":0.02882233316596496,"score_gpt":0.2710308797134743,"score_spread":0.2422085465475093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949892358","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.018496241,0.007870751,0.2897393,0.2347003,0.005529074,0.000111754875,0.00031428467,0.0012704524,0.4419678],"genre_scores_gemma":[0.68421143,0.0038784046,0.19069853,0.041434158,0.0066106715,0.0003864948,0.00021915653,0.00048402426,0.07207715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976186,0.0015653596,0.000069639944,0.00032351518,0.00032863487,0.000094221126],"domain_scores_gemma":[0.9979697,0.001151965,0.00009326054,0.00044219953,0.00021597976,0.00012697764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033139705,0.00071726076,0.00038647253,0.0009205175,0.0034920024,0.0034935141,0.0012881622,0.0020368467,0.008010372],"category_scores_gemma":[0.005600989,0.00024966322,0.0005355725,0.00085083605,0.02211215,0.012004131,0.004064231,0.004199906,0.0018224344],"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.0000054178863,0.0000033293238,0.000020524842,0.000009196661,0.0000010573794,0.000014908747,0.00028367224,0.000041626216,0.00003450174,0.993233,0.003917745,0.0024349669],"study_design_scores_gemma":[0.0000067667556,0.000010844929,0.000036254827,0.000017216813,0.0000015037284,0.000052016807,0.0001328682,0.00041682355,0.00008429331,0.9603703,0.03886567,0.0000054159914],"about_ca_topic_score_codex":0.0013496265,"about_ca_topic_score_gemma":0.0011379898,"teacher_disagreement_score":0.008010372,"about_ca_system_score_codex":0.0018351263,"about_ca_system_score_gemma":0.0011493476,"threshold_uncertainty_score":0.026797295},"labels":[],"label_agreement":null},{"id":"W2949930629","doi":"10.48550/arxiv.1402.7276","title":"Robot Location Estimation in the Situation Calculus","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Extension (predicate logic); Estimation; Task (project management); Computer science; Robot; Artificial intelligence; Situation calculus; State (computer science); Calculus (dental); Mathematics; Algorithm; Engineering; Programming language","score_opus":0.05766713645906969,"score_gpt":0.1992927644338115,"score_spread":0.14162562797474182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949930629","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.014462966,0.0004776385,0.9695991,0.0016274586,0.00006338629,0.000058990354,0.00021576582,0.000391674,0.013103006],"genre_scores_gemma":[0.5558549,0.0010927336,0.43606377,0.00038089254,0.00023967386,0.00018921398,0.00043392938,0.00012784386,0.005616985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524975,0.00164584,0.00039251512,0.0008814762,0.00136521,0.00046517467],"domain_scores_gemma":[0.9967874,0.0017740952,0.00030721983,0.00055250013,0.00041179932,0.0001670287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048405356,0.0009220321,0.00092694943,0.0016095985,0.0021920165,0.005601749,0.002684535,0.0019072973,0.0032583755],"category_scores_gemma":[0.009386531,0.000888451,0.002530703,0.0019522104,0.0068149706,0.010157128,0.0046610325,0.0033726576,0.00072354625],"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.000039467668,0.000014579758,0.00024980638,0.0000564314,0.000023277398,0.00020407258,0.00040730528,0.024859188,0.00042690377,0.9644122,0.0007295231,0.008577221],"study_design_scores_gemma":[0.00001726482,0.00000956037,0.0000811555,0.000019523011,0.000022983972,0.000067368484,0.000087839595,0.060317975,0.0004201245,0.9352548,0.0036823873,0.000018982593],"about_ca_topic_score_codex":0.010855507,"about_ca_topic_score_gemma":0.005969053,"teacher_disagreement_score":0.010855507,"about_ca_system_score_codex":0.0033911949,"about_ca_system_score_gemma":0.0021149646,"threshold_uncertainty_score":0.02559954},"labels":[],"label_agreement":null},{"id":"W2950294459","doi":"10.48550/arxiv.cs/0604076","title":"Semantically Correct Query Answers in the Presence of Null Values","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Null (SQL); Computer science; Set (abstract data type); Semantics (computer science); Information retrieval; Database; Data mining; Theoretical computer science; Programming language","score_opus":0.032376436563827944,"score_gpt":0.2665857631665659,"score_spread":0.23420932660273797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950294459","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.058105502,0.00030669876,0.9305934,0.001936354,0.00011512703,0.00016037277,0.00064559974,0.0026304733,0.005506423],"genre_scores_gemma":[0.6281876,0.0005476189,0.36207014,0.0012515491,0.000173511,0.00028747643,0.0022273518,0.001033948,0.0042208354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97949684,0.0061294227,0.0025895545,0.0025318288,0.007807571,0.0014447412],"domain_scores_gemma":[0.9470753,0.0286321,0.0032195519,0.013487366,0.0070323623,0.0005532752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016236471,0.0010717773,0.0015738306,0.0019483912,0.0012423694,0.0064171664,0.003173277,0.0032949003,0.0031266806],"category_scores_gemma":[0.05732222,0.0011601328,0.0022237687,0.0019352878,0.004840462,0.0130184805,0.005819223,0.0029812737,0.0007899201],"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.00103156,0.0002587056,0.006361964,0.0009687782,0.00031794774,0.0029189524,0.0057918415,0.043024793,0.019784017,0.8461992,0.006418588,0.06692368],"study_design_scores_gemma":[0.00019276583,0.000165915,0.0006414226,0.00019534038,0.00039116116,0.0012738232,0.001521602,0.13338651,0.04793151,0.7874251,0.026757516,0.000117352385],"about_ca_topic_score_codex":0.0022960212,"about_ca_topic_score_gemma":0.0019748914,"teacher_disagreement_score":0.016236471,"about_ca_system_score_codex":0.0016879338,"about_ca_system_score_gemma":0.0032448946,"threshold_uncertainty_score":0.0858677},"labels":[],"label_agreement":null},{"id":"W2950467909","doi":"10.48550/arxiv.cs/0201029","title":"The Witness Properties and the Semantics of the Prolog Cut","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Prolog; Programming language; Witness; Computer science; Semantics (computer science)","score_opus":0.053946138709778074,"score_gpt":0.22571849429043925,"score_spread":0.17177235558066117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950467909","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.032831166,0.0004960102,0.9297701,0.0026313625,0.00018085235,0.00015862807,0.00027951962,0.0011743114,0.032478046],"genre_scores_gemma":[0.65975195,0.00054393464,0.329893,0.0008998688,0.00018182157,0.00031899422,0.00037203316,0.00053083303,0.007507551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712604,0.0010988775,0.00020036357,0.0004625227,0.00076790655,0.00034425405],"domain_scores_gemma":[0.9968374,0.0016085813,0.00026560176,0.00069982215,0.00042789674,0.00016069788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031553362,0.00043258077,0.000474888,0.00090223347,0.0014171455,0.005160982,0.0012998818,0.0014719891,0.004180461],"category_scores_gemma":[0.0069671497,0.0007535474,0.0010354987,0.0009404849,0.006883256,0.007966381,0.0032928337,0.004099581,0.00072326773],"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.000032852877,0.000011472769,0.00010288122,0.000055671266,0.000005542464,0.00008221342,0.00055063644,0.0013297463,0.0008347111,0.9897682,0.0005612292,0.0066648372],"study_design_scores_gemma":[0.00003451841,0.000041049207,0.00011181532,0.000046074758,0.00001983918,0.00015823865,0.00025287527,0.012190987,0.0025745672,0.9667846,0.01776366,0.000021761934],"about_ca_topic_score_codex":0.0014743563,"about_ca_topic_score_gemma":0.0009815061,"teacher_disagreement_score":0.005160982,"about_ca_system_score_codex":0.0013866646,"about_ca_system_score_gemma":0.0013875966,"threshold_uncertainty_score":0.016687214},"labels":[],"label_agreement":null},{"id":"W2950976113","doi":"10.48550/arxiv.1704.05136","title":"The Causality/Repair Connection in Databases: Causality-Programs","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Carleton University","funders":"","keywords":"Causality (physics); Connection (principal bundle); Database; Computer science; Engineering; Physics","score_opus":0.13697242787647293,"score_gpt":0.2363070126953324,"score_spread":0.09933458481885948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950976113","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.010111854,0.00045339068,0.9831012,0.0017917384,0.00011075503,0.0000927524,0.0001856208,0.0005384646,0.0036141821],"genre_scores_gemma":[0.4602432,0.0015511138,0.52840704,0.0013573617,0.00054922974,0.0004752142,0.00082898984,0.00057918206,0.0060085943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993111,0.0027492219,0.000500161,0.0013928512,0.0018326739,0.00041407094],"domain_scores_gemma":[0.9773572,0.0170347,0.00105698,0.0024686463,0.0016019164,0.00048061207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007349722,0.0008855947,0.00091399293,0.0020421387,0.0017985256,0.00460663,0.002488979,0.0027777622,0.00505583],"category_scores_gemma":[0.027769921,0.000924749,0.0021567272,0.0025971665,0.0061512776,0.013737552,0.0038952464,0.006566986,0.0005727439],"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.00008548164,0.00007206271,0.00084066973,0.00020389933,0.000032989283,0.00014537563,0.00059251115,0.01447608,0.0008495396,0.95686907,0.0016743015,0.024158048],"study_design_scores_gemma":[0.000018603063,0.000018888362,0.000097628814,0.000034592013,0.000037022266,0.00007476963,0.00010353833,0.04818965,0.0018726382,0.9444462,0.005087769,0.0000187781],"about_ca_topic_score_codex":0.0026470982,"about_ca_topic_score_gemma":0.0021155362,"teacher_disagreement_score":0.007349722,"about_ca_system_score_codex":0.0016137402,"about_ca_system_score_gemma":0.0024943727,"threshold_uncertainty_score":0.0388695},"labels":[],"label_agreement":null},{"id":"W2951037111","doi":"10.48550/arxiv.1303.1509","title":"The Probability of a Possibility: Adding Uncertainty to Default Rules","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conditional probability; Probabilistic logic; Unification; Counterfactual thinking; Computer science; Conditional expectation; Probability theory; Connection (principal bundle); Imprecise probability; Semantics (computer science); Counterfactual conditional; Belief revision; Orthogonality; Possible world; Artificial intelligence; Mathematical economics; Mathematics; Theoretical computer science; Econometrics; Epistemology; Statistics; Programming language; Philosophy","score_opus":0.06549259038419684,"score_gpt":0.19963299636535287,"score_spread":0.134140405981156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951037111","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.008355224,0.00021737529,0.9835622,0.00095803797,0.00008591831,0.000043083863,0.000109271576,0.00070701813,0.005961917],"genre_scores_gemma":[0.5196495,0.00035893443,0.47556987,0.0007397264,0.00032726917,0.00016241515,0.0001550462,0.00025230923,0.0027849416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921462,0.003378937,0.00078124856,0.0012137591,0.0020294406,0.00045044933],"domain_scores_gemma":[0.9871793,0.007763883,0.0009097117,0.0022932887,0.0012822162,0.0005717025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009866808,0.0008247049,0.0009485336,0.003106965,0.0018918692,0.006636676,0.0031435129,0.0022214002,0.005109873],"category_scores_gemma":[0.022487713,0.0008785973,0.0023886575,0.0015036395,0.006614754,0.015063287,0.005841907,0.004383627,0.00072116783],"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.00007364471,0.000028043163,0.00047495277,0.00007376435,0.000038396898,0.00021429146,0.000866325,0.006026485,0.0014927931,0.9580858,0.0012245105,0.03140103],"study_design_scores_gemma":[0.000024546905,0.000026641552,0.00014539421,0.000051474486,0.00006001557,0.0001836429,0.0000939143,0.05875392,0.0027681084,0.92843205,0.009404135,0.00005620118],"about_ca_topic_score_codex":0.0021889731,"about_ca_topic_score_gemma":0.001979099,"teacher_disagreement_score":0.009866808,"about_ca_system_score_codex":0.002256912,"about_ca_system_score_gemma":0.001600235,"threshold_uncertainty_score":0.052181244},"labels":[],"label_agreement":null},{"id":"W2951571114","doi":"10.48550/arxiv.cs/0203005","title":"A Framework for Compiling Preferences in Logic Programs","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Programming language","score_opus":0.16773530375962017,"score_gpt":0.32485050717357955,"score_spread":0.15711520341395938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951571114","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.0018953069,0.00007142908,0.9935986,0.00016533564,0.000032135486,0.00007925888,0.00011392661,0.001745019,0.0022989644],"genre_scores_gemma":[0.044851057,0.00025338464,0.95180523,0.00020156764,0.0000775631,0.0002538149,0.0003379772,0.0005446164,0.0016746322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728215,0.00071823475,0.00040089592,0.0005296052,0.0008023025,0.00026676586],"domain_scores_gemma":[0.9981482,0.0007489348,0.00017555272,0.0005362612,0.00030278077,0.00008824382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032147206,0.000876167,0.00077520957,0.0018638702,0.0009893517,0.0028984437,0.0018844922,0.0009899111,0.0045658904],"category_scores_gemma":[0.006989295,0.0009959983,0.0022266316,0.0018241466,0.0023618923,0.004712394,0.002862933,0.0030568023,0.0012970181],"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.00005347727,0.00007447823,0.00054531684,0.00028477845,0.000051200885,0.00028810813,0.00079068815,0.039835807,0.0036174853,0.8661135,0.0030685307,0.08527671],"study_design_scores_gemma":[0.000046958547,0.00006094577,0.00017879799,0.000113519294,0.000065507105,0.00024792625,0.00015834249,0.10056642,0.0071042525,0.83369935,0.05770924,0.000048745787],"about_ca_topic_score_codex":0.002843314,"about_ca_topic_score_gemma":0.002675757,"teacher_disagreement_score":0.0045658904,"about_ca_system_score_codex":0.0014928415,"about_ca_system_score_gemma":0.0020557332,"threshold_uncertainty_score":0.017001271},"labels":[],"label_agreement":null},{"id":"W2951744645","doi":"","title":"Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Cardinality (data modeling); Database theory; Semantics (computer science); Theoretical computer science; Context (archaeology); Data integrity; Query optimization; Consistency (knowledge bases); Sequence (biology); Graph database; Relational database; Graph; Programming language; Artificial intelligence","score_opus":0.15464241348109078,"score_gpt":0.22320044599683392,"score_spread":0.06855803251574313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951744645","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.42921385,0.0021356305,0.53025496,0.022720348,0.00021160673,0.00045828003,0.004253698,0.001982182,0.00876943],"genre_scores_gemma":[0.865679,0.0008034479,0.12617892,0.0008988383,0.00050941546,0.00027336643,0.0030316457,0.00038822574,0.0022372177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9733699,0.009085857,0.0023639086,0.0038628571,0.008787098,0.002530465],"domain_scores_gemma":[0.7897838,0.18354262,0.006838026,0.011612335,0.0054890513,0.0027342248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019394293,0.0011887165,0.004899139,0.0027414842,0.0027208934,0.016025785,0.0073889904,0.005448781,0.0074981228],"category_scores_gemma":[0.106879964,0.0018624044,0.0046606082,0.005582093,0.0054292115,0.032770403,0.0072518913,0.0065923817,0.0005042624],"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.004492417,0.0010185408,0.013874413,0.0014958351,0.0008054486,0.0008183901,0.0030488737,0.37952358,0.005306636,0.48199156,0.013139034,0.094485216],"study_design_scores_gemma":[0.0002471681,0.00010152178,0.000896468,0.00003897698,0.0002254508,0.00025850724,0.00064819114,0.44633585,0.0013399131,0.54908943,0.0007635181,0.000054973956],"about_ca_topic_score_codex":0.009931325,"about_ca_topic_score_gemma":0.008076185,"teacher_disagreement_score":0.019394293,"about_ca_system_score_codex":0.0073900395,"about_ca_system_score_gemma":0.0075013805,"threshold_uncertainty_score":0.10256803},"labels":[],"label_agreement":null},{"id":"W2951775186","doi":"10.48550/arxiv.cs/0302038","title":"Tight Logic Programs","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Transitive closure; Negation as failure; Negation; Logic program; Transitive relation; Closure (psychology); Predicate (mathematical logic); Computer science; Predicate logic; Mathematics; Discrete mathematics; Programming language; Calculus (dental); Stable model semantics; Logic programming; Description logic; Combinatorics; Multimodal logic","score_opus":0.07016123141956032,"score_gpt":0.2742394754585043,"score_spread":0.20407824403894398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951775186","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.06201983,0.0015722371,0.85359365,0.0026011902,0.00018337996,0.00016200598,0.0007570772,0.0019582827,0.077152364],"genre_scores_gemma":[0.78086466,0.0016568394,0.18328893,0.0013145184,0.00040615298,0.000302485,0.0013167768,0.00054077944,0.030308938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703324,0.0006413942,0.0001626908,0.00075326243,0.0010241438,0.00038524246],"domain_scores_gemma":[0.9955715,0.0022207063,0.00042662447,0.0007526633,0.0006964051,0.00033203277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023887882,0.0007323359,0.00075475115,0.0017930553,0.0013935235,0.0035542431,0.0012940464,0.0008748298,0.009040454],"category_scores_gemma":[0.009001153,0.00069783884,0.0009778081,0.0015829562,0.0042988616,0.008364297,0.004078829,0.0030946338,0.00090298976],"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.000021710992,0.000015215485,0.00016584288,0.00005013108,0.0000092008,0.00005592697,0.0003587485,0.0016771477,0.0005614396,0.9870329,0.0010067071,0.009045036],"study_design_scores_gemma":[0.000012986749,0.000021983977,0.00016474073,0.000030893116,0.000017665045,0.000089539884,0.00015449431,0.009216039,0.00093910587,0.9704488,0.018892037,0.000011693509],"about_ca_topic_score_codex":0.0026974988,"about_ca_topic_score_gemma":0.0020278716,"teacher_disagreement_score":0.009040454,"about_ca_system_score_codex":0.0016614723,"about_ca_system_score_gemma":0.0011884827,"threshold_uncertainty_score":0.030243278},"labels":[],"label_agreement":null},{"id":"W2951845000","doi":"10.48550/arxiv.1105.1364","title":"Achieving Data Privacy through Secrecy Views and Null-Based Virtual Updates","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Wien","keywords":"Computer science; Null (SQL); Secrecy; Tuple; SQL; Permission; Encryption; Information retrieval; Semantics (computer science); Set (abstract data type); Relational database; Database; Computer security; Programming language; Mathematics","score_opus":0.20961557508041806,"score_gpt":0.2291430928137637,"score_spread":0.01952751773334563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951845000","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.03511219,0.00031599446,0.9557505,0.0013959985,0.000060172104,0.000094062234,0.0002201258,0.00072777044,0.006323251],"genre_scores_gemma":[0.7453346,0.0006820183,0.24667083,0.0008584222,0.00028022332,0.00026494625,0.0004884754,0.00039223908,0.00502819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.984354,0.006298753,0.0016127721,0.0020958532,0.004585767,0.001052817],"domain_scores_gemma":[0.9734239,0.010607094,0.0019567031,0.01113922,0.0022915462,0.0005815609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012094533,0.000894181,0.0011077567,0.0016832592,0.0020100093,0.00870805,0.0026658738,0.0014678058,0.0016764835],"category_scores_gemma":[0.025564365,0.0010264824,0.0020112789,0.0020223006,0.008921172,0.023038864,0.009756114,0.0039200485,0.0005447538],"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.00019707358,0.00005664925,0.0009561928,0.000083557214,0.000044016986,0.00016768539,0.0010515263,0.008633471,0.0030119177,0.9620139,0.0010936316,0.022690399],"study_design_scores_gemma":[0.00005356805,0.000075277974,0.00016338292,0.000041005518,0.00008138543,0.0002622265,0.00025980923,0.050399654,0.013540975,0.9274782,0.0076034553,0.00004097467],"about_ca_topic_score_codex":0.0014868843,"about_ca_topic_score_gemma":0.0011796105,"teacher_disagreement_score":0.012094533,"about_ca_system_score_codex":0.001707935,"about_ca_system_score_gemma":0.0027990935,"threshold_uncertainty_score":0.06396276},"labels":[],"label_agreement":null},{"id":"W2952804803","doi":"10.32920/23688735.v1","title":"Hybrid Temporal Situation Calculus","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Calculus (dental); Situation calculus; Computer science; Mathematics; Artificial intelligence; Medicine","score_opus":0.04612925268787869,"score_gpt":0.27910500758880885,"score_spread":0.23297575490093017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952804803","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.01140951,0.0005614102,0.9402288,0.0010275834,0.00019697037,0.00013033331,0.00038517875,0.000902502,0.045157604],"genre_scores_gemma":[0.4722012,0.00059241836,0.5051848,0.00060314627,0.0001838504,0.00038931193,0.00052191067,0.00018265536,0.020140748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801433,0.00053278025,0.00017566045,0.0004200184,0.00064782397,0.00020944237],"domain_scores_gemma":[0.998451,0.00067279325,0.00010031141,0.00028883197,0.0003710809,0.00011595605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021722605,0.00052476616,0.0005012376,0.0009880546,0.0011319853,0.002515247,0.0016592938,0.000975429,0.0064962846],"category_scores_gemma":[0.002465717,0.00046869338,0.0015389228,0.0009024156,0.0036201458,0.0040492006,0.002283319,0.0024596,0.0009708451],"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.00000921592,0.000008817152,0.00006854246,0.00002850134,0.000008202071,0.00009006507,0.00017331119,0.0028137527,0.0006274859,0.9911073,0.0005439055,0.004520976],"study_design_scores_gemma":[0.000033036813,0.000024287812,0.00012818487,0.000033161654,0.000036151443,0.00017285882,0.00010648691,0.059264272,0.001825754,0.90079486,0.03755341,0.000027517684],"about_ca_topic_score_codex":0.0042090514,"about_ca_topic_score_gemma":0.0026360995,"teacher_disagreement_score":0.0064962846,"about_ca_system_score_codex":0.0020940776,"about_ca_system_score_gemma":0.0013504294,"threshold_uncertainty_score":0.021732211},"labels":[],"label_agreement":null},{"id":"W2952839120","doi":"10.32920/23688732.v1","title":"Progression of Decomposed Local-Effect Action Theories","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; Deutsche Forschungsgemeinschaft","keywords":"Forgetting; Situation calculus; Action (physics); Computer science; Bridging (networking); Modularity (biology); Subject (documents); Decomposition; Representation (politics); Belief revision; Cognitive science; Artificial intelligence; Theory; Epistemology; Mathematics; Theoretical computer science; Cognitive psychology; Psychology; Philosophy","score_opus":0.03721432294962409,"score_gpt":0.33698758153137354,"score_spread":0.29977325858174947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952839120","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.08879648,0.00055668136,0.8778948,0.0011383467,0.00008031297,0.00020357908,0.00029895452,0.0010259376,0.030004816],"genre_scores_gemma":[0.7279346,0.0006479149,0.2596019,0.00027398122,0.00009650362,0.00020999018,0.00058190647,0.0002475389,0.010405757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699855,0.00085867045,0.00021806039,0.0006005529,0.0010064,0.00031769535],"domain_scores_gemma":[0.9958347,0.0019485856,0.00035930338,0.000897957,0.0006862325,0.00027313892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00441151,0.0007177848,0.0005881153,0.0023743515,0.0013796246,0.003256341,0.0016373518,0.00125074,0.0065849232],"category_scores_gemma":[0.0087087,0.00069241866,0.0028418312,0.0011121554,0.0062168953,0.009869925,0.0044508893,0.0037502542,0.0006640855],"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.000050597213,0.00002162884,0.0005552453,0.0000814008,0.0000253482,0.0003252947,0.0013222387,0.007246721,0.001605268,0.9764671,0.0003866193,0.011912525],"study_design_scores_gemma":[0.00002706737,0.000039184386,0.00025698618,0.000047841466,0.000038186437,0.0001328476,0.00018584786,0.028676469,0.0017207235,0.9640026,0.004852242,0.000020033629],"about_ca_topic_score_codex":0.004015561,"about_ca_topic_score_gemma":0.0034072564,"teacher_disagreement_score":0.0065849232,"about_ca_system_score_codex":0.002907057,"about_ca_system_score_gemma":0.0015485774,"threshold_uncertainty_score":0.02333057},"labels":[],"label_agreement":null},{"id":"W2953082263","doi":"10.1145/1166109.1166110","title":"Domain-dependent knowledge in answer set planning","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Computer science; Answer set programming; Correctness; Domain (mathematical analysis); Domain knowledge; Plan (archaeology); Logic programming; Set (abstract data type); Control (management); Semantics (computer science); Modular design; Artificial intelligence; Programming language; Theoretical computer science; Mathematics","score_opus":0.02998419991651737,"score_gpt":0.2864637845921789,"score_spread":0.25647958467566156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953082263","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.017873432,0.00027488035,0.9740475,0.00048247422,0.000024789419,0.000089131805,0.000057494668,0.00035124324,0.006799094],"genre_scores_gemma":[0.5282831,0.00050656847,0.46685317,0.00028567453,0.00006932073,0.00024775043,0.00024018314,0.00013618538,0.0033780092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965714,0.0013764551,0.00020691758,0.00047605456,0.0010982715,0.00027076466],"domain_scores_gemma":[0.9896119,0.008502368,0.00039667834,0.0009090741,0.00040280216,0.00017712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044533177,0.0006044397,0.0005788234,0.00092985266,0.0009492981,0.0022002126,0.0019568084,0.0013590908,0.0028459541],"category_scores_gemma":[0.012714415,0.00072387425,0.0010192513,0.0009103588,0.0044026077,0.005283163,0.0027163248,0.0022169042,0.00038274043],"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.00027337053,0.00014764289,0.0011660412,0.0004646993,0.00006662851,0.0006588993,0.0013435509,0.31413892,0.006204916,0.5718476,0.0011560707,0.10253154],"study_design_scores_gemma":[0.000061165156,0.00008808933,0.00029764872,0.000085226726,0.000059502672,0.00019970007,0.000202702,0.44925818,0.009789603,0.5306237,0.0092938095,0.00004077879],"about_ca_topic_score_codex":0.003475498,"about_ca_topic_score_gemma":0.0038560356,"teacher_disagreement_score":0.0044533177,"about_ca_system_score_codex":0.0014403433,"about_ca_system_score_gemma":0.0017267072,"threshold_uncertainty_score":0.023551643},"labels":[],"label_agreement":null},{"id":"W2953229660","doi":"10.48550/arxiv.1111.0090","title":"An Improved Implementation and Abstract Interface for Hybrid","year":2011,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"","keywords":"Interface (matter); Computer science; Proof assistant; HOL; De Bruijn sequence; Programming language; Mathematical proof; Theoretical computer science; Object (grammar); Set (abstract data type); Syntax; Hybrid system; Representation (politics); Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.03692913456100608,"score_gpt":0.30892981214592524,"score_spread":0.2720006775849192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953229660","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.0027562515,0.000049363804,0.9885365,0.00023736469,0.00010052129,0.00007425843,0.00009076961,0.004736727,0.0034182682],"genre_scores_gemma":[0.14101644,0.000226546,0.84390336,0.0007021932,0.00018523876,0.00046853008,0.00059920846,0.0029070922,0.009991495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933733,0.0015351785,0.00085787906,0.0009740057,0.002697653,0.0005620187],"domain_scores_gemma":[0.9935994,0.0019519989,0.00031183055,0.0025470525,0.0013750816,0.00021467904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067674303,0.00085612456,0.0011083405,0.0017793577,0.001235987,0.0052910196,0.003954074,0.0022106837,0.010229587],"category_scores_gemma":[0.008889372,0.0015883431,0.0024404377,0.0012657576,0.0048417714,0.014027336,0.0064817625,0.0059885955,0.0029210697],"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.0001381507,0.000060840623,0.0005289559,0.00015802454,0.00003110139,0.00015325074,0.000767639,0.00429553,0.007379648,0.954019,0.0036322703,0.028835531],"study_design_scores_gemma":[0.00017683445,0.00030497412,0.00050001254,0.00018077367,0.00019068939,0.0006426337,0.00040007982,0.15811066,0.043100584,0.56484026,0.23132218,0.00023038016],"about_ca_topic_score_codex":0.0016919482,"about_ca_topic_score_gemma":0.0012276196,"teacher_disagreement_score":0.010229587,"about_ca_system_score_codex":0.0018022296,"about_ca_system_score_gemma":0.002456608,"threshold_uncertainty_score":0.035790026},"labels":[],"label_agreement":null},{"id":"W2954570608","doi":"10.4230/lipics.fscd.2019.2","title":"A Linear Logical Framework in Hybrid (Invited Talk)","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear logic; Soundness; Programming language; Computer science; Sequent calculus; Logical framework; Theoretical computer science; Mathematics","score_opus":0.042061621743677356,"score_gpt":0.1809292026597845,"score_spread":0.13886758091610713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954570608","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.0083007645,0.0039694654,0.90044814,0.013030192,0.002152584,0.00009343651,0.00028904882,0.0028022174,0.06891415],"genre_scores_gemma":[0.3979181,0.0033521117,0.5001153,0.008883114,0.0025487866,0.00052990933,0.0008220666,0.0019156435,0.08391486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972242,0.0012150807,0.00010909071,0.0005060382,0.00066536304,0.00028015248],"domain_scores_gemma":[0.9983134,0.0009182988,0.00007169217,0.00024406935,0.00026843432,0.00018408394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045918557,0.00060974737,0.00051875546,0.0010553589,0.0018206249,0.0056027607,0.0020553363,0.002401,0.025449514],"category_scores_gemma":[0.00489989,0.0007546627,0.0015965612,0.00089795,0.0051693763,0.009421237,0.0053831637,0.004055316,0.0056207716],"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.000022740052,0.000014828823,0.000082334795,0.000059124057,0.000010845367,0.0000719444,0.00045676576,0.0008629924,0.0007585192,0.9810621,0.006028748,0.010569024],"study_design_scores_gemma":[0.0000399719,0.00004555514,0.00011554995,0.00009759007,0.000029365496,0.00021396037,0.0003171428,0.009172619,0.0025457188,0.78622514,0.20113105,0.00006629587],"about_ca_topic_score_codex":0.002492633,"about_ca_topic_score_gemma":0.0016034883,"teacher_disagreement_score":0.025449514,"about_ca_system_score_codex":0.0029927252,"about_ca_system_score_gemma":0.0014109381,"threshold_uncertainty_score":0.08513713},"labels":[],"label_agreement":null},{"id":"W2963390246","doi":"10.1017/s1471068417000291","title":"Well-founded operators for normal hybrid MKNF knowledge bases","year":2017,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Alberta","funders":"","keywords":"Computer science; DPLL algorithm; Operator (biology); Knowledge base; Solver; Knowledge representation and reasoning; Theoretical computer science; Constraint (computer-aided design); Realization (probability); Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.03538053620335877,"score_gpt":0.3295888816316333,"score_spread":0.2942083454282745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963390246","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.020979404,0.00011075102,0.97380644,0.00034525534,0.00003420201,0.00011422348,0.00023139601,0.0005748304,0.0038035703],"genre_scores_gemma":[0.3290962,0.00017040689,0.6666196,0.00027208787,0.00006889198,0.0002272717,0.0006369508,0.00015340166,0.0027551826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951939,0.0010735522,0.0005403416,0.00086829823,0.00188756,0.0004363799],"domain_scores_gemma":[0.9905359,0.0056802863,0.00066845445,0.0010403774,0.0017639232,0.00031102684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049615297,0.00063916645,0.00065645983,0.0030257443,0.001070669,0.003387466,0.0022298023,0.001355407,0.003845003],"category_scores_gemma":[0.013073443,0.0006174445,0.0017492098,0.0017237704,0.003883272,0.006795774,0.003761059,0.0031399226,0.0006780008],"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.00010344916,0.00009322877,0.0006217175,0.0001962173,0.000055171196,0.0003478272,0.0009938703,0.054710623,0.0057360823,0.87274766,0.0015971587,0.06279709],"study_design_scores_gemma":[0.00003028087,0.000039436378,0.00013594922,0.000100805984,0.00004550655,0.00013553795,0.00023226417,0.24376285,0.007333445,0.73999596,0.008148956,0.000039100836],"about_ca_topic_score_codex":0.004239284,"about_ca_topic_score_gemma":0.005461502,"teacher_disagreement_score":0.0049615297,"about_ca_system_score_codex":0.0022711556,"about_ca_system_score_gemma":0.0016976058,"threshold_uncertainty_score":0.026239395},"labels":[],"label_agreement":null},{"id":"W2963689351","doi":"","title":"Characterizing and Computing Causes for Query Answers in Databases from Database Repairs and Repair Programs","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":"Carleton University","funders":"","keywords":"Tuple; Computer science; Database; Set (abstract data type); Null (SQL); View; Semantics (computer science); Query language; Information retrieval; Database theory; Relational database; Database design; Programming language; Mathematics","score_opus":0.1039909753925838,"score_gpt":0.22610781246822526,"score_spread":0.12211683707564146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963689351","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.06766877,0.0003960387,0.9270937,0.0005408114,0.000030541178,0.00016962523,0.00044943704,0.001144615,0.002506369],"genre_scores_gemma":[0.60977054,0.0006528442,0.38423738,0.00021805959,0.00010146517,0.00045226063,0.0016654131,0.00042197664,0.0024800757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410594,0.0016263253,0.00059333455,0.001046779,0.0021740545,0.00045360212],"domain_scores_gemma":[0.98291653,0.011679892,0.0015914167,0.0016935648,0.001765628,0.0003528203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054568057,0.000852135,0.0010352101,0.0050879093,0.0011701271,0.0056957416,0.0019367179,0.0016186499,0.0021221824],"category_scores_gemma":[0.024495749,0.00096773147,0.002788527,0.0032647108,0.0042894175,0.0075803036,0.0041600033,0.0025238767,0.00034302403],"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.00031636207,0.00016136018,0.009039867,0.0007074614,0.00020348314,0.00054984057,0.003027045,0.14425199,0.004185327,0.7385566,0.0018750619,0.097125635],"study_design_scores_gemma":[0.000026733469,0.000055096418,0.0011079368,0.00008580743,0.00015209823,0.00020793152,0.0007199729,0.25536913,0.007328451,0.7313535,0.0035358737,0.00005745793],"about_ca_topic_score_codex":0.003162079,"about_ca_topic_score_gemma":0.0034556098,"teacher_disagreement_score":0.0056957416,"about_ca_system_score_codex":0.0019851234,"about_ca_system_score_gemma":0.0025458387,"threshold_uncertainty_score":0.028858662},"labels":[],"label_agreement":null},{"id":"W2964029271","doi":"10.1017/s147106841100038x","title":"Relating weight constraint and aggregate programs: Semantics and representation","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Alberta","funders":"","keywords":"Stable model semantics; Well-founded semantics; Semantics (computer science); Computer science; Constraint (computer-aided design); Operational semantics; Programming language; Representation (politics); Set (abstract data type); Theoretical computer science; Logic programming; Aggregate (composite); Denotational semantics; Mathematics","score_opus":0.04945355396791649,"score_gpt":0.2932697694423416,"score_spread":0.24381621547442514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964029271","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.049774367,0.0000967825,0.9429582,0.00071466295,0.00003410253,0.00009410444,0.0002241926,0.0009991915,0.005104381],"genre_scores_gemma":[0.67883354,0.00024726824,0.31440824,0.00048474284,0.00009410388,0.00030249328,0.000674238,0.0004593394,0.0044960524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961145,0.0012483317,0.00026327564,0.00057726016,0.0014780072,0.00031856116],"domain_scores_gemma":[0.99333644,0.0038137254,0.00071290345,0.00077139906,0.0012037626,0.0001618256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452279,0.00053151476,0.00046161533,0.0017326791,0.000678797,0.0034917684,0.0016268796,0.0012269662,0.00418166],"category_scores_gemma":[0.010733289,0.00041010737,0.0011556359,0.0023078695,0.0031834033,0.0060306494,0.0027281176,0.002031195,0.00036750897],"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.00011744001,0.00011042542,0.0011226694,0.00014793657,0.000040502935,0.00023642137,0.0010011803,0.030058075,0.0059208134,0.92197764,0.0014303438,0.03783662],"study_design_scores_gemma":[0.000025298032,0.00005643094,0.00030768773,0.000050664366,0.00004187489,0.00012311236,0.00022077345,0.22750777,0.008766295,0.75666434,0.0062081944,0.000027466544],"about_ca_topic_score_codex":0.0030947041,"about_ca_topic_score_gemma":0.0016287621,"teacher_disagreement_score":0.00418166,"about_ca_system_score_codex":0.0013675791,"about_ca_system_score_gemma":0.0014344321,"threshold_uncertainty_score":0.013989031},"labels":[],"label_agreement":null},{"id":"W2964051113","doi":"","title":"Query-answer causality in databases: abductive diagnosis and view-updates","year":2015,"lang":"en","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Causality (physics); Consistency (knowledge bases); Computer science; Query optimization; Information retrieval; Focus (optics); Data integrity; Query language; Web search query; Web query classification; Database; Data mining; Artificial intelligence; Search engine","score_opus":0.06983457153692955,"score_gpt":0.30403352255877,"score_spread":0.2341989510218404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964051113","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.0151391085,0.0017612897,0.97792256,0.002895197,0.00008892891,0.00013859819,0.00018297369,0.00020183426,0.0016694443],"genre_scores_gemma":[0.61040246,0.003785032,0.3805104,0.0010960911,0.00067244103,0.00037301244,0.0006833624,0.00013204887,0.0023451545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97781247,0.008501718,0.0020749648,0.0031959561,0.00746032,0.0009545803],"domain_scores_gemma":[0.8415507,0.12964216,0.008342319,0.010216419,0.008888723,0.0013596012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01974692,0.0014727617,0.0018374937,0.0041852775,0.0014965151,0.00573204,0.0037201457,0.0032241677,0.003036983],"category_scores_gemma":[0.10223595,0.0013517006,0.003233013,0.0048587173,0.0082458835,0.018097468,0.007896574,0.0061681704,0.00028615398],"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.0005031514,0.00024686288,0.0075477604,0.0009110617,0.00034331257,0.0008155811,0.0015892873,0.11118672,0.0016444512,0.7472983,0.0021577326,0.1257558],"study_design_scores_gemma":[0.000047821428,0.000049580474,0.00045202445,0.00009078687,0.0001159754,0.00027439088,0.00021619293,0.21671574,0.0018379135,0.7786073,0.0015521924,0.00004002006],"about_ca_topic_score_codex":0.0057150717,"about_ca_topic_score_gemma":0.0032879785,"teacher_disagreement_score":0.01974692,"about_ca_system_score_codex":0.0034299756,"about_ca_system_score_gemma":0.003904193,"threshold_uncertainty_score":0.10443294},"labels":[],"label_agreement":null},{"id":"W2965668794","doi":"10.1609/icaps.v29i1.3548","title":"A Logical Semantics for PDDL+","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","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":"Toronto Metropolitan University; York University","funders":"","keywords":"Computer science; Semantics (computer science); Rotation formalisms in three dimensions; Situation calculus; Operational semantics; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.05743131545813914,"score_gpt":0.3053202317283896,"score_spread":0.24788891627025048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965668794","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.0016845259,0.00019910152,0.98622406,0.0008959316,0.00016000391,0.00015742928,0.00042783187,0.0011755413,0.009075526],"genre_scores_gemma":[0.1309327,0.00066642184,0.85675323,0.0012874106,0.00023132222,0.00087301596,0.0014224105,0.00051392027,0.0073195547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597305,0.0011487517,0.00069994456,0.0007496809,0.0010490342,0.00037956523],"domain_scores_gemma":[0.99598086,0.0015512345,0.0003239731,0.0007165995,0.0011195383,0.00030774536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004483387,0.0010440532,0.0006299288,0.0015573706,0.0019527763,0.0059948293,0.0028873482,0.0015281339,0.006647779],"category_scores_gemma":[0.0053655426,0.0009509153,0.002212282,0.0013546397,0.0042993533,0.0063732835,0.005564719,0.0040898523,0.0020460112],"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.00003175963,0.000029686747,0.000118396674,0.00013885737,0.000012856146,0.00014944606,0.00037028242,0.0044492916,0.0009618805,0.9729355,0.002708427,0.018093633],"study_design_scores_gemma":[0.000103021455,0.000062873194,0.00009527827,0.00012182581,0.00004525301,0.00036223698,0.00026457265,0.043118764,0.005526738,0.768903,0.18133382,0.00006263142],"about_ca_topic_score_codex":0.0048214,"about_ca_topic_score_gemma":0.0034890883,"teacher_disagreement_score":0.006647779,"about_ca_system_score_codex":0.0026800463,"about_ca_system_score_gemma":0.003981729,"threshold_uncertainty_score":0.023710728},"labels":[],"label_agreement":null},{"id":"W2966029787","doi":"10.4230/lipics.ccc.2019.25","title":"Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"University of Waterloo","funders":"","keywords":"Mathematical proof; Gas meter prover; Operator (biology); Upper and lower bounds; Soundness; Mathematics; Completeness (order theory); Discrete mathematics; Value (mathematics); Class (philosophy); Complexity class; Combinatorics; Time complexity; Computer science","score_opus":0.015284144150633644,"score_gpt":0.2675084582222198,"score_spread":0.2522243140715862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966029787","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.18874404,0.0007675053,0.7880894,0.0026709845,0.00010305956,0.00025552287,0.00041425807,0.0015202579,0.017435012],"genre_scores_gemma":[0.8710938,0.00044426767,0.12149492,0.00053228653,0.00017451664,0.0003895636,0.00057159323,0.00039818202,0.004900872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99278474,0.0018378984,0.00033145974,0.0016304855,0.0021576448,0.0012577609],"domain_scores_gemma":[0.9545707,0.03581267,0.0018401311,0.005541241,0.001282354,0.0009529083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005420788,0.001550717,0.0022519438,0.0013649298,0.0013426649,0.005356402,0.004293362,0.0017391391,0.0073164552],"category_scores_gemma":[0.03429943,0.0007631945,0.002927425,0.001268617,0.0051542097,0.012991715,0.0061863344,0.007492837,0.0010307826],"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.00079824985,0.0002587384,0.0036009701,0.00056501915,0.00019328666,0.0002852465,0.00095766684,0.33505496,0.007187182,0.60787135,0.003338769,0.039888505],"study_design_scores_gemma":[0.00004260523,0.000060088903,0.00029629603,0.000034892633,0.00003539226,0.000051166222,0.000058457073,0.5984746,0.0030427484,0.39713982,0.0007371826,0.00002674798],"about_ca_topic_score_codex":0.002791386,"about_ca_topic_score_gemma":0.0029394177,"teacher_disagreement_score":0.0073164552,"about_ca_system_score_codex":0.005849373,"about_ca_system_score_gemma":0.0038667615,"threshold_uncertainty_score":0.042440414},"labels":[],"label_agreement":null},{"id":"W2966225274","doi":"10.24963/ijcai.2019/244","title":"A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief","year":2019,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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 Toronto","funders":"University of Toronto","keywords":"Completeness (order theory); Computer science; Expressive power; Propositional calculus; Belief revision; Knowledge representation and reasoning; Logical consequence; First-order logic; Expressivity; Non-monotonic logic; Order (exchange); Artificial intelligence; Cognitive science; Theoretical computer science; Programming language; Mathematics; Psychology","score_opus":0.015835706664772447,"score_gpt":0.21935620917217222,"score_spread":0.20352050250739978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966225274","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.009072455,0.00080254645,0.9754126,0.0033374536,0.00007253413,0.00009460136,0.00026340256,0.000399916,0.010544566],"genre_scores_gemma":[0.4029421,0.0015207173,0.5860024,0.0010854332,0.00034865332,0.00034062844,0.0004948822,0.00008715427,0.007178053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724555,0.00092901604,0.00019653984,0.00046644412,0.0009249499,0.00023760737],"domain_scores_gemma":[0.9951623,0.0029858665,0.0005155322,0.0006195595,0.00046654543,0.00025007973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038358727,0.00063349964,0.0007465279,0.0011615433,0.0016549266,0.00479658,0.0022346368,0.0020439774,0.0025743784],"category_scores_gemma":[0.00816399,0.00054121274,0.0019447327,0.0018325296,0.004902378,0.009031872,0.0033225177,0.0033575373,0.00061499333],"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.000030488072,0.000037208287,0.00013607799,0.00014316721,0.00002619798,0.00019796909,0.0004144364,0.0067174817,0.0011720866,0.9779773,0.0014922806,0.011655352],"study_design_scores_gemma":[0.000042534695,0.00004683826,0.000114762785,0.000056585402,0.00004679352,0.000269349,0.00009953633,0.04966669,0.0022417097,0.9344727,0.01290805,0.000034599794],"about_ca_topic_score_codex":0.0026411905,"about_ca_topic_score_gemma":0.002959975,"teacher_disagreement_score":0.00479658,"about_ca_system_score_codex":0.0025795002,"about_ca_system_score_gemma":0.002402717,"threshold_uncertainty_score":0.020286262},"labels":[],"label_agreement":null},{"id":"W2969945018","doi":"10.1007/978-3-030-29007-8_4","title":"A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Answer set programming; Artificial intelligence; Formalism (music); Preference; Declarative programming; Domain (mathematical analysis); Theoretical computer science; Logic programming; Decision problem; Set (abstract data type); Machine learning; Programming language; Inductive programming; Programming paradigm; Mathematics","score_opus":0.023188732706196383,"score_gpt":0.2797779865081381,"score_spread":0.25658925380194175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969945018","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.0008898445,0.000106233456,0.99333936,0.00023291359,0.000046499626,0.00011710513,0.00027937294,0.0015697922,0.003418833],"genre_scores_gemma":[0.028278282,0.00018398237,0.96649396,0.00025517223,0.00007705134,0.00032480873,0.00088576385,0.00040111318,0.0030998832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968683,0.00085493375,0.00038682402,0.0005182442,0.0010489263,0.0003227242],"domain_scores_gemma":[0.9970504,0.0014582431,0.00013581404,0.00065628387,0.00047731103,0.0002218968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00389201,0.0013648344,0.0012735631,0.0017695188,0.0015831174,0.005158632,0.005566857,0.0017389272,0.014071041],"category_scores_gemma":[0.008534577,0.0015452353,0.004410406,0.0023058073,0.0022076713,0.009729992,0.0051507144,0.0065507805,0.003974544],"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.00012565813,0.00019939167,0.00034374403,0.000371231,0.00011112741,0.00027012758,0.00076163735,0.011824618,0.003862127,0.837904,0.013842908,0.13038343],"study_design_scores_gemma":[0.00008527766,0.0000537214,0.00019547877,0.00010678989,0.000119494805,0.00023448639,0.0002527383,0.13478333,0.004483099,0.8093834,0.05022274,0.000079416146],"about_ca_topic_score_codex":0.0049550384,"about_ca_topic_score_gemma":0.00879852,"teacher_disagreement_score":0.014071041,"about_ca_system_score_codex":0.0015113336,"about_ca_system_score_gemma":0.0024553838,"threshold_uncertainty_score":0.04707235},"labels":[],"label_agreement":null},{"id":"W2970946372","doi":"10.18653/v1/d19-1335","title":"How Reasonable are Common-Sense Reasoning Tasks: A Case-Study on the Winograd Schema Challenge and SWAG","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Computer science; Schema (genetic algorithms); Common sense; Commonsense reasoning; Ask price; Artificial intelligence; Theoretical computer science; Machine learning; Epistemology","score_opus":0.050924099371779344,"score_gpt":0.26656180995334305,"score_spread":0.21563771058156372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970946372","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.78910655,0.0071258624,0.10460519,0.03851866,0.00030548373,0.00086354895,0.005405067,0.0020227747,0.052047014],"genre_scores_gemma":[0.9037442,0.00097000174,0.08335727,0.0017676278,0.00007986565,0.00019061724,0.0055646817,0.0006011438,0.0037245955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98368555,0.0106373215,0.0011419381,0.001869872,0.00216562,0.00049966905],"domain_scores_gemma":[0.8325851,0.14673561,0.0023543744,0.01146206,0.005063417,0.0017994901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02376161,0.00057575805,0.00092112157,0.0021742492,0.0024931817,0.0044549583,0.0028094812,0.004564952,0.0053115026],"category_scores_gemma":[0.11990428,0.00040558752,0.0009328928,0.0036939953,0.0036159651,0.015767295,0.00417635,0.0034170519,0.001108632],"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.004226654,0.0025792236,0.105391055,0.0026958606,0.0004456339,0.0040548914,0.042889263,0.01904249,0.0028159278,0.30370936,0.103668414,0.4084813],"study_design_scores_gemma":[0.0008899241,0.00062332384,0.019641781,0.0010785415,0.0003493127,0.0054123094,0.03995689,0.13454035,0.0059921267,0.6653739,0.12594913,0.00019240123],"about_ca_topic_score_codex":0.014824662,"about_ca_topic_score_gemma":0.022543766,"teacher_disagreement_score":0.02376161,"about_ca_system_score_codex":0.0017863375,"about_ca_system_score_gemma":0.0027420227,"threshold_uncertainty_score":0.12566495},"labels":[],"label_agreement":null},{"id":"W2981686809","doi":"10.3389/fpsyg.2019.02214","title":"Context, Content, and the Occasional Costs of Implicature Computation","year":2019,"lang":"en","type":"article","venue":"Frontiers in Psychology","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Social Sciences and Humanities Research Council of Canada; University of Toronto; Hebrew University of Jerusalem","keywords":"Implicature; Context (archaeology); Psychology; Content (measure theory); Computation; Cognitive psychology; Social psychology; Linguistics; Computer science; Pragmatics; Algorithm; Mathematics; History","score_opus":0.017729537048400416,"score_gpt":0.2796961167969403,"score_spread":0.2619665797485399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981686809","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.8184491,0.0015454505,0.1283529,0.0050152005,0.00012895904,0.00008943574,0.0002416689,0.00041694957,0.045760393],"genre_scores_gemma":[0.98115003,0.00025703246,0.01653688,0.00012962002,0.00007056916,0.00004621233,0.00006158045,0.00014732737,0.0016007478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971078,0.0008680583,0.0002471605,0.0006816613,0.0007650657,0.00033039434],"domain_scores_gemma":[0.96920544,0.022852618,0.00211479,0.0038579283,0.0013446352,0.0006245813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031700027,0.00046826157,0.00068294536,0.0011685292,0.0013436787,0.00532526,0.001402077,0.0019353016,0.0061552343],"category_scores_gemma":[0.041267157,0.0012618179,0.00080810825,0.0009900866,0.003609446,0.015460642,0.0035370658,0.0027926923,0.00039806674],"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.0013569645,0.00019551667,0.015070943,0.00068451057,0.0001988397,0.0010832468,0.0026856856,0.03763508,0.028183222,0.8281486,0.0016432892,0.08311401],"study_design_scores_gemma":[0.000066379944,0.00010063606,0.012026075,0.000056907058,0.00016414784,0.00068791554,0.000768721,0.070021436,0.009727748,0.90339255,0.0028800424,0.00010735747],"about_ca_topic_score_codex":0.0012363307,"about_ca_topic_score_gemma":0.0015433846,"teacher_disagreement_score":0.0061552343,"about_ca_system_score_codex":0.0019935805,"about_ca_system_score_gemma":0.00074745255,"threshold_uncertainty_score":0.020591259},"labels":[],"label_agreement":null},{"id":"W2982491624","doi":"10.4204/eptcs.308.1","title":"Towards A Logical Account of Epistemic Causality","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Causality (physics); Counterexample; Epistemology; Causal reasoning; Dimension (graph theory); Computer science; Mathematics; Philosophy; Psychology; Cognition; Discrete mathematics; Pure mathematics","score_opus":0.0070475254332443334,"score_gpt":0.24213160518906654,"score_spread":0.2350840797558222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982491624","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.007924838,0.0007882842,0.94376457,0.012355741,0.0003702989,0.00006689975,0.00016097943,0.00028429128,0.03428402],"genre_scores_gemma":[0.61857235,0.0021999301,0.3617096,0.004431386,0.0014540685,0.00054459047,0.0004872956,0.0002928896,0.010307882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929096,0.0039603687,0.0005329164,0.00085410307,0.0013423864,0.00040068454],"domain_scores_gemma":[0.9796022,0.013767052,0.0016564257,0.0023235157,0.0021266735,0.00052424194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013953999,0.0009563955,0.0008512297,0.002938951,0.0029251585,0.00811887,0.0027778442,0.0041017653,0.006516952],"category_scores_gemma":[0.019487139,0.0010687337,0.0025473384,0.0018126502,0.011423226,0.019973006,0.0074973167,0.0076753986,0.000916384],"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.0000042932884,0.000007829991,0.00007731992,0.000019537534,0.000006521881,0.0000401935,0.00011128304,0.0009536625,0.0000560136,0.99736565,0.00027046358,0.0010872725],"study_design_scores_gemma":[0.000007434801,0.0000039507895,0.000028089384,0.000013648894,0.0000070973824,0.000026493288,0.00004144419,0.004729042,0.000097892465,0.99237216,0.0026675041,0.000005303764],"about_ca_topic_score_codex":0.001659432,"about_ca_topic_score_gemma":0.0019125756,"teacher_disagreement_score":0.013953999,"about_ca_system_score_codex":0.0026844647,"about_ca_system_score_gemma":0.0034323155,"threshold_uncertainty_score":0.07379669},"labels":[],"label_agreement":null},{"id":"W2987239078","doi":"10.1016/j.artint.2019.103199","title":"Probabilistic sentence satisfiability: An approach to PSAT","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Air Force Office of Scientific Research","keywords":"Probabilistic logic; Satisfiability; Sentence; Conditional probability; Computer science; Mathematics; Algorithm; Gaussian; Set (abstract data type); Artificial intelligence; Statistics","score_opus":0.05290585328553442,"score_gpt":0.2841674287547401,"score_spread":0.23126157546920567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987239078","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.0024862443,0.00029295884,0.9904723,0.0015745731,0.00010868232,0.00015159187,0.00036154618,0.00051517127,0.004036902],"genre_scores_gemma":[0.18125406,0.001142267,0.8042474,0.0012329456,0.0009881825,0.00057440216,0.0019176379,0.000545606,0.008097538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99076277,0.0037773878,0.0006815974,0.0013746379,0.0029000477,0.0005035381],"domain_scores_gemma":[0.974481,0.019492183,0.0009966856,0.0027132195,0.0019234946,0.00039343888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00839106,0.001176413,0.001990759,0.0047116494,0.002103187,0.005312777,0.006346627,0.0028700256,0.012918831],"category_scores_gemma":[0.042626902,0.0018524182,0.0061883167,0.0059227813,0.0043854667,0.012429866,0.0073377746,0.0067640874,0.0019659905],"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.000112015376,0.000125686,0.00076997286,0.00037414097,0.0001815855,0.00036083945,0.0006117769,0.05659631,0.0007511673,0.838971,0.009975975,0.091169454],"study_design_scores_gemma":[0.000021434094,0.000018941553,0.00007789675,0.000036720976,0.000057321347,0.00013553769,0.00007021805,0.2011881,0.00059879245,0.79342145,0.0043513044,0.000022217666],"about_ca_topic_score_codex":0.0064670458,"about_ca_topic_score_gemma":0.008533281,"teacher_disagreement_score":0.012918831,"about_ca_system_score_codex":0.0022958422,"about_ca_system_score_gemma":0.004455775,"threshold_uncertainty_score":0.04437673},"labels":[],"label_agreement":null},{"id":"W2990609819","doi":"10.1007/978-3-030-35288-2_12","title":"An Efficient Solver for Parametrized Difference Revision","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Solver; Problem solver; Computer science; Operator (biology); Range (aeronautics); Theoretical computer science; Algorithm; Artificial intelligence; Mathematical optimization; Computational science; Programming language; Mathematics","score_opus":0.021360837614591163,"score_gpt":0.2653960032096404,"score_spread":0.24403516559504923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990609819","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.015589228,0.00034135283,0.9547102,0.0007079122,0.0003420621,0.00037546072,0.0009453541,0.008948414,0.018040095],"genre_scores_gemma":[0.25425386,0.00024228949,0.72443956,0.00049581646,0.00019718427,0.00037310456,0.0019058126,0.0022243606,0.015868027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970272,0.00059929857,0.00033054728,0.0006475258,0.001014098,0.0003814236],"domain_scores_gemma":[0.9949621,0.0031943785,0.00014871462,0.0009963365,0.0005608316,0.00013768303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026143305,0.001282926,0.002013151,0.0011523651,0.0011954381,0.003945772,0.0037853478,0.0020695038,0.028608762],"category_scores_gemma":[0.010413728,0.0012177472,0.0022465687,0.002012808,0.0016199526,0.0066423463,0.0063019693,0.0042978246,0.004480659],"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.0005677427,0.00032472084,0.0007167446,0.0007319131,0.00012486475,0.0003691993,0.0005943679,0.023102926,0.008646827,0.56080043,0.030956296,0.37306386],"study_design_scores_gemma":[0.00048197506,0.000093300354,0.00015415628,0.000073321324,0.00010928191,0.0002854708,0.0001903438,0.27011672,0.010532164,0.6958887,0.022003725,0.0000707554],"about_ca_topic_score_codex":0.0017383363,"about_ca_topic_score_gemma":0.0031725364,"teacher_disagreement_score":0.028608762,"about_ca_system_score_codex":0.0018440904,"about_ca_system_score_gemma":0.0025759179,"threshold_uncertainty_score":0.09570587},"labels":[],"label_agreement":null},{"id":"W2995123640","doi":"10.1145/3371129","title":"Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FP7 Ideas: European Research Council; Leverhulme Trust; McGill University; National Science Foundation","keywords":"Kleene algebra; Kleene's recursion theorem; Completeness (order theory); Algebra over a field; Equational logic; Universal algebra; Contrast (vision); Linear algebra","score_opus":0.011165097913350956,"score_gpt":0.23049799987184091,"score_spread":0.21933290195848995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995123640","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.03883542,0.00012761392,0.953832,0.0004740062,0.0000649413,0.00013468077,0.0003608144,0.0031623552,0.0030082094],"genre_scores_gemma":[0.70318186,0.00020023207,0.29161477,0.00033296525,0.00008810896,0.00019892126,0.0008466474,0.00051695097,0.0030194623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943869,0.0014920118,0.00042382136,0.0011447063,0.0018306368,0.00072195136],"domain_scores_gemma":[0.9883482,0.0073655206,0.000859572,0.002042801,0.0010963662,0.00028754902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035806003,0.0006983911,0.000998655,0.00091646827,0.0009306539,0.0034525143,0.0029245995,0.00097210985,0.0043602786],"category_scores_gemma":[0.016961282,0.00076671975,0.002585257,0.0012949827,0.0044308384,0.01246383,0.0030729745,0.002905855,0.0009055017],"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.00069299754,0.00020728099,0.0021269445,0.00043612375,0.00015712364,0.0005244637,0.0009459231,0.1012222,0.016736135,0.79947805,0.002406097,0.07506673],"study_design_scores_gemma":[0.00007992701,0.00009364157,0.00022054248,0.000045904966,0.000078220386,0.00012485168,0.00013199018,0.3394962,0.026118098,0.62979186,0.0037609416,0.000057920945],"about_ca_topic_score_codex":0.0050106267,"about_ca_topic_score_gemma":0.0061343634,"teacher_disagreement_score":0.0050106267,"about_ca_system_score_codex":0.0019912736,"about_ca_system_score_gemma":0.0034797778,"threshold_uncertainty_score":0.018936276},"labels":[],"label_agreement":null},{"id":"W2997326929","doi":"10.1609/aaai.v34i03.5669","title":"ElGolog: A High-Level Programming Language with Memory of the Execution History","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","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":"Simon Fraser University; York University","funders":"European Commission","keywords":"Converse; Computer science; Programming language; Situation calculus; Mathematics","score_opus":0.08513993585300643,"score_gpt":0.25414579831492945,"score_spread":0.169005862461923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997326929","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.009344779,0.00014959618,0.9607285,0.0006581247,0.000052762993,0.00011921468,0.00067852705,0.023537781,0.0047305957],"genre_scores_gemma":[0.2722581,0.00043408887,0.7110482,0.001348521,0.00009270622,0.00039916736,0.0014793496,0.0034890855,0.009450797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931455,0.00018000923,0.00007467137,0.00015026887,0.00016873042,0.00011176345],"domain_scores_gemma":[0.99842453,0.0008269153,0.00020254229,0.00030393197,0.00015375754,0.000088342356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377217,0.0006393962,0.0004701696,0.00065263273,0.0005292078,0.0024507374,0.002129599,0.00087215565,0.006047399],"category_scores_gemma":[0.0028860937,0.00070563925,0.0009990375,0.0006048362,0.0029512711,0.00506839,0.0021818879,0.0021479067,0.0014265105],"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.0005589814,0.00013669938,0.0032896488,0.00080105406,0.00008004942,0.0008826675,0.0020566746,0.02892187,0.013625707,0.7352134,0.023362136,0.19107105],"study_design_scores_gemma":[0.00022133581,0.0002189895,0.0011960737,0.00027661675,0.00013160684,0.0010208082,0.00031565808,0.17351817,0.025549503,0.53139555,0.26600695,0.00014875011],"about_ca_topic_score_codex":0.0030330962,"about_ca_topic_score_gemma":0.005001819,"teacher_disagreement_score":0.006047399,"about_ca_system_score_codex":0.0009017057,"about_ca_system_score_gemma":0.0018569432,"threshold_uncertainty_score":0.020230532},"labels":[],"label_agreement":null},{"id":"W2997463312","doi":"10.1017/s1471068421000089","title":"Exploring the Jungle of Intuitionistic Temporal Logics","year":2021,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Computer science; Soundness; Kripke semantics; Intuitionistic logic; Linear logic; Axiom; Interpretation (philosophy); Class (philosophy); Type theory; Theoretical computer science; Artificial intelligence; Intermediate logic; Mathematics; Description logic; Type (biology); Programming language","score_opus":0.09011873064827158,"score_gpt":0.3032837098513963,"score_spread":0.21316497920312472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997463312","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.09796761,0.0042688735,0.8069733,0.012104227,0.00039478875,0.00010447211,0.00016450197,0.00041521576,0.07760707],"genre_scores_gemma":[0.8557325,0.0013967202,0.13839932,0.0010366723,0.00024128145,0.00009138616,0.00009143428,0.0000643561,0.002946298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671966,0.0016203561,0.00018445557,0.0003427704,0.0008056803,0.0003270758],"domain_scores_gemma":[0.995488,0.0027738016,0.00035534785,0.0004508722,0.0006049187,0.0003272176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051815216,0.0005176875,0.00047290337,0.0019873562,0.0020768514,0.006376905,0.0013058095,0.0015378863,0.0027156828],"category_scores_gemma":[0.0050284923,0.0007117711,0.0010961054,0.0012663472,0.010623509,0.010874626,0.004121893,0.0041627954,0.00030596263],"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.0000075286007,0.000009231468,0.000068508794,0.000016351974,0.0000032643777,0.00003687266,0.00026847434,0.000812883,0.00019484779,0.99684,0.00017321827,0.001568843],"study_design_scores_gemma":[0.0000056883932,0.000006374795,0.000028623574,0.000016554619,0.0000031305667,0.000017916855,0.000089053596,0.006838443,0.00014640707,0.9911937,0.001648835,0.000005207985],"about_ca_topic_score_codex":0.0025637394,"about_ca_topic_score_gemma":0.0025955157,"teacher_disagreement_score":0.006376905,"about_ca_system_score_codex":0.002869611,"about_ca_system_score_gemma":0.001673949,"threshold_uncertainty_score":0.027402818},"labels":[],"label_agreement":null},{"id":"W2997707599","doi":"10.48550/arxiv.1909.07296","title":"A Substructural Epistemic Resource Logic: Theory and Modelling\\n Applications","year":2019,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","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":"Prevention of Organ Failure","funders":"","keywords":"Soundness; Epistemic modal logic; Completeness (order theory); Modalities; Computer science; Semantics (computer science); Resource (disambiguation); Theoretical computer science; Modal logic; Epistemology; Multimodal logic; Calculus (dental); Programming language; Mathematics; Description logic; Philosophy; Sociology; Medicine; Modal","score_opus":0.04138310706678809,"score_gpt":0.17398225532916858,"score_spread":0.1325991482623805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997707599","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.0056866608,0.0006758363,0.96612966,0.0012623166,0.00007491217,0.000053449614,0.00014527547,0.00033064006,0.025641305],"genre_scores_gemma":[0.3920065,0.0018172489,0.5824472,0.00074072013,0.0002651609,0.00034778425,0.0003971135,0.00018501763,0.021793384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987657,0.0004820523,0.00009177292,0.00025029108,0.0002990403,0.00011114802],"domain_scores_gemma":[0.9989235,0.00051869516,0.00010485692,0.00016350303,0.00017889624,0.0001104845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021770399,0.00073901605,0.000522981,0.001990061,0.0014829547,0.0039514396,0.0026957649,0.001731542,0.0057561295],"category_scores_gemma":[0.002878471,0.0005604364,0.0011427668,0.0023730665,0.0046599335,0.007606255,0.003032449,0.0028929203,0.0013702903],"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.0000056598415,0.000005863047,0.0000315749,0.000025420839,0.0000028287564,0.00003591589,0.00009551311,0.0024139262,0.00031090752,0.99264914,0.00038851993,0.004034649],"study_design_scores_gemma":[0.000009988996,0.000012951633,0.00003757514,0.00003832176,0.000011289529,0.00007076597,0.00006198296,0.056891583,0.0009929497,0.92508096,0.016777348,0.000014315249],"about_ca_topic_score_codex":0.004806832,"about_ca_topic_score_gemma":0.0028481325,"teacher_disagreement_score":0.0057561295,"about_ca_system_score_codex":0.0025909522,"about_ca_system_score_gemma":0.0013455668,"threshold_uncertainty_score":0.019256234},"labels":[],"label_agreement":null},{"id":"W2999356579","doi":"10.1007/s10516-019-09471-w","title":"The Content and Logic of Imperatives","year":2020,"lang":"en","type":"article","venue":"Axiomathes","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ontology; Content (measure theory); Computer science; Epistemology; Natural language processing; Artificial intelligence; Cognitive science; Philosophy; Psychology; Mathematics","score_opus":0.06266457352607788,"score_gpt":0.2409762868092159,"score_spread":0.17831171328313802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999356579","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.0594143,0.010153834,0.75732654,0.023498632,0.00066716643,0.0000898311,0.0010408497,0.0009716472,0.14683713],"genre_scores_gemma":[0.8454898,0.0047361595,0.12689212,0.00217095,0.0015067502,0.0001951756,0.00084384513,0.00031728638,0.01784804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592555,0.0020953517,0.00027099025,0.0005905107,0.0008455603,0.00027201718],"domain_scores_gemma":[0.9862613,0.010534837,0.00048643444,0.0012280904,0.0011448507,0.00034455425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047233566,0.0006073696,0.00074987544,0.002760249,0.002104352,0.007852448,0.0022733372,0.00221593,0.0060933908],"category_scores_gemma":[0.017312568,0.001082094,0.0012897527,0.0021537645,0.013071357,0.023066843,0.0031739436,0.005135193,0.0012877028],"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.000011183742,0.00000641402,0.000072497096,0.000028666907,0.0000037883485,0.00001592067,0.00020730108,0.00025390997,0.00010319069,0.99552333,0.00059280405,0.0031809197],"study_design_scores_gemma":[0.000005122667,0.00000250198,0.000037880705,0.000013168807,0.0000036663891,0.000015529555,0.000038462054,0.000845195,0.00011225856,0.9959417,0.0029808916,0.000003593394],"about_ca_topic_score_codex":0.0017085172,"about_ca_topic_score_gemma":0.0011017297,"teacher_disagreement_score":0.007852448,"about_ca_system_score_codex":0.0028857917,"about_ca_system_score_gemma":0.0015983543,"threshold_uncertainty_score":0.02497977},"labels":[],"label_agreement":null},{"id":"W3012364298","doi":"10.1017/s1471068420000046","title":"Train Scheduling with Hybrid Answer Set Programming","year":2020,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":23,"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":"Computer science; Answer set programming; Scheduling (production processes); Heuristics; Preprocessor; Job shop scheduling; Mathematical optimization; Distributed computing; Set (abstract data type); Routing (electronic design automation); Artificial intelligence; Programming language; Embedded system; Operating system; Mathematics","score_opus":0.03509764070194063,"score_gpt":0.2860400346852408,"score_spread":0.2509423939833002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012364298","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.022831291,0.00013989478,0.9672596,0.00065749616,0.00006830697,0.00013562068,0.00031467745,0.002363385,0.006229773],"genre_scores_gemma":[0.29936728,0.000121717836,0.6954853,0.00048136344,0.00006128575,0.00023698983,0.00080922584,0.00029833926,0.0031385769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818355,0.0008326517,0.0000823973,0.0002528051,0.0004527329,0.00019582082],"domain_scores_gemma":[0.997152,0.0019427309,0.00013280068,0.00034211436,0.00033046192,0.00009992384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019176268,0.00088771916,0.0007523614,0.0010497336,0.00050338067,0.0019378628,0.0019802756,0.0011934601,0.005566442],"category_scores_gemma":[0.0054086135,0.00044169292,0.0012576203,0.0013186284,0.0010680554,0.0017089744,0.0018780956,0.0021718103,0.0008212411],"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.00028995817,0.00035611662,0.0006923795,0.00017591064,0.000089393034,0.00013082595,0.00016238785,0.81027746,0.003382445,0.07666377,0.00613457,0.10164478],"study_design_scores_gemma":[0.000044968077,0.00003886548,0.00006625069,0.000011962719,0.000012231653,0.000017515154,0.000033471624,0.94891435,0.0012855857,0.04679372,0.0027739825,0.0000070529923],"about_ca_topic_score_codex":0.0036997963,"about_ca_topic_score_gemma":0.0047334456,"teacher_disagreement_score":0.005566442,"about_ca_system_score_codex":0.0011170609,"about_ca_system_score_gemma":0.0015785069,"threshold_uncertainty_score":0.018621624},"labels":[],"label_agreement":null},{"id":"W3013273637","doi":"10.4230/lipics.stacs.2020.40","title":"Succinct Population Protocols for Presburger Arithmetic","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Presburger arithmetic; Remainder; Population; Protocol (science); Quantifier (linguistics); Computer science; Discrete mathematics; Fragment (logic); Mathematics; Decidability; Arithmetic; Programming language","score_opus":0.046122456538243706,"score_gpt":0.3144925250052844,"score_spread":0.2683700684670407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013273637","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.025300313,0.00019373556,0.9602276,0.0010363244,0.00009198318,0.0003361087,0.00039286976,0.0019543343,0.010466755],"genre_scores_gemma":[0.55278426,0.00054985477,0.42877653,0.0012955627,0.00018145364,0.0015059981,0.0013714362,0.00087262446,0.0126621565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996228,0.0010805234,0.00028041657,0.0007475294,0.0012580584,0.00040552256],"domain_scores_gemma":[0.99306715,0.0043681846,0.00042579122,0.001383691,0.00057992764,0.00017525154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029324426,0.00078749104,0.000740379,0.0007886645,0.0013854997,0.0025255817,0.001894559,0.0012725609,0.010794685],"category_scores_gemma":[0.0099087795,0.0006751717,0.0016372793,0.0007654024,0.0033155633,0.00916262,0.0050622174,0.005171444,0.0017321266],"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.00018214641,0.00010531405,0.00038889784,0.00020895382,0.000029265582,0.0001285189,0.00079809444,0.019784002,0.011440322,0.93475705,0.0027071545,0.029470325],"study_design_scores_gemma":[0.00015026148,0.00013669151,0.00016687832,0.00008990158,0.000055818557,0.0000973529,0.00016580292,0.09087117,0.028932642,0.86492574,0.014349499,0.0000582063],"about_ca_topic_score_codex":0.0009845326,"about_ca_topic_score_gemma":0.0015961089,"teacher_disagreement_score":0.010794685,"about_ca_system_score_codex":0.002356699,"about_ca_system_score_gemma":0.0021381574,"threshold_uncertainty_score":0.03611189},"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":"W3015778484","doi":"","title":"In Memoriam: Douglas Walton 1942-2020","year":2020,"lang":"en","type":"article","venue":"Érudit (Université de Montréal)","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 Windsor","funders":"","keywords":"Argument (complex analysis); Philosophy; Epistemology; Sociology; Psychoanalysis; Psychology; Medicine","score_opus":0.006719481147685297,"score_gpt":0.16228774958723244,"score_spread":0.15556826843954713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015778484","genre_codex":"commentary","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.00015174858,0.0075046197,0.00032334766,0.5003579,0.48290494,0.000014052977,0.00023085331,0.000106995445,0.008405525],"genre_scores_gemma":[0.0067830887,0.0064085904,0.00052473886,0.49953184,0.21507366,0.00007222725,0.00038486085,0.00028333697,0.27093774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832183,0.000293605,0.000108000524,0.00041253783,0.0006805216,0.00018356867],"domain_scores_gemma":[0.99298495,0.0012707362,0.00036024334,0.00024266134,0.0037521145,0.0013893937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023679074,0.00093415804,0.000938432,0.0009045527,0.0041046883,0.0060524573,0.0014632173,0.005593772,0.03658337],"category_scores_gemma":[0.020607943,0.0003533884,0.000740651,0.00061653485,0.002308132,0.0038903356,0.0030609816,0.016451996,0.03081161],"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.0000095208125,0.0000018646668,0.000027761986,0.000010356193,0.0000017593367,0.000039381837,0.000029309613,0.000003930685,0.00001419926,0.00059895567,0.99756205,0.0017010117],"study_design_scores_gemma":[0.0000059778367,0.000005883066,0.00014208238,0.000082844235,0.0000038740814,0.00010432987,0.00013860177,0.000023104767,0.0000659491,0.0009753895,0.99844176,0.000010215922],"about_ca_topic_score_codex":0.008174047,"about_ca_topic_score_gemma":0.01769119,"teacher_disagreement_score":0.03658337,"about_ca_system_score_codex":0.0043391157,"about_ca_system_score_gemma":0.0033151046,"threshold_uncertainty_score":0.122383535},"labels":[],"label_agreement":null},{"id":"W3022125085","doi":"10.5555/2615731.2615757","title":"Progression and verification of situation calculus agents with bounded beliefs","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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","funders":"","keywords":"Situation calculus; Decidability; Bounded function; Action (physics); Computer science; Domain (mathematical analysis); Object (grammar); Temporal logic; Belief revision; Calculus (dental); Order (exchange); Mathematics; Theoretical computer science; Discrete mathematics; Artificial intelligence","score_opus":0.03857713149392297,"score_gpt":0.2800804080179356,"score_spread":0.24150327652401263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022125085","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.103170216,0.00025047816,0.88801867,0.00085357117,0.00005283298,0.00020202449,0.0003303022,0.0016495457,0.0054723374],"genre_scores_gemma":[0.7789321,0.0002899343,0.21597572,0.00021904286,0.000073878444,0.0002933613,0.00071577315,0.00015685895,0.0033432413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991975,0.0020228818,0.00054909807,0.0015028623,0.002855953,0.0010943175],"domain_scores_gemma":[0.97866565,0.015013075,0.0017083447,0.0018872089,0.0020235793,0.0007021933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007826946,0.00101814,0.0009589631,0.0018146529,0.0016677378,0.0035641596,0.0026015579,0.0014697837,0.0035387354],"category_scores_gemma":[0.031043561,0.00082663365,0.0029750834,0.0010792809,0.005532158,0.009025323,0.0042213746,0.004063621,0.00047436435],"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.0003105234,0.00013173102,0.002549875,0.00024386817,0.00013407385,0.0011366548,0.00198181,0.09036722,0.009570187,0.87133366,0.0007111956,0.02152931],"study_design_scores_gemma":[0.000111019894,0.00009444897,0.0003538705,0.00006819559,0.00008584068,0.000147772,0.00020602667,0.39185312,0.009081303,0.59452116,0.0034203662,0.000056965317],"about_ca_topic_score_codex":0.011236188,"about_ca_topic_score_gemma":0.0059694406,"teacher_disagreement_score":0.011236188,"about_ca_system_score_codex":0.0032009876,"about_ca_system_score_gemma":0.004659688,"threshold_uncertainty_score":0.04139328},"labels":[],"label_agreement":null},{"id":"W3035029999","doi":"10.24963/ijcai.2020/250","title":"A Modal Logic for Joint Abilities under Strategy Commitments","year":2020,"lang":"en","type":"article","venue":"","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Multimodal logic; Linear temporal logic; Extension (predicate logic); Modal logic; Dynamic logic (digital electronics); Computer science; Temporal logic; Joint (building); Temporal logic of actions; Modal; Operator (biology); Representation (politics); Description logic; Knowledge representation and reasoning; Artificial intelligence; Theoretical computer science; Programming language; Engineering","score_opus":0.11849711138450673,"score_gpt":0.2828529239561271,"score_spread":0.16435581257162035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035029999","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.026954595,0.0005649058,0.93863195,0.002618801,0.00019201134,0.00017179758,0.0008636442,0.0012018578,0.0288006],"genre_scores_gemma":[0.64456636,0.0006364605,0.34039205,0.0015492295,0.00028302416,0.0004038714,0.0008801623,0.00016710535,0.011121731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770385,0.00063350354,0.0002296854,0.00049301796,0.0005744685,0.00036554676],"domain_scores_gemma":[0.99740124,0.0014157965,0.00027856097,0.0002394145,0.00049211876,0.000172879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028783276,0.0007585699,0.00047048883,0.0015016984,0.0018460433,0.0035138382,0.001979162,0.0013497081,0.0053522983],"category_scores_gemma":[0.004637561,0.0006037845,0.0018359045,0.0013442712,0.004332759,0.008504691,0.0035042346,0.0036780792,0.0007376851],"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.00006092289,0.000037845384,0.00018695138,0.00009528758,0.000019348803,0.00019639255,0.0006209404,0.0042655086,0.0022892463,0.9755946,0.0019655884,0.01466733],"study_design_scores_gemma":[0.000073640185,0.00005734174,0.0001716898,0.000063431704,0.000071462644,0.00024824546,0.00035418387,0.061037567,0.004311073,0.9137338,0.019821223,0.000056459092],"about_ca_topic_score_codex":0.0070958943,"about_ca_topic_score_gemma":0.0059488667,"teacher_disagreement_score":0.0070958943,"about_ca_system_score_codex":0.003518488,"about_ca_system_score_gemma":0.0026742357,"threshold_uncertainty_score":0.02552855},"labels":[],"label_agreement":null},{"id":"W3037007237","doi":"","title":"From Association to Reasoning, an Alternative to Pearls' Causal Reasoning.","year":2020,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Université du Québec à Montréal","funders":"","keywords":"Causal reasoning; Association (psychology); Computer science; Case-based reasoning; Opportunistic reasoning; Deductive reasoning; Model-based reasoning; Cognitive science; Artificial intelligence; Epistemology; Cognition; Psychology; Knowledge representation and reasoning; Philosophy; Psychiatry","score_opus":0.06403721750851618,"score_gpt":0.36133342209304525,"score_spread":0.2972962045845291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037007237","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.0028380693,0.00669946,0.7144807,0.052849248,0.0034567916,0.00014943504,0.00059767975,0.00053630164,0.21839237],"genre_scores_gemma":[0.45911834,0.0083497465,0.445781,0.016611664,0.005487304,0.00079189247,0.0011821308,0.00043423427,0.062243715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923448,0.0034887653,0.0004150863,0.0014376958,0.0019986136,0.0003149763],"domain_scores_gemma":[0.989939,0.005443555,0.000569653,0.0023727634,0.0012608672,0.00041424567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077563473,0.0010524908,0.0012224063,0.0040925723,0.0032098286,0.009883452,0.004468575,0.0047960957,0.014479166],"category_scores_gemma":[0.029446078,0.00081378175,0.0023352015,0.0040490944,0.018938806,0.026946902,0.006760552,0.009080042,0.0040299585],"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.000019440056,0.000010424921,0.00008566263,0.000054535707,0.00001779173,0.000051932882,0.00036414724,0.00024183451,0.000029409177,0.984294,0.0040835505,0.010747309],"study_design_scores_gemma":[0.0000069019884,0.0000032294377,0.000026537602,0.000021835087,0.0000057915627,0.00005410352,0.00006381826,0.0006510046,0.000046280766,0.9878016,0.011314415,0.00000459018],"about_ca_topic_score_codex":0.003500831,"about_ca_topic_score_gemma":0.003808007,"teacher_disagreement_score":0.014479166,"about_ca_system_score_codex":0.0028012013,"about_ca_system_score_gemma":0.003503104,"threshold_uncertainty_score":0.048437595},"labels":[],"label_agreement":null},{"id":"W3037763758","doi":"10.2139/ssrn.3577239","title":"Spreadsheets for Legal Reasoning: The Continued Promise of Declarative Logic Programming in Law","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Programming language; Declarative programming; Computer science; Logic programming; Deductive reasoning; Law; Artificial intelligence; Political science; Inductive programming; Programming paradigm","score_opus":0.018917858727312137,"score_gpt":0.2587676563384473,"score_spread":0.23984979761113515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037763758","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.0063052475,0.010346918,0.8966917,0.04369439,0.001068871,0.00011831272,0.0009974054,0.005938928,0.034838174],"genre_scores_gemma":[0.09672854,0.01765397,0.85770553,0.0060383007,0.002587043,0.0003439903,0.0014728104,0.0022199,0.015249848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927088,0.0034526954,0.0005503389,0.0007178796,0.002338666,0.00023171923],"domain_scores_gemma":[0.9113841,0.066490665,0.0014431208,0.014498202,0.004640628,0.0015432299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015359203,0.0010852014,0.0014223285,0.0031433066,0.0013167703,0.013804612,0.00618795,0.0044011953,0.03740223],"category_scores_gemma":[0.059068594,0.001491768,0.0016101289,0.0051495438,0.0074648643,0.044646334,0.0060536447,0.011094011,0.007936473],"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.00015577363,0.00010175027,0.00040910018,0.00032679262,0.000057973786,0.00004988625,0.000351944,0.005440287,0.0005276739,0.8119873,0.028566025,0.1520256],"study_design_scores_gemma":[0.00008984083,0.000028629896,0.000108543514,0.0004157061,0.000022692757,0.000056301706,0.00012782894,0.03419459,0.00088506076,0.8725896,0.09142434,0.000056873694],"about_ca_topic_score_codex":0.004002374,"about_ca_topic_score_gemma":0.0033661518,"teacher_disagreement_score":0.03740223,"about_ca_system_score_codex":0.0020448773,"about_ca_system_score_gemma":0.0032314674,"threshold_uncertainty_score":0.12512296},"labels":[],"label_agreement":null},{"id":"W3038013650","doi":"10.65109/eqat9756","title":"Computationally Grounded Quantitative Trust with Time","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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":"Computer science; Construct (python library); Model checking; Quantitative analysis (chemistry); Logical framework; Artificial intelligence; Theoretical computer science; Management science; Data science; Human–computer interaction; Programming language","score_opus":0.026400343398932363,"score_gpt":0.23813910585803078,"score_spread":0.21173876245909842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038013650","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.014983056,0.00014317635,0.9776407,0.00065635087,0.000048742346,0.00011441314,0.0002551891,0.00064894045,0.005509454],"genre_scores_gemma":[0.63966805,0.00021004128,0.35574648,0.00020147604,0.00005866369,0.00032309972,0.00034749944,0.00025268408,0.0031921084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99116534,0.003934267,0.0005354186,0.0011854132,0.0025386729,0.0006409585],"domain_scores_gemma":[0.97332746,0.0181598,0.002267678,0.0036602991,0.0019494321,0.00063537277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065944274,0.0014907548,0.0010673114,0.0023110942,0.0011960149,0.005595695,0.0028178818,0.0014915378,0.005795654],"category_scores_gemma":[0.0377045,0.00093564333,0.002389651,0.0016224795,0.005247521,0.012134411,0.0048604636,0.003431601,0.0005286323],"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.00019448837,0.000046473284,0.00088088796,0.0001655621,0.00006829157,0.00019528477,0.0004488276,0.24621634,0.0012943092,0.73420894,0.0008416441,0.015438997],"study_design_scores_gemma":[0.000036465266,0.000041406987,0.00009624402,0.0000465068,0.000036021185,0.000044741835,0.00009179807,0.5493776,0.0015336967,0.44658056,0.002090302,0.00002475511],"about_ca_topic_score_codex":0.010200991,"about_ca_topic_score_gemma":0.008442277,"teacher_disagreement_score":0.010200991,"about_ca_system_score_codex":0.0061378973,"about_ca_system_score_gemma":0.0036061138,"threshold_uncertainty_score":0.04453373},"labels":[],"label_agreement":null},{"id":"W3038017159","doi":"10.65109/ympu2037","title":"Epistemic Plan Recognition","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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 Toronto","funders":"","keywords":"Epistemic modal logic; Plan (archaeology); Computer science; Epistemology; Artificial intelligence; Set (abstract data type); Task (project management); Process (computing); Epistemic virtue; Multimodal logic; Engineering; Philosophy; Description logic; Programming language","score_opus":0.06078415612745125,"score_gpt":0.2253533925682471,"score_spread":0.16456923644079585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038017159","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.0057990695,0.0000883546,0.98102313,0.00071604067,0.000051719748,0.00021196522,0.00045803987,0.0027152,0.00893644],"genre_scores_gemma":[0.23097156,0.00023281285,0.7590631,0.00028368397,0.000049206985,0.00034527943,0.002213339,0.0004328749,0.006408068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971521,0.00085812394,0.0002876003,0.0007063826,0.00073393766,0.00026197548],"domain_scores_gemma":[0.9914579,0.004887151,0.0007132738,0.0018223294,0.00088085205,0.00023848291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035091136,0.0010787016,0.0007002839,0.0012715753,0.0012529166,0.0032836415,0.0024805723,0.0019843536,0.010069684],"category_scores_gemma":[0.016680926,0.0005912982,0.0024410354,0.0007695723,0.0024954681,0.005204633,0.003324475,0.0027492964,0.0021223694],"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.00044272462,0.00028177758,0.0027435615,0.00067878613,0.00013229149,0.0006073428,0.0014331582,0.1438951,0.00736671,0.53713363,0.017932571,0.2873523],"study_design_scores_gemma":[0.00005808781,0.000094048555,0.00066678814,0.00015802287,0.00009542389,0.0003586919,0.0005184351,0.56532973,0.012867439,0.38369212,0.036078703,0.00008247208],"about_ca_topic_score_codex":0.00680855,"about_ca_topic_score_gemma":0.008028956,"teacher_disagreement_score":0.010069684,"about_ca_system_score_codex":0.0016286054,"about_ca_system_score_gemma":0.0045733326,"threshold_uncertainty_score":0.03368652},"labels":[],"label_agreement":null},{"id":"W3040098638","doi":"10.1109/re48521.2020.00049","title":"Symboleo: Towards a Specification Language for Legal Contracts","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":54,"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 Ottawa","funders":"","keywords":"Computer science; Executable; Design by contract; Specification language; Formal specification; Smart contract; Programming language; Ontology; Software engineering; Semantics (computer science); Axiom; Language Of Temporal Ordering Specification; Computer security; Software; Software development; Database transaction","score_opus":0.03012364973396586,"score_gpt":0.2636554690119168,"score_spread":0.23353181927795091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040098638","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.0009715196,0.00017759122,0.990936,0.0008203837,0.00011571355,0.00020101202,0.0005584227,0.002318769,0.0039006316],"genre_scores_gemma":[0.032328706,0.0008570319,0.9547112,0.0012425996,0.00015833114,0.0008831887,0.0026081936,0.0015389957,0.00567176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903501,0.0035964504,0.0015722595,0.00080984674,0.003064268,0.00060704426],"domain_scores_gemma":[0.99089676,0.004741189,0.00090316986,0.0010501171,0.0019518333,0.0004568194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0117003685,0.0013548364,0.0012114927,0.0028566632,0.001746708,0.0066463146,0.0032526227,0.0029754725,0.00785321],"category_scores_gemma":[0.014310216,0.0020209777,0.0029181533,0.002570297,0.004928421,0.009732258,0.005404672,0.007263892,0.003618385],"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.00006569539,0.00004771303,0.00030141417,0.00032322467,0.0000224771,0.0002602385,0.0011453939,0.0074968594,0.003541882,0.9497182,0.0103780925,0.026698953],"study_design_scores_gemma":[0.00013997473,0.000088787216,0.0001910276,0.0004781731,0.000049205293,0.0007427943,0.0005450408,0.095777944,0.008959344,0.40994737,0.48293734,0.00014295986],"about_ca_topic_score_codex":0.0060647065,"about_ca_topic_score_gemma":0.0053478954,"teacher_disagreement_score":0.0117003685,"about_ca_system_score_codex":0.0028711448,"about_ca_system_score_gemma":0.007580953,"threshold_uncertainty_score":0.061878145},"labels":[],"label_agreement":null},{"id":"W3040611580","doi":"10.1007/978-3-030-52152-3_22","title":"Learning to Model Another Agent’s Beliefs: A Preliminary Approach","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Process (computing); Order (exchange); Artificial intelligence; Intelligent agent; Belief revision; Natural (archaeology); Cognitive science; Psychology","score_opus":0.027303179272468114,"score_gpt":0.2364933274448766,"score_spread":0.2091901481724085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040611580","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.005477147,0.00034497184,0.9817822,0.0017467315,0.000051194816,0.00006837269,0.000121761565,0.00012085595,0.010286873],"genre_scores_gemma":[0.3823143,0.001383653,0.59241074,0.00091533887,0.00035686544,0.0004909817,0.0006272909,0.00010140534,0.02139937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998825,0.00053199154,0.000075071875,0.00028706974,0.00021268164,0.000068216126],"domain_scores_gemma":[0.9946583,0.0039273235,0.0001611118,0.0006006576,0.00045178024,0.00020084406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026807447,0.0010306062,0.00088826654,0.00066041347,0.00072493905,0.002571186,0.0032868376,0.0018503097,0.008614053],"category_scores_gemma":[0.008707054,0.00057791325,0.0015080235,0.0010025363,0.00232854,0.0068735983,0.002792889,0.0033984156,0.0011325949],"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.000112456495,0.00021705661,0.00093285483,0.0002390275,0.0001231319,0.00019124625,0.00069174235,0.08215757,0.0014412467,0.83544374,0.004057163,0.07439279],"study_design_scores_gemma":[0.000018252873,0.00010349936,0.00021892767,0.000043542015,0.00003324344,0.00008205725,0.000091404254,0.24448702,0.00072453194,0.7485799,0.005592836,0.000024799981],"about_ca_topic_score_codex":0.0035425539,"about_ca_topic_score_gemma":0.0034278717,"teacher_disagreement_score":0.008614053,"about_ca_system_score_codex":0.0015109198,"about_ca_system_score_gemma":0.0013996284,"threshold_uncertainty_score":0.028816938},"labels":[],"label_agreement":null},{"id":"W3042122359","doi":"10.24963/ijcai.2020/749","title":"GenC: A Fast Tool for Applications Involving Belief Revision","year":2020,"lang":"en","type":"article","venue":"","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":"British Columbia Institute of Technology","funders":"","keywords":"Solver; Class (philosophy); Belief revision; Computer science; Problem solver; Hamming distance; Similarity (geometry); Artificial intelligence; Variety (cybernetics); Theoretical computer science; Component (thermodynamics); Algorithm; Programming language; Software engineering","score_opus":0.028214723933387312,"score_gpt":0.2579864000941247,"score_spread":0.2297716761607374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042122359","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.0019376695,0.00028327707,0.725299,0.00031011848,0.00015925782,0.00020721732,0.002101613,0.26326513,0.006436685],"genre_scores_gemma":[0.07365288,0.0005849159,0.858842,0.0010543303,0.00013807275,0.0009983123,0.00664772,0.049086306,0.008995403],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997612,0.00058788835,0.00019171827,0.00039920514,0.0010072669,0.00020197027],"domain_scores_gemma":[0.98953855,0.007261693,0.00040378454,0.0014905079,0.0010969044,0.00020854264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037089388,0.002200915,0.0013525041,0.0025718121,0.00093976076,0.0028522522,0.0049549513,0.0024311799,0.04827677],"category_scores_gemma":[0.017322531,0.0015563138,0.001949429,0.0020325321,0.0013157311,0.004537204,0.0041955705,0.0034382541,0.013552259],"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.0011251029,0.0002449307,0.003250155,0.0018974999,0.00030344754,0.0014538171,0.0007934972,0.041762587,0.009133981,0.10347369,0.37470123,0.46186006],"study_design_scores_gemma":[0.00063648267,0.00012735177,0.00093922345,0.00040943548,0.00010146235,0.0012173497,0.00014839585,0.57257235,0.029551592,0.13219671,0.26186967,0.00022994172],"about_ca_topic_score_codex":0.003279989,"about_ca_topic_score_gemma":0.004760255,"teacher_disagreement_score":0.04827677,"about_ca_system_score_codex":0.0016551545,"about_ca_system_score_gemma":0.0024315373,"threshold_uncertainty_score":0.16150194},"labels":[],"label_agreement":null},{"id":"W3042245160","doi":"10.1145/3434292","title":"Probabilistic programming semantics for name generation","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Semantics (computer science); Calculus (dental); Computer science; Analogy; Operational semantics; Mathematics; Algebra over a field; Discrete mathematics; Programming language; Pure mathematics; Artificial intelligence; Linguistics","score_opus":0.034371214083242056,"score_gpt":0.2882303096701417,"score_spread":0.2538590955868996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042245160","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.0037622293,0.0003459185,0.9814532,0.002735492,0.00018308069,0.00004884766,0.00022840781,0.0005423679,0.010700492],"genre_scores_gemma":[0.4158911,0.0012136057,0.55768937,0.0027637705,0.0011745745,0.00073050294,0.00067150785,0.0007838303,0.019081704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928611,0.0021691248,0.0005452453,0.0015084017,0.0023886827,0.0005273625],"domain_scores_gemma":[0.98923254,0.005809782,0.0008188493,0.0022954696,0.001338072,0.0005051784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007639281,0.00097291655,0.000989239,0.0022438543,0.0024111108,0.0063190097,0.0038915311,0.0028189393,0.009275609],"category_scores_gemma":[0.0132232765,0.0009876277,0.0028824059,0.0022368524,0.008112065,0.016180707,0.0046621277,0.0061776396,0.0020469967],"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.000004922973,0.0000065831628,0.00004233522,0.000014762168,0.000004006129,0.00002536379,0.00012249296,0.0009325614,0.00013850797,0.99620664,0.000347919,0.0021539258],"study_design_scores_gemma":[0.000008088731,0.0000065120416,0.000029218645,0.00001192489,0.0000066239722,0.000068151734,0.000031115786,0.008712841,0.00034124043,0.98410493,0.0066671227,0.000012117636],"about_ca_topic_score_codex":0.0018837049,"about_ca_topic_score_gemma":0.0012952812,"teacher_disagreement_score":0.009275609,"about_ca_system_score_codex":0.002858151,"about_ca_system_score_gemma":0.0022842763,"threshold_uncertainty_score":0.040400803},"labels":[],"label_agreement":null},{"id":"W3043970203","doi":"10.1007/978-981-15-5054-6_11","title":"Towards Making Safety Case Arguments Explicit, Precise, and Well Founded","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Notation; Argument (complex analysis); Safety case; Epistemology; Situation calculus; Computer science; Semantics (computer science); Calculus (dental); Programming language; Risk analysis (engineering); Mathematics; Philosophy; Medicine","score_opus":0.0313689444226444,"score_gpt":0.25408120400154166,"score_spread":0.22271225957889726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043970203","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.002219389,0.0013272371,0.92206854,0.0046814284,0.00052425585,0.00013167584,0.00021911143,0.0016174078,0.067210935],"genre_scores_gemma":[0.10798051,0.002775046,0.8450022,0.002106499,0.0009314709,0.00026184143,0.00069482095,0.0015029715,0.038744546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912477,0.0029677646,0.0006570182,0.001206904,0.0033737724,0.0005469104],"domain_scores_gemma":[0.96895075,0.021150908,0.0010470017,0.005311647,0.0031426125,0.00039713312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011050165,0.0017249879,0.0014442942,0.0033952163,0.0018433549,0.010905445,0.005044095,0.0050646765,0.019790452],"category_scores_gemma":[0.040688075,0.0029327744,0.0018983841,0.002280388,0.009454229,0.02911825,0.0085215345,0.014239156,0.009843557],"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.000028986384,0.000038926293,0.000093433126,0.00015488602,0.000017062268,0.0000810412,0.00041370845,0.0019993235,0.00090616423,0.93744105,0.010078612,0.048746902],"study_design_scores_gemma":[0.000011863911,0.0000064686787,0.000047771544,0.000112432266,0.000021181359,0.000066981476,0.00008749222,0.0068583703,0.0013153272,0.95851994,0.032937285,0.000014826029],"about_ca_topic_score_codex":0.002196002,"about_ca_topic_score_gemma":0.0031235595,"teacher_disagreement_score":0.019790452,"about_ca_system_score_codex":0.0029580183,"about_ca_system_score_gemma":0.0032337075,"threshold_uncertainty_score":0.06620562},"labels":[],"label_agreement":null},{"id":"W3080556762","doi":"10.24963/kr.2020/57","title":"Changing Beliefs about Domain Dynamics in the Situation Calculus","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Situation calculus; Axiom; Domain (mathematical analysis); Action (physics); Dynamics (music); Rewriting; Relation (database); Computer science; Belief revision; Artificial intelligence; Epistemology; Mathematics; Psychology; Data mining; Programming language","score_opus":0.015584184587081084,"score_gpt":0.23359037720629053,"score_spread":0.21800619261920945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080556762","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.03739919,0.00013386569,0.9478335,0.0014242966,0.00008793605,0.000117855285,0.00015953046,0.0008618831,0.011981982],"genre_scores_gemma":[0.59664965,0.0002858083,0.39766392,0.00034856482,0.0001257186,0.00020733125,0.00021365477,0.00020070643,0.004304585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929611,0.003147798,0.000493554,0.0011164629,0.0017841527,0.00049682596],"domain_scores_gemma":[0.9907246,0.0049693836,0.0007067102,0.0019282749,0.0013215771,0.0003494514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008979851,0.00063181494,0.0006132135,0.0012703852,0.0015192211,0.0045344136,0.0019847504,0.0012713217,0.0040254975],"category_scores_gemma":[0.020118445,0.00084691145,0.0017764363,0.00090752455,0.005249742,0.010615448,0.0034865276,0.003527794,0.0006253723],"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.00007946487,0.00004037763,0.0005938453,0.000068728754,0.000052715262,0.00025731986,0.0022019215,0.019293003,0.0028887154,0.9585478,0.0005907581,0.0153853465],"study_design_scores_gemma":[0.0000713718,0.00007529857,0.00039251125,0.00005259927,0.00014714709,0.00014928766,0.00048648258,0.12733552,0.004636105,0.85317487,0.013398534,0.00008030351],"about_ca_topic_score_codex":0.006408292,"about_ca_topic_score_gemma":0.0049084136,"teacher_disagreement_score":0.008979851,"about_ca_system_score_codex":0.0023589197,"about_ca_system_score_gemma":0.0017120334,"threshold_uncertainty_score":0.047490597},"labels":[],"label_agreement":null},{"id":"W3080880417","doi":"10.24963/kr.2020/62","title":"A First-Order Logic of Limited Belief Based on Possible Worlds","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Toronto","funders":"University of Toronto","keywords":"Possible world; Computer science; Epistemic modal logic; Order (exchange); Sentence; Epistemology; Semantics (computer science); Artificial intelligence; Non-monotonic logic; Description logic; Multimodal logic; Philosophy; Programming language","score_opus":0.028113954516520163,"score_gpt":0.2382975380100321,"score_spread":0.21018358349351193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080880417","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.0137729235,0.001151805,0.9374829,0.005038563,0.00021206192,0.00014774266,0.0005772797,0.00035301244,0.04126375],"genre_scores_gemma":[0.53378505,0.001012533,0.4507685,0.0015416191,0.00030493975,0.0003922461,0.0006399982,0.0000799503,0.011475208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996729,0.0012779103,0.00023408358,0.00062099163,0.0008628524,0.0002751301],"domain_scores_gemma":[0.99584097,0.0022780842,0.00036116078,0.000486004,0.00073729834,0.00029640712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004531343,0.00086989155,0.0007903949,0.002128192,0.002099813,0.0058936803,0.0022294947,0.0017286497,0.0044431835],"category_scores_gemma":[0.0059446157,0.00067902997,0.0027378728,0.0022029832,0.0066975383,0.012909712,0.0032729264,0.004721021,0.00071893935],"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.000015476104,0.000010973448,0.00005586958,0.000027062044,0.000010659429,0.000042655,0.00022095014,0.001474336,0.00021168956,0.99409,0.00047441997,0.0033657972],"study_design_scores_gemma":[0.000023087803,0.000021583093,0.000065915956,0.0000333595,0.00002081519,0.000059972765,0.00008005536,0.015337616,0.0005963911,0.9755937,0.008144838,0.00002253268],"about_ca_topic_score_codex":0.004268723,"about_ca_topic_score_gemma":0.00417383,"teacher_disagreement_score":0.0058936803,"about_ca_system_score_codex":0.0034973929,"about_ca_system_score_gemma":0.0020333729,"threshold_uncertainty_score":0.025375485},"labels":[],"label_agreement":null},{"id":"W3081168039","doi":"10.24963/kr.2020/33","title":"A Preference-Based Approach to Defeasible Deontic Inference","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Defeasible estate; Deontic logic; Non-monotonic logic; Soundness; Computer science; Inference; Theoretical computer science; Defeasible reasoning; Set (abstract data type); Outcome (game theory); Propositional calculus; Artificial intelligence; Mathematics; Algorithm; Discrete mathematics; Mathematical economics; Programming language; Linguistics","score_opus":0.11485046020722679,"score_gpt":0.25629715592245816,"score_spread":0.14144669571523139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081168039","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.0015052245,0.00028882452,0.97963893,0.0011046728,0.000071358576,0.000072737486,0.000093103044,0.000082041784,0.017143112],"genre_scores_gemma":[0.18887465,0.0009153491,0.7962938,0.0007541073,0.00025911318,0.00032630045,0.00026068807,0.000100796686,0.012215217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541146,0.0018343447,0.00030590084,0.000609943,0.0016108456,0.00022752878],"domain_scores_gemma":[0.99654645,0.001943853,0.00019829464,0.0005969597,0.0005455072,0.00016897058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005375744,0.0008313741,0.0010592408,0.0023465457,0.0016837335,0.0036126787,0.0031935181,0.0018841416,0.0072674756],"category_scores_gemma":[0.008602683,0.0009066473,0.0020776896,0.0027268208,0.0031676528,0.0054647764,0.002889412,0.0041518942,0.0013012189],"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.000014595159,0.000023577497,0.00007815695,0.00007471805,0.0000271606,0.00005771501,0.00015695734,0.0077448175,0.00039209824,0.9763604,0.00082883245,0.014240913],"study_design_scores_gemma":[0.000013683185,0.000016099686,0.000052661017,0.000030213872,0.000018107734,0.00006855433,0.000044067536,0.038664334,0.00041843703,0.9483687,0.012290136,0.000015039812],"about_ca_topic_score_codex":0.0033617124,"about_ca_topic_score_gemma":0.0055025355,"teacher_disagreement_score":0.0072674756,"about_ca_system_score_codex":0.0029054377,"about_ca_system_score_gemma":0.0021654437,"threshold_uncertainty_score":0.028429985},"labels":[],"label_agreement":null},{"id":"W3081416561","doi":"10.24963/kr.2020/26","title":"Dyadic Obligations over Complex Actions as Deontic Constraints in the Situation Calculus","year":2020,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deontic logic; Computer science; Situation calculus; Obligation; Deliberation; Defeasible estate; Permission; Action (physics); Accessibility relation; Artificial intelligence; Epistemology; Philosophy; Law; Political science","score_opus":0.07370708921623577,"score_gpt":0.3005858386365046,"score_spread":0.22687874942026887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081416561","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.022537693,0.0011611524,0.93934095,0.0018261743,0.00022919374,0.00017170352,0.00031216396,0.00042906054,0.033991825],"genre_scores_gemma":[0.52674776,0.0017704465,0.45614997,0.00065727456,0.00054545427,0.00055964856,0.0004902307,0.00021224997,0.012866904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948547,0.0020532236,0.00041547592,0.00079171767,0.0014234673,0.00046142688],"domain_scores_gemma":[0.9959448,0.0022652661,0.0003748375,0.0005166227,0.0005851989,0.00031330224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065075364,0.0008362366,0.0008893217,0.0016114225,0.0024577265,0.005582696,0.0017835423,0.0014886644,0.004020068],"category_scores_gemma":[0.0068408907,0.000996022,0.001719333,0.0021324614,0.0069054603,0.009838924,0.0032255354,0.0038420437,0.0007498504],"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.000010488525,0.000009306844,0.000058572754,0.000022495185,0.000007243023,0.00006889884,0.00041940098,0.0034701321,0.00027523158,0.9924359,0.00034285348,0.002879547],"study_design_scores_gemma":[0.000020386282,0.00001221217,0.00010235232,0.000030445683,0.000025209685,0.00005126548,0.00013441275,0.02443687,0.00047208494,0.9629079,0.011782849,0.00002400584],"about_ca_topic_score_codex":0.012190573,"about_ca_topic_score_gemma":0.010374118,"teacher_disagreement_score":0.012190573,"about_ca_system_score_codex":0.0043583307,"about_ca_system_score_gemma":0.0036454136,"threshold_uncertainty_score":0.034415543},"labels":[],"label_agreement":null},{"id":"W3090190944","doi":"10.3233/faia200170","title":"Agent Abstraction via Forgetting in the Situation Calculus","year":2020,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Abstraction; Forgetting; Calculus (dental); Computer science; Cognitive science; Psychology; Epistemology; Philosophy; Cognitive psychology; Medicine","score_opus":0.04467535015298014,"score_gpt":0.27003960378511227,"score_spread":0.22536425363213214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090190944","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.009835804,0.0010255796,0.9553532,0.00064386224,0.00023333752,0.00004659901,0.00011727845,0.0009392128,0.031805098],"genre_scores_gemma":[0.5047994,0.002624574,0.4589232,0.00047808187,0.00051474455,0.0001872326,0.00050003786,0.0006006707,0.031372003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981457,0.0005278216,0.0001582559,0.0003587946,0.0005611252,0.0002483014],"domain_scores_gemma":[0.9974717,0.0012567263,0.000100962214,0.00084538735,0.00021389585,0.00011129912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024966553,0.001100937,0.001147177,0.0010935366,0.0013275349,0.0044730916,0.0028757271,0.001389974,0.0066237776],"category_scores_gemma":[0.0056507597,0.0012753931,0.0030321002,0.001282085,0.0043120524,0.012446154,0.003766639,0.0056955987,0.0016581378],"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.000040385934,0.00001870816,0.00008409834,0.00007460633,0.000025558104,0.00012609376,0.0003887624,0.005402427,0.0006130816,0.9734967,0.0013508045,0.01837879],"study_design_scores_gemma":[0.000010406104,0.000008443426,0.000036203433,0.000019836707,0.00002786845,0.000069947586,0.000027859602,0.020471338,0.00063924276,0.97272044,0.005955251,0.0000131105135],"about_ca_topic_score_codex":0.003257338,"about_ca_topic_score_gemma":0.002943273,"teacher_disagreement_score":0.0066237776,"about_ca_system_score_codex":0.0016965162,"about_ca_system_score_gemma":0.0013474213,"threshold_uncertainty_score":0.022158742},"labels":[],"label_agreement":null},{"id":"W3092634028","doi":"","title":"On limited conjunctions in polynomial feature logics, with applications in obda — Extended abstract","year":2018,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Feature (linguistics); Computer science; Polynomial; Algebra over a field; Theoretical computer science; Mathematics; Artificial intelligence; Pure mathematics; Linguistics; Philosophy","score_opus":0.028799648740481056,"score_gpt":0.29457127866500676,"score_spread":0.2657716299245257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092634028","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.015586392,0.0013382911,0.9617923,0.001658147,0.00025501498,0.000070886184,0.0002563324,0.00036261082,0.018680058],"genre_scores_gemma":[0.40033987,0.0029062328,0.5789085,0.00094892184,0.0013396959,0.00026935057,0.00065860624,0.00035901027,0.014269757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973667,0.0011109585,0.00017901292,0.00046268225,0.00061351556,0.00026713146],"domain_scores_gemma":[0.9907539,0.006814525,0.0004248407,0.0009303449,0.00076441653,0.00031198692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045189704,0.0008765461,0.0014685092,0.0027858352,0.001922147,0.0038223423,0.0027586299,0.0014226631,0.00946645],"category_scores_gemma":[0.01418431,0.0008261978,0.0024501919,0.0057702065,0.0045108823,0.012433359,0.0057951533,0.004588494,0.0012494386],"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.00015154599,0.000117878124,0.0005137443,0.00017189434,0.000038259317,0.00020333916,0.0003255725,0.014007695,0.000810268,0.92497414,0.0039424174,0.054743335],"study_design_scores_gemma":[0.000019058187,0.000023533761,0.00014254639,0.000049775528,0.000029836294,0.00007624998,0.00007167642,0.066698365,0.00044430836,0.9277053,0.0047186455,0.00002083954],"about_ca_topic_score_codex":0.0035539055,"about_ca_topic_score_gemma":0.0051859207,"teacher_disagreement_score":0.00946645,"about_ca_system_score_codex":0.0018865122,"about_ca_system_score_gemma":0.0010920605,"threshold_uncertainty_score":0.031668425},"labels":[],"label_agreement":null},{"id":"W3093584058","doi":"10.1007/s00354-020-00112-0","title":"Learning Disjunctive Logic Programs from Nondeterministic Interpretation Transitions","year":2020,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Inductive logic programming; Computer science; Nondeterministic algorithm; Logic program; Dynamic logic (digital electronics); Artificial intelligence; Logic programming; Multimodal logic; Theoretical computer science; Programming language; State (computer science); Interpretation (philosophy); Description logic","score_opus":0.044804909331026384,"score_gpt":0.26090390986839657,"score_spread":0.2160990005373702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093584058","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.18629265,0.00055413996,0.8019723,0.0018323805,0.00010341616,0.00019396801,0.0007463666,0.002483245,0.00582153],"genre_scores_gemma":[0.83734405,0.00024037904,0.1574915,0.0003481569,0.000084709056,0.0001499214,0.0013086138,0.00019591197,0.0028366393],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985701,0.0004420965,0.00007655863,0.00047609603,0.00030410418,0.00013095995],"domain_scores_gemma":[0.98643523,0.011829501,0.00041104676,0.00058267673,0.00055982545,0.00018154706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652414,0.0008425419,0.00071743573,0.00088397186,0.00049076474,0.002196858,0.0018427435,0.0013219733,0.0043599536],"category_scores_gemma":[0.014095756,0.00075359625,0.0011725008,0.0007593207,0.0012316897,0.0055271415,0.0020195933,0.0037586547,0.00057081605],"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.0014704267,0.0008401771,0.0089402655,0.0005932806,0.0001817298,0.00061397895,0.00068142824,0.32074457,0.0065808194,0.10751713,0.008415267,0.543421],"study_design_scores_gemma":[0.00006545644,0.00006723274,0.000371127,0.000031822347,0.000033920227,0.00006471792,0.00007745049,0.84202033,0.0028693997,0.15336156,0.0010247566,0.000012286838],"about_ca_topic_score_codex":0.001984028,"about_ca_topic_score_gemma":0.006077692,"teacher_disagreement_score":0.0043599536,"about_ca_system_score_codex":0.0013358403,"about_ca_system_score_gemma":0.001483488,"threshold_uncertainty_score":0.014585495},"labels":[],"label_agreement":null},{"id":"W3096722223","doi":"10.3233/faia200672","title":"The Mereological Structure of Informational Entities","year":2020,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Logic, Reasoning, and Knowledge","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":"Université de Sherbrooke","funders":"Canadian Institutes of Health Research","keywords":"Mereology; Axiom; Word (group theory); Key (lock); Computer science; Information structure; Basis (linear algebra); Information retrieval; Linguistics; Epistemology; Mathematics; Philosophy; Computer security","score_opus":0.027543927440050506,"score_gpt":0.2428007459851443,"score_spread":0.21525681854509382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096722223","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.024469538,0.0070488076,0.3658955,0.0071319584,0.0010104305,0.00009708619,0.00036019713,0.00034165866,0.5936448],"genre_scores_gemma":[0.75473934,0.0052946485,0.15203026,0.0019879185,0.001288133,0.00028446803,0.0007494091,0.00029575144,0.08333004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849606,0.00059094053,0.00010394821,0.00024687147,0.00046143524,0.00010078619],"domain_scores_gemma":[0.99828535,0.0009136111,0.000105975225,0.00033820237,0.00028193032,0.000074830736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016415094,0.0003739006,0.00033374873,0.0017067004,0.0019428125,0.0050109713,0.0011008946,0.0014925794,0.005383579],"category_scores_gemma":[0.0026210158,0.00056093367,0.00056114007,0.0013769127,0.0112037705,0.011079891,0.002333003,0.0032619718,0.001380174],"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":[7.238633e-7,8.5349063e-7,0.0000056773492,0.000006825435,3.5737798e-7,0.000007472206,0.00008855918,0.00003757786,0.000043166474,0.99890685,0.00023557499,0.000666413],"study_design_scores_gemma":[0.0000029950243,0.0000056695685,0.000059742168,0.000029101599,0.0000031238806,0.000097409065,0.00008419004,0.000661534,0.00019180827,0.9502501,0.048607703,0.0000066938915],"about_ca_topic_score_codex":0.0008480965,"about_ca_topic_score_gemma":0.0008798996,"teacher_disagreement_score":0.005383579,"about_ca_system_score_codex":0.0018457859,"about_ca_system_score_gemma":0.0012120676,"threshold_uncertainty_score":0.018009901},"labels":[],"label_agreement":null},{"id":"W3117449497","doi":"10.1109/uemcon51285.2020.9298169","title":"On the Development of Tools for Modelling Dynamic Beliefs Based on Past Data","year":2020,"lang":"en","type":"article","venue":"","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Belief revision; Operator (biology); Process (computing); Representation (politics); Point (geometry); Component (thermodynamics); Software agent; Order (exchange); Software; Artificial intelligence; Data science; Machine learning","score_opus":0.13312721650154655,"score_gpt":0.2780406429242385,"score_spread":0.14491342642269198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117449497","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.0013041721,0.00017732164,0.9962262,0.00026659042,0.000023621766,0.00006439809,0.00019015328,0.0007810673,0.00096657313],"genre_scores_gemma":[0.07371698,0.0007005659,0.9223225,0.00022692558,0.00009140439,0.00044846415,0.0008888555,0.0002462725,0.0013580319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954673,0.0017272003,0.0006376609,0.0006735282,0.0012465103,0.00024785433],"domain_scores_gemma":[0.9496341,0.038470723,0.0036267473,0.00443315,0.0031916534,0.0006435283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011280361,0.0018078509,0.0019883201,0.0055444986,0.0012378802,0.005838228,0.0058495305,0.0025903892,0.006609767],"category_scores_gemma":[0.05495887,0.0020059177,0.0048213108,0.004487948,0.0037622992,0.011554336,0.0033656529,0.0064847297,0.0018572066],"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.0001448854,0.00027982687,0.0035945235,0.00072611467,0.0002717915,0.0005156679,0.0017078698,0.39984858,0.0016300525,0.468112,0.0038119594,0.119356714],"study_design_scores_gemma":[0.000027491935,0.000036935257,0.00031543945,0.00015495993,0.000041400494,0.000081818805,0.00011973291,0.7783922,0.00089945254,0.21301743,0.0068528657,0.000060236325],"about_ca_topic_score_codex":0.014088524,"about_ca_topic_score_gemma":0.017269777,"teacher_disagreement_score":0.014088524,"about_ca_system_score_codex":0.002722795,"about_ca_system_score_gemma":0.0026535492,"threshold_uncertainty_score":0.059656918},"labels":[],"label_agreement":null},{"id":"W3117645958","doi":"","title":"Probabilistic programming semantics for name generation","year":2021,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Semantics (computer science); Computer science; Calculus (dental); Operational semantics; Analogy; Mathematics; Theoretical computer science; Programming language; Artificial intelligence; Linguistics","score_opus":0.04606911200660268,"score_gpt":0.26854309555236633,"score_spread":0.22247398354576364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117645958","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.0039482974,0.0003605281,0.97962236,0.002990715,0.00019085717,0.00004868852,0.00024152047,0.00055404345,0.012043039],"genre_scores_gemma":[0.4289695,0.0011734792,0.5453927,0.002584035,0.0011162873,0.00067123794,0.00063816144,0.0007484041,0.01870619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930118,0.0022072427,0.0005468704,0.0014631997,0.0022684364,0.0005024174],"domain_scores_gemma":[0.98949814,0.005814593,0.0008062653,0.0020815628,0.0013025891,0.0004968391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077739465,0.00090999703,0.0009760388,0.0022004931,0.0024174212,0.0062206527,0.0037600836,0.002701432,0.009203463],"category_scores_gemma":[0.012728255,0.0009839545,0.0028276248,0.002219397,0.008348129,0.015865227,0.004547696,0.005833467,0.0019805478],"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.0000050452454,0.0000063470857,0.000039953775,0.000015669104,0.000004195652,0.00002507376,0.00013080952,0.00091936026,0.00012749484,0.9962717,0.00034676457,0.002107666],"study_design_scores_gemma":[0.000008289281,0.0000065511476,0.000030286194,0.000012497632,0.000007089285,0.00006738286,0.00003385184,0.0084800115,0.0003286095,0.984029,0.0069838976,0.000012597489],"about_ca_topic_score_codex":0.0020152107,"about_ca_topic_score_gemma":0.0014021712,"teacher_disagreement_score":0.009203463,"about_ca_system_score_codex":0.0030059703,"about_ca_system_score_gemma":0.0023015824,"threshold_uncertainty_score":0.04111308},"labels":[],"label_agreement":null},{"id":"W3119718785","doi":"10.7551/mitpress/9581.003.0006","title":"Semantic Stipulation and Knowledge De Re","year":2012,"lang":"en","type":"book-chapter","venue":"The MIT Press eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Manitoba; University of Winnipeg","keywords":"Stipulation; Computer science; Political science","score_opus":0.0541111378517778,"score_gpt":0.25730397355416146,"score_spread":0.20319283570238367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119718785","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.027328353,0.0035553577,0.58159065,0.016572146,0.0006438593,0.00013389977,0.00026003356,0.0008843093,0.36903134],"genre_scores_gemma":[0.869285,0.0014843018,0.09683259,0.0025742725,0.00049313804,0.00040158577,0.00037044712,0.00031505563,0.028243646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922017,0.0043050707,0.00051444577,0.0012859514,0.0011420796,0.0005507756],"domain_scores_gemma":[0.99486035,0.0026549979,0.00028363208,0.0013971316,0.0006060028,0.0001978176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007936481,0.0009171596,0.0009654252,0.0017091305,0.0034007162,0.0048381425,0.0025759598,0.0036716978,0.007126943],"category_scores_gemma":[0.007114163,0.0007390671,0.0017464045,0.0012634522,0.022260817,0.019768465,0.0061025117,0.0061358,0.0019472277],"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.0000041542735,0.000002910785,0.00001111737,0.000014200442,0.0000013809419,0.000014471548,0.00019092162,0.00013856993,0.0000712568,0.9981019,0.00028773374,0.0011613608],"study_design_scores_gemma":[0.0000061842425,0.000005281754,0.000030098245,0.00001604118,0.0000029645873,0.0000307684,0.00012771515,0.0007492203,0.00029820492,0.98819935,0.010525597,0.000008581813],"about_ca_topic_score_codex":0.001738751,"about_ca_topic_score_gemma":0.0012095551,"teacher_disagreement_score":0.007936481,"about_ca_system_score_codex":0.0051674442,"about_ca_system_score_gemma":0.0018616343,"threshold_uncertainty_score":0.041972578},"labels":[],"label_agreement":null},{"id":"W3121502482","doi":"10.1075/pc.19.1.04mac","title":"Reasoning from paradigms and negative evidence","year":2011,"lang":"en","type":"article","venue":"Pragmatics & Cognition","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"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 Windsor","funders":"","keywords":"Outcome (game theory); Set (abstract data type); Epistemology; Computer science; Cognitive psychology; Artificial intelligence; Psychology; Philosophy; Mathematics; Mathematical economics","score_opus":0.060265549585889686,"score_gpt":0.25863810750957417,"score_spread":0.19837255792368447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121502482","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.039377347,0.0042796726,0.8051632,0.05675982,0.0009891866,0.00023096561,0.0003144642,0.00033347917,0.0925519],"genre_scores_gemma":[0.65093344,0.0022419963,0.33111006,0.007955397,0.0010349195,0.00048206295,0.00042916674,0.00013631149,0.0056766104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9654776,0.024756258,0.0019278507,0.002744503,0.0041328706,0.0009608759],"domain_scores_gemma":[0.93471247,0.049365684,0.00354512,0.007431297,0.003348299,0.0015971313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03184249,0.001356199,0.0012793093,0.00317083,0.003699596,0.011642609,0.004130905,0.0063008764,0.005175007],"category_scores_gemma":[0.05881553,0.0013203733,0.0030797734,0.0017655435,0.027474623,0.028311687,0.014314837,0.011835407,0.00081606826],"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.000024884686,0.000015183211,0.00022343079,0.00010396384,0.000036334506,0.00019268726,0.0009055426,0.0009046056,0.0002316032,0.99171036,0.00095227925,0.0046991836],"study_design_scores_gemma":[0.000010653041,0.0000046873174,0.000028487706,0.000024011668,0.000006554291,0.00006662819,0.0000953065,0.0010314578,0.00015397932,0.9961773,0.0023931416,0.000007847871],"about_ca_topic_score_codex":0.0013076264,"about_ca_topic_score_gemma":0.0015071522,"teacher_disagreement_score":0.03184249,"about_ca_system_score_codex":0.0047170194,"about_ca_system_score_gemma":0.0024188834,"threshold_uncertainty_score":0.16840118},"labels":[],"label_agreement":null},{"id":"W3137835047","doi":"10.1145/3262168","title":"Session details: Semantics","year":2015,"lang":"en","type":"article","venue":"ACM SIGLOG News","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":"Column (typography); Session (web analytics); Semantics (computer science); Component (thermodynamics); Foundation (evidence); Connection (principal bundle); Subject (documents); Computer science; Quarter (Canadian coin); Mathematics education; Mathematics; Theoretical computer science; Algebra over a field; Pure mathematics; Programming language; World Wide Web; Political science; History; Geometry","score_opus":0.055970368079020186,"score_gpt":0.28608301915795786,"score_spread":0.2301126510789377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137835047","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.000508845,0.0028159267,0.0036846313,0.03332349,0.08057696,0.00041486148,0.013829028,0.005505538,0.8593406],"genre_scores_gemma":[0.004068188,0.0015446771,0.00088798435,0.008010986,0.017206935,0.00031900208,0.006464917,0.0030450583,0.9584523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987447,0.0001735236,0.00007526376,0.0003153219,0.00043913716,0.00025207232],"domain_scores_gemma":[0.99712676,0.00030593685,0.00009144102,0.00033899906,0.00083477877,0.0013020613],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022189831,0.0015698897,0.0018362997,0.001488595,0.0044349795,0.012287041,0.0013672828,0.0035630353,0.79861355],"category_scores_gemma":[0.0043160603,0.0007194322,0.0013847623,0.001960104,0.0007070424,0.0078156665,0.00482675,0.0059028645,0.63555515],"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.000022009712,0.000013668943,0.000024182094,0.000023960316,0.0000011632337,0.000007722887,0.000015217674,0.000012315119,0.00007125925,0.0015508957,0.9911436,0.007114023],"study_design_scores_gemma":[0.000011933645,0.000008198316,0.00010217698,0.000029921492,0.000001386562,0.000013193215,0.000030267207,0.000031359818,0.00004978459,0.0013255959,0.99839103,0.000005217089],"about_ca_topic_score_codex":0.0024687438,"about_ca_topic_score_gemma":0.006631635,"teacher_disagreement_score":0.79861355,"about_ca_system_score_codex":0.0032625748,"about_ca_system_score_gemma":0.0033287373,"threshold_uncertainty_score":0.28725332},"labels":[],"label_agreement":null},{"id":"W3146654032","doi":"","title":"Toulmin’s “Analytic Arguments”","year":2011,"lang":"de","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"McMaster University","funders":"","keywords":"Argument (complex analysis); Epistemology; Tautology (logic); Key (lock); Philosophy; Terminology; Mathematics; Calculus (dental); Computer science; Linguistics; Artificial intelligence","score_opus":0.3228988384084094,"score_gpt":0.5151851193458603,"score_spread":0.19228628093745093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146654032","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.009111371,0.014351466,0.10874115,0.13542736,0.0041930852,0.00020694984,0.00048210708,0.00030884804,0.72717774],"genre_scores_gemma":[0.6944499,0.011010632,0.06849574,0.08832312,0.0062567214,0.0013850149,0.000503641,0.00076948124,0.12880586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939074,0.0028290139,0.00028356528,0.0011720832,0.0013577207,0.000450341],"domain_scores_gemma":[0.9929081,0.0040834625,0.00061203993,0.00070485007,0.001460709,0.00023084172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005726094,0.0011336068,0.0005828153,0.0040113656,0.0039726906,0.0065856995,0.0021029245,0.005604158,0.0070771924],"category_scores_gemma":[0.016956631,0.0005634559,0.0012247523,0.002703916,0.027244436,0.01236042,0.0028584783,0.00692785,0.0021311955],"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.000009285014,0.000003788936,0.000040226547,0.000028161237,0.0000031940563,0.0000138281275,0.0006398051,0.000042771964,0.000029816958,0.9860787,0.011292514,0.0018178119],"study_design_scores_gemma":[0.0000138329215,0.000011241604,0.00010930773,0.0001264602,0.000010592524,0.00007846943,0.00026281874,0.00041426322,0.0003236509,0.8332621,0.16537355,0.000013719411],"about_ca_topic_score_codex":0.0035263847,"about_ca_topic_score_gemma":0.0024925498,"teacher_disagreement_score":0.009355841,"about_ca_system_score_codex":0.009355841,"about_ca_system_score_gemma":0.00406328,"threshold_uncertainty_score":0.0678817},"labels":[],"label_agreement":null},{"id":"W314996113","doi":"10.1109/ccc.2004.1313795","title":"Relativized NP search problems and propositional proof systems","year":2004,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Propositional calculus; Proof complexity; Computer science; Propositional variable; Discrete mathematics; Mathematics; Theoretical computer science; Mathematical proof; Intermediate logic","score_opus":0.023596908556013044,"score_gpt":0.2357890679326395,"score_spread":0.21219215937662647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W314996113","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.025445294,0.0053056157,0.8430579,0.011748217,0.0003253076,0.0001490802,0.00048247102,0.0008230482,0.11266312],"genre_scores_gemma":[0.65610397,0.0054128184,0.3122578,0.0030936506,0.0015834784,0.0005358711,0.0012841315,0.00032941313,0.019398913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99365085,0.002689855,0.0003433711,0.0011466554,0.0016484642,0.0005207479],"domain_scores_gemma":[0.9897642,0.007763341,0.0006214541,0.0010246218,0.0005513765,0.00027503594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040528113,0.0008855365,0.00083382,0.002360907,0.0022084834,0.0062435395,0.0024598995,0.002374679,0.008861349],"category_scores_gemma":[0.014508461,0.0009206315,0.0019211192,0.0028355038,0.007987552,0.014357746,0.0046322476,0.00849911,0.0009756976],"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.000004326097,0.0000044030157,0.000024133127,0.000028187671,0.0000051701945,0.000009149913,0.000055811804,0.0015568017,0.000042256073,0.99461925,0.00077269,0.00287775],"study_design_scores_gemma":[0.000006499527,0.00000402413,0.000041742955,0.000015626387,0.000005655256,0.000019836743,0.000029301042,0.004994818,0.00010193903,0.98959255,0.0051831575,0.0000049174173],"about_ca_topic_score_codex":0.0030758989,"about_ca_topic_score_gemma":0.0021581375,"teacher_disagreement_score":0.008861349,"about_ca_system_score_codex":0.005487906,"about_ca_system_score_gemma":0.001961656,"threshold_uncertainty_score":0.03981769},"labels":[],"label_agreement":null},{"id":"W3155043239","doi":"10.5430/air.v10n1p43","title":"Development process of multiagent system for glycemic control of intensive care unit patients","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Glycemic; Intensive care unit; Process (computing); Medicine; Health care; Intensive care medicine; Control (management); Inference; Computer science; Risk analysis (engineering); Process management; Engineering; Artificial intelligence; Diabetes mellitus","score_opus":0.15561443800742505,"score_gpt":0.39986883737901197,"score_spread":0.2442543993715869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155043239","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.08774193,0.0007751328,0.88440055,0.0007051801,0.00023627323,0.001579161,0.00020755809,0.004599815,0.019754369],"genre_scores_gemma":[0.4534235,0.00059811224,0.5320155,0.0001610969,0.00007818509,0.00088460866,0.00041896442,0.00019182863,0.012228232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994729,0.00015768227,0.000042053758,0.00010109196,0.00017488876,0.000051367064],"domain_scores_gemma":[0.9996099,0.00008871807,0.000035974866,0.000041600244,0.00016324336,0.00006057876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912759,0.00036405763,0.00031361615,0.00036235337,0.00056149584,0.00095340365,0.0007164658,0.00046608705,0.0029031427],"category_scores_gemma":[0.001473717,0.00021716973,0.0004081303,0.00016393079,0.00019275756,0.00044989682,0.00075715117,0.00051359995,0.00078998046],"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.0006313209,0.0010450949,0.015773173,0.0011307674,0.00021493503,0.0029245915,0.003924181,0.17498381,0.1404469,0.030676914,0.014844194,0.6134041],"study_design_scores_gemma":[0.00027220364,0.00092026923,0.0074955444,0.00021449008,0.00020222689,0.0011325357,0.00070564274,0.77767754,0.08846066,0.009031102,0.11377692,0.00011084005],"about_ca_topic_score_codex":0.0015984625,"about_ca_topic_score_gemma":0.0011673849,"teacher_disagreement_score":0.0029031427,"about_ca_system_score_codex":0.0003115076,"about_ca_system_score_gemma":0.0015718881,"threshold_uncertainty_score":0.009711921},"labels":[],"label_agreement":null},{"id":"W3164300571","doi":"10.48550/arxiv.2105.11071","title":"Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an\\n Approximator of AFT","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","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 Alberta","funders":"","keywords":"Fixed point; Operator (biology); Semantics (computer science); Context (archaeology); Computer science; Abstraction; Extension (predicate logic); Algebra over a field; Computation; Algebraic semantics; Theoretical computer science; Mathematics; Programming language; Algorithm; Discrete mathematics; Pure mathematics","score_opus":0.08214952523003266,"score_gpt":0.2244995795538269,"score_spread":0.14235005432379425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164300571","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.027531875,0.000114874725,0.96726674,0.00020981512,0.000036095127,0.000050568095,0.00010143084,0.00045931884,0.0042292955],"genre_scores_gemma":[0.48669034,0.00024105591,0.5057575,0.0002430304,0.00008596145,0.00018375259,0.00047417113,0.00022932042,0.006094906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997635,0.00041560072,0.00022401981,0.00069453154,0.0008300872,0.00020066227],"domain_scores_gemma":[0.9974462,0.0010563284,0.00017573198,0.0006550391,0.0005714578,0.00009531193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022790397,0.0004780001,0.0005789489,0.0018307953,0.0009357112,0.0028142838,0.001596419,0.0009529918,0.004037295],"category_scores_gemma":[0.0058502047,0.00043472147,0.0021212627,0.0010817003,0.0027107475,0.0051204315,0.003182426,0.002724388,0.0005525887],"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.0000659556,0.000026761092,0.00069149525,0.000104705185,0.000049249822,0.00020671137,0.00083005714,0.013975299,0.004487816,0.9491814,0.00058761204,0.029792951],"study_design_scores_gemma":[0.00002111249,0.00006139507,0.0003472759,0.0000676074,0.00010119151,0.00031016942,0.0002824029,0.17327784,0.008894978,0.80598176,0.010608578,0.00004580089],"about_ca_topic_score_codex":0.002786699,"about_ca_topic_score_gemma":0.002459599,"teacher_disagreement_score":0.004037295,"about_ca_system_score_codex":0.001853159,"about_ca_system_score_gemma":0.0010629734,"threshold_uncertainty_score":0.013506055},"labels":[],"label_agreement":null},{"id":"W3176904788","doi":"10.1609/aaai.v35i5.16507","title":"Satisfiability and Algorithms for Non-uniform Random k-SAT","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Satisfiability; Boolean satisfiability problem; Algorithm; Range (aeronautics); Benchmark (surveying); Maximum satisfiability problem; Mathematics; Class (philosophy); Computer science; Probability distribution; Theoretical computer science; Discrete mathematics; Boolean function; Artificial intelligence; Statistics","score_opus":0.06496425787849228,"score_gpt":0.29735266906284086,"score_spread":0.23238841118434858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176904788","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.01782356,0.0004043794,0.97348726,0.0012061757,0.00006688491,0.00019449096,0.00022413094,0.0015737438,0.0050193924],"genre_scores_gemma":[0.2439012,0.0004183554,0.74692214,0.00060048816,0.00018367103,0.0005853683,0.0012728542,0.0005146728,0.0056012636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534935,0.0018961268,0.00037215816,0.0012666458,0.0006896262,0.000426231],"domain_scores_gemma":[0.981817,0.01402767,0.0009576076,0.0022368105,0.00069497287,0.0002658516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048905243,0.001191705,0.0014580619,0.0019058934,0.001555756,0.0028062635,0.0044021,0.0024642327,0.009257021],"category_scores_gemma":[0.031856913,0.0010676348,0.0027940592,0.003111766,0.0027555528,0.007120909,0.003948785,0.0040662447,0.0020569016],"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.00039787358,0.0003670802,0.0025852614,0.00061398145,0.00018945886,0.00017564392,0.00046133026,0.38996893,0.0022778634,0.4256324,0.009866674,0.16746354],"study_design_scores_gemma":[0.00009818301,0.000033454693,0.00020722226,0.000030906558,0.000031722087,0.00008708826,0.0000488328,0.65868205,0.0011880015,0.33806032,0.0015134428,0.00001880117],"about_ca_topic_score_codex":0.002845068,"about_ca_topic_score_gemma":0.0053034266,"teacher_disagreement_score":0.009257021,"about_ca_system_score_codex":0.0029006759,"about_ca_system_score_gemma":0.002595481,"threshold_uncertainty_score":0.030967832},"labels":[],"label_agreement":null},{"id":"W3186637254","doi":"10.1016/j.artint.2021.103557","title":"Strategic reasoning with a bounded number of resources: The quest for tractability","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; Université de Sherbrooke","keywords":"Bounded function; Model checking; Temporal logic; Turing machine; EXPTIME; Computer science; Theoretical computer science; Path (computing); Time complexity; Computational complexity theory; Boolean satisfiability problem; Computation tree logic; Mathematics; Discrete mathematics; Algorithm; PSPACE; Programming language","score_opus":0.0629153797926646,"score_gpt":0.31340299822789824,"score_spread":0.25048761843523365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186637254","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.035752486,0.001783143,0.9043028,0.020245183,0.00014631977,0.00024768172,0.0008020163,0.00078794826,0.03593237],"genre_scores_gemma":[0.6197956,0.0033300838,0.3566681,0.0036871159,0.0009900163,0.0013315267,0.0015170921,0.0009620408,0.01171844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9777002,0.012876971,0.0014226454,0.0029372205,0.0034995424,0.0015634191],"domain_scores_gemma":[0.7343585,0.2302393,0.005005628,0.024159392,0.0039970223,0.0022401526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023948282,0.0022804835,0.0057105976,0.0032023326,0.003795779,0.01219774,0.007244661,0.007907958,0.012228367],"category_scores_gemma":[0.12212772,0.0032409995,0.0065834853,0.0033517918,0.01843901,0.047106195,0.011769538,0.018261323,0.0021837084],"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.00016831006,0.00013270508,0.0004821892,0.00032404886,0.00014274687,0.0001601448,0.00026596445,0.054895733,0.00034535045,0.9331336,0.0021930342,0.0077561415],"study_design_scores_gemma":[0.000031420917,0.000013729662,0.000037161943,0.00002972349,0.000017814382,0.000026409956,0.000027680459,0.054677323,0.000109675944,0.94429904,0.0007194755,0.0000104768205],"about_ca_topic_score_codex":0.0070634237,"about_ca_topic_score_gemma":0.007089007,"teacher_disagreement_score":0.023948282,"about_ca_system_score_codex":0.0064307624,"about_ca_system_score_gemma":0.0059926556,"threshold_uncertainty_score":0.12665212},"labels":[],"label_agreement":null},{"id":"W3191838736","doi":"10.24963/ijcai.2021/257","title":"How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements","year":2021,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Exploit; Context (archaeology); Matching (statistics); Belief revision; Operator (biology); Preference; Set (abstract data type); Computer science; Upper and lower bounds; Theoretical computer science; Mathematical economics; Mathematics; Discrete mathematics; Artificial intelligence; Statistics; Programming language","score_opus":0.08899685419180835,"score_gpt":0.2804953528669472,"score_spread":0.19149849867513885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191838736","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.47998372,0.0015647581,0.44774756,0.027188972,0.00017421022,0.00052466895,0.0017049434,0.0011420526,0.03996916],"genre_scores_gemma":[0.9218985,0.0008389098,0.06870185,0.00070886104,0.0002767311,0.00030503774,0.00084991194,0.00025563414,0.0061645675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886036,0.0045996387,0.0007709534,0.001947708,0.0024771814,0.001600907],"domain_scores_gemma":[0.85079396,0.13148604,0.0049293004,0.00786942,0.002268075,0.0026531331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009568727,0.00089360104,0.0026264964,0.0015674946,0.002348194,0.011046705,0.0033792742,0.0038213236,0.011968258],"category_scores_gemma":[0.0774236,0.0013860943,0.0027523795,0.0023549777,0.004836969,0.025270974,0.00560453,0.006025829,0.0008382166],"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.0016421969,0.0005782526,0.0052776053,0.00078600814,0.00032717327,0.0005494269,0.0024362765,0.12818679,0.0041699917,0.7479825,0.009894048,0.09816979],"study_design_scores_gemma":[0.00013345703,0.000047130998,0.00059541705,0.000028882787,0.000087407316,0.00015748946,0.00035636616,0.19546773,0.0011693324,0.80012673,0.0017876419,0.000042459968],"about_ca_topic_score_codex":0.0041537597,"about_ca_topic_score_gemma":0.0026952457,"teacher_disagreement_score":0.011968258,"about_ca_system_score_codex":0.004753257,"about_ca_system_score_gemma":0.0038435243,"threshold_uncertainty_score":0.05060482},"labels":[],"label_agreement":null},{"id":"W3193790318","doi":"10.18778/0138-0680.2021.18","title":"An Arithmetically Complete Predicate Modal Logic","year":2021,"lang":"en","type":"article","venue":"Bulletin of the Section of Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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","funders":"","keywords":"Predicate (mathematical logic); Modal; Completeness (order theory); Kripke semantics; Mathematics; Modal logic; First order; Extension (predicate logic); Algorithm; Computer science; Artificial intelligence; Multimodal logic; Programming language; Description logic; Applied mathematics","score_opus":0.02306834566345674,"score_gpt":0.24260116236419121,"score_spread":0.21953281670073446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193790318","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.18878335,0.0008597623,0.6147414,0.0031313375,0.00018374273,0.00011273701,0.0011395237,0.0019364846,0.18911168],"genre_scores_gemma":[0.8907139,0.0002967418,0.08457814,0.00067550776,0.00010961672,0.000063310385,0.0006279589,0.00012028506,0.022814522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994771,0.00010990849,0.000022544222,0.00012590068,0.00017204612,0.000092523995],"domain_scores_gemma":[0.99948263,0.00026238448,0.00003819454,0.00007341171,0.00010604113,0.000037280388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083753833,0.0003589109,0.00031599583,0.00059114635,0.0009518783,0.0019211264,0.0009749361,0.0006073577,0.005948593],"category_scores_gemma":[0.0011227545,0.00023816856,0.0009030307,0.0004703319,0.0026296384,0.0042468025,0.0020079843,0.0019484533,0.00060896535],"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.000025485868,0.000011779067,0.000059169906,0.000035321384,0.000004174579,0.000051097133,0.000138618,0.0017409655,0.0011827151,0.9916489,0.00052805146,0.0045737266],"study_design_scores_gemma":[0.000025539663,0.000040866635,0.00015814132,0.000022391658,0.000012515969,0.00011467825,0.000095251395,0.013735129,0.0028856986,0.95784944,0.025045931,0.00001439169],"about_ca_topic_score_codex":0.0017174801,"about_ca_topic_score_gemma":0.0016364143,"teacher_disagreement_score":0.005948593,"about_ca_system_score_codex":0.0014757968,"about_ca_system_score_gemma":0.0009662041,"threshold_uncertainty_score":0.019900084},"labels":[],"label_agreement":null},{"id":"W3205917349","doi":"10.24963/kr.2021/41","title":"Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases","year":2021,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Alberta","funders":"","keywords":"Computer science; Answer set programming; Solver; Context (archaeology); Theoretical computer science; Fragment (logic); Set (abstract data type); Logic programming; Programming language","score_opus":0.031880610219290555,"score_gpt":0.2907732951916021,"score_spread":0.25889268497231155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205917349","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.011551296,0.00026270514,0.9795432,0.0010184756,0.000050959345,0.00018294479,0.00060117326,0.00094583415,0.00584354],"genre_scores_gemma":[0.15799779,0.00034866921,0.83582366,0.0006846132,0.0000936536,0.00037637766,0.0014868694,0.00030457604,0.0028837177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880244,0.002984914,0.0014220107,0.0020182843,0.0046067485,0.00094362977],"domain_scores_gemma":[0.9688325,0.022799294,0.001598934,0.0032149663,0.003082996,0.00047139009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008483166,0.0010099347,0.0011004384,0.0038726293,0.0017942325,0.007890502,0.0041828994,0.002047254,0.007815837],"category_scores_gemma":[0.036071695,0.0012896426,0.004132926,0.003145701,0.004376079,0.012504835,0.0067490707,0.0066999365,0.0013701343],"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.00014603643,0.00013321418,0.0013153437,0.0005992486,0.00015050267,0.00034932786,0.0014273237,0.06487162,0.0024888837,0.82777554,0.003772944,0.09696998],"study_design_scores_gemma":[0.000030650473,0.000028340051,0.00016061828,0.00021626416,0.000083281346,0.00021686,0.00028258938,0.15817894,0.005331847,0.8238642,0.0115604745,0.000045881363],"about_ca_topic_score_codex":0.005297124,"about_ca_topic_score_gemma":0.00960629,"teacher_disagreement_score":0.008483166,"about_ca_system_score_codex":0.0045209853,"about_ca_system_score_gemma":0.00284341,"threshold_uncertainty_score":0.04486382},"labels":[],"label_agreement":null},{"id":"W3206122379","doi":"10.24963/kr.2021/19","title":"An Account of Intensional and Extensional Actions, and its Application to Belief, Nondeterministic Actions and Fallible Sensors","year":2021,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Nondeterministic algorithm; Extensional definition; Action (physics); Computer science; Set (abstract data type); Artificial intelligence; Epistemic modal logic; Situation calculus; State (computer science); Extension (predicate logic); Epistemology; Theoretical computer science; Algorithm; Programming language; Philosophy","score_opus":0.02858426920546463,"score_gpt":0.2937491541838794,"score_spread":0.2651648849784148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206122379","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.0129649425,0.0038775182,0.85465384,0.007548715,0.00034136072,0.00008578816,0.00019059583,0.00028551338,0.120051734],"genre_scores_gemma":[0.7680384,0.0025117765,0.20778744,0.0018094156,0.00073608337,0.0004565357,0.0001713479,0.00012337713,0.018365702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982095,0.0006574649,0.00012434447,0.00036408595,0.0004372353,0.00020738207],"domain_scores_gemma":[0.99725527,0.0015786287,0.00031586215,0.00043773645,0.00025744786,0.00015498436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003285957,0.0010608016,0.0005690329,0.0019873257,0.0016173759,0.004046659,0.0021932411,0.002553011,0.004073005],"category_scores_gemma":[0.0038159129,0.0006679075,0.0019907884,0.0013722818,0.014991549,0.012227981,0.0028324153,0.0038498354,0.0004799581],"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.0000034607172,0.000003308708,0.000040146726,0.000012347602,0.000003136867,0.000038123933,0.0002961461,0.0012505662,0.00005706909,0.9966421,0.0001942192,0.0014593895],"study_design_scores_gemma":[0.0000042502033,0.0000067038054,0.000068196794,0.000018945782,0.000008870222,0.000047917543,0.00005954047,0.00506365,0.00009799306,0.989571,0.005046072,0.000006961321],"about_ca_topic_score_codex":0.0037256854,"about_ca_topic_score_gemma":0.0029262826,"teacher_disagreement_score":0.004073005,"about_ca_system_score_codex":0.0031903032,"about_ca_system_score_gemma":0.0014437744,"threshold_uncertainty_score":0.023147404},"labels":[],"label_agreement":null},{"id":"W3207154427","doi":"10.1007/s10992-021-09637-1","title":"Neighbourhood Semantics for Quantified Relevant Logics","year":2021,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Grantová Agentura České Republiky","keywords":"Kripke semantics; T-norm fuzzy logics; Computer science; Semantics (computer science); Algebraic semantics; Mathematics; Calculus (dental); Algebra over a field; Description logic; Theoretical computer science; Artificial intelligence; Pure mathematics; Programming language; Intermediate logic; Medicine","score_opus":0.052837766866093976,"score_gpt":0.29403859866754606,"score_spread":0.24120083180145208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207154427","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.046200305,0.0016140033,0.9040664,0.0025209016,0.000331774,0.00015461433,0.00060469395,0.0008261789,0.043681104],"genre_scores_gemma":[0.76916873,0.0012825236,0.21093412,0.0006809389,0.00048308252,0.00030323275,0.0010556878,0.0003425114,0.01574914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967463,0.0011211245,0.0003599492,0.0005920779,0.0009083633,0.00027214136],"domain_scores_gemma":[0.9948237,0.0028318851,0.00031736985,0.00074716506,0.0008323742,0.0004474561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036736485,0.0006709926,0.0013590377,0.0033845776,0.0029586835,0.006422288,0.0023273483,0.0018507096,0.006064439],"category_scores_gemma":[0.009092256,0.00087284896,0.0023705324,0.0025724398,0.00414301,0.016219458,0.0047526304,0.0037226104,0.0007910195],"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.00002573662,0.000015768712,0.00005949682,0.0000432114,0.000009691557,0.00003438066,0.00016587907,0.0008856457,0.00021082575,0.9946897,0.0004356136,0.0034240424],"study_design_scores_gemma":[0.000010237526,0.0000049312716,0.00002442236,0.000012220377,0.0000107904625,0.000020739919,0.000047118807,0.004079884,0.00015814246,0.9936743,0.0019494187,0.000007763515],"about_ca_topic_score_codex":0.002125297,"about_ca_topic_score_gemma":0.0024705764,"teacher_disagreement_score":0.006422288,"about_ca_system_score_codex":0.0027290871,"about_ca_system_score_gemma":0.0013439052,"threshold_uncertainty_score":0.020287573},"labels":[],"label_agreement":null},{"id":"W3207585702","doi":"10.24963/kr.2021/21","title":"The Nondeterministic Situation Calculus","year":2021,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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","funders":"","keywords":"Nondeterministic algorithm; Computer science; Situation calculus; Extension (predicate logic); Theoretical computer science; Frame (networking); Projection (relational algebra); Calculus (dental); Programming language; Algorithm","score_opus":0.014114993765135463,"score_gpt":0.2452534196277007,"score_spread":0.23113842586256522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207585702","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.010150816,0.0009835196,0.9195314,0.0024319696,0.00025821154,0.00022291792,0.0005053454,0.001032986,0.064882874],"genre_scores_gemma":[0.44588354,0.001899804,0.52452075,0.0010952919,0.00039412876,0.0006328094,0.0009566581,0.0003321772,0.024284806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948657,0.0015807152,0.0005153157,0.001030114,0.0015138217,0.00049434835],"domain_scores_gemma":[0.9965798,0.0015175279,0.0002389763,0.0007157085,0.00072636455,0.00022161953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044630016,0.00084654195,0.0007400933,0.0012665475,0.0024191837,0.0048572957,0.0022533059,0.0013430077,0.006379933],"category_scores_gemma":[0.007603462,0.00095572695,0.0018183673,0.0013743725,0.0061674546,0.009310127,0.0039963513,0.0036171628,0.0013769213],"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.000007818298,0.0000064722826,0.000072987335,0.000024158033,0.000005088444,0.000045811856,0.00019161319,0.0011527742,0.00016862732,0.9931686,0.0007062025,0.004449788],"study_design_scores_gemma":[0.000020202264,0.000011445138,0.000077410696,0.000033520195,0.000021118534,0.00010602334,0.00009715498,0.013230743,0.0008014564,0.9418418,0.04373969,0.00001948204],"about_ca_topic_score_codex":0.0065397457,"about_ca_topic_score_gemma":0.0046580294,"teacher_disagreement_score":0.0065397457,"about_ca_system_score_codex":0.002906188,"about_ca_system_score_gemma":0.003942389,"threshold_uncertainty_score":0.023602903},"labels":[],"label_agreement":null},{"id":"W3208404890","doi":"","title":"Fixpoint Characterizations of Disjunctive Hybrid MKNF Knowledge Bases.","year":2021,"lang":"en","type":"article","venue":"International Conference on Lightning Protection","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Mathematics","score_opus":0.05336291999267006,"score_gpt":0.2824708897480868,"score_spread":0.22910796975541675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208404890","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.09803531,0.0020706507,0.85956794,0.0017110163,0.00014124301,0.00036134975,0.0064594825,0.0022543583,0.029398551],"genre_scores_gemma":[0.70963967,0.0009830459,0.27226558,0.000558961,0.0001817802,0.00027868734,0.008409857,0.0002743226,0.007408014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957218,0.00065418606,0.00062785274,0.00084785547,0.0017090539,0.00043926088],"domain_scores_gemma":[0.9800923,0.012728247,0.0011979527,0.002154322,0.0034515187,0.0003756688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003306297,0.000600444,0.00070163695,0.0051042214,0.0013129752,0.0052273786,0.004390687,0.0015968347,0.008811046],"category_scores_gemma":[0.021288007,0.00088848156,0.0016625117,0.0045393514,0.0021249289,0.01318117,0.0035640902,0.0026589734,0.0011111133],"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.0005400523,0.00018114017,0.0039445506,0.0008489638,0.00031274627,0.0010914454,0.0023756728,0.042004503,0.0060910583,0.7925272,0.0062367115,0.14384592],"study_design_scores_gemma":[0.00006210835,0.00007989281,0.0010499267,0.000338905,0.0002942964,0.0008551957,0.0008885617,0.11623163,0.008031216,0.85300195,0.019086897,0.00007937214],"about_ca_topic_score_codex":0.007834058,"about_ca_topic_score_gemma":0.007922996,"teacher_disagreement_score":0.008811046,"about_ca_system_score_codex":0.0023463112,"about_ca_system_score_gemma":0.0013191528,"threshold_uncertainty_score":0.029475927},"labels":[],"label_agreement":null},{"id":"W340913344","doi":"10.1613/jair.4192","title":"Multiagent Only Knowing in Dynamic Systems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","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":"University of Toronto","funders":"RWTH Aachen University; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Extension (predicate logic); Epistemic modal logic; Order (exchange); Artificial intelligence; Monotonic function; Modal logic; Modal; Theoretical computer science; Epistemology; Description logic; Multimodal logic; Mathematics; Programming language; Philosophy","score_opus":0.11776793154295662,"score_gpt":0.4046022042379217,"score_spread":0.2868342726949651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340913344","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.040511746,0.0013925784,0.9037042,0.0037000328,0.0001160566,0.00012627462,0.00015785368,0.0003817304,0.049909484],"genre_scores_gemma":[0.84309417,0.0006996908,0.14623782,0.0005199457,0.00018067751,0.0002746121,0.00019381577,0.00008111389,0.0087181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973139,0.0010161148,0.00014810216,0.0004766872,0.0007635269,0.00028167185],"domain_scores_gemma":[0.99672323,0.0020422242,0.00022772589,0.0005166714,0.0002931625,0.00019698807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031422474,0.00059840153,0.0007223003,0.0011163041,0.0016405337,0.0033485976,0.0012531423,0.0016687679,0.0021326593],"category_scores_gemma":[0.0052324417,0.00054661214,0.001433066,0.00077675475,0.005437065,0.0065813456,0.0038929565,0.0028868401,0.00034890234],"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.0000074029026,0.000010692201,0.00009706329,0.000024520763,0.000010044182,0.00007882465,0.00025998708,0.007028939,0.00023209471,0.98925436,0.00029117195,0.0027049065],"study_design_scores_gemma":[0.000010711015,0.000011958588,0.000086231914,0.0000123201,0.000012881344,0.000045683053,0.000069447604,0.05558309,0.00044918866,0.9394766,0.0042298,0.000012003791],"about_ca_topic_score_codex":0.0034059144,"about_ca_topic_score_gemma":0.0027074006,"teacher_disagreement_score":0.0034059144,"about_ca_system_score_codex":0.002891233,"about_ca_system_score_gemma":0.0015606916,"threshold_uncertainty_score":0.020977437},"labels":[],"label_agreement":null},{"id":"W35529797","doi":"10.21037/tlcr-21-765","title":"A logical theory of coordination and joint ability","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":21,"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":"Computer science; Logical consequence; Joint (building); Situation calculus; Plan (archaeology); State (computer science); Logical framework; Artificial intelligence; Algorithm; Programming language; Engineering","score_opus":0.1509613474423319,"score_gpt":0.33999822856199413,"score_spread":0.18903688111966224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35529797","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.027452288,0.0035282127,0.70220184,0.01454778,0.0008859549,0.00012424876,0.0008233197,0.00045426944,0.249982],"genre_scores_gemma":[0.8031038,0.0029918905,0.15279827,0.0024040183,0.0012211365,0.00046607354,0.0011799069,0.0001809815,0.035653982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977518,0.00081888254,0.00019319648,0.0004512186,0.0004546756,0.00033021258],"domain_scores_gemma":[0.99656785,0.0017950454,0.00031418997,0.0004568386,0.00059191155,0.000274159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033690901,0.0007488728,0.000591456,0.0022571126,0.0026735347,0.0046686907,0.001612156,0.0014963718,0.013462195],"category_scores_gemma":[0.0050355834,0.00049694575,0.002416406,0.001495644,0.009393438,0.011779429,0.0036138077,0.0030715812,0.0016449513],"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.0000052036157,0.0000033831136,0.000048950882,0.000013692937,0.0000057554084,0.000028086572,0.000063922394,0.000397226,0.000048129827,0.99750644,0.0005891278,0.0012902467],"study_design_scores_gemma":[0.0000147655555,0.000008729426,0.0000779927,0.000012693466,0.000007521992,0.00004860694,0.00007265096,0.0023478167,0.00008066054,0.9906715,0.00664981,0.0000072275816],"about_ca_topic_score_codex":0.0050005284,"about_ca_topic_score_gemma":0.0031518857,"teacher_disagreement_score":0.013462195,"about_ca_system_score_codex":0.0030778765,"about_ca_system_score_gemma":0.0018070835,"threshold_uncertainty_score":0.04503548},"labels":[],"label_agreement":null},{"id":"W35647878","doi":"","title":"The Ehrenfeucht-Fraisse Game for Paths and Cycles","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01323359922616632,"score_gpt":0.25845646713267834,"score_spread":0.24522286790651202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35647878","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.15492517,0.0018339894,0.6481368,0.008636373,0.00028193984,0.00029170144,0.00090596016,0.00047842108,0.18450963],"genre_scores_gemma":[0.85974395,0.001447552,0.102358215,0.0006151814,0.00017339499,0.00030345836,0.00050487154,0.00016075,0.03469257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963934,0.0016680137,0.00022958287,0.0005173742,0.0006169459,0.00057469576],"domain_scores_gemma":[0.9930587,0.0049951673,0.00027140646,0.00069192075,0.0004082173,0.00057464035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037582635,0.0010589493,0.0021108927,0.0021566614,0.0038450377,0.009563445,0.002443603,0.004529563,0.012383388],"category_scores_gemma":[0.015835578,0.00073002285,0.0017621331,0.00314822,0.0070226807,0.01813125,0.004610091,0.0036985888,0.0011591387],"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.000024472674,0.000007994365,0.00006000791,0.000017643166,0.000005177469,0.000026879177,0.00011223781,0.0018113278,0.00005031893,0.9949981,0.0005152474,0.0023706343],"study_design_scores_gemma":[0.0000071246154,0.0000027116005,0.0000144874675,0.0000059780073,0.0000035745982,0.000011954572,0.000034611832,0.004125679,0.000036100508,0.99448276,0.001270706,0.000004286414],"about_ca_topic_score_codex":0.0077577317,"about_ca_topic_score_gemma":0.005581748,"teacher_disagreement_score":0.012383388,"about_ca_system_score_codex":0.00413004,"about_ca_system_score_gemma":0.0025742254,"threshold_uncertainty_score":0.0414266},"labels":[],"label_agreement":null},{"id":"W36235450","doi":"10.3390/plants11192584","title":"A knowledge-based approach to planning with incomplete information and sensing","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence Planning Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":199,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Akademie Věd České Republiky; Grantová Agentura České Republiky; Deutsche Forschungsgemeinschaft","keywords":"Planner; Computer science; Representation (politics); Knowledge representation and reasoning; Domain (mathematical analysis); Set (abstract data type); Automated planning and scheduling; Domain knowledge; Complete information; Modal; State (computer science); Artificial intelligence; Mathematics; Algorithm","score_opus":0.14386924941217705,"score_gpt":0.31149717960207324,"score_spread":0.1676279301898962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36235450","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.0046793753,0.00032790157,0.9891829,0.00073477154,0.00004213278,0.00018934859,0.00051209074,0.0005234778,0.0038079445],"genre_scores_gemma":[0.18207975,0.0006889721,0.8118894,0.00034372884,0.00009029456,0.0005846165,0.0015280736,0.00016986886,0.002625286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787223,0.0007956652,0.00015474015,0.000738211,0.000268085,0.00017098895],"domain_scores_gemma":[0.992819,0.005062128,0.00049157284,0.0007273187,0.00066629885,0.00023368977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003201226,0.0015070266,0.0020070814,0.0030996732,0.0015898963,0.0037509797,0.0049901665,0.0024177604,0.008780109],"category_scores_gemma":[0.010404033,0.0013007079,0.0022387635,0.003721792,0.0020152119,0.0048767063,0.0045608417,0.0024184976,0.0010154383],"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.00020992539,0.00023052024,0.003078593,0.00083828723,0.00031102623,0.0005983729,0.0009540389,0.6077789,0.0015491679,0.08056041,0.0074939667,0.29639673],"study_design_scores_gemma":[0.000044965636,0.00011291947,0.00079048786,0.00017717556,0.00013073778,0.00016095475,0.0009519766,0.78053415,0.0009923785,0.20483002,0.011188255,0.00008593017],"about_ca_topic_score_codex":0.019641822,"about_ca_topic_score_gemma":0.023054339,"teacher_disagreement_score":0.019641822,"about_ca_system_score_codex":0.0024469306,"about_ca_system_score_gemma":0.004921004,"threshold_uncertainty_score":0.03905499},"labels":[],"label_agreement":null},{"id":"W36639351","doi":"10.1609/aaai.v25i1.7850","title":"Integrating Rules and Description Logics by Circumscription","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Circumscription; Semantics (computer science); Stable model semantics; Logic programming; Answer set programming; Non-monotonic logic; Well-founded semantics; Set (abstract data type); Computer science; Mathematics; Artificial intelligence; Theoretical computer science; Programming language; Denotational semantics; Operational semantics","score_opus":0.11592488744407466,"score_gpt":0.263017775786242,"score_spread":0.14709288834216738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36639351","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.0057076295,0.00075716595,0.9830383,0.001271035,0.000092421535,0.0000603041,0.00006484114,0.00025225917,0.008755969],"genre_scores_gemma":[0.28468654,0.0015499312,0.7056258,0.0013388877,0.00035401795,0.00034096293,0.00024791306,0.00025744978,0.005598533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936259,0.002668552,0.0007005616,0.001002566,0.0016091564,0.00039338143],"domain_scores_gemma":[0.9921467,0.003937713,0.0009098854,0.0019551453,0.00064047746,0.00041017498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006885884,0.00090711744,0.001051036,0.0028920523,0.0011207113,0.005824704,0.002325115,0.0017978462,0.0023265225],"category_scores_gemma":[0.00834419,0.0008035792,0.002266814,0.0023447324,0.0076731513,0.014985038,0.0047680824,0.003792713,0.00061729737],"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.00000858155,0.000012827059,0.00009142017,0.000035282003,0.000008920057,0.000051879535,0.00035440113,0.0019119802,0.00053422165,0.98968583,0.0001877506,0.0071167382],"study_design_scores_gemma":[0.00000893897,0.0000148079025,0.00003616328,0.000037616453,0.000014127899,0.00007339932,0.000056062625,0.011741176,0.001464928,0.97569954,0.010838938,0.000014380919],"about_ca_topic_score_codex":0.0018007597,"about_ca_topic_score_gemma":0.0014070161,"teacher_disagreement_score":0.006885884,"about_ca_system_score_codex":0.002210792,"about_ca_system_score_gemma":0.001588725,"threshold_uncertainty_score":0.03641647},"labels":[],"label_agreement":null},{"id":"W38868912","doi":"10.1111/ahe.13073","title":"Specifying Event Logics for Active Databases.","year":2002,"lang":"en","type":"article","venue":"Description Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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 Toronto","funders":"","keywords":"Active database; Computer science; Event (particle physics); Event calculus; Semantics (computer science); Action (physics); Database; Dimension (graph theory); Description logic; Theoretical computer science; Programming language; Mathematics","score_opus":0.15376946996379104,"score_gpt":0.28708729752248224,"score_spread":0.1333178275586912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38868912","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.0037022214,0.000741143,0.9701955,0.00093263056,0.00015759167,0.00032494852,0.005436425,0.009166503,0.009343094],"genre_scores_gemma":[0.19697164,0.0019708541,0.7661583,0.0018647887,0.00030781768,0.0011026203,0.016563214,0.001795785,0.0132650705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537057,0.0010368387,0.0009686286,0.0009704543,0.0013235582,0.0003299741],"domain_scores_gemma":[0.99495983,0.002526353,0.0004858753,0.001273417,0.000559616,0.00019499079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052459086,0.0012063477,0.0007096098,0.0021724354,0.0009892323,0.005445167,0.0035125448,0.0015971115,0.014101165],"category_scores_gemma":[0.011995963,0.000858541,0.0024041748,0.0016671141,0.0016511447,0.010743197,0.0032311082,0.0024987,0.0036217903],"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.00029087372,0.00012934528,0.0020414246,0.00094315107,0.0001197658,0.00047793606,0.00056777423,0.017824812,0.003208021,0.80640036,0.029175622,0.13882084],"study_design_scores_gemma":[0.000091997535,0.000079065634,0.00048284192,0.00039811144,0.00011138,0.0006715825,0.000311036,0.17567858,0.014998445,0.6018119,0.20528947,0.00007563362],"about_ca_topic_score_codex":0.0049512875,"about_ca_topic_score_gemma":0.008794604,"teacher_disagreement_score":0.014101165,"about_ca_system_score_codex":0.0021516944,"about_ca_system_score_gemma":0.0026219247,"threshold_uncertainty_score":0.047173142},"labels":[],"label_agreement":null},{"id":"W39832950","doi":"","title":"An Exponential Time/Space Speedup For Resolution","year":2007,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"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 Toronto","funders":"","keywords":"Resolution (logic); DPLL algorithm; Satisfiability; Speedup; Heuristics; Bottleneck; PSPACE; Mathematical proof; Heuristic; Proof complexity; Space (punctuation); Computer science; Mathematics; Algorithm; Conjunctive normal form; Automated theorem proving; Exponential function; Discrete mathematics; Computational complexity theory; Mathematical optimization; Parallel computing; Artificial intelligence","score_opus":0.02567232214564987,"score_gpt":0.29772534194865613,"score_spread":0.2720530198030063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39832950","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.08143615,0.0066167885,0.81236964,0.023329623,0.0011960781,0.00033548824,0.0019019104,0.010499927,0.062314413],"genre_scores_gemma":[0.3931162,0.0029320787,0.579157,0.0030988476,0.0008932293,0.0003934788,0.0018132783,0.0018545847,0.016741348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350476,0.0011872161,0.000364182,0.0015607371,0.0022279972,0.0011550966],"domain_scores_gemma":[0.98729634,0.0077242046,0.0004888545,0.0034326378,0.00078079547,0.00027715374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039284993,0.0021440163,0.001340002,0.001406935,0.0012258132,0.0039609117,0.0032797938,0.0033266465,0.029736113],"category_scores_gemma":[0.016282776,0.0010502132,0.0026445452,0.0023694534,0.0022276465,0.013776273,0.003449769,0.0058489847,0.005825638],"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.0024866345,0.00085241755,0.0022365577,0.0021708575,0.00023126802,0.0006029153,0.000509236,0.07881025,0.06091848,0.34548867,0.061891995,0.44380075],"study_design_scores_gemma":[0.0005220829,0.00032581444,0.0009639492,0.0002322875,0.00021166161,0.0013688917,0.0003316258,0.4233636,0.037223432,0.49405771,0.04133477,0.00006417545],"about_ca_topic_score_codex":0.0016627659,"about_ca_topic_score_gemma":0.0025422922,"teacher_disagreement_score":0.029736113,"about_ca_system_score_codex":0.0028874853,"about_ca_system_score_gemma":0.0026261602,"threshold_uncertainty_score":0.09947717},"labels":[],"label_agreement":null},{"id":"W41899231","doi":"","title":"Conservative belief change","year":2004,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Proposition; Context (archaeology); Interpretation (philosophy); Belief structure; State (computer science); Computer science; Set (abstract data type); Representation (politics); Mathematics; Artificial intelligence; Epistemology; Algorithm; Philosophy","score_opus":0.24965957017784085,"score_gpt":0.3577612197210079,"score_spread":0.10810164954316703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41899231","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.045531224,0.0011289575,0.8122776,0.011775574,0.0006005748,0.00027574378,0.00022636479,0.00064939976,0.1275345],"genre_scores_gemma":[0.9017392,0.00038161865,0.085544586,0.0016812813,0.0003306269,0.00026948645,0.00015353791,0.00010335078,0.009796288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887304,0.0041906973,0.0006354745,0.0024214538,0.0032740154,0.000748029],"domain_scores_gemma":[0.9815839,0.007809264,0.0016351306,0.0050416845,0.0032171863,0.00071283645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010874519,0.0008319586,0.0008966227,0.0014521519,0.0019800174,0.0047554774,0.002383847,0.002816636,0.005470865],"category_scores_gemma":[0.032229107,0.000523477,0.0015320567,0.0008672812,0.009815901,0.008949789,0.0053285244,0.0052022487,0.0007553707],"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.000033056425,0.000013732019,0.00038959272,0.000056019875,0.000033776363,0.00007782657,0.0013362196,0.0009972457,0.0005533653,0.9861696,0.0009729087,0.009366607],"study_design_scores_gemma":[0.000020095886,0.000038374652,0.00025338677,0.000027391645,0.000032449312,0.00012396082,0.00024362205,0.00501465,0.00064216537,0.9832424,0.010340779,0.00002079011],"about_ca_topic_score_codex":0.001021508,"about_ca_topic_score_gemma":0.0007253468,"teacher_disagreement_score":0.010874519,"about_ca_system_score_codex":0.0028039466,"about_ca_system_score_gemma":0.0014826293,"threshold_uncertainty_score":0.057510674},"labels":[],"label_agreement":null},{"id":"W4205220844","doi":"10.1093/jigpal/jzab025","title":"Logics of Ignorance and Being Wrong","year":2021,"lang":"en","type":"article","venue":"Logic Journal of IGPL","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"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":"","keywords":"Ignorance; Epistemology; Philosophy; Expressivity; Mathematics; Computer science; Calculus (dental); Programming language; Linguistics; Medicine","score_opus":0.013995834184206628,"score_gpt":0.23612690171126757,"score_spread":0.22213106752706094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205220844","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.107136495,0.009985694,0.44330087,0.04459595,0.00083714473,0.000076838114,0.00036691513,0.00038898035,0.39331105],"genre_scores_gemma":[0.98086196,0.0012421535,0.011712691,0.0018689438,0.0002449031,0.00004004825,0.00009098868,0.000028096158,0.003910278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931102,0.003654535,0.00041601007,0.0008648019,0.0014964805,0.00045809927],"domain_scores_gemma":[0.9907161,0.005696467,0.0009231287,0.001251071,0.0010184499,0.0003949349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063590044,0.00038540334,0.0006097502,0.0018071065,0.002288868,0.005714885,0.0010804165,0.0021087895,0.0028289333],"category_scores_gemma":[0.010345528,0.0003732451,0.0008488104,0.0014635029,0.026704239,0.010085115,0.003919075,0.003704024,0.00034072026],"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.000005398893,0.0000016320489,0.00005479415,0.000016116934,0.0000031301213,0.000024461748,0.00040000613,0.0003046607,0.00003552598,0.9979286,0.00023879614,0.0009866883],"study_design_scores_gemma":[0.000004034009,0.0000027644073,0.000059181333,0.000026040692,0.0000042959705,0.00003847963,0.0001831616,0.00051419745,0.000059670536,0.99558663,0.0035169744,0.0000046732494],"about_ca_topic_score_codex":0.0038001933,"about_ca_topic_score_gemma":0.0014090744,"teacher_disagreement_score":0.0063590044,"about_ca_system_score_codex":0.0038771068,"about_ca_system_score_gemma":0.002266565,"threshold_uncertainty_score":0.033630073},"labels":[],"label_agreement":null},{"id":"W4205512329","doi":"10.1145/3498677","title":"Reasoning about “reasoning about reasoning”: semantics and contextual equivalence for probabilistic programs with nested queries and recursion","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":19,"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":"Soundness; Computer science; Operational semantics; Probabilistic logic; Equivalence (formal languages); Theoretical computer science; Inference; Semantics (computer science); Recursion (computer science); Denotational semantics; Programming language; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.01557696947963156,"score_gpt":0.25566242282379664,"score_spread":0.2400854533441651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205512329","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.0056231343,0.0001239884,0.98872656,0.0016342709,0.000039066847,0.00006713065,0.00007024391,0.00040379236,0.0033118406],"genre_scores_gemma":[0.35063836,0.00034247185,0.64269143,0.001098529,0.00023598691,0.0005037136,0.00032071833,0.00044718024,0.0037215548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9855656,0.006150609,0.0013138229,0.0024958812,0.0034284804,0.001045603],"domain_scores_gemma":[0.9800044,0.012102573,0.0013249312,0.0035992188,0.0021829284,0.0007860168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012960603,0.0010857546,0.0012939207,0.0022168716,0.0023237949,0.007582733,0.0038040045,0.0031987168,0.0038373345],"category_scores_gemma":[0.030914579,0.0013425753,0.0039676726,0.0018827297,0.013540993,0.020874191,0.008108831,0.007335361,0.0007611463],"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.000012648002,0.00002311026,0.00014612642,0.000039266317,0.000015838266,0.000057845642,0.000529174,0.003343848,0.00041262803,0.990146,0.00033534796,0.00493817],"study_design_scores_gemma":[0.000013492582,0.000016480486,0.00007910099,0.000023959696,0.000020665979,0.00007451977,0.000109060085,0.030933568,0.0010757067,0.9637802,0.0038534498,0.00001980826],"about_ca_topic_score_codex":0.006468284,"about_ca_topic_score_gemma":0.0043428605,"teacher_disagreement_score":0.012960603,"about_ca_system_score_codex":0.0040810695,"about_ca_system_score_gemma":0.0032825086,"threshold_uncertainty_score":0.06854302},"labels":[],"label_agreement":null},{"id":"W4206046586","doi":"10.1007/s10992-014-9330-x","title":"Guest Editors’ Introduction","year":2014,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.017172200330879486,"score_gpt":0.24629256994569004,"score_spread":0.22912036961481055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206046586","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.000171268,0.0059548025,0.0005843303,0.03705388,0.9303817,0.00003360107,0.00022531484,0.00020127888,0.025393905],"genre_scores_gemma":[0.0037121784,0.006757002,0.00068462425,0.024970993,0.72640747,0.000088570305,0.0003177556,0.0003364954,0.23672487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727196,0.0003094586,0.0002461135,0.0005523095,0.0012390617,0.0003811997],"domain_scores_gemma":[0.985036,0.0023562578,0.0009298876,0.00091784843,0.0069689876,0.0037910584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003786427,0.0012805212,0.0011118974,0.0028377036,0.0018334787,0.0073236316,0.0020237407,0.0043950854,0.15647644],"category_scores_gemma":[0.02106377,0.0005330304,0.0009938253,0.0012068178,0.0010471117,0.00352095,0.0025424566,0.0067948666,0.090312585],"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.000022460106,0.000009928134,0.00004661007,0.00011778404,0.000004182287,0.00004036747,0.000017004688,0.000024342042,0.0000938136,0.0018447582,0.9803561,0.017422525],"study_design_scores_gemma":[0.000010893677,0.0000147256,0.00014230741,0.000096998956,0.0000056544923,0.00008049684,0.000019807128,0.000040167375,0.000099590274,0.0011815027,0.9983012,0.0000066483394],"about_ca_topic_score_codex":0.00056638586,"about_ca_topic_score_gemma":0.0012687716,"teacher_disagreement_score":0.15647644,"about_ca_system_score_codex":0.0014725042,"about_ca_system_score_gemma":0.0022674957,"threshold_uncertainty_score":0.5234659},"labels":[],"label_agreement":null},{"id":"W4206823480","doi":"10.1016/j.jlap.2014.02.017","title":"Preface","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Psychology","score_opus":0.033215056177060234,"score_gpt":0.34725635102431884,"score_spread":0.3140412948472586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206823480","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.0014548944,0.016572995,0.009880509,0.044127278,0.23894036,0.0004752295,0.011888393,0.0016367758,0.6750237],"genre_scores_gemma":[0.0056957435,0.0058652447,0.003131681,0.006587413,0.02640845,0.0002044206,0.0067575416,0.000774596,0.944575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926347,0.000109584136,0.000053347278,0.000137034,0.00037525425,0.00006130059],"domain_scores_gemma":[0.9950305,0.0008053357,0.00016834341,0.00048395523,0.002810434,0.00070148107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013791642,0.0007955874,0.0006552378,0.0031196168,0.0021383956,0.0036508748,0.0011972346,0.0011205582,0.42561483],"category_scores_gemma":[0.010424928,0.0002880248,0.0004793475,0.0020634623,0.0006161571,0.0028626472,0.0018363388,0.00275741,0.28131163],"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.000021642836,0.000018108169,0.000080569494,0.00007914144,0.0000017014077,0.000025612659,0.00005714845,0.00005128835,0.000095572934,0.007250155,0.9486873,0.043631837],"study_design_scores_gemma":[0.0000031659247,0.000007801908,0.00019488446,0.000091517686,0.0000013224852,0.0000323785,0.000046044806,0.0000258403,0.000066055785,0.0036066542,0.99592054,0.0000037499137],"about_ca_topic_score_codex":0.0032056845,"about_ca_topic_score_gemma":0.004905536,"teacher_disagreement_score":0.57438517,"about_ca_system_score_codex":0.0017882524,"about_ca_system_score_gemma":0.001955812,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4206841129","doi":"10.1561/0400000068","title":"Quantum Proofs","year":2016,"lang":"en","type":"article","venue":"Foundations and Trends® in Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","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","funders":"","keywords":"Quantum complexity theory; Mathematical proof; Complexity class; Quantum algorithm; Proof complexity; Gas meter prover; Quantum computer; Computer science; Theoretical computer science; Class (philosophy); Quantum; Quantum information; Mathematics; Discrete mathematics; Time complexity; Quantum mechanics; Physics","score_opus":0.015426612340881449,"score_gpt":0.27143515409028196,"score_spread":0.2560085417494005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206841129","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.00807818,0.022117352,0.4955539,0.017253121,0.0034180547,0.00034888802,0.0021735681,0.0014442222,0.44961265],"genre_scores_gemma":[0.486745,0.036774036,0.28548366,0.008937157,0.006096486,0.00081071287,0.0045596994,0.0011053246,0.16948788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995331,0.0012734949,0.00031868267,0.0009541466,0.0017308649,0.00039169527],"domain_scores_gemma":[0.9909025,0.0045653703,0.000522189,0.00228896,0.0014172154,0.00030372196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002987538,0.00079010084,0.0008400869,0.0021047005,0.0027917244,0.006768732,0.0025635238,0.002326692,0.049825795],"category_scores_gemma":[0.015019332,0.0007700198,0.0014932831,0.002086015,0.005097172,0.013931584,0.004745087,0.0042287474,0.009450041],"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.0000065931667,0.0000066131547,0.00004677711,0.000102634185,0.0000071492636,0.000018813109,0.000067824316,0.00024824083,0.00012188902,0.9820388,0.00597892,0.011355754],"study_design_scores_gemma":[0.000009811181,0.000010974272,0.00007388997,0.00010283015,0.000008995049,0.0001154544,0.000051693427,0.0016076531,0.00056657806,0.8759636,0.121475294,0.00001309305],"about_ca_topic_score_codex":0.0013278523,"about_ca_topic_score_gemma":0.0012873766,"teacher_disagreement_score":0.049825795,"about_ca_system_score_codex":0.0034833315,"about_ca_system_score_gemma":0.0030756944,"threshold_uncertainty_score":0.16668385},"labels":[],"label_agreement":null},{"id":"W4211020560","doi":"10.1007/978-94-017-0466-3_4","title":"The Logic of Fiction","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"","keywords":"Epistemology; Object (grammar); Dilemma; Philosophy; Point (geometry); Fiction theory; Analytic philosophy; Philosophy of language; Semantics (computer science); Linguistics; Computer science; Contemporary philosophy; Literary fiction; Mathematics; Literary criticism; Metaphysics","score_opus":0.029663884271025946,"score_gpt":0.2200072818209195,"score_spread":0.19034339754989354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211020560","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.00090339745,0.012147559,0.012327024,0.00677425,0.00060886523,0.000026398597,0.00010851691,0.00011020584,0.96699387],"genre_scores_gemma":[0.31289586,0.021284007,0.017968338,0.006306573,0.0036480331,0.00024554625,0.000610881,0.00035887878,0.6366818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989336,0.00044226038,0.00003534385,0.00017088995,0.00031318693,0.00010467624],"domain_scores_gemma":[0.9985979,0.0009324315,0.00005352949,0.00017403567,0.00018724956,0.000054774606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010681715,0.0007857307,0.000705003,0.0026591239,0.0041986955,0.009331799,0.0014044497,0.0025929383,0.02237334],"category_scores_gemma":[0.00381332,0.0005279827,0.00065775646,0.0021319897,0.01874993,0.009787651,0.0016662007,0.0044281026,0.005132334],"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.0000023055013,0.0000019543934,0.000009054777,0.000021402519,0.0000012735929,0.000009929887,0.00024899095,0.00005647542,0.000015243194,0.9856829,0.010278522,0.0036718082],"study_design_scores_gemma":[0.00000456938,0.0000037130205,0.00004102254,0.0000754805,0.0000024184044,0.000054146705,0.00013990594,0.00021244466,0.00006286288,0.76842207,0.2309762,0.0000050988588],"about_ca_topic_score_codex":0.004517875,"about_ca_topic_score_gemma":0.0037719,"teacher_disagreement_score":0.02237334,"about_ca_system_score_codex":0.005566585,"about_ca_system_score_gemma":0.002470541,"threshold_uncertainty_score":0.07484633},"labels":[],"label_agreement":null},{"id":"W4220992003","doi":"10.1017/bsl.2022.9","title":"NOTICES","year":2022,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"California State University, Northridge; University of California, Irvine; College of Veterinary Medicine, Cornell University; Háskólinn í Reykjavík; Universidad de Costa Rica; McMaster University; California State University; National Science Foundation","keywords":"Content (measure theory); Computer science; Mathematics","score_opus":0.015446194333931476,"score_gpt":0.22385973441804632,"score_spread":0.20841354008411483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220992003","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.0009909817,0.0015733605,0.0029684217,0.029052623,0.043831088,0.0005969967,0.012013169,0.0049476884,0.9040257],"genre_scores_gemma":[0.004903905,0.00059889565,0.0010968676,0.007668822,0.006232833,0.00025258723,0.0052866503,0.0009713234,0.9729882],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926318,0.0009364502,0.00050092593,0.00078357855,0.004460844,0.0006865009],"domain_scores_gemma":[0.9771817,0.004934749,0.00097319775,0.0039260327,0.010628531,0.0023557914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005199459,0.00088619615,0.0008598067,0.003269551,0.004143055,0.006108851,0.002330382,0.0051270896,0.6468045],"category_scores_gemma":[0.038045824,0.0005820276,0.0007599562,0.0028885605,0.0010100459,0.0049152006,0.0036656044,0.0048108185,0.4115775],"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.000045345118,0.000017089298,0.000093559545,0.00006848698,0.0000017505548,0.000048434846,0.00006523305,0.000019117653,0.00019767457,0.0063897367,0.9747006,0.01835293],"study_design_scores_gemma":[0.0000074532504,0.000008716508,0.00017493639,0.00002646977,0.0000013682261,0.000025268808,0.000036302063,0.000025601144,0.00008109905,0.00067543087,0.9989322,0.000005134404],"about_ca_topic_score_codex":0.008730643,"about_ca_topic_score_gemma":0.010493611,"teacher_disagreement_score":0.3531955,"about_ca_system_score_codex":0.0032486182,"about_ca_system_score_gemma":0.0040892814,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4226218108","doi":"10.1007/978-3-030-97457-2_13","title":"Analysis of the Execution Time of the Jason BDI Reasoning Cycle","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Execution time; Time complexity; Exploit; Running time; Worst-case execution time; Frame (networking); Profiling (computer programming); Response time; Programming language; Parallel computing; Algorithm; Operating system","score_opus":0.00913418617803789,"score_gpt":0.22096968387614668,"score_spread":0.2118354976981088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226218108","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.804165,0.0011851793,0.15376468,0.0006787416,0.00013658748,0.0002370839,0.0018169854,0.003867737,0.03414797],"genre_scores_gemma":[0.9105427,0.00019212134,0.08171662,0.000087155284,0.000018228,0.00010761214,0.0010023236,0.0004232569,0.0059099207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981997,0.0003676388,0.000064437416,0.00026122056,0.0007726987,0.0003341406],"domain_scores_gemma":[0.990257,0.0077813556,0.0003597417,0.00054630515,0.0008931925,0.00016245843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016786396,0.0007662234,0.0005496568,0.0015916426,0.0008691107,0.0015557441,0.0011856683,0.0005608869,0.010175664],"category_scores_gemma":[0.009643802,0.00045329114,0.0007747975,0.001454745,0.00079862337,0.0016857979,0.000593653,0.0011188127,0.000676473],"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.005291118,0.00071273244,0.013016882,0.0010675003,0.00018790386,0.00035745034,0.00073094794,0.4704888,0.04699217,0.13515252,0.010384193,0.31561783],"study_design_scores_gemma":[0.00007475524,0.0001517036,0.0021565943,0.000025529695,0.00007422479,0.000060302387,0.00009049301,0.9701914,0.011712085,0.013762942,0.0016787703,0.000021157957],"about_ca_topic_score_codex":0.012102437,"about_ca_topic_score_gemma":0.015813477,"teacher_disagreement_score":0.012102437,"about_ca_system_score_codex":0.0024456636,"about_ca_system_score_gemma":0.0033023625,"threshold_uncertainty_score":0.034041047},"labels":[],"label_agreement":null},{"id":"W4231023460","doi":"10.4324/9781315262628","title":"An Invitation to Formal Reasoning","year":2017,"lang":"en","type":"book","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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","score_opus":0.021444169051468415,"score_gpt":0.2787513157480034,"score_spread":0.257307146696535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231023460","genre_codex":"commentary","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.0013550555,0.019902589,0.1806281,0.44177353,0.04554011,0.0002281979,0.0006967851,0.0012641714,0.30861145],"genre_scores_gemma":[0.099416226,0.022107475,0.14251101,0.18851313,0.0719689,0.0024490645,0.0019081212,0.0022550784,0.46887103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9841384,0.006104401,0.0009323015,0.0022380892,0.005789993,0.0007967268],"domain_scores_gemma":[0.9812557,0.012119714,0.0005519126,0.00193534,0.003512917,0.00062445935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013170036,0.0014160277,0.0011616057,0.0018370085,0.0047417306,0.008624391,0.0035226822,0.0077202828,0.02875209],"category_scores_gemma":[0.038177345,0.000768717,0.0032968004,0.0014115322,0.01790795,0.01793362,0.009524046,0.01655011,0.013815497],"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.0000068810227,0.000012166367,0.000029577937,0.00004577164,0.000004426963,0.000045010907,0.000379975,0.00013349105,0.00005019099,0.90820557,0.083116315,0.007970644],"study_design_scores_gemma":[0.000007014865,0.000009036001,0.000025875384,0.00010538753,0.000003163832,0.00007795848,0.000081981,0.00035346774,0.00006491264,0.50580114,0.4934589,0.000011013516],"about_ca_topic_score_codex":0.00249197,"about_ca_topic_score_gemma":0.0012935664,"teacher_disagreement_score":0.02875209,"about_ca_system_score_codex":0.0068437224,"about_ca_system_score_gemma":0.0046367003,"threshold_uncertainty_score":0.09618533},"labels":[],"label_agreement":null},{"id":"W4231535802","doi":"10.1176/pn.41.16.0036a","title":"Faulty Logic","year":2006,"lang":"en","type":"article","venue":"Psychiatric News","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":"Computer science","score_opus":0.011172248418433062,"score_gpt":0.23826889580987481,"score_spread":0.22709664739144175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231535802","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010460962,0.0045037097,0.019621985,0.046403997,0.016007172,0.00008429916,0.0021685862,0.002074777,0.90808934],"genre_scores_gemma":[0.09345457,0.0076049743,0.015122796,0.038137607,0.014552372,0.00026932443,0.004538756,0.0038664786,0.8224531],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967276,0.0010170105,0.0002291368,0.00063969323,0.001020174,0.0003663863],"domain_scores_gemma":[0.9948673,0.0017854396,0.00022149309,0.0009084161,0.0019371673,0.00028015053],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018092901,0.001066701,0.00079039263,0.0021742014,0.003807754,0.007973834,0.0019816197,0.0030615053,0.3557959],"category_scores_gemma":[0.014804813,0.0005654629,0.00093281275,0.0016728418,0.0039550164,0.011592553,0.0031812722,0.004485292,0.18613578],"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.000065278284,0.00001569806,0.00013063036,0.00013632333,0.000010499011,0.00016311735,0.00037638913,0.000120200326,0.00013367053,0.3405457,0.6204585,0.03784395],"study_design_scores_gemma":[0.000012217102,0.0000067518936,0.000071150935,0.00011426715,0.0000048803035,0.0002016996,0.00017035405,0.00018382988,0.00020013473,0.12641302,0.87260807,0.000013642791],"about_ca_topic_score_codex":0.0035585605,"about_ca_topic_score_gemma":0.0029805498,"teacher_disagreement_score":0.3557959,"about_ca_system_score_codex":0.004593624,"about_ca_system_score_gemma":0.0023776498,"threshold_uncertainty_score":0.918879},"labels":[],"label_agreement":null},{"id":"W4232231877","doi":"10.1007/978-3-030-62757-7_3","title":"Logic in Reality","year":2020,"lang":"en","type":"book-chapter","venue":"Studies in applied philosophy, epistemology and rational ethics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Epistemology; Philosophical logic; Philosophy; Computer science","score_opus":0.19074309729702138,"score_gpt":0.3586716537357434,"score_spread":0.167928556438722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232231877","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.0029340556,0.031712614,0.028942477,0.027006565,0.0013525938,0.000041633546,0.0002243706,0.00013730065,0.9076484],"genre_scores_gemma":[0.4217987,0.018889124,0.021833979,0.013723105,0.0034988108,0.0003167755,0.00059231906,0.00046019477,0.518887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860734,0.0008165281,0.000036544097,0.0002098482,0.00025652457,0.00007326352],"domain_scores_gemma":[0.9988507,0.00069275766,0.000050722883,0.00018887474,0.00015773853,0.00005918433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016857506,0.00067834655,0.0006056149,0.0011443894,0.0023332902,0.006867146,0.0009202447,0.0023135,0.014465481],"category_scores_gemma":[0.0027893719,0.00034778286,0.00038775883,0.0010493876,0.016244166,0.006610788,0.0015374918,0.004586103,0.0039669457],"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.0000027213653,0.0000029970895,0.000020891586,0.000013074181,0.0000011975269,0.0000060026655,0.00029482672,0.000049594684,0.000020085054,0.9893399,0.007761175,0.0024876385],"study_design_scores_gemma":[0.000004255068,0.000004385376,0.000054750355,0.000048854963,0.0000018424698,0.000026062915,0.00023636132,0.00015861,0.00004829311,0.8574896,0.14192422,0.0000027523708],"about_ca_topic_score_codex":0.004710355,"about_ca_topic_score_gemma":0.0038777054,"teacher_disagreement_score":0.014465481,"about_ca_system_score_codex":0.0042995065,"about_ca_system_score_gemma":0.0022261506,"threshold_uncertainty_score":0.04839188},"labels":[],"label_agreement":null},{"id":"W4234423775","doi":"10.1109/icse.1993.346034","title":"'. . . and nothing else changes': the frame problem in procedure specifications","year":2002,"lang":"en","type":"article","venue":"","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":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Frame (networking); Programming language; Frame problem; Notation; Object (grammar); Formal specification; Formal methods; Field (mathematics); Formal language; Artificial intelligence; Mathematics","score_opus":0.04810930668659105,"score_gpt":0.2237208784713758,"score_spread":0.17561157178478476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234423775","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.020691704,0.0034818973,0.89309186,0.015440884,0.00044903936,0.00015138344,0.00013959828,0.0006897333,0.065863974],"genre_scores_gemma":[0.5942678,0.0042283162,0.37032488,0.003719279,0.0005632934,0.00056096836,0.00038726846,0.0006033282,0.025344947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892491,0.0069177775,0.0004768814,0.0010681606,0.0014532144,0.00083480426],"domain_scores_gemma":[0.98692423,0.008921429,0.0009255118,0.002033642,0.00090457604,0.00029055763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017208349,0.00085221464,0.0008648719,0.0018922943,0.0039709043,0.006629679,0.0021670652,0.006261037,0.0064601162],"category_scores_gemma":[0.0291918,0.0009965568,0.0017935297,0.002561073,0.015720028,0.022497999,0.0033700957,0.0042838817,0.0010728734],"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.000026482894,0.0000053787053,0.00012782722,0.000035540208,0.000004688438,0.00012683115,0.0014976806,0.0009302428,0.00011504841,0.98247945,0.0010388788,0.013611819],"study_design_scores_gemma":[0.000024122433,0.000052961484,0.00014404059,0.00014376709,0.00002441018,0.00032147637,0.0012473018,0.007849466,0.00082116097,0.94334877,0.045987826,0.000034674842],"about_ca_topic_score_codex":0.011876248,"about_ca_topic_score_gemma":0.007284365,"teacher_disagreement_score":0.017208349,"about_ca_system_score_codex":0.004328702,"about_ca_system_score_gemma":0.004308442,"threshold_uncertainty_score":0.09100753},"labels":[],"label_agreement":null},{"id":"W4234644336","doi":"10.1016/s1571-0661(05)80010-6","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","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":"Computer science; Programming language","score_opus":0.0066518300760790025,"score_gpt":0.23989979024881028,"score_spread":0.23324796017273128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234644336","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.0008857616,0.009523812,0.0051965876,0.032917768,0.14381957,0.00044932263,0.013839137,0.0030515122,0.79031646],"genre_scores_gemma":[0.0034285164,0.0044619073,0.0019222223,0.005857445,0.013936788,0.00022232757,0.0137998415,0.0013202701,0.95505077],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982432,0.0002146261,0.00013379821,0.00035119292,0.00090390263,0.00015327113],"domain_scores_gemma":[0.9940216,0.0008515822,0.0002610146,0.00074721297,0.0032714766,0.0008471527],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020360867,0.0011437889,0.0009721673,0.0029724708,0.0026086795,0.007525959,0.0021031087,0.002201045,0.58818364],"category_scores_gemma":[0.011647767,0.0004758398,0.00082154205,0.0029593222,0.0007238011,0.005312553,0.0028653406,0.0037067086,0.43549824],"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.000017080238,0.000010874205,0.00004338149,0.0000857173,0.0000015196397,0.000017102942,0.00003927119,0.000032245338,0.000061106395,0.0028649664,0.96988726,0.02693958],"study_design_scores_gemma":[0.0000020896398,0.0000056232007,0.00010315751,0.0000624759,8.9493943e-7,0.000019166684,0.000031080675,0.000015615773,0.000029267429,0.00063631765,0.99909174,0.0000025891015],"about_ca_topic_score_codex":0.003947821,"about_ca_topic_score_gemma":0.0040155533,"teacher_disagreement_score":0.41181636,"about_ca_system_score_codex":0.002687565,"about_ca_system_score_gemma":0.0030001183,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4235002577","doi":"10.1145/1577824","title":"Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","year":2009,"lang":"en","type":"paratext","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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; Logical framework; Representation (politics); Programming language; Variable (mathematics); Automated theorem proving; Mathematics","score_opus":0.028040431079381038,"score_gpt":0.3110173742096698,"score_spread":0.28297694313028876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235002577","genre_codex":"methods","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.00561573,0.1107154,0.3752997,0.114908814,0.039172366,0.0005742492,0.001465307,0.0031185767,0.3491299],"genre_scores_gemma":[0.083639264,0.08169028,0.34302375,0.018196888,0.020408595,0.0010849928,0.005167892,0.004244464,0.4425439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932306,0.002799887,0.00055165676,0.0010865119,0.0018458691,0.000485468],"domain_scores_gemma":[0.99432135,0.0026948303,0.0001751776,0.00093590847,0.0012547498,0.0006179898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008896736,0.0011785412,0.0011674433,0.0023424414,0.0023670064,0.013067581,0.0031445662,0.0038906385,0.057939112],"category_scores_gemma":[0.012086281,0.0011929463,0.0021178739,0.0023978176,0.0053697047,0.014207993,0.006591698,0.008250101,0.015124476],"study_design_candidate":"not_applicable","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.00009618479,0.000117649855,0.00037136546,0.0006219115,0.000054630833,0.00017015285,0.0022514714,0.0010766214,0.0011281023,0.4349399,0.36820504,0.19096698],"study_design_scores_gemma":[0.000012801955,0.000016303378,0.00011680389,0.00039385707,0.000013276224,0.00013910292,0.00031937717,0.0007316946,0.00031505062,0.06165475,0.93626785,0.000019108558],"about_ca_topic_score_codex":0.003451048,"about_ca_topic_score_gemma":0.0039341645,"teacher_disagreement_score":0.057939112,"about_ca_system_score_codex":0.0044754213,"about_ca_system_score_gemma":0.006121197,"threshold_uncertainty_score":0.19382566},"labels":[],"label_agreement":null},{"id":"W4235643071","doi":"10.1007/978-1-4939-7131-2_100933","title":"Query Answering","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.021514418107549827,"score_gpt":0.2242485666942576,"score_spread":0.20273414858670777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235643071","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.0026079242,0.029235052,0.52673686,0.008590844,0.0018119533,0.00036636283,0.0039672647,0.0050379485,0.42164582],"genre_scores_gemma":[0.08911312,0.043904718,0.44650808,0.0073094848,0.0043006646,0.00070402,0.0285612,0.0023950515,0.3772037],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979639,0.00039493534,0.00015429195,0.00052236055,0.0008209726,0.00014350012],"domain_scores_gemma":[0.99875236,0.00056180963,0.000033341064,0.000355339,0.00024766265,0.00004955048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017530159,0.0013899767,0.0013677836,0.0026550412,0.0012305763,0.0070448173,0.0031430644,0.0017550263,0.0675402],"category_scores_gemma":[0.0049339454,0.0007209459,0.0015523689,0.0043727807,0.0016326157,0.010449676,0.0030638392,0.0032635194,0.03779921],"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.000054218224,0.000074547075,0.00014505666,0.00076825306,0.00004124044,0.00006139507,0.00029056397,0.0012274891,0.0018455673,0.3745529,0.23285942,0.38807935],"study_design_scores_gemma":[0.00001639771,0.000019841476,0.0001994334,0.00028500304,0.0000349549,0.00032167463,0.00015169127,0.007556685,0.0018228734,0.3439554,0.6456109,0.000025215397],"about_ca_topic_score_codex":0.0023070944,"about_ca_topic_score_gemma":0.002263774,"teacher_disagreement_score":0.0675402,"about_ca_system_score_codex":0.0019800013,"about_ca_system_score_gemma":0.001268101,"threshold_uncertainty_score":0.22594446},"labels":[],"label_agreement":null},{"id":"W4237840899","doi":"10.22329/il.v31i3.3400","title":"Inference Claims","year":2011,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Universidade de Coimbra","keywords":"Generalization; Argument (complex analysis); Counterfactual thinking; Inference; Epistemology; Philosophy; Mathematical economics; Mathematics; Medicine","score_opus":0.05526603600104324,"score_gpt":0.2529798593404789,"score_spread":0.19771382333943566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237840899","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.015118923,0.0025562742,0.13441299,0.018683508,0.0032077865,0.0006272783,0.0062715,0.0026515499,0.81647015],"genre_scores_gemma":[0.5665333,0.003992782,0.083119445,0.0070991185,0.003908682,0.0007534039,0.015172744,0.0012400503,0.31818038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906916,0.0017801224,0.0009771985,0.0027106658,0.0029412077,0.0008993038],"domain_scores_gemma":[0.981871,0.007875707,0.00067428406,0.0054657683,0.0035595258,0.00055364374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011239806,0.0011743422,0.0011089245,0.003423605,0.004375495,0.007379585,0.0038701002,0.005621172,0.1045059],"category_scores_gemma":[0.038298063,0.00077245024,0.002426815,0.0020691473,0.003842429,0.015116609,0.0075722127,0.0048930617,0.024913648],"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.00015667612,0.000054063727,0.0010182279,0.00027931898,0.000057869136,0.0005604173,0.0012214012,0.00038464274,0.00057952123,0.92947584,0.031659123,0.034552872],"study_design_scores_gemma":[0.00005042389,0.000035269495,0.0007104913,0.00036756284,0.00012300172,0.00054551265,0.0005554182,0.0019773361,0.0020269249,0.6782845,0.31528765,0.000035887864],"about_ca_topic_score_codex":0.0020377298,"about_ca_topic_score_gemma":0.0017182766,"teacher_disagreement_score":0.1045059,"about_ca_system_score_codex":0.0034254408,"about_ca_system_score_gemma":0.002811411,"threshold_uncertainty_score":0.34960705},"labels":[],"label_agreement":null},{"id":"W4238088022","doi":"10.1007/978-3-030-36233-1_1","title":"Introduction","year":2020,"lang":"en","type":"book-chapter","venue":"Synthese Library/Synthese library","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Materials science","score_opus":0.012083886128068232,"score_gpt":0.1813814941100493,"score_spread":0.16929760798198107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238088022","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.0002905162,0.0030660583,0.0053179595,0.0026774318,0.0035268045,0.00014874457,0.0029338552,0.0015933532,0.9804452],"genre_scores_gemma":[0.0010977798,0.0016946363,0.001904973,0.0010449894,0.0006002546,0.00007600578,0.0022067325,0.00042842806,0.9909462],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993518,0.000062680105,0.000029156547,0.00014694841,0.00034480734,0.00006464051],"domain_scores_gemma":[0.9990639,0.00013274733,0.000033694116,0.00015900718,0.0004345769,0.00017608014],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006265975,0.0009394935,0.00070000195,0.0020175222,0.0015047059,0.0056476444,0.0019390871,0.0020574215,0.69789577],"category_scores_gemma":[0.0025532139,0.00044530927,0.0006752721,0.0019515165,0.00066352723,0.0044775484,0.002685711,0.0020928462,0.6009497],"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.00002513544,0.00003533756,0.0000869544,0.00018437182,0.0000026292635,0.000045971137,0.00012587296,0.00010690485,0.00038206993,0.032167673,0.7921663,0.17467076],"study_design_scores_gemma":[0.0000017891099,0.0000041198314,0.00005001232,0.000056804714,8.232492e-7,0.000030141233,0.000027171061,0.000016749394,0.00005446542,0.0025837875,0.9971717,0.0000024250467],"about_ca_topic_score_codex":0.0029139705,"about_ca_topic_score_gemma":0.00463479,"teacher_disagreement_score":0.69789577,"about_ca_system_score_codex":0.0014433244,"about_ca_system_score_gemma":0.0017363086,"threshold_uncertainty_score":0.430915},"labels":[],"label_agreement":null},{"id":"W4238340374","doi":"10.32920/ryerson.14660574.v1","title":"Plan recognition in dynamic 2-D environments","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Formalism (music); Computer science; Interpreter; Overtaking; Plan (archaeology); Artificial intelligence; Automaton; Theoretical computer science; Programming language; Engineering","score_opus":0.02649416979560451,"score_gpt":0.2376719358855737,"score_spread":0.2111777660899692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238340374","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.054895513,0.00029973715,0.9366503,0.00024424298,0.0000391849,0.000061752755,0.00030599136,0.0020643712,0.0054390733],"genre_scores_gemma":[0.65110123,0.00056170754,0.34196287,0.00013554734,0.000028156579,0.00012616834,0.001016928,0.00022246197,0.004844903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.00009234155,0.000029534545,0.00016726507,0.00010912874,0.00007665787],"domain_scores_gemma":[0.9994025,0.0003205556,0.00008245246,0.00009517338,0.000059754035,0.000039535666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559006,0.00056459615,0.00048863504,0.0006447791,0.0006539925,0.0019544836,0.00073837896,0.0009318402,0.0030119524],"category_scores_gemma":[0.001877252,0.00037307275,0.000932059,0.0005582686,0.0013814304,0.002427557,0.0015716754,0.0007221121,0.0005942205],"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.0003129235,0.00009945679,0.0036466743,0.00028597796,0.00005827852,0.0010119474,0.001074179,0.62792283,0.020141497,0.1904966,0.0037589304,0.15119071],"study_design_scores_gemma":[0.00002288451,0.000046094065,0.0010285379,0.000031975655,0.000016220276,0.0001896685,0.00034606966,0.8817102,0.0072658826,0.10164909,0.0076665143,0.000026945007],"about_ca_topic_score_codex":0.0087748105,"about_ca_topic_score_gemma":0.0071128667,"teacher_disagreement_score":0.0087748105,"about_ca_system_score_codex":0.0009297547,"about_ca_system_score_gemma":0.0007654272,"threshold_uncertainty_score":0.017447472},"labels":[],"label_agreement":null},{"id":"W4239236141","doi":"10.1002/0471221139.ch14","title":"Decentralized Systems","year":2002,"lang":"en","type":"other","venue":"","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 Toronto","funders":"","keywords":"Interconnection; Control theory (sociology); Diagonal; Computer science; Decentralised system; Controller (irrigation); Control engineering; Adaptive control; Dominance (genetics); Stability (learning theory); Engineering; Control (management); Mathematics","score_opus":0.017892136383039676,"score_gpt":0.2245667505432765,"score_spread":0.2066746141602368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239236141","genre_codex":"methods","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.012550099,0.002385011,0.63759655,0.0041077556,0.0009560677,0.00030760956,0.00092946936,0.0010556653,0.3401117],"genre_scores_gemma":[0.6107863,0.004861385,0.1854997,0.0015225654,0.0009134421,0.00081651163,0.0016510899,0.00025747967,0.19369163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00018264017,0.000055364428,0.00022115442,0.00031300046,0.000091934766],"domain_scores_gemma":[0.99956983,0.000104228544,0.000040867315,0.00011322363,0.00013449359,0.000037356534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065058365,0.0005236037,0.0005493433,0.0006325925,0.0010676099,0.0021571384,0.0006946933,0.0009943098,0.021753605],"category_scores_gemma":[0.0014350094,0.00027085308,0.0004908328,0.0007066803,0.00094039395,0.001930529,0.0022815848,0.0011505346,0.004024582],"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.000028642107,0.000022518527,0.00022155976,0.00010863581,0.000023377965,0.00016070223,0.00018602997,0.018123548,0.001809833,0.9251247,0.012143266,0.042047195],"study_design_scores_gemma":[0.00007059981,0.000054412518,0.00034375046,0.000067533285,0.000024771356,0.00028801934,0.00014713506,0.078109555,0.0014920097,0.62032706,0.29904622,0.000028911063],"about_ca_topic_score_codex":0.0016811843,"about_ca_topic_score_gemma":0.0017475245,"teacher_disagreement_score":0.021753605,"about_ca_system_score_codex":0.0014144422,"about_ca_system_score_gemma":0.0011566322,"threshold_uncertainty_score":0.0727731},"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":"W4243215113","doi":"10.1016/s1571-0661(05)80875-8","title":"Preface","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","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":"Library science; Computer science; Operations research; Engineering","score_opus":0.007424242706152011,"score_gpt":0.24707835672429573,"score_spread":0.2396541140181437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243215113","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010868851,0.014277534,0.006867397,0.023903467,0.09733331,0.000383064,0.01573437,0.0028417902,0.8375723],"genre_scores_gemma":[0.004819909,0.0068520266,0.003117336,0.0050201975,0.014772181,0.00021732811,0.014499717,0.0015274335,0.94917387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840647,0.00018623054,0.00011979459,0.00034575397,0.0008143367,0.00012736898],"domain_scores_gemma":[0.99624676,0.00068193703,0.00015139532,0.0005228309,0.0018217119,0.0005753827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013104723,0.0011918258,0.0010718226,0.0031539926,0.0023785084,0.006456148,0.0018864062,0.0017610615,0.59907156],"category_scores_gemma":[0.008746488,0.00041927124,0.0008345839,0.003023961,0.00085989764,0.004896745,0.003127394,0.0026553532,0.40105373],"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.000027471646,0.000015525226,0.00009061793,0.000134734,0.0000030564074,0.00002763406,0.00008412885,0.00005406845,0.00012145498,0.0054809507,0.94270724,0.05125317],"study_design_scores_gemma":[0.0000023514756,0.000007690724,0.00011926932,0.00006915845,0.0000014368676,0.00003755224,0.000043620643,0.000019209643,0.000044034135,0.0014504842,0.99820197,0.0000032178955],"about_ca_topic_score_codex":0.0026396108,"about_ca_topic_score_gemma":0.003157162,"teacher_disagreement_score":0.59907156,"about_ca_system_score_codex":0.0021165211,"about_ca_system_score_gemma":0.0024313927,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4243422394","doi":"10.1007/978-1-4614-8265-9_1267","title":"Null Values","year":2018,"lang":"pt","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Null (SQL); Mathematics; Computer science; Data mining","score_opus":0.02649153142572949,"score_gpt":0.2540182289957467,"score_spread":0.22752669757001723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243422394","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.0090223495,0.0029939637,0.31625488,0.002527186,0.0045012194,0.0005791526,0.016019288,0.013334828,0.6347671],"genre_scores_gemma":[0.14440471,0.0043847645,0.17822818,0.0025596311,0.0018201184,0.0011047965,0.034814913,0.012330125,0.62035275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710196,0.0005773378,0.0002680697,0.00075467303,0.0010080154,0.00029001007],"domain_scores_gemma":[0.99614584,0.00092781056,0.00018744415,0.0013892766,0.0011795158,0.00017010777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019423723,0.0019829397,0.0013400778,0.0027157227,0.0020899603,0.008029104,0.0030352427,0.0015113989,0.12695992],"category_scores_gemma":[0.008620494,0.0010300404,0.0010273487,0.0032993802,0.0021033739,0.0118778655,0.0040313043,0.0025520094,0.0772219],"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.00031440202,0.000056917135,0.0005661827,0.00048662504,0.000039163744,0.0002019765,0.00045127838,0.00040145323,0.0025118866,0.6851528,0.14351718,0.16630015],"study_design_scores_gemma":[0.000030055799,0.000030124442,0.00013014137,0.00017438023,0.000031338026,0.00031463426,0.0001318896,0.0007751434,0.005339805,0.26463538,0.72836435,0.000042714648],"about_ca_topic_score_codex":0.0008300518,"about_ca_topic_score_gemma":0.00090843736,"teacher_disagreement_score":0.12695992,"about_ca_system_score_codex":0.0012142267,"about_ca_system_score_gemma":0.001416118,"threshold_uncertainty_score":0.42472327},"labels":[],"label_agreement":null},{"id":"W4244929417","doi":"10.1023/a:1024248828122","title":"Synonymous Logics","year":2003,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Axiom; Equivalence (formal languages); Accessibility relation; Logical equivalence; Modal logic; Simple (philosophy); Mathematics; Logical consequence; Relation (database); Equivalence relation; Classical logic; Modal; Translation (biology); Axiomatic system; Mathematical economics; Computer science; Epistemology; Discrete mathematics; Artificial intelligence; Philosophy","score_opus":0.03407663729605738,"score_gpt":0.26282667466863896,"score_spread":0.2287500373725816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244929417","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.013421227,0.0063407533,0.2851281,0.011659688,0.001946233,0.00013644817,0.0022402469,0.0014506081,0.6776768],"genre_scores_gemma":[0.62867147,0.006343981,0.15083058,0.006673556,0.0026091759,0.00034929402,0.0061773886,0.0011530095,0.19719157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785644,0.0006683678,0.00020233325,0.0006108583,0.00046608757,0.00019587111],"domain_scores_gemma":[0.997586,0.00089186546,0.00013086434,0.0005905821,0.0006010587,0.000199748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015953676,0.00083814474,0.0010267978,0.0032849247,0.004702403,0.007822395,0.0014935782,0.0020024306,0.043638635],"category_scores_gemma":[0.005643294,0.0008652156,0.0011764169,0.0033599476,0.005033054,0.01547178,0.0041550756,0.0043376633,0.008960306],"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.000014456309,0.000007572531,0.000065339744,0.000023211887,0.000004462534,0.000022169414,0.00014678594,0.000042874068,0.00008535143,0.985872,0.005880967,0.007834924],"study_design_scores_gemma":[0.000012038062,0.0000039982956,0.000053096443,0.00002314057,0.000010363485,0.00012415188,0.000121755686,0.0004585785,0.00022123982,0.94389284,0.05507161,0.000007158149],"about_ca_topic_score_codex":0.0013323633,"about_ca_topic_score_gemma":0.0014469196,"teacher_disagreement_score":0.043638635,"about_ca_system_score_codex":0.001988007,"about_ca_system_score_gemma":0.0013751809,"threshold_uncertainty_score":0.14598584},"labels":[],"label_agreement":null},{"id":"W4245198223","doi":"10.1007/978-3-319-74451-3","title":"Relational Topology","year":2018,"lang":"en","type":"book","venue":"Lecture notes in mathematics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Algebraic topology; Topology (electrical circuits); Algebraic number; General topology; Algebra over a field; Pure mathematics; Topological space; Combinatorics; Mathematical analysis","score_opus":0.02734411538513943,"score_gpt":0.2569818996096699,"score_spread":0.22963778422453046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245198223","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.006483838,0.015873533,0.113959216,0.0044226246,0.0016627236,0.00006486951,0.0018520388,0.00086142664,0.8548198],"genre_scores_gemma":[0.286442,0.028701447,0.10207282,0.002197704,0.0038751352,0.00027766562,0.008485373,0.0013359013,0.56661195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951684,0.00007914047,0.000029779627,0.00014246968,0.00019976715,0.00003192098],"domain_scores_gemma":[0.99964654,0.00009485389,0.000022629752,0.00010550075,0.000094222865,0.000036136833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039916782,0.00073752797,0.00078889634,0.0016356473,0.0013991173,0.004843761,0.00086647127,0.00064546865,0.040442605],"category_scores_gemma":[0.0012919097,0.00045365424,0.00057803583,0.0024581908,0.0017209592,0.006696387,0.0016920263,0.0025358615,0.01522787],"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.000010665667,0.0000070618494,0.000043900887,0.00007096392,0.000007655074,0.000028498851,0.000109212786,0.000314473,0.00033034192,0.944503,0.02509474,0.029479455],"study_design_scores_gemma":[0.000005434245,0.000008071466,0.00011771953,0.00003253586,0.00000827869,0.00014191483,0.0000616989,0.00057383825,0.00026161896,0.77084076,0.22794114,0.0000070150472],"about_ca_topic_score_codex":0.00083213614,"about_ca_topic_score_gemma":0.00085304206,"teacher_disagreement_score":0.040442605,"about_ca_system_score_codex":0.0011260043,"about_ca_system_score_gemma":0.00062916044,"threshold_uncertainty_score":0.13529402},"labels":[],"label_agreement":null},{"id":"W4245990945","doi":"10.1016/s1874-5075(05)80019-1","title":"Introduction","year":2005,"lang":"en","type":"book-chapter","venue":"˜A œpractical logic of cognitive systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.0391913594935264,"score_gpt":0.2872446604504132,"score_spread":0.2480533009568868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245990945","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005242506,0.0034603782,0.008759066,0.004773644,0.003680748,0.0001265131,0.0020589118,0.00093988987,0.9756766],"genre_scores_gemma":[0.003813188,0.0026703845,0.0046003964,0.0023321048,0.001034869,0.00011551611,0.002132733,0.0003780026,0.9829228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999212,0.00010227123,0.000036769958,0.0001963865,0.000363711,0.00008885953],"domain_scores_gemma":[0.99901235,0.00016890912,0.000041595526,0.00017892325,0.0004265467,0.00017163204],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008021646,0.0008295327,0.0005370964,0.0016134299,0.001772767,0.005545095,0.0020098065,0.0022936685,0.511364],"category_scores_gemma":[0.0029535973,0.00034827174,0.00059693126,0.0016259158,0.0010875858,0.0047400477,0.0025725253,0.0021803747,0.34996682],"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.00003396967,0.000042111118,0.0001465274,0.00019014842,0.0000037433924,0.0000745882,0.00031474256,0.00014824132,0.0004060819,0.17587382,0.6599673,0.16279872],"study_design_scores_gemma":[0.0000019382487,0.0000054899374,0.000057487465,0.000053977492,9.661745e-7,0.000047369005,0.000042602536,0.000026506154,0.000061511164,0.010196044,0.98950315,0.0000029865298],"about_ca_topic_score_codex":0.002542927,"about_ca_topic_score_gemma":0.003353616,"teacher_disagreement_score":0.511364,"about_ca_system_score_codex":0.0017095747,"about_ca_system_score_gemma":0.0019055371,"threshold_uncertainty_score":0.69698},"labels":[],"label_agreement":null},{"id":"W4246123776","doi":"10.3233/fi-2016-1395","title":"Preface","year":2016,"lang":"la","type":"article","venue":"Fundamenta Informaticae","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Libera Università di Bolzano; Universität Bremen; Università della Calabria; Marmara Üniversitesi; Uniwersytet Warszawski; Università degli Studi dell'Aquila; Universidade de Lisboa; Universidad Nacional del Sur; Università degli Studi di Genova; Universidad Politécnica de Madrid; Aalto-Yliopisto; Universidade da Coruña; Universität Potsdam; University of Bath; Texas Tech University; Simon Fraser University; Arizona State University; University of Oxford; University of Alberta; Drexel University","keywords":"Answer set programming; Computer science; Constraint programming; Stable model semantics; Semantics (computer science); Set (abstract data type); Theoretical computer science; Constraint satisfaction; Logic programming; Constraint satisfaction problem; Programming language; Non-monotonic logic; Mathematics; Artificial intelligence; Operational semantics; Mathematical optimization","score_opus":0.01978046628812696,"score_gpt":0.23929596673903886,"score_spread":0.2195155004509119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246123776","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.002302769,0.016232809,0.014397232,0.04758934,0.14404388,0.0005960037,0.015341703,0.0022132655,0.7572831],"genre_scores_gemma":[0.013775221,0.00976388,0.006837551,0.010106989,0.023140248,0.00037852844,0.015908102,0.001442214,0.91864735],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987607,0.00018103472,0.00009707665,0.00028476713,0.00055422063,0.00012223564],"domain_scores_gemma":[0.9958151,0.00074072403,0.00017178101,0.00042629772,0.0021384354,0.0007076982],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015790113,0.001073064,0.00083087437,0.0024893817,0.0024002243,0.004219591,0.0016133039,0.0017119307,0.42582887],"category_scores_gemma":[0.0111018615,0.00034827058,0.00077953434,0.0022110539,0.0008275534,0.004091554,0.0027371242,0.0032683625,0.27645984],"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.000040074705,0.000024259318,0.00016522677,0.00013511136,0.0000040189966,0.00007093138,0.00011019205,0.00012281808,0.0001632548,0.012412701,0.9309248,0.05582659],"study_design_scores_gemma":[0.000003927855,0.00001063025,0.00021715727,0.00009689827,0.000001716753,0.0000661191,0.000055309312,0.000041754953,0.00007346269,0.0035805912,0.99584794,0.0000045695156],"about_ca_topic_score_codex":0.0035932355,"about_ca_topic_score_gemma":0.0042934725,"teacher_disagreement_score":0.5741711,"about_ca_system_score_codex":0.0028938376,"about_ca_system_score_gemma":0.002733373,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4246220219","doi":"10.1007/978-0-387-39940-9_5012","title":"Approximate Reasoning","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Psychology","score_opus":0.015896368807342992,"score_gpt":0.23069603841586026,"score_spread":0.21479966960851726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246220219","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.003514115,0.013762257,0.72891355,0.0030355684,0.001067441,0.00013924915,0.00094253634,0.0013468596,0.24727847],"genre_scores_gemma":[0.23281114,0.019348705,0.5709538,0.0018325651,0.0017345647,0.00035491187,0.0057744985,0.00068045635,0.16650933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975924,0.00042636797,0.00016591317,0.00046900767,0.0012154703,0.00013079555],"domain_scores_gemma":[0.99816847,0.0006109911,0.00007247148,0.0006913559,0.00040299213,0.000053633015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001589791,0.0013463815,0.0014791292,0.001917561,0.0012119025,0.0059070326,0.003425623,0.0018760248,0.03672937],"category_scores_gemma":[0.00765211,0.00077647466,0.0014731201,0.0023470302,0.002039941,0.006940889,0.0030292848,0.003104727,0.011865526],"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.000112586415,0.00007067902,0.00035385476,0.00039098307,0.00007372488,0.00010558939,0.00017303145,0.009603517,0.0010044188,0.69538146,0.039454147,0.25327593],"study_design_scores_gemma":[0.000024396157,0.000026986576,0.00026293006,0.00020252774,0.000051800664,0.00032467805,0.000097766744,0.04590904,0.0023436465,0.8043639,0.14636795,0.000024379366],"about_ca_topic_score_codex":0.0022843545,"about_ca_topic_score_gemma":0.002465289,"teacher_disagreement_score":0.03672937,"about_ca_system_score_codex":0.0016709252,"about_ca_system_score_gemma":0.0012178586,"threshold_uncertainty_score":0.122871995},"labels":[],"label_agreement":null},{"id":"W4248233446","doi":"10.32920/ryerson.14662323","title":"Deterministic planning in incompletely known domains with local effects","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Planner; Computer science; Semantics (computer science); Fragment (logic); Knowledge base; Order (exchange); Theoretical computer science; Propositional calculus; Artificial intelligence; Programming language","score_opus":0.018198869156082466,"score_gpt":0.25958853643703955,"score_spread":0.2413896672809571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248233446","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.0673697,0.0003760412,0.9264475,0.00040239104,0.00002011254,0.000090903435,0.00018266097,0.0012078601,0.0039028686],"genre_scores_gemma":[0.61314523,0.00074994756,0.3819321,0.00010517429,0.000039465336,0.00015258728,0.0005952134,0.00016831825,0.0031118335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980413,0.0006711694,0.00014761546,0.00043822607,0.00048975565,0.00021190521],"domain_scores_gemma":[0.9931518,0.005416369,0.0003970699,0.00061411684,0.00027337504,0.00014730204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029868365,0.00069213496,0.0010483488,0.0009259882,0.0010287381,0.0021868942,0.001683877,0.0011289223,0.002332905],"category_scores_gemma":[0.011283732,0.0008775665,0.0011602312,0.0012337592,0.0025221906,0.0043024225,0.0026993284,0.001902934,0.00028139589],"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.00029317904,0.000108557855,0.001240885,0.00024320965,0.000077910365,0.0007567278,0.00059225684,0.75397193,0.0041156965,0.1803572,0.0009990538,0.057243478],"study_design_scores_gemma":[0.00007210591,0.000059412745,0.00032388658,0.000032234966,0.00005593219,0.00010836102,0.00012192947,0.77923024,0.0045186393,0.21254456,0.0029103113,0.000022443193],"about_ca_topic_score_codex":0.01057203,"about_ca_topic_score_gemma":0.016036497,"teacher_disagreement_score":0.01057203,"about_ca_system_score_codex":0.0015950075,"about_ca_system_score_gemma":0.0023571844,"threshold_uncertainty_score":0.021020949},"labels":[],"label_agreement":null},{"id":"W4249214718","doi":"10.22329/il.v22i3.2591","title":"Pollock on Practical Reasoning","year":2001,"lang":"en","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pollock; Component (thermodynamics); Epistemology; Computer science; Architecture; Practical reason; Cognitive science; Sociology; Philosophy; Psychology; Art; Art history","score_opus":0.032313471354079124,"score_gpt":0.2922078628113353,"score_spread":0.2598943914572562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249214718","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.0087899715,0.026275171,0.1320906,0.121744834,0.0021847514,0.00012324796,0.00019228864,0.00041272954,0.7081864],"genre_scores_gemma":[0.7056627,0.016736005,0.07633344,0.025071796,0.0030534668,0.0005025574,0.00023688628,0.00047702255,0.17192623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681586,0.0015277702,0.00011715534,0.0005095605,0.00074440456,0.0002853435],"domain_scores_gemma":[0.9971462,0.0017052896,0.00013703424,0.0003953527,0.00043084327,0.00018516471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027175196,0.0006246337,0.000574782,0.0016448739,0.0045625498,0.0069335047,0.0013188958,0.0031862147,0.009655851],"category_scores_gemma":[0.007840866,0.0004245332,0.0008227371,0.0016178117,0.019177321,0.010073126,0.0036888535,0.0056857453,0.0016813371],"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.0000034354566,0.000002743858,0.000022564862,0.000013778833,0.0000014927946,0.000010084531,0.00018398059,0.00018896066,0.0000125484385,0.992573,0.0047762734,0.002211204],"study_design_scores_gemma":[0.000009222948,0.000005382757,0.000044356362,0.00006597196,0.0000045012116,0.000023753779,0.0001427798,0.0008144465,0.0000775056,0.89091176,0.10789427,0.0000060100783],"about_ca_topic_score_codex":0.015972584,"about_ca_topic_score_gemma":0.008729327,"teacher_disagreement_score":0.015972584,"about_ca_system_score_codex":0.007053104,"about_ca_system_score_gemma":0.0036324193,"threshold_uncertainty_score":0.051174104},"labels":[],"label_agreement":null},{"id":"W4249399534","doi":"10.1109/lics.2004.1319634","title":"A second-order theory for NL","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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 Toronto","funders":"","keywords":"Mathematics; Nondeterministic algorithm; Order (exchange); Discrete mathematics; Horn clause; Bounded function; Set theory; Quantifier (linguistics); Polynomial; Set (abstract data type); Combinatorics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.013609677250464474,"score_gpt":0.24260100266285478,"score_spread":0.2289913254123903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249399534","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.012379784,0.0017807968,0.9114755,0.003235323,0.0003600023,0.000086647226,0.00050270226,0.0008633375,0.0693159],"genre_scores_gemma":[0.5319393,0.0023604876,0.42596364,0.0026689172,0.0008474265,0.0004856324,0.0012856453,0.00051151484,0.033937246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839157,0.00040279978,0.00012730953,0.00033016698,0.0005080651,0.0002400017],"domain_scores_gemma":[0.9982339,0.0008905156,0.0001351106,0.00033191484,0.0003083518,0.000100228215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529841,0.00066444126,0.0006648825,0.0019079736,0.0015167623,0.004561242,0.0017079667,0.001428754,0.007251935],"category_scores_gemma":[0.0025992452,0.0005451449,0.0022548006,0.0017530025,0.005292433,0.012465346,0.0034685836,0.0044190474,0.0014825644],"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.0000021327785,0.0000029193411,0.000036226487,0.0000178449,0.0000016540669,0.000015851738,0.00007707657,0.0002813507,0.00013451792,0.9973309,0.00031955942,0.0017800252],"study_design_scores_gemma":[0.000009218187,0.000012901344,0.000077284516,0.000024412295,0.0000077021505,0.00009214439,0.00008110022,0.005389492,0.00073069875,0.9523918,0.04117148,0.000011649859],"about_ca_topic_score_codex":0.0025577692,"about_ca_topic_score_gemma":0.0027187064,"teacher_disagreement_score":0.007251935,"about_ca_system_score_codex":0.0030745335,"about_ca_system_score_gemma":0.0016813979,"threshold_uncertainty_score":0.024260163},"labels":[],"label_agreement":null},{"id":"W4251006659","doi":"10.1007/978-1-4614-6170-8_100876","title":"Logic Programming","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Programming language; Computer science","score_opus":0.02563945676541805,"score_gpt":0.23395079897682514,"score_spread":0.2083113422114071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251006659","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008630787,0.026775407,0.098287195,0.0049540913,0.0011952291,0.00007162612,0.0007536217,0.0010456657,0.8660541],"genre_scores_gemma":[0.056863688,0.036853883,0.091173336,0.0048151966,0.0022570286,0.0003030297,0.0028397148,0.0011782704,0.8037158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.00012131064,0.000028043205,0.00013257079,0.00028876675,0.000043650885],"domain_scores_gemma":[0.9996458,0.00016100776,0.000014494016,0.000070443406,0.00008392386,0.000024327439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204629,0.0010279685,0.00074610254,0.0012795653,0.0010810992,0.004667129,0.0014765186,0.0009475098,0.051657595],"category_scores_gemma":[0.0013259692,0.0005554926,0.00063288835,0.0019256794,0.0021344349,0.004557472,0.0015188956,0.0035669196,0.025006678],"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.00001323039,0.000028724453,0.00007172452,0.00022226777,0.000012401902,0.00003799345,0.00017421108,0.0004966462,0.0002766204,0.702266,0.15175949,0.14464071],"study_design_scores_gemma":[0.0000068361946,0.0000046466553,0.00007566997,0.00015094994,0.0000055680844,0.00010094857,0.000045699824,0.00065476564,0.000199937,0.45064366,0.5481047,0.0000066959133],"about_ca_topic_score_codex":0.0015945975,"about_ca_topic_score_gemma":0.0021160305,"teacher_disagreement_score":0.051657595,"about_ca_system_score_codex":0.0021294553,"about_ca_system_score_gemma":0.0012851548,"threshold_uncertainty_score":0.17281187},"labels":[],"label_agreement":null},{"id":"W4251299905","doi":"10.32920/ryerson.14662323.v1","title":"Deterministic planning in incompletely known domains with local effects","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Planner; Computer science; Fragment (logic); Semantics (computer science); Knowledge base; Order (exchange); Theoretical computer science; Propositional calculus; Artificial intelligence; Programming language","score_opus":0.018198869156082466,"score_gpt":0.25958853643703955,"score_spread":0.2413896672809571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251299905","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.0673697,0.0003760412,0.9264475,0.00040239104,0.00002011254,0.000090903435,0.00018266097,0.0012078601,0.0039028686],"genre_scores_gemma":[0.61314523,0.00074994756,0.3819321,0.00010517429,0.000039465336,0.00015258728,0.0005952134,0.00016831825,0.0031118335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980413,0.0006711694,0.00014761546,0.00043822607,0.00048975565,0.00021190521],"domain_scores_gemma":[0.9931518,0.005416369,0.0003970699,0.00061411684,0.00027337504,0.00014730204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029868365,0.00069213496,0.0010483488,0.0009259882,0.0010287381,0.0021868942,0.001683877,0.0011289223,0.002332905],"category_scores_gemma":[0.011283732,0.0008775665,0.0011602312,0.0012337592,0.0025221906,0.0043024225,0.0026993284,0.001902934,0.00028139589],"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.00029317904,0.000108557855,0.001240885,0.00024320965,0.000077910365,0.0007567278,0.00059225684,0.75397193,0.0041156965,0.1803572,0.0009990538,0.057243478],"study_design_scores_gemma":[0.00007210591,0.000059412745,0.00032388658,0.000032234966,0.00005593219,0.00010836102,0.00012192947,0.77923024,0.0045186393,0.21254456,0.0029103113,0.000022443193],"about_ca_topic_score_codex":0.01057203,"about_ca_topic_score_gemma":0.016036497,"teacher_disagreement_score":0.01057203,"about_ca_system_score_codex":0.0015950075,"about_ca_system_score_gemma":0.0023571844,"threshold_uncertainty_score":0.021020949},"labels":[],"label_agreement":null},{"id":"W4252520463","doi":"10.1109/ictai.2004.103","title":"Quartet based phylogeny reconstruction with answer set programming","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"University of Alberta","funders":"","keywords":"Ultrametric space; Set (abstract data type); Representation (politics); Computer science; Answer set programming; Consistency (knowledge bases); Genetic programming; Phylogenetics; Theoretical computer science; Artificial intelligence; Mathematics; Biology; Discrete mathematics; Programming language","score_opus":0.013398175928228338,"score_gpt":0.22516432880125514,"score_spread":0.2117661528730268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252520463","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.0105153015,0.00018251145,0.9854285,0.0007265452,0.00003406563,0.00010127415,0.00023946606,0.00066660694,0.0021058188],"genre_scores_gemma":[0.14709435,0.00028442414,0.84812814,0.00045491196,0.00012521137,0.0003340196,0.0012521335,0.00024819555,0.0020785648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704945,0.001162345,0.00021078404,0.00065882143,0.00068867725,0.00022991553],"domain_scores_gemma":[0.9902768,0.007767353,0.0005470337,0.0006251394,0.0005769744,0.00020662278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00408256,0.001149005,0.0014955172,0.0014846927,0.00088278676,0.0025548209,0.0030636336,0.001732773,0.0065662893],"category_scores_gemma":[0.016294144,0.0006540649,0.0023587483,0.0023925242,0.0019053447,0.0056181,0.0030603383,0.0042892625,0.00079503114],"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.0003267102,0.00041884658,0.0019995826,0.000734008,0.00014158545,0.0002760137,0.00060630264,0.44789645,0.0024548597,0.28565225,0.0093704695,0.25012287],"study_design_scores_gemma":[0.000046260873,0.000056488872,0.00011945597,0.000031871044,0.000023460421,0.00007422901,0.00009321989,0.6722464,0.0010480909,0.323779,0.0024649983,0.000016556192],"about_ca_topic_score_codex":0.001447484,"about_ca_topic_score_gemma":0.0021216725,"teacher_disagreement_score":0.0065662893,"about_ca_system_score_codex":0.0011897213,"about_ca_system_score_gemma":0.0014920081,"threshold_uncertainty_score":0.021966398},"labels":[],"label_agreement":null},{"id":"W4252778177","doi":"10.1007/978-3-319-53562-3_8","title":"Inference Claims","year":2017,"lang":"en","type":"book-chapter","venue":"Argumentation library","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Generalization; Argument (complex analysis); Counterfactual thinking; Inference; Epistemology; Philosophy; Mathematics; Calculus (dental); Medicine","score_opus":0.02620174096334784,"score_gpt":0.2593206104370299,"score_spread":0.23311886947368207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252778177","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020068686,0.0028625352,0.063361734,0.0052921567,0.00089864316,0.000087981956,0.00061471405,0.00042229364,0.924453],"genre_scores_gemma":[0.27035096,0.008967148,0.06302198,0.0035341934,0.0029085928,0.00047433111,0.0044013746,0.00093533937,0.64540607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609715,0.00093116943,0.0002694388,0.0009845889,0.0014598315,0.0002578399],"domain_scores_gemma":[0.996241,0.0019278349,0.00012719362,0.00086278934,0.0007140657,0.00012706085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032065744,0.001417184,0.0010536807,0.0041536335,0.003486256,0.010302931,0.0026614899,0.004355764,0.0884301],"category_scores_gemma":[0.012968836,0.0008619903,0.0017056591,0.0022365958,0.004564298,0.013867509,0.004740372,0.005723312,0.027221574],"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.000021426269,0.000023955421,0.00005210336,0.000093367955,0.000012340865,0.000051830342,0.00026136715,0.0002636797,0.00014225065,0.9459848,0.02136198,0.03173096],"study_design_scores_gemma":[0.000008673711,0.0000060987386,0.000073142546,0.00018016408,0.000016408248,0.00011383057,0.00012051039,0.0009914001,0.00045764013,0.8747367,0.12328526,0.000010052569],"about_ca_topic_score_codex":0.0012444011,"about_ca_topic_score_gemma":0.0012250043,"teacher_disagreement_score":0.0884301,"about_ca_system_score_codex":0.00312251,"about_ca_system_score_gemma":0.0018221239,"threshold_uncertainty_score":0.29582816},"labels":[],"label_agreement":null},{"id":"W4253247806","doi":"10.1007/978-1-4899-7993-3_1267-2","title":"Null Values","year":2016,"lang":"pt","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Null (SQL); Mathematics; Statistics; Computer science; Data mining","score_opus":0.02364609835611153,"score_gpt":0.24752161096136946,"score_spread":0.22387551260525793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253247806","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.009726911,0.0029640063,0.33153495,0.0024693012,0.0044809184,0.0006057529,0.01632922,0.013890055,0.61799896],"genre_scores_gemma":[0.15102145,0.0042211115,0.1839047,0.0025364957,0.001796274,0.0011187632,0.03468785,0.012776037,0.6079372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969854,0.00059499475,0.00028106952,0.0007789994,0.0010547474,0.00030478052],"domain_scores_gemma":[0.9959908,0.0009643976,0.00019867951,0.0014481692,0.0012203859,0.00017758246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022467,0.0020270147,0.001367738,0.002807251,0.002111382,0.008110872,0.0031192787,0.0015544011,0.12562394],"category_scores_gemma":[0.008975397,0.0010419546,0.0010609404,0.003315806,0.0021466273,0.012062117,0.0041659474,0.0025278558,0.07458327],"study_design_candidate":"not_applicable","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.0003384922,0.000061173625,0.0006355957,0.00050181773,0.00004256242,0.00021967622,0.0004729551,0.00042108644,0.0026634645,0.6834436,0.14054404,0.1706555],"study_design_scores_gemma":[0.00003164793,0.000031956497,0.00014372451,0.00018045568,0.000033986416,0.00034277304,0.0001394049,0.0008458525,0.005839767,0.27813515,0.71422917,0.000046100373],"about_ca_topic_score_codex":0.0008484627,"about_ca_topic_score_gemma":0.0009198985,"teacher_disagreement_score":0.12562394,"about_ca_system_score_codex":0.0012194158,"about_ca_system_score_gemma":0.0014383455,"threshold_uncertainty_score":0.42025393},"labels":[],"label_agreement":null},{"id":"W4253273005","doi":"10.1007/978-3-662-07003-1_1","title":"Introduction","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Natural number; Mathematics; Expressive power; Algebraically closed field; Real number; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Theoretical computer science","score_opus":0.013310040984498506,"score_gpt":0.20831491140556968,"score_spread":0.19500487042107117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253273005","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.00028289304,0.0036439362,0.0064697764,0.0031244946,0.0033045947,0.00011269236,0.0011712917,0.0008185259,0.98107177],"genre_scores_gemma":[0.0013845748,0.0022899536,0.0021942512,0.0012794529,0.0007748191,0.00006428053,0.0010057075,0.00022763232,0.9907793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994821,0.00005232086,0.000021310234,0.000119731994,0.00026834622,0.00005619282],"domain_scores_gemma":[0.999255,0.000117257805,0.000027252636,0.00012435726,0.00033897682,0.00013712031],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060028286,0.0007963735,0.0005811404,0.0016608783,0.0014378874,0.004866445,0.001869099,0.0018596674,0.53301054],"category_scores_gemma":[0.0020416647,0.0003793661,0.00058506266,0.001610766,0.0008490979,0.004257234,0.0020323405,0.002224026,0.41554058],"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.000021808391,0.000036962174,0.00007957863,0.00015681166,0.0000026721307,0.000043606404,0.0001794196,0.00011724708,0.00039835216,0.07894759,0.75729233,0.16272365],"study_design_scores_gemma":[0.000001496649,0.0000041895296,0.0000439145,0.000049841914,8.075533e-7,0.000035826764,0.000026951955,0.000020383457,0.000050609047,0.0056919954,0.99407166,0.000002279144],"about_ca_topic_score_codex":0.002162287,"about_ca_topic_score_gemma":0.0034126118,"teacher_disagreement_score":0.46698946,"about_ca_system_score_codex":0.0014117588,"about_ca_system_score_gemma":0.0015512886,"threshold_uncertainty_score":0.6661038},"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":"W4254406458","doi":"10.1007/978-1-4614-8265-9_1242","title":"Inconsistent Databases","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Database; Computer science","score_opus":0.03037075587799821,"score_gpt":0.24930711688819418,"score_spread":0.21893636101019598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254406458","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.0053084767,0.05538652,0.4877446,0.017151428,0.005870045,0.00033728467,0.002959305,0.0027024478,0.4225399],"genre_scores_gemma":[0.18025024,0.067127734,0.39903083,0.011261509,0.0059601823,0.0006172876,0.01306688,0.0021759244,0.32050943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967133,0.0005776804,0.0003578711,0.0006453298,0.0015685246,0.00013732843],"domain_scores_gemma":[0.99502426,0.0017552604,0.00022061178,0.0018413153,0.0010210992,0.00013750255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027514177,0.0008753417,0.0010361924,0.0027419105,0.0015494846,0.0076787514,0.0033984676,0.0018986894,0.032060605],"category_scores_gemma":[0.012333713,0.000982408,0.0009816521,0.0042614224,0.002276084,0.01116701,0.0041210456,0.003624727,0.010789004],"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.000055537777,0.000032005155,0.00025952538,0.00053708226,0.000038077407,0.00017240978,0.00032745456,0.000826622,0.00064134476,0.71232,0.10789822,0.17689176],"study_design_scores_gemma":[0.000015044619,0.000013751973,0.00012761366,0.00034151203,0.000029703722,0.00089707616,0.000121809426,0.0028714542,0.001183058,0.50313,0.49125007,0.00001894613],"about_ca_topic_score_codex":0.00065584946,"about_ca_topic_score_gemma":0.0006962353,"teacher_disagreement_score":0.032060605,"about_ca_system_score_codex":0.0012156467,"about_ca_system_score_gemma":0.0017573886,"threshold_uncertainty_score":0.10725337},"labels":[],"label_agreement":null},{"id":"W4254455338","doi":"10.1007/978-1-4939-7131-2_100615","title":"Logic Programming","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Programming language","score_opus":0.03229494320500396,"score_gpt":0.24690949262970582,"score_spread":0.21461454942470187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254455338","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.0009052333,0.026389647,0.09109314,0.005586078,0.0014262686,0.00006838878,0.0008308544,0.0010739691,0.87262636],"genre_scores_gemma":[0.056360167,0.034194577,0.08050747,0.0051021357,0.0026067982,0.0002914307,0.0030852265,0.001226893,0.81662524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939466,0.000115820054,0.000027135142,0.00013589494,0.00028242264,0.00004404229],"domain_scores_gemma":[0.99961936,0.00016982896,0.000015274261,0.00007743916,0.00009107132,0.000027087175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051363866,0.0010149064,0.0007247854,0.0012345392,0.0010819904,0.0049257325,0.0014027153,0.0009483949,0.055746797],"category_scores_gemma":[0.00144223,0.0005374785,0.0006487277,0.0019379533,0.0020085128,0.0046184636,0.0015152192,0.0036159018,0.028123647],"study_design_candidate":"not_applicable","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.000013774016,0.000029714218,0.0000715015,0.00023371197,0.000012259723,0.00003377968,0.00016783466,0.00047724752,0.0002724774,0.6990029,0.16540308,0.13428174],"study_design_scores_gemma":[0.0000068096087,0.0000045216348,0.000074895026,0.00014227942,0.0000059022414,0.00008934479,0.000043250653,0.0005936802,0.00018270817,0.44163132,0.557219,0.0000062290173],"about_ca_topic_score_codex":0.0014362192,"about_ca_topic_score_gemma":0.0018648437,"teacher_disagreement_score":0.055746797,"about_ca_system_score_codex":0.0021144073,"about_ca_system_score_gemma":0.0013079074,"threshold_uncertainty_score":0.18649161},"labels":[],"label_agreement":null},{"id":"W4254665787","doi":"10.22329/il.v31i4.3330","title":"Whither Consequence?","year":2011,"lang":"en","type":"article","venue":"Informal Logic","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":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Skepticism; Epistemology; Class (philosophy); Resistance (ecology); Philosophy; Inductive method; Law; Political science","score_opus":0.04963537470332596,"score_gpt":0.23128343132173526,"score_spread":0.1816480566184093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254665787","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.017556928,0.015866257,0.15914185,0.23833542,0.0050727907,0.00006533917,0.0002447378,0.00048665403,0.56323],"genre_scores_gemma":[0.8738586,0.0060336585,0.022303022,0.034302972,0.0047756755,0.00018147097,0.00017370962,0.00037849278,0.057992525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540895,0.0018320762,0.00018822699,0.0013713884,0.0007775541,0.00042178438],"domain_scores_gemma":[0.9927504,0.004772091,0.00034987638,0.00118099,0.00066654827,0.0002801849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007662955,0.0004908864,0.0007489049,0.00115703,0.0038553125,0.006028743,0.0010202806,0.0038512691,0.020828944],"category_scores_gemma":[0.014926466,0.00041718807,0.00080822525,0.0008703168,0.020722361,0.021461407,0.003297446,0.007576051,0.0031925878],"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.000015024887,0.0000035463383,0.0000617628,0.000023699879,0.000004403567,0.000030323332,0.00031259313,0.000037718168,0.000059804017,0.9926912,0.002834876,0.003924979],"study_design_scores_gemma":[0.000009333406,0.00000891874,0.000067224624,0.000027931212,0.000004748643,0.00006347395,0.00019568046,0.00011561597,0.00018521902,0.9647217,0.034595832,0.0000043619157],"about_ca_topic_score_codex":0.001077206,"about_ca_topic_score_gemma":0.0011824617,"teacher_disagreement_score":0.020828944,"about_ca_system_score_codex":0.0032841782,"about_ca_system_score_gemma":0.0013084841,"threshold_uncertainty_score":0.06967974},"labels":[],"label_agreement":null},{"id":"W4255379325","doi":"10.32920/ryerson.14660574","title":"Plan recognition in dynamic 2-D environments","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Formalism (music); Computer science; Interpreter; Overtaking; Plan (archaeology); Artificial intelligence; Automaton; Theoretical computer science; Programming language; Engineering","score_opus":0.02649416979560451,"score_gpt":0.2376719358855737,"score_spread":0.2111777660899692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255379325","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.054895513,0.00029973715,0.9366503,0.00024424298,0.0000391849,0.000061752755,0.00030599136,0.0020643712,0.0054390733],"genre_scores_gemma":[0.65110123,0.00056170754,0.34196287,0.00013554734,0.000028156579,0.00012616834,0.001016928,0.00022246197,0.004844903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.00009234155,0.000029534545,0.00016726507,0.00010912874,0.00007665787],"domain_scores_gemma":[0.9994025,0.0003205556,0.00008245246,0.00009517338,0.000059754035,0.000039535666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559006,0.00056459615,0.00048863504,0.0006447791,0.0006539925,0.0019544836,0.00073837896,0.0009318402,0.0030119524],"category_scores_gemma":[0.001877252,0.00037307275,0.000932059,0.0005582686,0.0013814304,0.002427557,0.0015716754,0.0007221121,0.0005942205],"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.0003129235,0.00009945679,0.0036466743,0.00028597796,0.00005827852,0.0010119474,0.001074179,0.62792283,0.020141497,0.1904966,0.0037589304,0.15119071],"study_design_scores_gemma":[0.00002288451,0.000046094065,0.0010285379,0.000031975655,0.000016220276,0.0001896685,0.00034606966,0.8817102,0.0072658826,0.10164909,0.0076665143,0.000026945007],"about_ca_topic_score_codex":0.0087748105,"about_ca_topic_score_gemma":0.0071128667,"teacher_disagreement_score":0.0087748105,"about_ca_system_score_codex":0.0009297547,"about_ca_system_score_gemma":0.0007654272,"threshold_uncertainty_score":0.017447472},"labels":[],"label_agreement":null},{"id":"W4255641397","doi":"10.1007/978-0-387-39940-9_1267","title":"Null Values","year":2009,"lang":"pt","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Null (SQL); Mathematics; Computer science; Data mining","score_opus":0.0235251919671503,"score_gpt":0.24954677090105945,"score_spread":0.22602157893390915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255641397","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.011348467,0.0026262589,0.347235,0.0023918515,0.0043226,0.0006625079,0.019343894,0.016958114,0.59511137],"genre_scores_gemma":[0.15751602,0.0035808885,0.18866985,0.002404119,0.0016142082,0.001159381,0.039575394,0.013792763,0.59168744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971511,0.00055895664,0.0002612255,0.00072964985,0.0009961843,0.00030295204],"domain_scores_gemma":[0.9959193,0.000982236,0.00019418907,0.0015059579,0.0012196724,0.00017864337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199161,0.0020355599,0.0013942736,0.0027817239,0.0020670088,0.007475559,0.0031225914,0.0015681747,0.12658371],"category_scores_gemma":[0.008634964,0.0010357794,0.0010525635,0.003180926,0.0019554817,0.011564231,0.004010952,0.0023412649,0.07344968],"study_design_candidate":"not_applicable","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.00042165557,0.00007857057,0.00085814565,0.00055401394,0.000051592007,0.0002604915,0.0005120221,0.00048865174,0.0032322516,0.6375304,0.16527435,0.19073783],"study_design_scores_gemma":[0.000038105834,0.000036491878,0.00018506919,0.00018344201,0.0000403197,0.00038282294,0.00015644488,0.001042159,0.007253398,0.26556778,0.7250609,0.000053070362],"about_ca_topic_score_codex":0.00084452605,"about_ca_topic_score_gemma":0.00096883305,"teacher_disagreement_score":0.12658371,"about_ca_system_score_codex":0.0011576772,"about_ca_system_score_gemma":0.0013308269,"threshold_uncertainty_score":0.42346472},"labels":[],"label_agreement":null},{"id":"W4283794194","doi":"10.1609/aaai.v36i5.20524","title":"Using Conditional Independence for Belief Revision","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Belief revision; Dependency (UML); Independence (probability theory); Conditional independence; Computer science; Domain (mathematical analysis); ENCODE; Operator (biology); Knowledge base; Belief structure; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.1380607233127197,"score_gpt":0.3326342931215088,"score_spread":0.19457356980878907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794194","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.006644134,0.00009315212,0.9879775,0.00049870036,0.00004293254,0.000087409906,0.00007017363,0.00024284906,0.0043431805],"genre_scores_gemma":[0.5714574,0.0002080767,0.42420954,0.0005091697,0.0002303778,0.00050027523,0.00019911275,0.000109956265,0.0025761789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98278886,0.008617284,0.0010613191,0.0019978639,0.004848071,0.0006865815],"domain_scores_gemma":[0.950882,0.033009645,0.003141027,0.0071396134,0.0049347053,0.0008929459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017110089,0.0010146309,0.0009548549,0.0024762743,0.0011954665,0.003270224,0.0022311637,0.0012004788,0.004094808],"category_scores_gemma":[0.054366853,0.0007656092,0.0025529624,0.0015474587,0.004890787,0.0056605954,0.004664078,0.004256666,0.00055700843],"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.000105574196,0.000073753006,0.00090238126,0.00021373852,0.00014641487,0.00017836463,0.0009362239,0.034422718,0.002284606,0.918591,0.0010298297,0.04111534],"study_design_scores_gemma":[0.000053331147,0.00011978998,0.00037309714,0.000073908646,0.000074683216,0.000118634554,0.000082752995,0.16871203,0.0022609693,0.8245909,0.0034647144,0.00007517635],"about_ca_topic_score_codex":0.0026412308,"about_ca_topic_score_gemma":0.0028637662,"teacher_disagreement_score":0.017110089,"about_ca_system_score_codex":0.0024814797,"about_ca_system_score_gemma":0.0022729177,"threshold_uncertainty_score":0.0904879},"labels":[],"label_agreement":null},{"id":"W4283802141","doi":"10.1609/aaai.v36i9.21219","title":"Planning to Avoid Side Effects","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Computer science; Side effect (computer science); Context (archaeology); Agency (philosophy); Risk analysis (engineering); Lead (geology); Relation (database); Management science; Business; Engineering; Epistemology; Data mining","score_opus":0.0592639208155509,"score_gpt":0.29161868043928074,"score_spread":0.23235475962372984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283802141","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.0937328,0.00037838725,0.8830438,0.0012527197,0.00009688594,0.00025147802,0.00010595059,0.0012148668,0.0199231],"genre_scores_gemma":[0.7211326,0.00033649808,0.27277416,0.00035604718,0.000041311945,0.00028330926,0.00019457619,0.0004936061,0.004387735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970085,0.001251507,0.00014745933,0.00029486537,0.0009016892,0.00039591422],"domain_scores_gemma":[0.9907032,0.0062936866,0.0006354791,0.0015118597,0.0006524115,0.00020333141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031645573,0.001237549,0.0006455268,0.0006154203,0.0008300106,0.001343069,0.0009688838,0.0008041866,0.005162064],"category_scores_gemma":[0.016269995,0.0006913313,0.0010424401,0.00047084864,0.0028848147,0.0022146695,0.0025551952,0.0020433909,0.0005674209],"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.0005221831,0.0002332037,0.00367934,0.00066647213,0.00020601833,0.00062308984,0.0011037576,0.53056276,0.013517193,0.29720986,0.0036461249,0.14803003],"study_design_scores_gemma":[0.000085987704,0.00026665052,0.00080508535,0.00013366262,0.00014026236,0.00025423872,0.00027339702,0.45422503,0.014700334,0.5206226,0.0084524155,0.000040414172],"about_ca_topic_score_codex":0.0018214345,"about_ca_topic_score_gemma":0.0029106752,"teacher_disagreement_score":0.005162064,"about_ca_system_score_codex":0.0009083192,"about_ca_system_score_gemma":0.0026740383,"threshold_uncertainty_score":0.017268836},"labels":[],"label_agreement":null},{"id":"W4283810932","doi":"10.1609/aaai.v36i5.20485","title":"From Actions to Programs as Abstract Actual Causes","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Toronto Metropolitan University; University of Regina; York University","funders":"","keywords":"Abstraction; Causality (physics); Causation; Computer science; Programming language; Action (physics); Situation calculus; Sequence (biology); Theoretical computer science; Epistemology","score_opus":0.12145030703466844,"score_gpt":0.3222884280208421,"score_spread":0.20083812098617368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283810932","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.016677273,0.00092524453,0.9582851,0.0019089847,0.0001209316,0.00011180782,0.0002009756,0.0005023161,0.021267507],"genre_scores_gemma":[0.5244575,0.0027579907,0.45821133,0.0013159728,0.00047382835,0.00064322515,0.00061530643,0.00046640224,0.011058392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956091,0.0020655384,0.00025668312,0.00064366456,0.0009823216,0.0004426391],"domain_scores_gemma":[0.9946203,0.003140105,0.00049958134,0.00097540807,0.00052992476,0.00023478005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133004,0.0008723526,0.0005078118,0.0026848414,0.0013119114,0.0047205416,0.0015117992,0.0015361463,0.004980435],"category_scores_gemma":[0.010749493,0.00092771504,0.002036453,0.0016870815,0.008843413,0.012247676,0.0054288306,0.004369813,0.0005069272],"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.000006144352,0.0000051705415,0.00016861879,0.000038009683,0.0000089331625,0.000077802266,0.0005542867,0.0030741272,0.00018077358,0.9924886,0.00027362822,0.0031238226],"study_design_scores_gemma":[0.000006769318,0.00000800408,0.00010971025,0.000028133445,0.000018317574,0.00003884882,0.00013169098,0.0075209565,0.00033488518,0.9835603,0.008234989,0.000007350619],"about_ca_topic_score_codex":0.003396033,"about_ca_topic_score_gemma":0.0031813039,"teacher_disagreement_score":0.004980435,"about_ca_system_score_codex":0.0021559934,"about_ca_system_score_gemma":0.0021554427,"threshold_uncertainty_score":0.021857679},"labels":[],"label_agreement":null},{"id":"W4285602009","doi":"10.24963/ijcai.2022/355","title":"The Limits of Morality in Strategic Games","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Outcome (game theory); Morality; Constraint (computer-aided design); Computer science; Strategic dominance; Sacrifice; Mathematical economics; Management science; Economics; Mathematics; Epistemology; Philosophy","score_opus":0.11874704221349053,"score_gpt":0.30395960290421015,"score_spread":0.18521256069071962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285602009","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.14700438,0.0033745402,0.69189197,0.012936564,0.0005342023,0.00020930139,0.00025240163,0.0004037442,0.1433929],"genre_scores_gemma":[0.9528214,0.0007090094,0.040870424,0.00063742936,0.00026786266,0.00022762887,0.00008778353,0.00007096795,0.0043075057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98398626,0.008723597,0.0011231158,0.001798692,0.0031046292,0.001263736],"domain_scores_gemma":[0.97176516,0.01980207,0.0021200425,0.0023201832,0.002268785,0.0017237641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011078882,0.0007929361,0.0010651579,0.0019318288,0.0031579982,0.0077399393,0.0020618741,0.0032806434,0.0039613256],"category_scores_gemma":[0.038102902,0.0011770177,0.0016147324,0.0010787509,0.018229248,0.021440923,0.0068783127,0.006861718,0.00046643242],"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.000022003387,0.000012915402,0.00020043495,0.00004300362,0.00001232984,0.00006525602,0.00047668378,0.002628276,0.00017942132,0.9932515,0.00029860964,0.0028095862],"study_design_scores_gemma":[0.000008170265,0.000009737571,0.00007067172,0.000022345328,0.000005897018,0.000027245882,0.000109539855,0.00453916,0.00009975715,0.99338406,0.0017151494,0.000008284133],"about_ca_topic_score_codex":0.0021204401,"about_ca_topic_score_gemma":0.0012797614,"teacher_disagreement_score":0.011078882,"about_ca_system_score_codex":0.003457154,"about_ca_system_score_gemma":0.0022774206,"threshold_uncertainty_score":0.058591425},"labels":[],"label_agreement":null},{"id":"W4285604285","doi":"10.24963/ijcai.2022/360","title":"Epistemic Logic of Likelihood and Belief","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Computer science; Sublanguage; Probabilistic argumentation; Semantics (computer science); Belief revision; Modal logic; Theoretical computer science; Event (particle physics); Artificial intelligence; Epistemic modal logic; Datalog; Epistemology; Multimodal logic; Description logic; Programming language; Modal","score_opus":0.05277767543155166,"score_gpt":0.26541783398633145,"score_spread":0.2126401585547798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285604285","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.009697639,0.0017604163,0.91082054,0.010482164,0.00033179906,0.00012398302,0.00059072935,0.0005571225,0.06563563],"genre_scores_gemma":[0.60125893,0.002007985,0.37026796,0.003454152,0.0015259375,0.0005538815,0.00074890803,0.00024865946,0.019933643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930467,0.0032073134,0.000585394,0.0010284258,0.00164276,0.0004893912],"domain_scores_gemma":[0.98955524,0.007278435,0.00062042614,0.00075517123,0.0013748042,0.00041607427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007859171,0.0011421085,0.0009813518,0.0024619985,0.0031019386,0.006163177,0.0021602067,0.0027895032,0.006358836],"category_scores_gemma":[0.015267191,0.0010326323,0.0027602897,0.0017682557,0.009293745,0.017134322,0.0056607807,0.0071934336,0.0012158701],"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.00001048996,0.0000069131174,0.000056187248,0.000038643197,0.000009050399,0.00007176227,0.0002769043,0.0009621512,0.00012172773,0.99529403,0.0006481221,0.0025039588],"study_design_scores_gemma":[0.000011158667,0.0000068811028,0.000033951277,0.00002653867,0.0000131171755,0.00007840804,0.00006376182,0.006561679,0.00018509115,0.98743826,0.005569653,0.000011564115],"about_ca_topic_score_codex":0.0035299873,"about_ca_topic_score_gemma":0.0025625266,"teacher_disagreement_score":0.007859171,"about_ca_system_score_codex":0.0037507745,"about_ca_system_score_gemma":0.0024050109,"threshold_uncertainty_score":0.04156375},"labels":[],"label_agreement":null},{"id":"W4288046400","doi":"10.24963/kr.2022/40","title":"Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing","year":2022,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Computer science; Projection (relational algebra); Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.03398709040379344,"score_gpt":0.2699377127467016,"score_spread":0.23595062234290815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288046400","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.044704877,0.0004218018,0.94868815,0.0007480538,0.000035860052,0.00007283672,0.0001522214,0.00039969946,0.0047764257],"genre_scores_gemma":[0.78507286,0.00054283737,0.21055037,0.00015391984,0.00009879686,0.00013515848,0.00028235582,0.00009538216,0.0030683114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921017,0.002937282,0.00044651402,0.0015488118,0.0021950668,0.0007706246],"domain_scores_gemma":[0.97981745,0.014352322,0.0016587555,0.0024227893,0.0010956519,0.0006530823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069713476,0.0011108817,0.0017121654,0.0017968204,0.0011153548,0.004056389,0.002540524,0.0017374702,0.0027619938],"category_scores_gemma":[0.029219666,0.0011982032,0.00252401,0.0015816349,0.006901272,0.012491635,0.005608911,0.00538991,0.0003482759],"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.00025755138,0.00006484094,0.0011882571,0.00017356359,0.000119760065,0.00089219504,0.0015142991,0.19206478,0.0021784196,0.7826909,0.0003906749,0.018464766],"study_design_scores_gemma":[0.000021603526,0.000059969007,0.00030234808,0.000022652483,0.000040572686,0.00009474834,0.000116225674,0.36183363,0.0013400184,0.63496006,0.001170376,0.000037790574],"about_ca_topic_score_codex":0.007262991,"about_ca_topic_score_gemma":0.0037762602,"teacher_disagreement_score":0.007262991,"about_ca_system_score_codex":0.002231235,"about_ca_system_score_gemma":0.0018609707,"threshold_uncertainty_score":0.036868453},"labels":[],"label_agreement":null},{"id":"W4293798160","doi":"10.3390/philosophies7050095","title":"Could a Computer Learn to Be an Appeals Court Judge? The Place of the Unspeakable and Unwriteable in All-Purpose Intelligent Systems","year":2022,"lang":"en","type":"article","venue":"Philosophies","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Doctrine; Set (abstract data type); Tacit knowledge; Construct (python library); Epistemology; Law; Cognition; Articulation (sociology); Human intelligence; Law and economics; Sociology; Psychology; Computer science; Artificial intelligence; Philosophy; Political science; Politics","score_opus":0.06561460324146876,"score_gpt":0.2761957655895828,"score_spread":0.21058116234811405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293798160","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09830879,0.004112107,0.21065027,0.21789837,0.0008037069,0.00014256782,0.00051092927,0.002867802,0.46470544],"genre_scores_gemma":[0.92356724,0.00152709,0.029909713,0.005532088,0.000250985,0.00008022758,0.00022123064,0.0002520637,0.03865941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982128,0.0007653368,0.00006726373,0.00041248178,0.0003160521,0.0002260783],"domain_scores_gemma":[0.99651814,0.0017582987,0.0002718376,0.0006567541,0.00030574837,0.00048918737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028209318,0.00035939502,0.0002806944,0.00058021117,0.0020643352,0.0052436,0.0015377093,0.0026606254,0.009904515],"category_scores_gemma":[0.013797317,0.00036557118,0.00038898856,0.0004528046,0.009982194,0.013833433,0.0028330106,0.0033792034,0.003900293],"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.00006722709,0.00005535596,0.0020119068,0.00009743295,0.000019407176,0.00027679035,0.0039841454,0.0031290576,0.00071976316,0.91673595,0.020119874,0.052783012],"study_design_scores_gemma":[0.000013790026,0.00002416922,0.0006921633,0.00007573311,0.00001118765,0.000107709006,0.0009959303,0.0059362003,0.0007730386,0.88463014,0.106709525,0.000030466284],"about_ca_topic_score_codex":0.0054895086,"about_ca_topic_score_gemma":0.003921909,"teacher_disagreement_score":0.009904515,"about_ca_system_score_codex":0.0019083767,"about_ca_system_score_gemma":0.0018305227,"threshold_uncertainty_score":0.033133864},"labels":[],"label_agreement":null},{"id":"W4296269331","doi":"10.3166/jancl.20.173-191","title":"Verifying one hundred prisoners and a lightbulb","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Criminology; Psychology; History; Political science","score_opus":0.011426729895202195,"score_gpt":0.2115961814008152,"score_spread":0.20016945150561302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296269331","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.2611851,0.00031622557,0.71619177,0.0074135168,0.00017301741,0.00056837907,0.00023359321,0.0012749908,0.012643402],"genre_scores_gemma":[0.84149504,0.0001533623,0.15191516,0.00068972015,0.000048773934,0.00034648346,0.0001906989,0.00021141261,0.0049494156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9804859,0.010120787,0.0015245854,0.0030639335,0.0033824774,0.0014222263],"domain_scores_gemma":[0.9358842,0.045231175,0.00410749,0.010428689,0.003093455,0.0012549486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01737122,0.0009477255,0.0015404637,0.00094732066,0.0031161355,0.00451626,0.0034512463,0.0049870163,0.004016618],"category_scores_gemma":[0.08191959,0.0011517269,0.0024075762,0.0009590344,0.011160889,0.013446466,0.010174801,0.0053806896,0.00056669285],"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.00053587864,0.00023138836,0.0033811745,0.0003132727,0.00022576476,0.0022872062,0.006459183,0.045511536,0.004381576,0.91307837,0.001731035,0.021863606],"study_design_scores_gemma":[0.0002594812,0.00026914224,0.00056590186,0.00015734111,0.00012809492,0.00065038167,0.0013758847,0.2056749,0.012529156,0.76649565,0.011778245,0.000115683186],"about_ca_topic_score_codex":0.004049833,"about_ca_topic_score_gemma":0.002238131,"teacher_disagreement_score":0.01737122,"about_ca_system_score_codex":0.0031376502,"about_ca_system_score_gemma":0.0050295233,"threshold_uncertainty_score":0.09186888},"labels":[],"label_agreement":null},{"id":"W4296740036","doi":"10.32920/ryerson.14637291.v2","title":"A Logic of Actions Revisited","year":2022,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Unification; Operator (biology); Predicate (mathematical logic); Predicate logic; Circumscription; Mathematics; Computer science; Projection (relational algebra); Theoretical computer science; Logical connective; Artificial intelligence; Algorithm; Discrete mathematics; Description logic; Programming language","score_opus":0.06135687093673067,"score_gpt":0.30899606670359614,"score_spread":0.24763919576686547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296740036","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.036569748,0.0030792223,0.8090883,0.015725194,0.00055093545,0.000118584074,0.00081240555,0.0013388644,0.13271672],"genre_scores_gemma":[0.75748456,0.0017344499,0.1979967,0.0039524096,0.0005210175,0.00024673046,0.0007612542,0.00032661203,0.036976304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973183,0.0009684863,0.00016962428,0.00064397784,0.00064117083,0.00025841687],"domain_scores_gemma":[0.99847287,0.00073552155,0.000116057054,0.00028796642,0.00027885704,0.00010875851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025484762,0.0006023128,0.0004945078,0.0011533783,0.0014831356,0.0042690937,0.0013388533,0.001550007,0.0058169477],"category_scores_gemma":[0.0031818512,0.00043811445,0.0015887469,0.0011821098,0.006558363,0.010004754,0.0030156763,0.0041662087,0.0009403922],"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.000009930226,0.0000034098516,0.000055510933,0.000014070475,0.0000032134512,0.00004978759,0.00017686334,0.0005197135,0.00022587254,0.99518484,0.00076981855,0.0029869238],"study_design_scores_gemma":[0.000012540352,0.000010452744,0.0000673042,0.000019746058,0.000011851969,0.000079898666,0.00013892485,0.0076652085,0.00059738307,0.9734418,0.017945617,0.0000092880555],"about_ca_topic_score_codex":0.0058935126,"about_ca_topic_score_gemma":0.0027937775,"teacher_disagreement_score":0.0058935126,"about_ca_system_score_codex":0.0033036058,"about_ca_system_score_gemma":0.0023437154,"threshold_uncertainty_score":0.023969412},"labels":[],"label_agreement":null},{"id":"W4297848459","doi":"","title":"Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear Logic","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Connection (principal bundle); Linear logic; Multiplicative function; Computer science; Intuitionistic logic; Proof theory; Mathematics; Algorithm; Theoretical computer science; Mathematical proof","score_opus":0.031241636974363114,"score_gpt":0.2737420564110819,"score_spread":0.2425004194367188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297848459","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.042019505,0.0004251783,0.93868643,0.0011530232,0.00011701517,0.00026648425,0.00046859265,0.0029635872,0.0139001645],"genre_scores_gemma":[0.5966313,0.00024925818,0.3918883,0.0004832604,0.00011548825,0.00026609696,0.0010866476,0.0005561304,0.008723482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995233,0.002197195,0.00025701523,0.0006298613,0.0012450874,0.00043782083],"domain_scores_gemma":[0.98459595,0.011173181,0.0004476199,0.0019150503,0.0013091811,0.0005589974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034960436,0.0009609657,0.0015441991,0.002143178,0.0018834242,0.0038548987,0.0040034275,0.002567526,0.017531589],"category_scores_gemma":[0.021209916,0.0011475234,0.0020760787,0.0021501838,0.0020711175,0.007491475,0.006591396,0.0037992462,0.002216204],"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.001521493,0.0005426693,0.0014103376,0.0012849026,0.00022735252,0.00028421273,0.0006702801,0.10210926,0.008196954,0.663804,0.0126770865,0.20727138],"study_design_scores_gemma":[0.00010822336,0.00007085599,0.0001707715,0.00005702524,0.00007421254,0.00006760655,0.000047166788,0.41324836,0.0023804326,0.580668,0.003072801,0.000034595607],"about_ca_topic_score_codex":0.0027361691,"about_ca_topic_score_gemma":0.0061764396,"teacher_disagreement_score":0.017531589,"about_ca_system_score_codex":0.0030223199,"about_ca_system_score_gemma":0.0033341788,"threshold_uncertainty_score":0.058649063},"labels":[],"label_agreement":null},{"id":"W4297986018","doi":"10.1145/1166109.1166114","title":"The strength of replacement in weak arithmetic","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Mathematics; Class (philosophy); Bounded function; Discrete mathematics; Complexity class; Quantifier (linguistics); Axiom; Integer (computer science); Polynomial; Combinatorics; Time complexity; Computer science","score_opus":0.015527304787196765,"score_gpt":0.25024992507927163,"score_spread":0.23472262029207486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297986018","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.23600431,0.001898103,0.623687,0.0058343094,0.0005299185,0.00018987349,0.00062272855,0.0016811828,0.12955254],"genre_scores_gemma":[0.91835326,0.00050843664,0.07029548,0.0009943462,0.0003355207,0.00016545733,0.00032902826,0.00018053298,0.008837947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99068135,0.002325629,0.0009056556,0.0021668244,0.0028784587,0.0010420951],"domain_scores_gemma":[0.98473537,0.008179987,0.0009004677,0.0037379435,0.0018057611,0.00064037717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071582696,0.0006845222,0.0010488473,0.0021845635,0.002833353,0.0055990824,0.0025188494,0.0019540119,0.0049626497],"category_scores_gemma":[0.014590043,0.0013365861,0.0023913702,0.0014806392,0.013201368,0.014477458,0.008820851,0.006022831,0.0010180547],"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.000057283138,0.000011119626,0.00067246327,0.00009055979,0.000021559947,0.00006220938,0.00034311,0.0008549806,0.0012271691,0.9904997,0.00059547607,0.005564373],"study_design_scores_gemma":[0.00004528096,0.00012470038,0.0006094588,0.000060565933,0.000070864684,0.00021831898,0.00025968064,0.009006488,0.004996988,0.97099364,0.013568844,0.00004521714],"about_ca_topic_score_codex":0.0021743805,"about_ca_topic_score_gemma":0.0015082698,"teacher_disagreement_score":0.0071582696,"about_ca_system_score_codex":0.0027375487,"about_ca_system_score_gemma":0.0018825255,"threshold_uncertainty_score":0.037856996},"labels":[],"label_agreement":null},{"id":"W4299377239","doi":"","title":"On the dependencies of logical rules","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Theoretical computer science; Programming language","score_opus":0.06834780453088404,"score_gpt":0.27345152069210266,"score_spread":0.2051037161612186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299377239","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.087061994,0.0003477512,0.8953044,0.0010485934,0.00007560602,0.00017182063,0.00040921077,0.0005150391,0.015065562],"genre_scores_gemma":[0.72875446,0.00042965353,0.26393306,0.00037786423,0.000113326416,0.00023828348,0.00081869925,0.00038986394,0.0049448106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99046504,0.0037410674,0.0006916066,0.0011954485,0.0032660821,0.00064072193],"domain_scores_gemma":[0.91523385,0.06664671,0.0035223237,0.006389602,0.0071651,0.0010424139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008137276,0.0005986947,0.0007855589,0.0023442404,0.0015631953,0.0023689035,0.001419001,0.0013401028,0.005319664],"category_scores_gemma":[0.05132682,0.0009878018,0.0010197739,0.0013275659,0.004092137,0.0066863745,0.0029708573,0.0025473891,0.0007876205],"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.00020717886,0.00007429056,0.0040462385,0.00023057302,0.000063330226,0.00042922684,0.0005890058,0.04681865,0.0046647573,0.90137637,0.0017097181,0.039790593],"study_design_scores_gemma":[0.00003755808,0.00003717922,0.000935476,0.00006361279,0.000043704546,0.00014917598,0.00007603832,0.10826603,0.00672443,0.87709594,0.0065473006,0.000023432878],"about_ca_topic_score_codex":0.0037854542,"about_ca_topic_score_gemma":0.0037381893,"teacher_disagreement_score":0.008137276,"about_ca_system_score_codex":0.002638396,"about_ca_system_score_gemma":0.0024716987,"threshold_uncertainty_score":0.043034494},"labels":[],"label_agreement":null},{"id":"W4299939910","doi":"","title":"An Implementation of Consistency-Based Multi-Agent Belief Change using ASP","year":2015,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Computer science; Consistency (knowledge bases); Programming language; Artificial intelligence","score_opus":0.19037266651377716,"score_gpt":0.37328697079980133,"score_spread":0.18291430428602418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299939910","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.002991491,0.000025634632,0.9863002,0.0002423198,0.00005064232,0.00013447224,0.0001168081,0.0068760836,0.003262373],"genre_scores_gemma":[0.11630736,0.00005910251,0.87826073,0.0002651614,0.000038964474,0.00035425965,0.00047721612,0.0009890633,0.003248178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972427,0.0008626584,0.00020341728,0.000417255,0.0010569139,0.00021701328],"domain_scores_gemma":[0.99611986,0.0019472123,0.0001924263,0.0008086291,0.0007522093,0.00017967212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054359124,0.0008221599,0.0007889099,0.0008864707,0.0011328663,0.0029508588,0.00443063,0.0015459514,0.012035004],"category_scores_gemma":[0.011117808,0.00081819046,0.0018610272,0.00063664396,0.0020315342,0.003749061,0.0042788303,0.003332175,0.0017133001],"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.00085765554,0.000732376,0.0028510757,0.0006526641,0.0002829907,0.0007945197,0.0018377205,0.14078848,0.013180682,0.5311552,0.022818139,0.28404835],"study_design_scores_gemma":[0.00019033547,0.00010039773,0.00024057722,0.00007969703,0.00007627368,0.00011701518,0.00014489808,0.7981083,0.018799478,0.15123942,0.030851938,0.000051720115],"about_ca_topic_score_codex":0.0044214395,"about_ca_topic_score_gemma":0.004339781,"teacher_disagreement_score":0.012035004,"about_ca_system_score_codex":0.001594026,"about_ca_system_score_gemma":0.00171886,"threshold_uncertainty_score":0.04026115},"labels":[],"label_agreement":null},{"id":"W4300632766","doi":"10.1007/978-1-4614-8265-9_5021","title":"Consistent Query Answering","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Information retrieval; Question answering; Computer science","score_opus":0.02056502640134401,"score_gpt":0.230701696018518,"score_spread":0.210136669617174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300632766","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.0033163915,0.013501725,0.838036,0.00613126,0.0010339833,0.00041522176,0.0038701359,0.0054606926,0.12823465],"genre_scores_gemma":[0.11394918,0.015341325,0.74565923,0.0047072684,0.0021729388,0.0006044982,0.026193677,0.0022364238,0.08913548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936767,0.0012647561,0.00056556624,0.0013879068,0.0028022134,0.0003027649],"domain_scores_gemma":[0.9962972,0.0015949814,0.0001145642,0.0012119788,0.00069790246,0.00008338229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490297,0.0013694781,0.0016532707,0.003048581,0.0013311158,0.006981274,0.0039301286,0.0020591542,0.036121003],"category_scores_gemma":[0.010497073,0.0011208731,0.0017651737,0.0050799386,0.0020496147,0.0090606995,0.004032987,0.0037690876,0.016723331],"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.00009989829,0.00011812863,0.00029175062,0.00080024754,0.00009703327,0.00011367429,0.0003208562,0.0023217513,0.0029389684,0.48948562,0.13676946,0.36664265],"study_design_scores_gemma":[0.00003748431,0.00003520872,0.00024396031,0.00022235644,0.000068543304,0.00042846636,0.00015234026,0.018449767,0.0034649228,0.72821826,0.2486449,0.000033757075],"about_ca_topic_score_codex":0.0018085488,"about_ca_topic_score_gemma":0.0018103222,"teacher_disagreement_score":0.036121003,"about_ca_system_score_codex":0.0016944774,"about_ca_system_score_gemma":0.0021979348,"threshold_uncertainty_score":0.120836794},"labels":[],"label_agreement":null},{"id":"W4300749200","doi":"","title":"Inferring Probability Comparisons","year":2016,"lang":"en","type":"preprint","venue":"eScholarship (California Digital Library)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Statistics; Mathematics","score_opus":0.03134599680967807,"score_gpt":0.2374679512078531,"score_spread":0.20612195439817504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300749200","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.07878475,0.00058648695,0.9048176,0.0016358872,0.00014047981,0.00017848058,0.0022622733,0.00078604027,0.010807935],"genre_scores_gemma":[0.59291923,0.00047093513,0.40119836,0.00047311166,0.00018739598,0.00026749857,0.0027340543,0.00021044376,0.001538937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874813,0.0038652988,0.0009182317,0.0042084414,0.002943993,0.0005827853],"domain_scores_gemma":[0.9452038,0.039928,0.003484224,0.0065122372,0.003941172,0.0009305185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010218661,0.0015776865,0.0015070897,0.006383713,0.0020593002,0.0056465142,0.0033665453,0.0023580976,0.005131073],"category_scores_gemma":[0.07464331,0.0014414424,0.003389395,0.0044446965,0.0035125965,0.021699464,0.005269421,0.0061735217,0.00084769254],"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.00048823393,0.000220059,0.02732786,0.0006531102,0.00048049982,0.0011412795,0.0024589568,0.04232906,0.004553137,0.8010688,0.0041349526,0.11514412],"study_design_scores_gemma":[0.000022446446,0.000047325288,0.0032321466,0.00012107558,0.00011179947,0.00026758213,0.00044085042,0.06336095,0.003150909,0.92191017,0.007269137,0.00006565786],"about_ca_topic_score_codex":0.004294251,"about_ca_topic_score_gemma":0.0047596744,"teacher_disagreement_score":0.010218661,"about_ca_system_score_codex":0.0034756532,"about_ca_system_score_gemma":0.0025838236,"threshold_uncertainty_score":0.0540421},"labels":[],"label_agreement":null},{"id":"W4301148590","doi":"","title":"An Epistemic Resource Logic based on Boolean BI","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Prevention of Organ Failure","funders":"","keywords":"Epistemic modal logic; Computer science; Resource (disambiguation); Epistemology; Theoretical computer science; Philosophy; Description logic; Multimodal logic","score_opus":0.018109418072881522,"score_gpt":0.24029399013777905,"score_spread":0.22218457206489753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301148590","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.010611598,0.0006400788,0.9282586,0.0024658332,0.00034019756,0.0001908277,0.0007663605,0.0010526363,0.0556738],"genre_scores_gemma":[0.45589656,0.0011240583,0.50257367,0.0015140543,0.0005872308,0.0005358929,0.0016815815,0.00050823326,0.035578698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954535,0.0015878411,0.00050214084,0.00086035056,0.0011710657,0.00042504177],"domain_scores_gemma":[0.9958717,0.0020061156,0.00021810348,0.00063646876,0.00083185453,0.00043572945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004773856,0.0012378384,0.0014695346,0.0040672435,0.0030271814,0.008553206,0.0028676575,0.0019365196,0.014597598],"category_scores_gemma":[0.009464916,0.0010467223,0.0022970398,0.004274834,0.0043444852,0.013336249,0.0059775333,0.0049255313,0.0032259892],"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.00003826467,0.000017666232,0.000054152424,0.000050822033,0.000010508474,0.00006332811,0.0000988354,0.0013485154,0.00043471527,0.9911907,0.001086325,0.0056061847],"study_design_scores_gemma":[0.000025575357,0.000015775013,0.000047672227,0.000039345516,0.000038156588,0.00008528843,0.0000634995,0.027502008,0.0010703357,0.9593281,0.011750726,0.00003339698],"about_ca_topic_score_codex":0.005746911,"about_ca_topic_score_gemma":0.004858697,"teacher_disagreement_score":0.014597598,"about_ca_system_score_codex":0.00407087,"about_ca_system_score_gemma":0.002700728,"threshold_uncertainty_score":0.048833847},"labels":[],"label_agreement":null},{"id":"W4301240121","doi":"","title":"Logical Modeling and Analysis of Regulatory Genetic Networks in a Non Monotonic Framework","year":2015,"lang":"en","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"McMaster University","funders":"","keywords":"Monotonic function; Computer science; Logical analysis; Computational biology; Biology; Mathematics; Statistics","score_opus":0.01959390587774903,"score_gpt":0.2262107547050795,"score_spread":0.20661684882733047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301240121","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.004640433,0.00037767686,0.98865193,0.00044020146,0.000031063773,0.000036869304,0.000093836316,0.00015310537,0.005574813],"genre_scores_gemma":[0.23448354,0.0017477581,0.7502159,0.00037866947,0.0002299273,0.00039861273,0.00045417456,0.00024308101,0.011848344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858224,0.0007423815,0.00008328138,0.00019635129,0.00030203612,0.00009371385],"domain_scores_gemma":[0.9976387,0.0016844232,0.00017791224,0.00023459815,0.00018743437,0.00007692129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028960167,0.0009834695,0.00069462776,0.0011825693,0.00088284945,0.003140351,0.0032291538,0.00086417457,0.0040211393],"category_scores_gemma":[0.0044979313,0.00074140343,0.0026011618,0.001305774,0.0031042444,0.004675339,0.0014538558,0.002651904,0.000656031],"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.000023582475,0.000028459624,0.0001232095,0.000095682706,0.000029457973,0.00013497724,0.00016106034,0.061942525,0.0011447303,0.923812,0.000687409,0.011816866],"study_design_scores_gemma":[0.00000817129,0.000011793226,0.00004833816,0.000027108505,0.0000260732,0.000039888666,0.000038391,0.18485521,0.0007652421,0.81016463,0.0040058997,0.000009338992],"about_ca_topic_score_codex":0.0034585192,"about_ca_topic_score_gemma":0.0047838483,"teacher_disagreement_score":0.0040211393,"about_ca_system_score_codex":0.0021505377,"about_ca_system_score_gemma":0.0016814036,"threshold_uncertainty_score":0.015603304},"labels":[],"label_agreement":null},{"id":"W4306820122","doi":"","title":"A Substructural Epistemic Resource Logic","year":2017,"lang":"en","type":"preprint","venue":"INRIA a CCSD electronic archive server","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":"Prevention of Organ Failure","funders":"","keywords":"Epistemic modal logic; Computer science; Resource (disambiguation); Epistemology; Artificial intelligence; Multimodal logic; Description logic; Philosophy","score_opus":0.018079140831251943,"score_gpt":0.258601433281986,"score_spread":0.24052229245073403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306820122","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.01101529,0.0007220935,0.92575526,0.0019454125,0.00019088728,0.00010665481,0.0005727916,0.0013261456,0.05836553],"genre_scores_gemma":[0.4354368,0.0011415582,0.52194095,0.0016065675,0.0002963289,0.00041649496,0.0010970398,0.000347633,0.037716627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770576,0.00066345284,0.00017688944,0.00052191893,0.0006965516,0.00023548862],"domain_scores_gemma":[0.9984464,0.000575407,0.00013428838,0.00026850312,0.0003856307,0.00018980782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028511512,0.00079434423,0.0006872725,0.0020476154,0.0015856563,0.0040545017,0.0022863334,0.0015844775,0.009277611],"category_scores_gemma":[0.0030150684,0.00058053393,0.0011704604,0.0021161565,0.0036098713,0.007435566,0.0033388457,0.0031183313,0.0026214847],"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.000021375889,0.000010921276,0.000042404296,0.00004949987,0.000006388442,0.00006009527,0.00014065299,0.0014114432,0.0012085218,0.98788923,0.0011298758,0.008029535],"study_design_scores_gemma":[0.000027450547,0.000022646995,0.000070424416,0.00004700588,0.00003204413,0.00012101197,0.000079027006,0.023631396,0.0030160868,0.93302554,0.0398992,0.000028042221],"about_ca_topic_score_codex":0.004585453,"about_ca_topic_score_gemma":0.0029244742,"teacher_disagreement_score":0.009277611,"about_ca_system_score_codex":0.003037702,"about_ca_system_score_gemma":0.0019581162,"threshold_uncertainty_score":0.031036675},"labels":[],"label_agreement":null},{"id":"W4306846252","doi":"10.1007/s10849-022-09375-w","title":"Deontic Paradoxes in Mīmāṃsā Logics: There and Back Again","year":2022,"lang":"en","type":"article","venue":"Journal of Logic Language and Information","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":"University of Toronto","funders":"Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Deontic logic; Philosophy; Epistemology; Vedas; Sanskrit; Focus (optics); Normative; Modal; Field (mathematics); Treasure; Linguistics; Computer science; Calculus (dental); Sociology; Mathematics; Pure mathematics; Theology; Hinduism; Physics","score_opus":0.008473791995972353,"score_gpt":0.2212787288254178,"score_spread":0.21280493682944546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306846252","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.40824005,0.017055629,0.24934596,0.048733134,0.0010113547,0.000094836476,0.0001492508,0.0004603375,0.27490947],"genre_scores_gemma":[0.9806836,0.0009798389,0.013619936,0.001040562,0.000116811534,0.00004513633,0.000015660331,0.000030891963,0.0034674339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996572,0.0020536385,0.00020829155,0.0003594952,0.00062724703,0.00017927964],"domain_scores_gemma":[0.9929745,0.0048020356,0.0006642288,0.00076419464,0.00055445335,0.00024057922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005721394,0.00039935985,0.00067537697,0.0018645269,0.005002441,0.008411594,0.0011590404,0.0022410515,0.002920788],"category_scores_gemma":[0.009661056,0.00044979152,0.0007121955,0.001402493,0.016545137,0.0135954,0.005160815,0.0044354727,0.0002737958],"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.000009598471,0.0000051497286,0.00010198063,0.000015669259,0.0000037944785,0.000041527066,0.00076945743,0.0001815006,0.000082973034,0.996828,0.0001896656,0.0017707843],"study_design_scores_gemma":[0.00001035045,0.000010222657,0.00016929889,0.000039108185,0.000005926681,0.00009043855,0.00096796086,0.0025487056,0.00027979643,0.99059063,0.005274943,0.000012526267],"about_ca_topic_score_codex":0.0018593248,"about_ca_topic_score_gemma":0.0026582289,"teacher_disagreement_score":0.008411594,"about_ca_system_score_codex":0.0044947383,"about_ca_system_score_gemma":0.001936703,"threshold_uncertainty_score":0.032611787},"labels":[],"label_agreement":null},{"id":"W4312826258","doi":"10.1609/socs.v2i1.18189","title":"State-Set Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abstraction; Set (abstract data type); State (computer science); State space; Computer science; Domain (mathematical analysis); Theoretical computer science; Space (punctuation); Abstraction model checking; Algorithm; Mathematics; Model checking; Programming language","score_opus":0.02110703944093761,"score_gpt":0.27012043411119724,"score_spread":0.24901339467025962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312826258","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.02557705,0.0004960725,0.953606,0.0003885448,0.0000801608,0.00022397892,0.00039306073,0.0017990597,0.017436018],"genre_scores_gemma":[0.5135889,0.00040095477,0.47752273,0.00028868837,0.000038771857,0.000332201,0.0011959847,0.0004366608,0.0061950847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696916,0.00086013996,0.000242578,0.00074938545,0.0008857316,0.0002930495],"domain_scores_gemma":[0.99396825,0.003376629,0.0003155572,0.0015363602,0.00060479634,0.00019846411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458746,0.0007908254,0.001191785,0.0014126773,0.0012416035,0.0033435216,0.0023310005,0.0014751443,0.012708282],"category_scores_gemma":[0.012801302,0.0005236664,0.0014013369,0.0015551687,0.0024535812,0.0062358966,0.0049239704,0.0018541146,0.0018358782],"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.0003536551,0.00017364977,0.0026055402,0.00043803133,0.00015128693,0.00012270028,0.0005793671,0.15606156,0.0053816303,0.6098693,0.0060553886,0.21820787],"study_design_scores_gemma":[0.00005138257,0.00016874276,0.0005361445,0.000085910215,0.00007101771,0.00012259929,0.0001949486,0.4871783,0.008485792,0.48429674,0.018755846,0.000052627616],"about_ca_topic_score_codex":0.0026829154,"about_ca_topic_score_gemma":0.0025071858,"teacher_disagreement_score":0.012708282,"about_ca_system_score_codex":0.0019099404,"about_ca_system_score_gemma":0.002563053,"threshold_uncertainty_score":0.04251343},"labels":[],"label_agreement":null},{"id":"W4313360133","doi":"10.1007/978-3-031-21112-6_3","title":"Preliminary Concepts","year":2023,"lang":"en","type":"book-chapter","venue":"Computer science foundations and applied logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Computer science; Mathematical practice; Mathematics; Calculus (dental); Epistemology; Cognitive science; Mathematics education; Psychology; Philosophy","score_opus":0.03956036983622263,"score_gpt":0.2783497972655325,"score_spread":0.23878942742930986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313360133","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.0029598481,0.006242757,0.09740223,0.007754484,0.00381954,0.00018169009,0.0025833999,0.00084704114,0.87820905],"genre_scores_gemma":[0.11151868,0.010731973,0.08553576,0.0072626756,0.0062706294,0.00090406963,0.009024992,0.0014086855,0.7673425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887043,0.00020581139,0.0000688374,0.00041466687,0.0003125659,0.00012765951],"domain_scores_gemma":[0.99847597,0.0003944733,0.00007163207,0.00035281418,0.00055605435,0.00014899338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013068302,0.0012756432,0.00094970834,0.0022221135,0.0029939718,0.005638058,0.001921472,0.0015722383,0.16178277],"category_scores_gemma":[0.004776897,0.00057360623,0.001301938,0.0021012092,0.0031311288,0.008052396,0.0028945587,0.0051439116,0.071174316],"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.000023039976,0.000024672503,0.000074898686,0.00012686015,0.0000076250635,0.000039451257,0.00021850177,0.00010535627,0.0003232064,0.9112559,0.062440965,0.025359524],"study_design_scores_gemma":[0.000009977803,0.000014392858,0.00014186383,0.00005593942,0.000009671225,0.00013280564,0.00009858366,0.00023354554,0.00027588996,0.59495056,0.40406775,0.000008992728],"about_ca_topic_score_codex":0.0016920965,"about_ca_topic_score_gemma":0.0015364095,"teacher_disagreement_score":0.16178277,"about_ca_system_score_codex":0.0018644114,"about_ca_system_score_gemma":0.0016083936,"threshold_uncertainty_score":0.5412173},"labels":[],"label_agreement":null},{"id":"W4318252247","doi":"","title":"Relational semantics and finite models of separation logics","year":2007,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Semantics (computer science); Computer science; Programming language; Operational semantics; Natural language processing; Theoretical computer science","score_opus":0.0497715963396936,"score_gpt":0.26000316574201576,"score_spread":0.21023156940232215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318252247","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.025733069,0.0047147516,0.92903334,0.0060192826,0.00030737594,0.000088488814,0.00068179955,0.0007331417,0.032688733],"genre_scores_gemma":[0.6791335,0.0032967818,0.29857036,0.0015633443,0.0008142744,0.00040464342,0.0013652119,0.00030455808,0.014547291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99412644,0.0023099065,0.0005268133,0.0009368134,0.001616353,0.00048368983],"domain_scores_gemma":[0.9931914,0.0044176155,0.00051586976,0.001005928,0.0005793396,0.00028982467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005395222,0.0012120047,0.0016004331,0.0023925616,0.0025817365,0.008987072,0.0036102352,0.0029238795,0.006555144],"category_scores_gemma":[0.009591951,0.0013654727,0.0032229254,0.0026098858,0.007533745,0.018619202,0.0042661233,0.0069095357,0.0011490071],"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.000017298344,0.000010844329,0.000022313232,0.000026755994,0.000008019804,0.000016893713,0.00011698692,0.00117666,0.00012108325,0.9960419,0.00030482857,0.0021364924],"study_design_scores_gemma":[0.000010996031,0.0000035878754,0.000009735144,0.000009391789,0.0000065717745,0.000012107926,0.00002407487,0.0031177788,0.00012681044,0.9953277,0.0013456139,0.000005619711],"about_ca_topic_score_codex":0.0041981894,"about_ca_topic_score_gemma":0.0030091014,"teacher_disagreement_score":0.008987072,"about_ca_system_score_codex":0.0047916886,"about_ca_system_score_gemma":0.0024276057,"threshold_uncertainty_score":0.034766316},"labels":[],"label_agreement":null},{"id":"W4318567983","doi":"10.1142/s270507852250014x","title":"Consciousness as a Trigger to Adaptation","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence and Consciousness","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 Toronto","funders":"","keywords":"Consciousness; Artificial consciousness; Cognitive science; Cognitive architecture; Cognition; Adaptation (eye); Extension (predicate logic); Architecture; State (computer science); Psychology; Epistemology; LIDA; Computer science; Philosophy","score_opus":0.05200417361782013,"score_gpt":0.3047946431416103,"score_spread":0.2527904695237902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318567983","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.2850668,0.00264081,0.21613546,0.020752944,0.0012673127,0.00025990116,0.00026591055,0.0021039199,0.47150686],"genre_scores_gemma":[0.9817888,0.00037977134,0.010224445,0.0010346733,0.00010338531,0.00008358739,0.000065091845,0.00013213149,0.006188191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986216,0.00042485853,0.00005882395,0.00032824668,0.0002618241,0.00030474347],"domain_scores_gemma":[0.9981388,0.000785578,0.000146215,0.000400669,0.00026739814,0.00026138028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433084,0.00028142167,0.00039360393,0.00056597276,0.0012005686,0.003249438,0.0008688585,0.0020825684,0.008054971],"category_scores_gemma":[0.005704344,0.0003017454,0.0006486934,0.00039359863,0.004372854,0.003928055,0.0036022437,0.0023928508,0.0010893682],"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.00012654199,0.00007116269,0.002713564,0.00018998538,0.000052380987,0.0011160716,0.0043846294,0.0027120607,0.014957468,0.93615156,0.0035905163,0.03393399],"study_design_scores_gemma":[0.000043959033,0.000097380915,0.005742429,0.00012486237,0.000045037945,0.0005501269,0.0017482637,0.0082943635,0.0060559767,0.93743795,0.039799143,0.000060572936],"about_ca_topic_score_codex":0.0008391292,"about_ca_topic_score_gemma":0.00040778122,"teacher_disagreement_score":0.008054971,"about_ca_system_score_codex":0.001386839,"about_ca_system_score_gemma":0.001352398,"threshold_uncertainty_score":0.026946545},"labels":[],"label_agreement":null},{"id":"W4319166055","doi":"10.48550/arxiv.2302.01224","title":"Propositional Logics for the Lawvere Quantale","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"School of Informatics, University of Edinburgh; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Propositional calculus; Discrete mathematics; Completeness (order theory); Propositional variable; Decidability; Pure mathematics; Algebra over a field; Intermediate logic","score_opus":0.16740411433673602,"score_gpt":0.21441656237885523,"score_spread":0.04701244804211921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319166055","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.061494853,0.002445646,0.83353484,0.0060454085,0.00034330573,0.00015950011,0.00041265023,0.00066134514,0.09490248],"genre_scores_gemma":[0.82492673,0.0009574528,0.16132933,0.0011946517,0.00034958814,0.00019873423,0.00030681735,0.00009920553,0.010637477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769944,0.0008978412,0.00014819205,0.00027663828,0.00075470516,0.00022310276],"domain_scores_gemma":[0.9982811,0.0010450782,0.00010533425,0.00022805377,0.0002443761,0.00009595779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196075,0.00048514307,0.0004654282,0.0013488593,0.0012931407,0.003517637,0.0009930175,0.0011372676,0.00288312],"category_scores_gemma":[0.00490724,0.00042904995,0.0016921293,0.0009538866,0.00520627,0.0069349236,0.0033799792,0.0035241835,0.00038812956],"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.0000030119463,0.0000036265928,0.000027376098,0.000010791864,0.000003416842,0.000021534417,0.000110963105,0.00067309977,0.0001983568,0.99696916,0.00020770673,0.0017709042],"study_design_scores_gemma":[0.000005820538,0.000006006762,0.00006560357,0.000011350429,0.0000044882377,0.00002807105,0.000034284778,0.004386081,0.0003095979,0.9896554,0.0054850704,0.000008267369],"about_ca_topic_score_codex":0.0022153154,"about_ca_topic_score_gemma":0.0016921728,"teacher_disagreement_score":0.0037397435,"about_ca_system_score_codex":0.0037397435,"about_ca_system_score_gemma":0.0011831338,"threshold_uncertainty_score":0.027133882},"labels":[],"label_agreement":null},{"id":"W4322709492","doi":"10.1007/978-3-031-21003-7","title":"Toward Robots That Reason: Logic, Probability &amp; Causal Laws","year":2023,"lang":"en","type":"book","venue":"Synthesis lectures on artificial intelligence and machine learning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; Deutscher Akademischer Austauschdienst; UK Research and Innovation","keywords":"Robot; Computer science; Mathematical economics; Cognitive science; Artificial intelligence; Epistemology; Mathematics; Psychology; Philosophy","score_opus":0.13120131618882522,"score_gpt":0.2986068013379378,"score_spread":0.1674054851491126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322709492","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.009005495,0.027209008,0.6410156,0.041567393,0.001570494,0.00005076511,0.00043491097,0.0007092881,0.27843714],"genre_scores_gemma":[0.5561804,0.023466393,0.29809487,0.0047696372,0.002317671,0.00024833463,0.00053451717,0.00053985533,0.11384824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955827,0.00015586255,0.000018221159,0.00010354245,0.00013630599,0.000027719638],"domain_scores_gemma":[0.99909055,0.0005906273,0.00007479403,0.00010581581,0.0000948298,0.000043371634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010416121,0.0005385356,0.0004252039,0.00070038764,0.00091900927,0.0042048227,0.0008233849,0.0014797576,0.0071560843],"category_scores_gemma":[0.0031074716,0.00056430616,0.0006387189,0.00075999746,0.007922182,0.0075576706,0.0010927083,0.0030200533,0.002023085],"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.0000062995127,0.0000049406553,0.00004418344,0.000031215837,0.00000548851,0.000012010368,0.00012288042,0.0021851542,0.00013131423,0.98046964,0.00719463,0.009792192],"study_design_scores_gemma":[0.0000026416885,0.0000018137576,0.00003138015,0.00001383457,0.000002074557,0.000012537959,0.000026025878,0.002383487,0.00008436277,0.98044056,0.016997747,0.0000036089457],"about_ca_topic_score_codex":0.001702883,"about_ca_topic_score_gemma":0.0014576099,"teacher_disagreement_score":0.0071560843,"about_ca_system_score_codex":0.0012967526,"about_ca_system_score_gemma":0.00086245616,"threshold_uncertainty_score":0.02393943},"labels":[],"label_agreement":null},{"id":"W4323244234","doi":"10.5220/0011704500003393","title":"Ethical Considerations for the Deployment of Logic-Based Models of Reasoning","year":2023,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Software deployment; Computer science; Software engineering","score_opus":0.09446702988568494,"score_gpt":0.3144047915425866,"score_spread":0.21993776165690165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323244234","genre_codex":"commentary","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.015630452,0.0011539571,0.38266116,0.4507936,0.0026216907,0.0005286844,0.00016183668,0.0006752903,0.14577335],"genre_scores_gemma":[0.6983535,0.00091512,0.19731578,0.07569885,0.0026381332,0.001781366,0.00019884543,0.00066753966,0.022430792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.79095185,0.15460695,0.0056673917,0.0062831035,0.0365732,0.005917467],"domain_scores_gemma":[0.5164721,0.31403401,0.014026718,0.0991414,0.047680315,0.008645501],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.1932402,0.00090000447,0.0012549638,0.0022179699,0.0061375247,0.020598587,0.006243377,0.020850837,0.009607782],"category_scores_gemma":[0.3874408,0.0016682509,0.0016222032,0.0017663722,0.034128055,0.027106734,0.013571576,0.02496196,0.0026487755],"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.000081209844,0.00005093608,0.00047015067,0.000053101547,0.000026456431,0.00010821563,0.0019580852,0.0015900837,0.00024023005,0.97810113,0.009001404,0.008319069],"study_design_scores_gemma":[0.00009663364,0.00004282366,0.00025457947,0.0003071664,0.000033059954,0.00024171859,0.0011278305,0.008995263,0.0006326031,0.9323395,0.055886455,0.00004242878],"about_ca_topic_score_codex":0.0051946067,"about_ca_topic_score_gemma":0.004450925,"teacher_disagreement_score":0.1932402,"about_ca_system_score_codex":0.0076133916,"about_ca_system_score_gemma":0.015422692,"threshold_uncertainty_score":0.9948785},"labels":[],"label_agreement":null},{"id":"W4323244368","doi":"10.5220/0011614800003393","title":"A System for Updating Trust and Performing Belief Revision","year":2023,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Belief revision; Artificial intelligence","score_opus":0.02123994644175,"score_gpt":0.2586237790416688,"score_spread":0.23738383259991877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323244368","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.005900912,0.000107160544,0.97775364,0.00036227115,0.00015960161,0.00016587302,0.00023014304,0.01368495,0.0016354242],"genre_scores_gemma":[0.19153793,0.00012032641,0.8010257,0.00030477802,0.00015223715,0.00026415463,0.0006135883,0.00085225346,0.005129013],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994869,0.0015881207,0.0006380628,0.0011120596,0.0015184904,0.00027425104],"domain_scores_gemma":[0.9812665,0.008126505,0.0010059015,0.004963835,0.0038247644,0.0008125156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008716553,0.0011413612,0.0015249737,0.0021793458,0.0018482009,0.0050290246,0.0034987004,0.0026826793,0.009005917],"category_scores_gemma":[0.03372966,0.0012066443,0.0014902416,0.0014227512,0.0014155929,0.0065312437,0.0049765236,0.0032979052,0.0040429267],"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.0020970684,0.00058288267,0.0047398354,0.0005536952,0.00069411495,0.0006181353,0.0018780384,0.03890883,0.0140550835,0.06265104,0.031862047,0.84135914],"study_design_scores_gemma":[0.00038109024,0.0002038952,0.0011075969,0.00010431661,0.0004997284,0.00048575058,0.00020869263,0.84652543,0.022657298,0.10298718,0.024651367,0.00018769989],"about_ca_topic_score_codex":0.007073411,"about_ca_topic_score_gemma":0.010095855,"teacher_disagreement_score":0.009005917,"about_ca_system_score_codex":0.0013892031,"about_ca_system_score_gemma":0.0034364199,"threshold_uncertainty_score":0.046098113},"labels":[],"label_agreement":null},{"id":"W4323527457","doi":"10.1007/978-3-031-28083-2_3","title":"A General Method for Representing Sets of Relations by Vectors","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Algebraic number; Relation (database); Representation (politics); Algebra over a field; Mathematics; Core (optical fiber); Computer science; Discrete mathematics; Pure mathematics; Mathematical analysis; Data mining","score_opus":0.02948213755386343,"score_gpt":0.3004086659942145,"score_spread":0.2709265284403511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323527457","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.00026185942,0.00019223859,0.9952951,0.000095187235,0.00015032991,0.00006714673,0.0003645479,0.0009547057,0.002618809],"genre_scores_gemma":[0.008562575,0.0005274158,0.97782284,0.00016235358,0.00013536292,0.0003264663,0.001052428,0.00063592463,0.010774535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974038,0.00047963712,0.00039965755,0.00074284704,0.0008132357,0.00016078215],"domain_scores_gemma":[0.9986449,0.00041765027,0.00006919468,0.0005180038,0.00029236893,0.000057878646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021749425,0.0018842825,0.0014455251,0.0037950506,0.0015868624,0.0067334766,0.004246575,0.0014539666,0.020512426],"category_scores_gemma":[0.0042146835,0.0013302136,0.0036204779,0.0068051172,0.0022408853,0.0112930825,0.0035100302,0.0043592085,0.009531439],"study_design_candidate":"not_applicable","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.000067632405,0.000037605463,0.00014161733,0.0003200074,0.000057270438,0.00008947277,0.00040767726,0.0022644426,0.0033400727,0.7721206,0.015465209,0.20568836],"study_design_scores_gemma":[0.00004295072,0.00005045353,0.00011775901,0.00018478592,0.00008818556,0.0004575965,0.00013891212,0.029781902,0.0058461824,0.7088067,0.25439835,0.00008623358],"about_ca_topic_score_codex":0.0026575981,"about_ca_topic_score_gemma":0.0032579557,"teacher_disagreement_score":0.020512426,"about_ca_system_score_codex":0.001022549,"about_ca_system_score_gemma":0.001239966,"threshold_uncertainty_score":0.06862092},"labels":[],"label_agreement":null},{"id":"W4361840531","doi":"10.1007/978-3-031-10135-9_2","title":"How Abduction Fares in Mathematical Space","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Space (punctuation); Face (sociological concept); Epistemology; Metaphor; Value (mathematics); Philosophy of mathematics; Reading (process); Philosophy; Mathematics; Linguistics","score_opus":0.0346357450392624,"score_gpt":0.23327539823336324,"score_spread":0.19863965319410085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361840531","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.008858937,0.02906798,0.58920264,0.02974378,0.0015094167,0.00005001603,0.0003241186,0.0007819345,0.34046116],"genre_scores_gemma":[0.46225753,0.024895081,0.39918202,0.004687079,0.0021507356,0.00019160916,0.0007576132,0.0010837425,0.10479459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729365,0.0012469968,0.00018433505,0.00039780405,0.0007352603,0.00014179265],"domain_scores_gemma":[0.99351925,0.004772645,0.00015584686,0.0010770791,0.00038797923,0.00008710103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037247492,0.000925679,0.0010049333,0.0019030238,0.0015907941,0.008435758,0.001971022,0.0024567202,0.015945775],"category_scores_gemma":[0.013934297,0.00087932765,0.0015225795,0.0021924034,0.012202953,0.022921616,0.0037426602,0.0066956,0.0042222086],"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.00000849605,0.0000051445954,0.000058131107,0.00006422039,0.000009045775,0.000016235383,0.00020137441,0.000973635,0.00006868232,0.9768173,0.0026351172,0.019142687],"study_design_scores_gemma":[0.0000028192987,0.0000025345307,0.000020551042,0.0000347265,0.0000042471966,0.0000322812,0.00004378423,0.001540794,0.000091494236,0.98685956,0.011363156,0.0000040898526],"about_ca_topic_score_codex":0.002487282,"about_ca_topic_score_gemma":0.0022120303,"teacher_disagreement_score":0.015945775,"about_ca_system_score_codex":0.0019000031,"about_ca_system_score_gemma":0.0012700394,"threshold_uncertainty_score":0.053343892},"labels":[],"label_agreement":null},{"id":"W4363652005","doi":"10.1007/s11229-023-04114-5","title":"Structured propositions and a semantics for unrestricted impure logics of ground","year":2023,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Philosophy of language; Philosophy of science; Semantics (computer science); Iterated function; Computer science; Common ground; Identity (music); Epistemology; Theoretical computer science; Metaphysics; Programming language; Natural language processing; Artificial intelligence; Mathematics; Philosophy; Psychology; Communication","score_opus":0.021238585824811383,"score_gpt":0.2642165872199406,"score_spread":0.24297800139512923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4363652005","genre_codex":"methods","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.028036533,0.0011354086,0.92358583,0.0039213644,0.00026354656,0.00014478335,0.00050889194,0.0008526767,0.041551013],"genre_scores_gemma":[0.6547699,0.00077452324,0.33068478,0.0011807997,0.00039781324,0.00033074841,0.0009268826,0.00024848076,0.010686042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968267,0.0011589627,0.00033719023,0.0006191568,0.0007219948,0.0003359269],"domain_scores_gemma":[0.99422425,0.0031055566,0.00045037005,0.001216307,0.000647603,0.00035586895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044042007,0.00081804156,0.00079189445,0.0029439293,0.0028642265,0.007872628,0.0029281697,0.0027067906,0.007677338],"category_scores_gemma":[0.0075522107,0.0012549997,0.002830805,0.002162859,0.009726317,0.01909835,0.005543702,0.0057566976,0.0008431527],"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.000014151561,0.000011435392,0.00003945295,0.000020978056,0.0000074274117,0.000034704393,0.0002050429,0.0004272831,0.00016897375,0.99730873,0.00025884478,0.0015029663],"study_design_scores_gemma":[0.000012574493,0.0000072689163,0.000027996986,0.00001875344,0.000012641719,0.000037552356,0.00010223279,0.0023669861,0.0003880624,0.9945353,0.0024825837,0.000008113061],"about_ca_topic_score_codex":0.0015175237,"about_ca_topic_score_gemma":0.0020758773,"teacher_disagreement_score":0.007872628,"about_ca_system_score_codex":0.0024404735,"about_ca_system_score_gemma":0.0015186128,"threshold_uncertainty_score":0.025683284},"labels":[],"label_agreement":null},{"id":"W4379516867","doi":"10.3390/books978-3-0365-7838-5","title":"10th Anniversary of &lt;em&gt;Axioms&lt;/em&gt;: Logic","year":2023,"lang":"en","type":"book","venue":"","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":"Axiom; Mathematics; Geometry","score_opus":0.024083255042116548,"score_gpt":0.23817094835457533,"score_spread":0.21408769331245878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379516867","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.00096570305,0.026566697,0.01320003,0.015849488,0.08802318,0.00009899895,0.0023244298,0.0013778753,0.85159355],"genre_scores_gemma":[0.0049052015,0.0061374526,0.0042475807,0.001872434,0.009074443,0.000062473206,0.0009321824,0.0006967184,0.9720715],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924254,0.000109803084,0.000046129626,0.00015530712,0.00037798038,0.00006829543],"domain_scores_gemma":[0.99912757,0.00013774773,0.00004288522,0.00014649013,0.00039073644,0.00015449424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094167836,0.0010516689,0.0006769374,0.0015234309,0.0013181751,0.0070394496,0.0010924132,0.0014087349,0.14461198],"category_scores_gemma":[0.0017736135,0.0004926628,0.0008062307,0.0012988218,0.0017151608,0.0037682983,0.0017635286,0.0036354116,0.09647867],"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.000023867595,0.000011321295,0.000051848707,0.000125529,0.000004684058,0.000049424016,0.00006428892,0.00016064961,0.00039497248,0.042790763,0.912678,0.043644536],"study_design_scores_gemma":[0.0000014589646,0.0000061050473,0.0000832041,0.000053737152,0.0000016991045,0.00006224316,0.0000112703665,0.000063060645,0.000108102126,0.002850567,0.9967559,0.000002719826],"about_ca_topic_score_codex":0.0027259637,"about_ca_topic_score_gemma":0.0047046132,"teacher_disagreement_score":0.14461198,"about_ca_system_score_codex":0.0030250293,"about_ca_system_score_gemma":0.0013803034,"threshold_uncertainty_score":0.48377526},"labels":[],"label_agreement":null},{"id":"W4379983127","doi":"10.32920/23459144","title":"Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic","year":2023,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Idempotence; Class (philosophy); Descriptive complexity theory; Order (exchange); Discrete mathematics; Time complexity; Polynomial; Constraint (computer-aided design); Constraint satisfaction; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.06515020277542678,"score_gpt":0.2905297792477522,"score_spread":0.22537957647232543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379983127","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.17054987,0.00091682037,0.80315286,0.0038559493,0.00010118592,0.0001949532,0.00066645734,0.0010432308,0.019518645],"genre_scores_gemma":[0.7586294,0.00089312106,0.22958444,0.00075841905,0.0002060939,0.0002490148,0.0011014399,0.0001700185,0.008407958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963309,0.001145203,0.00030064068,0.0007077269,0.0011257567,0.00038983044],"domain_scores_gemma":[0.991085,0.0066071753,0.0005472518,0.00091977743,0.00050338975,0.0003373725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038045412,0.0007357909,0.0008910673,0.0009049157,0.0009826191,0.004010097,0.0023077081,0.0011625411,0.00355539],"category_scores_gemma":[0.009403977,0.0008396611,0.0029757018,0.0017617297,0.0038069852,0.010257825,0.0031971177,0.005996378,0.00036125205],"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.00010747495,0.0001260589,0.00057112763,0.00017635552,0.000057472476,0.00020976957,0.0005735719,0.0337735,0.0024927256,0.9425878,0.001519657,0.017804457],"study_design_scores_gemma":[0.000040546263,0.00003311831,0.00011400049,0.00002285899,0.000023752322,0.00008683169,0.000105345374,0.087437585,0.0022017446,0.90719664,0.0027183937,0.000019126213],"about_ca_topic_score_codex":0.0027379051,"about_ca_topic_score_gemma":0.004223897,"teacher_disagreement_score":0.004010097,"about_ca_system_score_codex":0.0033480262,"about_ca_system_score_gemma":0.0018161773,"threshold_uncertainty_score":0.024291694},"labels":[],"label_agreement":null},{"id":"W4380082719","doi":"10.32920/23459144.v1","title":"Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic","year":2023,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Idempotence; Class (philosophy); Descriptive complexity theory; Order (exchange); Discrete mathematics; Constraint satisfaction; Time complexity; Polynomial; Constraint (computer-aided design); Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.06515020277542678,"score_gpt":0.2905297792477522,"score_spread":0.22537957647232543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380082719","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.17054987,0.00091682037,0.80315286,0.0038559493,0.00010118592,0.0001949532,0.00066645734,0.0010432308,0.019518645],"genre_scores_gemma":[0.7586294,0.00089312106,0.22958444,0.00075841905,0.0002060939,0.0002490148,0.0011014399,0.0001700185,0.008407958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963309,0.001145203,0.00030064068,0.0007077269,0.0011257567,0.00038983044],"domain_scores_gemma":[0.991085,0.0066071753,0.0005472518,0.00091977743,0.00050338975,0.0003373725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038045412,0.0007357909,0.0008910673,0.0009049157,0.0009826191,0.004010097,0.0023077081,0.0011625411,0.00355539],"category_scores_gemma":[0.009403977,0.0008396611,0.0029757018,0.0017617297,0.0038069852,0.010257825,0.0031971177,0.005996378,0.00036125205],"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.00010747495,0.0001260589,0.00057112763,0.00017635552,0.000057472476,0.00020976957,0.0005735719,0.0337735,0.0024927256,0.9425878,0.001519657,0.017804457],"study_design_scores_gemma":[0.000040546263,0.00003311831,0.00011400049,0.00002285899,0.000023752322,0.00008683169,0.000105345374,0.087437585,0.0022017446,0.90719664,0.0027183937,0.000019126213],"about_ca_topic_score_codex":0.0027379051,"about_ca_topic_score_gemma":0.004223897,"teacher_disagreement_score":0.004010097,"about_ca_system_score_codex":0.0033480262,"about_ca_system_score_gemma":0.0018161773,"threshold_uncertainty_score":0.024291694},"labels":[],"label_agreement":null},{"id":"W4382866786","doi":"10.1609/icaps.v33i1.27179","title":"Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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","funders":"Horizon 2020 Framework Programme","keywords":"Planner; Linear temporal logic; Temporal logic; Computer science; Linear logic; Spurious relationship; Overhead (engineering); Compiler; Theoretical computer science; Artificial intelligence; Programming language; Machine learning","score_opus":0.06726799504584709,"score_gpt":0.33030112970346653,"score_spread":0.26303313465761946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866786","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.09828173,0.0005042379,0.8763705,0.0006611441,0.0000812272,0.00014667722,0.00082259375,0.008242765,0.014889042],"genre_scores_gemma":[0.5365755,0.00034212586,0.45711243,0.00021794462,0.00003414739,0.00014079723,0.0009031076,0.0005510758,0.0041229078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.00041419565,0.000065965854,0.0001861301,0.00026458685,0.0001707886],"domain_scores_gemma":[0.99767154,0.0016448859,0.00019285384,0.00021511223,0.00017421365,0.000101297264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015357528,0.00066680013,0.00038473232,0.0006926001,0.00063421036,0.0013833909,0.0012304116,0.0005895801,0.004231965],"category_scores_gemma":[0.0042437324,0.000476127,0.00086243515,0.00088646304,0.0016060446,0.0027051445,0.0014488595,0.0013115148,0.00053294963],"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.00072067796,0.0003346007,0.0027455764,0.0008678854,0.00012457976,0.00094761734,0.0011580925,0.52986264,0.017515924,0.29851398,0.007122869,0.14008561],"study_design_scores_gemma":[0.0000706498,0.00012869114,0.0003811371,0.00005658132,0.000058018086,0.00014461987,0.00014265542,0.88456917,0.015761668,0.08948602,0.009168973,0.000031852713],"about_ca_topic_score_codex":0.0100706825,"about_ca_topic_score_gemma":0.017403644,"teacher_disagreement_score":0.0100706825,"about_ca_system_score_codex":0.0017322182,"about_ca_system_score_gemma":0.0021699313,"threshold_uncertainty_score":0.02002412},"labels":[],"label_agreement":null},{"id":"W4384296739","doi":"10.32920/23688732","title":"Progression of Decomposed Local-Effect Action Theories","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research; Deutsche Forschungsgemeinschaft","keywords":"Forgetting; Situation calculus; Action (physics); Computer science; Bridging (networking); Modularity (biology); Subject (documents); Representation (politics); Decomposition; Belief revision; Cognitive science; Theory; Artificial intelligence; Epistemology; Theoretical computer science; Mathematics; Cognitive psychology; Psychology","score_opus":0.03721432294962409,"score_gpt":0.33698758153137354,"score_spread":0.29977325858174947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384296739","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.08879648,0.00055668136,0.8778948,0.0011383467,0.00008031297,0.00020357908,0.00029895452,0.0010259376,0.030004816],"genre_scores_gemma":[0.7279346,0.0006479149,0.2596019,0.00027398122,0.00009650362,0.00020999018,0.00058190647,0.0002475389,0.010405757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699855,0.00085867045,0.00021806039,0.0006005529,0.0010064,0.00031769535],"domain_scores_gemma":[0.9958347,0.0019485856,0.00035930338,0.000897957,0.0006862325,0.00027313892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00441151,0.0007177848,0.0005881153,0.0023743515,0.0013796246,0.003256341,0.0016373518,0.00125074,0.0065849232],"category_scores_gemma":[0.0087087,0.00069241866,0.0028418312,0.0011121554,0.0062168953,0.009869925,0.0044508893,0.0037502542,0.0006640855],"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.000050597213,0.00002162884,0.0005552453,0.0000814008,0.0000253482,0.0003252947,0.0013222387,0.007246721,0.001605268,0.9764671,0.0003866193,0.011912525],"study_design_scores_gemma":[0.00002706737,0.000039184386,0.00025698618,0.000047841466,0.000038186437,0.0001328476,0.00018584786,0.028676469,0.0017207235,0.9640026,0.004852242,0.000020033629],"about_ca_topic_score_codex":0.004015561,"about_ca_topic_score_gemma":0.0034072564,"teacher_disagreement_score":0.0065849232,"about_ca_system_score_codex":0.002907057,"about_ca_system_score_gemma":0.0015485774,"threshold_uncertainty_score":0.02333057},"labels":[],"label_agreement":null},{"id":"W4384296821","doi":"10.32920/23688735","title":"Hybrid Temporal Situation Calculus","year":2023,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University; York University","funders":"","keywords":"Situation calculus; Axiom; Automaton; Extension (predicate logic); Hybrid automaton; Computer science; Simple (philosophy); Calculus (dental); Argument (complex analysis); Hybrid system; Action (physics); Mathematical economics; Theoretical computer science; Mathematics; Artificial intelligence; Programming language; Epistemology","score_opus":0.04612925268787869,"score_gpt":0.27910500758880885,"score_spread":0.23297575490093017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384296821","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.01140951,0.0005614102,0.9402288,0.0010275834,0.00019697037,0.00013033331,0.00038517875,0.000902502,0.045157604],"genre_scores_gemma":[0.4722012,0.00059241836,0.5051848,0.00060314627,0.0001838504,0.00038931193,0.00052191067,0.00018265536,0.020140748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801433,0.00053278025,0.00017566045,0.0004200184,0.00064782397,0.00020944237],"domain_scores_gemma":[0.998451,0.00067279325,0.00010031141,0.00028883197,0.0003710809,0.00011595605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021722605,0.00052476616,0.0005012376,0.0009880546,0.0011319853,0.002515247,0.0016592938,0.000975429,0.0064962846],"category_scores_gemma":[0.002465717,0.00046869338,0.0015389228,0.0009024156,0.0036201458,0.0040492006,0.002283319,0.0024596,0.0009708451],"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.00000921592,0.000008817152,0.00006854246,0.00002850134,0.000008202071,0.00009006507,0.00017331119,0.0028137527,0.0006274859,0.9911073,0.0005439055,0.004520976],"study_design_scores_gemma":[0.000033036813,0.000024287812,0.00012818487,0.000033161654,0.000036151443,0.00017285882,0.00010648691,0.059264272,0.001825754,0.90079486,0.03755341,0.000027517684],"about_ca_topic_score_codex":0.0042090514,"about_ca_topic_score_gemma":0.0026360995,"teacher_disagreement_score":0.0064962846,"about_ca_system_score_codex":0.0020940776,"about_ca_system_score_gemma":0.0013504294,"threshold_uncertainty_score":0.021732211},"labels":[],"label_agreement":null},{"id":"W4385764351","doi":"10.24963/ijcai.2023/347","title":"Abstraction of Nondeterministic Situation Calculus Action Theories","year":2023,"lang":"en","type":"article","venue":"","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":"York University","funders":"","keywords":"Nondeterministic algorithm; Computer science; Abstraction; Action (physics); Task (project management); Situation calculus; Domain (mathematical analysis); Plan (archaeology); Programming language; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.03654581066973239,"score_gpt":0.30295286182045,"score_spread":0.2664070511507176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385764351","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.0053559565,0.00026162696,0.98446053,0.00023138362,0.000048438513,0.00007350078,0.000121102,0.00044970124,0.008997756],"genre_scores_gemma":[0.27150926,0.00074482366,0.7190816,0.00025354043,0.0001353423,0.00044653745,0.0005025085,0.0002076873,0.007118747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969627,0.0009452794,0.00032048012,0.00045562096,0.000975603,0.00034016752],"domain_scores_gemma":[0.99745697,0.0010112189,0.0002649636,0.0007500378,0.0003640308,0.00015284953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003421317,0.0012579581,0.00087070756,0.0018398489,0.0010851367,0.0031753636,0.0025856665,0.00092228304,0.00432907],"category_scores_gemma":[0.0048912046,0.0009943614,0.0033477098,0.0012152999,0.0034614212,0.0058106803,0.00331193,0.003921039,0.0008445969],"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.0000121722005,0.000013072745,0.00014666936,0.000048297512,0.000014862578,0.00007752229,0.00025278758,0.01594607,0.0005799679,0.97732043,0.0002600747,0.005328111],"study_design_scores_gemma":[0.00001894467,0.00002146092,0.00009566897,0.000037811893,0.000034037665,0.000066884975,0.0000545175,0.09554915,0.0012276093,0.8888938,0.01397806,0.000022088845],"about_ca_topic_score_codex":0.004707702,"about_ca_topic_score_gemma":0.0046836585,"teacher_disagreement_score":0.004707702,"about_ca_system_score_codex":0.0021259887,"about_ca_system_score_gemma":0.0026189624,"threshold_uncertainty_score":0.018093884},"labels":[],"label_agreement":null},{"id":"W4386211456","doi":"10.4204/eptcs.385.40","title":"Proceedings 39th International Conference on Logic Programming","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","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 Alberta","funders":"Ministerio de Ciencia e Innovación","keywords":"Computer science; Programming language","score_opus":0.016768188259415184,"score_gpt":0.27524222376854657,"score_spread":0.2584740355091314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386211456","genre_codex":"methods","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.0061237807,0.07318819,0.5463569,0.020166788,0.018175777,0.00041313787,0.0027289866,0.0066739228,0.32617262],"genre_scores_gemma":[0.08158865,0.05038134,0.4561251,0.0073419623,0.008233224,0.0010124234,0.009892001,0.00403484,0.38139042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974732,0.0007010564,0.00030316436,0.0006041775,0.0007512484,0.00016712304],"domain_scores_gemma":[0.9967253,0.001342269,0.00011147558,0.00083818246,0.0007556549,0.00022706666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039820434,0.00149607,0.0016085482,0.0018126855,0.0013641098,0.00919012,0.0025509538,0.0020686,0.077991575],"category_scores_gemma":[0.006393171,0.0007803407,0.0023651347,0.0020520096,0.0024595077,0.006948858,0.0037628016,0.005891655,0.02434958],"study_design_candidate":"not_applicable","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.00027299684,0.00018742678,0.0006690107,0.00077641354,0.00019090592,0.0003166145,0.0004051371,0.0032746047,0.0023821576,0.31494972,0.24142575,0.43514934],"study_design_scores_gemma":[0.000034542696,0.000041547606,0.000345733,0.00040484362,0.000054819415,0.0003346705,0.00011977978,0.008405676,0.0008689513,0.15538768,0.8339743,0.000027443228],"about_ca_topic_score_codex":0.0021606158,"about_ca_topic_score_gemma":0.001878979,"teacher_disagreement_score":0.077991575,"about_ca_system_score_codex":0.0027665813,"about_ca_system_score_gemma":0.0029111388,"threshold_uncertainty_score":0.26090783},"labels":[],"label_agreement":null},{"id":"W4386231691","doi":"10.1007/978-3-031-39784-4_9","title":"An Evidence Logic Perspective on Schotch-Jennings Forcing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Doxastic logic; Forcing (mathematics); Epistemic modal logic; Modal logic; Modal operator; Operator (biology); Perspective (graphical); Semantics (computer science); Hypergraph; Computer science; Epistemology; Mathematics; Modal; Algorithm; Theoretical computer science; Discrete mathematics; Multimodal logic; Artificial intelligence; Description logic; Philosophy; Programming language","score_opus":0.04238636107239058,"score_gpt":0.3013732260256221,"score_spread":0.25898686495323153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386231691","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.01896888,0.0062093567,0.34794652,0.037317514,0.0012504304,0.00010918523,0.00068407843,0.00016689664,0.58734715],"genre_scores_gemma":[0.8019554,0.004916087,0.090512365,0.0054447884,0.0027987398,0.00035557084,0.00045873725,0.00017379122,0.09338457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975914,0.00096438354,0.00016050656,0.0004092289,0.00067162607,0.00020278829],"domain_scores_gemma":[0.99387157,0.004740498,0.00023656874,0.00054526614,0.00044290273,0.00016322035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00413879,0.000680484,0.0012818486,0.0031419187,0.003234349,0.004416474,0.002186607,0.0038345992,0.017879149],"category_scores_gemma":[0.008888805,0.0007511421,0.0018431137,0.0029959634,0.012076144,0.011564857,0.0032232073,0.005838004,0.0011779362],"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.0000023988032,0.0000017765058,0.000013035508,0.000007405165,0.0000014913242,0.000013028026,0.000025526206,0.00015545328,0.0000135988585,0.9986694,0.00040832406,0.00068854966],"study_design_scores_gemma":[0.0000030166805,0.0000013098457,0.000012005152,0.000005651591,0.0000012411475,0.0000091973425,0.000012073847,0.00022534416,0.000015502223,0.99793065,0.0017820761,0.0000019666415],"about_ca_topic_score_codex":0.0027222396,"about_ca_topic_score_gemma":0.0030140523,"teacher_disagreement_score":0.017879149,"about_ca_system_score_codex":0.0043965443,"about_ca_system_score_gemma":0.00170278,"threshold_uncertainty_score":0.05981177},"labels":[],"label_agreement":null},{"id":"W4386473763","doi":"10.1007/978-3-031-43264-4_3","title":"Qualitative Uncertainty Reasoning in AgentSpeak","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Extension (predicate logic); Scalability; Observability; Syntax; Artificial intelligence; Modalities; Programming language; Theoretical computer science; Mathematics; Applied mathematics; Database","score_opus":0.043678243237320995,"score_gpt":0.31757894549339355,"score_spread":0.27390070225607255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386473763","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.005388409,0.001690923,0.9541038,0.0017678674,0.0001346611,0.00005987483,0.00022296025,0.000813679,0.035817698],"genre_scores_gemma":[0.5029806,0.0023341842,0.46842253,0.00065463374,0.00032181034,0.000290405,0.0007841866,0.00044313623,0.023768524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838245,0.0006990671,0.000096105825,0.00018049151,0.0005237117,0.00011814377],"domain_scores_gemma":[0.99720144,0.0020818482,0.000096045245,0.00032105797,0.0002085762,0.00009103438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026455794,0.0006786932,0.00079498714,0.0012085963,0.0012697309,0.0040562465,0.0022781596,0.001281075,0.008329639],"category_scores_gemma":[0.0067556906,0.0007948652,0.0011447181,0.0014777087,0.0032335864,0.0061706407,0.0028625573,0.002534148,0.001266155],"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.000038077877,0.000018645522,0.000078914396,0.00008680567,0.000021129677,0.00005125268,0.00019288254,0.015810456,0.00025614514,0.9567413,0.0029885075,0.023716051],"study_design_scores_gemma":[0.0000046767173,0.000002482365,0.00002032989,0.00002079454,0.000006416446,0.000012543194,0.000036785583,0.03373179,0.00039254964,0.9604632,0.0053028557,0.00000542637],"about_ca_topic_score_codex":0.0052684336,"about_ca_topic_score_gemma":0.004272691,"teacher_disagreement_score":0.008329639,"about_ca_system_score_codex":0.0023429675,"about_ca_system_score_gemma":0.0011396805,"threshold_uncertainty_score":0.02786541},"labels":[],"label_agreement":null},{"id":"W4386879846","doi":"10.1016/j.jlamp.2023.100919","title":"Branching pomsets: Design, expressiveness and applications to choreographies","year":2023,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Electronic Components and Systems for European Leadership; Key Digital Technologies Joint Undertaking; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche; Ministério da Ciência, Tecnologia e Ensino Superior; European Commission; Canadian Institute of Steel Construction","keywords":"Branching (polymer chemistry); Computer science; Concurrency; Theoretical computer science; ENCODE; Programming language; Event structure; Set (abstract data type); Operational semantics; Automaton; Semantics (computer science); Mathematics","score_opus":0.06223679255921293,"score_gpt":0.3772277272417923,"score_spread":0.3149909346825794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386879846","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.0066039115,0.00021203977,0.98773324,0.00020147639,0.000045748227,0.00015966177,0.00014647908,0.0006843566,0.004213046],"genre_scores_gemma":[0.23455487,0.0008033783,0.7571405,0.00013271523,0.00008540715,0.0009930052,0.00032711925,0.00035097386,0.0056120534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969254,0.001080958,0.00040591136,0.00051377126,0.00082466647,0.00024918272],"domain_scores_gemma":[0.9941894,0.003295904,0.0005955909,0.0010995392,0.00046759305,0.00035214776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035064297,0.0012473803,0.0009024914,0.0017105181,0.0020270215,0.0038697566,0.0020201767,0.0015251704,0.0058437083],"category_scores_gemma":[0.009505509,0.0012963149,0.0026874996,0.0021971222,0.00677377,0.0060393442,0.0038720402,0.0030719303,0.0007866436],"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.00005704262,0.000028335908,0.0004262306,0.0001648107,0.000032426393,0.00027868056,0.0008651637,0.035927262,0.0036010707,0.94026953,0.00059700076,0.01775246],"study_design_scores_gemma":[0.000056266737,0.000053391497,0.00017550228,0.00012681066,0.00004654838,0.00027366323,0.0002534667,0.1295327,0.0062024207,0.83846647,0.024750356,0.000062400984],"about_ca_topic_score_codex":0.004341048,"about_ca_topic_score_gemma":0.0032555892,"teacher_disagreement_score":0.0058437083,"about_ca_system_score_codex":0.002316599,"about_ca_system_score_gemma":0.0018791014,"threshold_uncertainty_score":0.019549131},"labels":[],"label_agreement":null},{"id":"W4387096360","doi":"10.1016/j.artint.2023.104023","title":"A general framework for preferences in answer set programming","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Generality; Answer set programming; Constraint satisfaction; Theoretical computer science; Constraint programming; Implementation; Set (abstract data type); Preference; Flexibility (engineering); Constraint satisfaction problem; Satisfiability; Programming language; Logic programming; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.11974218036133154,"score_gpt":0.3563576723342461,"score_spread":0.23661549197291454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387096360","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.001390668,0.0003172005,0.9886989,0.0014566238,0.00011019763,0.00007410126,0.00023929898,0.0002464362,0.007466585],"genre_scores_gemma":[0.11594249,0.0009103497,0.8695468,0.0016660033,0.00075168815,0.00072897953,0.0010200437,0.0003647177,0.00906907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99203944,0.0034316934,0.00081944856,0.0012630504,0.001796775,0.00064968533],"domain_scores_gemma":[0.9937319,0.003594189,0.00023801356,0.0010752628,0.00093100005,0.00042963264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01003002,0.0013076096,0.0016883606,0.0032898525,0.0025619844,0.0067039332,0.0049933377,0.003075962,0.016187396],"category_scores_gemma":[0.016549988,0.001316413,0.004382264,0.005236479,0.0040103295,0.016915658,0.005772461,0.007168148,0.003711752],"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.000013168884,0.000016583266,0.00008134074,0.0000588132,0.000015101713,0.000028891407,0.00015629723,0.0011691488,0.00019891355,0.98732656,0.0015490981,0.0093861185],"study_design_scores_gemma":[0.000012918099,0.000010870124,0.000036600526,0.000024807396,0.000015225101,0.00004339487,0.000053827465,0.008113084,0.00019462332,0.9824636,0.009019401,0.000011543873],"about_ca_topic_score_codex":0.0021661753,"about_ca_topic_score_gemma":0.0022388115,"teacher_disagreement_score":0.016187396,"about_ca_system_score_codex":0.0021098363,"about_ca_system_score_gemma":0.0017787125,"threshold_uncertainty_score":0.05415225},"labels":[],"label_agreement":null},{"id":"W4387172145","doi":"10.3233/faia230401","title":"On Explaining Agent Behaviour via Root Cause Analysis: A Formal Account Grounded in Theory of Mind","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Root (linguistics); Action (physics); Causal model; Causal structure; Causal reasoning; Cognitive science; Theory of mind; Computer science; Causal theory of reference; Root cause; Epistemology; Psychology; Cognitive psychology; Cognition; Linguistics; Mathematics","score_opus":0.053310962504392705,"score_gpt":0.291841695728201,"score_spread":0.2385307332238083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387172145","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.010148034,0.0023661642,0.91859365,0.008415058,0.00016927808,0.0000645311,0.0001501816,0.00036036724,0.059732847],"genre_scores_gemma":[0.65161085,0.003244762,0.3278536,0.0016032497,0.00032358823,0.0003883844,0.00042109904,0.0002810263,0.014273517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921405,0.00033103794,0.000034619487,0.00013812432,0.00018897766,0.00009307659],"domain_scores_gemma":[0.9981558,0.0012850846,0.00015510803,0.00022568171,0.00010865028,0.00006962935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002023345,0.0010278187,0.00069602765,0.001911451,0.0013298013,0.0027782354,0.0028288227,0.0026592466,0.0052121365],"category_scores_gemma":[0.0036367693,0.00050549075,0.002324634,0.0015635175,0.00857132,0.007901174,0.00282102,0.0032285906,0.0006968679],"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.0000032554055,0.0000050290087,0.00008138802,0.000034694072,0.0000073206265,0.00005154962,0.00027196849,0.0044863694,0.00009053213,0.99213964,0.00049522193,0.0023329568],"study_design_scores_gemma":[0.000004115608,0.000003984323,0.00004845431,0.000018220566,0.000006356107,0.000031153304,0.00003662609,0.013096385,0.000066811874,0.98415345,0.0025289806,0.0000054278494],"about_ca_topic_score_codex":0.0038287516,"about_ca_topic_score_gemma":0.0039507826,"teacher_disagreement_score":0.0052121365,"about_ca_system_score_codex":0.0025590276,"about_ca_system_score_gemma":0.0016865885,"threshold_uncertainty_score":0.018567085},"labels":[],"label_agreement":null},{"id":"W4387185195","doi":"10.3233/faia230281","title":"FOND Planning for Pure-Past Linear Temporal Logic Goals","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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","funders":"Horizon 2020 Framework Programme","keywords":"Nondeterministic algorithm; Correctness; Computer science; Encoding (memory); Linear temporal logic; Observable; Action (physics); Automaton; Simple (philosophy); Temporal logic; Spurious relationship; Theoretical computer science; Algorithm; Artificial intelligence; Machine learning","score_opus":0.08519032252542884,"score_gpt":0.31342331124957484,"score_spread":0.228232988724146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387185195","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.014498944,0.00043427633,0.95151365,0.00053155416,0.00006739215,0.00006175034,0.00034643014,0.0035650071,0.028980942],"genre_scores_gemma":[0.3001765,0.0007607619,0.6796579,0.00028692812,0.000050158425,0.00016463795,0.0008000177,0.00055668957,0.017546391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995432,0.00015816101,0.00003431292,0.000070436174,0.0001492191,0.00004476214],"domain_scores_gemma":[0.9993475,0.0004216258,0.00003996781,0.000114099224,0.0000499419,0.000026977885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006412673,0.00047514905,0.00023818215,0.000394095,0.00048806923,0.0013339536,0.00066168606,0.0005532122,0.005640582],"category_scores_gemma":[0.001967416,0.00035061754,0.0006331477,0.0005453757,0.0013182134,0.0024396658,0.0012784043,0.0011172822,0.0009264338],"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.00013869055,0.00004766992,0.00032841766,0.00026429436,0.000016782333,0.0002620021,0.0004031276,0.055004384,0.0071418467,0.7979436,0.0066107153,0.1318385],"study_design_scores_gemma":[0.00004430538,0.000050799903,0.00021627948,0.00009300619,0.000028020546,0.00025746593,0.00009357738,0.34571663,0.014944197,0.5767842,0.061735064,0.000036380192],"about_ca_topic_score_codex":0.0026611267,"about_ca_topic_score_gemma":0.0033941113,"teacher_disagreement_score":0.005640582,"about_ca_system_score_codex":0.0012198862,"about_ca_system_score_gemma":0.0011777797,"threshold_uncertainty_score":0.018869698},"labels":[],"label_agreement":null},{"id":"W4388372864","doi":"10.1093/oso/9780198500513.001.0001","title":"Mathematical Logic","year":2001,"lang":"en","type":"book","venue":"","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":"York University","funders":"","keywords":"Foundations of mathematics; Recursion (computer science); Gödel; Computer science; Axiom; Theme (computing); Mathematical logic; Set theory; Set (abstract data type); Section (typography); Gödel's incompleteness theorems; Calculus (dental); Mathematics; Algebra over a field; Programming language; Mathematics education; Pure mathematics","score_opus":0.02647287355906199,"score_gpt":0.2470737846053226,"score_spread":0.2206009110462606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388372864","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.0015439418,0.023106737,0.07529097,0.009136027,0.001558058,0.000091196176,0.0014675652,0.00057922804,0.8872262],"genre_scores_gemma":[0.1427131,0.04299615,0.11243842,0.009168994,0.0039226203,0.0004854673,0.005043264,0.00085065764,0.68238133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904007,0.00021791484,0.00008048791,0.00020859859,0.00038640387,0.00006638958],"domain_scores_gemma":[0.9991586,0.0003161184,0.000056149354,0.00018141334,0.00023455013,0.000053281026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084349426,0.0009156644,0.0008758094,0.0015646287,0.0021824974,0.0060344804,0.0012542062,0.0014150126,0.03568706],"category_scores_gemma":[0.0023056592,0.0004908368,0.0008326668,0.0021890493,0.004070142,0.006854602,0.002120974,0.0040559364,0.017053733],"study_design_candidate":"not_applicable","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.0000029771852,0.0000039781735,0.000026450116,0.00008083399,0.0000038782587,0.000024924788,0.00013688633,0.00020311374,0.000090240064,0.9563411,0.029534591,0.013550992],"study_design_scores_gemma":[0.0000028683346,0.0000032898101,0.000052325802,0.00009231205,0.000003036148,0.00009046288,0.00004192632,0.00036805726,0.00008898482,0.56124073,0.43801147,0.0000045801426],"about_ca_topic_score_codex":0.001423681,"about_ca_topic_score_gemma":0.0013100504,"teacher_disagreement_score":0.03568706,"about_ca_system_score_codex":0.0034504116,"about_ca_system_score_gemma":0.0016376536,"threshold_uncertainty_score":0.11938512},"labels":[],"label_agreement":null},{"id":"W4388996076","doi":"10.1007/978-3-031-29415-0_7","title":"Fine’s Semantics for Relevance Logic and Its Relevance","year":2023,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Soundness; Relevance (law); Semantics (computer science); Interpretation (philosophy); Completeness (order theory); Kripke semantics; Computer science; Well-founded semantics; Property (philosophy); Abstract interpretation; Operational semantics; Programming language; Epistemology; Mathematics; Multimodal logic; Description logic; Denotational semantics; Philosophy","score_opus":0.044381974305231824,"score_gpt":0.30095761357657846,"score_spread":0.25657563927134663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388996076","genre_codex":"methods","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.007139379,0.012710538,0.5225898,0.018259162,0.0014649774,0.00015001123,0.00056440604,0.00076170726,0.43636003],"genre_scores_gemma":[0.5841439,0.007896658,0.23676427,0.007892822,0.0037966075,0.0005117166,0.00089143054,0.00078520546,0.15731737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728096,0.00073396397,0.00021698767,0.00073813,0.00083822117,0.00019173471],"domain_scores_gemma":[0.99802774,0.0010844268,0.00007629597,0.00035906708,0.00038643592,0.00006601934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029970193,0.00087056396,0.0011062293,0.0040836204,0.0034353652,0.005488431,0.0016626029,0.003450297,0.011122386],"category_scores_gemma":[0.008442305,0.0010198662,0.0016985469,0.0033052722,0.008214412,0.017447658,0.0029167691,0.0056487345,0.0023881895],"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.0000060312805,0.000005371817,0.000020680704,0.00003286867,0.0000034987897,0.000018073863,0.00015883787,0.00018728583,0.000106496416,0.98740923,0.0043806406,0.0076708836],"study_design_scores_gemma":[0.0000049093214,0.0000035861844,0.000033237415,0.000021153637,0.0000049850246,0.000061732244,0.000024447085,0.0005123318,0.00014033045,0.96184653,0.03733937,0.0000075406056],"about_ca_topic_score_codex":0.0031620476,"about_ca_topic_score_gemma":0.0024182184,"teacher_disagreement_score":0.011122386,"about_ca_system_score_codex":0.0037836023,"about_ca_system_score_gemma":0.0013553287,"threshold_uncertainty_score":0.03720808},"labels":[],"label_agreement":null},{"id":"W4389009937","doi":"10.1007/978-981-99-8391-9_5","title":"Reports, Observations, and Belief Change","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Computer science; Honesty; Set (abstract data type); Context (archaeology); Class (philosophy); Process (computing); Representation (politics); Key (lock); Operator (biology); Order (exchange); Artificial intelligence; Computer security; Psychology; Social psychology; Programming language","score_opus":0.05794831357193754,"score_gpt":0.2563156510575475,"score_spread":0.19836733748560997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389009937","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.16598901,0.019162925,0.47684357,0.03510599,0.0011579306,0.00017204559,0.0012560181,0.00079073303,0.2995217],"genre_scores_gemma":[0.95098215,0.0032971893,0.02807883,0.0006396222,0.00061511516,0.00010530628,0.00046977078,0.00007371874,0.015738195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966738,0.0013656857,0.00025524263,0.00063683174,0.00082436006,0.00024405574],"domain_scores_gemma":[0.9695561,0.022467356,0.002963141,0.0028164661,0.0017512453,0.0004456458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005406572,0.00047584617,0.00050288433,0.0016184888,0.0010115987,0.005772092,0.0015587088,0.0019973333,0.009341047],"category_scores_gemma":[0.039495233,0.00061116816,0.0007336456,0.001974194,0.006549775,0.011511746,0.0018206682,0.0034344902,0.00092394446],"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.00015538726,0.00004623193,0.002087144,0.00010138607,0.000035456073,0.00015530238,0.0019653977,0.0023095703,0.0002368345,0.95271033,0.0031780032,0.037018955],"study_design_scores_gemma":[0.000026891445,0.000025226978,0.0011102798,0.00004080549,0.00003052698,0.000110408015,0.0005832674,0.0046356567,0.00022866124,0.9877037,0.00548557,0.000018983284],"about_ca_topic_score_codex":0.0040286495,"about_ca_topic_score_gemma":0.0021019692,"teacher_disagreement_score":0.009341047,"about_ca_system_score_codex":0.0018566295,"about_ca_system_score_gemma":0.0007557062,"threshold_uncertainty_score":0.031248987},"labels":[],"label_agreement":null},{"id":"W4389396137","doi":"10.1016/j.eswa.2023.122856","title":"Model checking combined trust and commitments in Multi-Agent Systems","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Model checking; Computation tree logic; Theoretical computer science; Temporal logic; Binary decision diagram; Formalism (music); Computation; Probabilistic CTL; Subjective logic; Algorithm; Artificial intelligence; Probabilistic logic","score_opus":0.05874410564406512,"score_gpt":0.2932519827685964,"score_spread":0.23450787712453125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389396137","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.15139703,0.00020885476,0.84270775,0.0012423799,0.00013901852,0.00023314414,0.00021641128,0.0012361757,0.0026192472],"genre_scores_gemma":[0.9421321,0.000055145796,0.05627429,0.00008430305,0.00003673348,0.00011335272,0.00013809891,0.00010341938,0.0010625066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9846044,0.008055381,0.00093544845,0.002126514,0.003000732,0.0012773991],"domain_scores_gemma":[0.936089,0.04748234,0.003885781,0.006463021,0.0045006094,0.0015793276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012142336,0.0012454226,0.002125404,0.0016595379,0.0015984161,0.0053477837,0.004261356,0.0025187954,0.00283901],"category_scores_gemma":[0.0651877,0.001560297,0.0021371096,0.0012844134,0.0041941386,0.0104313,0.00664284,0.0049021505,0.00031536623],"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.00085781375,0.00018476041,0.0030318382,0.00022135314,0.00030734713,0.00042406862,0.0005583098,0.8689429,0.0020866701,0.10236222,0.0009554857,0.02006722],"study_design_scores_gemma":[0.00004423467,0.00002704393,0.00009186377,0.000012196016,0.000030398654,0.000020116577,0.00004998893,0.9535885,0.0009113059,0.044994336,0.00021782686,0.000012195526],"about_ca_topic_score_codex":0.013832327,"about_ca_topic_score_gemma":0.014034117,"teacher_disagreement_score":0.013832327,"about_ca_system_score_codex":0.0037129952,"about_ca_system_score_gemma":0.004432433,"threshold_uncertainty_score":0.06421554},"labels":[],"label_agreement":null},{"id":"W4389576403","doi":"10.1109/acsos-c58168.2023.00022","title":"A Road Toward Reflective Normative Agents","year":2023,"lang":"en","type":"article","venue":"","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 Ontario Institute of Technology","funders":"","keywords":"Normative; Computer science; Political science; Law","score_opus":0.05524882206700869,"score_gpt":0.3121434123452984,"score_spread":0.2568945902782897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389576403","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.020709513,0.006095882,0.64827925,0.19842364,0.0022699407,0.000289803,0.000121405326,0.0010151106,0.122795396],"genre_scores_gemma":[0.4566501,0.0035363075,0.5084645,0.012253759,0.0015424545,0.00081916054,0.00025648667,0.00052524655,0.015952032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9736521,0.01726655,0.0009992602,0.0033479694,0.0037500379,0.0009840357],"domain_scores_gemma":[0.9414093,0.028925411,0.0030728558,0.014643287,0.008516091,0.0034331926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042444896,0.0013163916,0.001207976,0.002442615,0.003997906,0.016311573,0.0043885577,0.008978527,0.0055399304],"category_scores_gemma":[0.06546356,0.001078155,0.0013253707,0.0013185473,0.034132008,0.027439471,0.010440726,0.013070244,0.0022456152],"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.000012144945,0.00003889259,0.0002553368,0.000059658432,0.000010983537,0.00003543292,0.0026857667,0.00072050793,0.00015674702,0.98484415,0.0019433588,0.00923702],"study_design_scores_gemma":[0.000012881393,0.0000152087205,0.00006497244,0.00010832773,0.000004914745,0.000025197942,0.00078624004,0.0023233986,0.00018742951,0.9616107,0.03484726,0.000013380064],"about_ca_topic_score_codex":0.002296796,"about_ca_topic_score_gemma":0.0013905831,"teacher_disagreement_score":0.042444896,"about_ca_system_score_codex":0.003706196,"about_ca_system_score_gemma":0.007867088,"threshold_uncertainty_score":0.22447276},"labels":[],"label_agreement":null},{"id":"W4390545201","doi":"10.1007/978-3-031-30488-0_6","title":"Inductively Defined Sets; Structural Induction","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Recursion (computer science); Mathematical induction; Section (typography); Inductively coupled plasma; Computer science; Mathematics; Algorithm; Physics; Geometry","score_opus":0.02509222159259693,"score_gpt":0.25076664728977266,"score_spread":0.22567442569717572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545201","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.0039060267,0.01603039,0.34474653,0.004290631,0.00084860926,0.00013185493,0.0009485858,0.0011076769,0.6279896],"genre_scores_gemma":[0.33170977,0.025977617,0.38047773,0.0033582351,0.002715632,0.0009879508,0.0038785685,0.0013123907,0.24958204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988205,0.0003605457,0.000045523382,0.00024284009,0.00045728954,0.000073306706],"domain_scores_gemma":[0.99893457,0.0006753793,0.000038636175,0.00015066538,0.00016159781,0.00003920634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014754407,0.0013169114,0.00091059954,0.0018707115,0.0015531826,0.0031588178,0.0021790038,0.0008709577,0.012324719],"category_scores_gemma":[0.0030798097,0.0009354081,0.000745378,0.0023884282,0.007155095,0.006873526,0.002913695,0.0058933645,0.0043067983],"study_design_candidate":"not_applicable","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.0000053311974,0.000014008098,0.000021963702,0.00006200228,0.0000020208909,0.000010106671,0.00010439477,0.00028104076,0.00013704646,0.9782416,0.0069798185,0.014140584],"study_design_scores_gemma":[0.0000058589067,0.0000028671338,0.000037384507,0.000029120833,0.0000041844014,0.000026658838,0.000037544538,0.00069613144,0.00031636888,0.96252084,0.03631882,0.000004245548],"about_ca_topic_score_codex":0.0022673772,"about_ca_topic_score_gemma":0.0030386022,"teacher_disagreement_score":0.012324719,"about_ca_system_score_codex":0.004112629,"about_ca_system_score_gemma":0.0014951797,"threshold_uncertainty_score":0.04123032},"labels":[],"label_agreement":null},{"id":"W4390605291","doi":"10.1145/3632903","title":"Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation; Royal Society; Semiconductor Research Corporation","keywords":"Probabilistic logic; Markov chain; Discrete mathematics; Computer science; Graph; Measure (data warehouse); Random graph; Mathematics; Theoretical computer science; Artificial intelligence; Data mining; Statistics","score_opus":0.01335425872438527,"score_gpt":0.26647790613374994,"score_spread":0.25312364740936466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605291","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.04686134,0.0005116765,0.92522633,0.0035688188,0.00013197654,0.000052778163,0.00021863592,0.00045841394,0.022970019],"genre_scores_gemma":[0.79566556,0.00072709663,0.18872435,0.0011290367,0.00031395524,0.0003277855,0.00037485934,0.0002824836,0.012454886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977099,0.00088895386,0.00012320421,0.00041381808,0.0006427428,0.00022138598],"domain_scores_gemma":[0.995265,0.002645347,0.00049669127,0.0007019569,0.0005360949,0.00035504645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027776435,0.0006428227,0.0005490716,0.0018823094,0.0016946525,0.0037678524,0.0019399344,0.001989044,0.004745166],"category_scores_gemma":[0.0074656205,0.00048136536,0.0015441381,0.0017816628,0.005852127,0.0125978375,0.003524061,0.003259302,0.00062980637],"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.0000027563776,0.0000034724524,0.00005136195,0.000006046127,0.0000014301086,0.000015254056,0.0000993618,0.0008491565,0.00008432999,0.9978382,0.00016529381,0.0008834114],"study_design_scores_gemma":[0.0000026913847,0.0000039068814,0.000040071372,0.00000600758,0.0000028644724,0.000025118245,0.000050836345,0.009737386,0.0001428934,0.9880585,0.0019233571,0.0000064153396],"about_ca_topic_score_codex":0.0029010703,"about_ca_topic_score_gemma":0.002202015,"teacher_disagreement_score":0.004745166,"about_ca_system_score_codex":0.0032345422,"about_ca_system_score_gemma":0.0011195478,"threshold_uncertainty_score":0.023468316},"labels":[],"label_agreement":null},{"id":"W4391012378","doi":"10.1007/978-3-031-46193-4_1","title":"Logical Methodology and the Structure of Logic Syllabi","year":2023,"lang":"fr","type":"book-chapter","venue":"Annals of the Canadian Society for History and Philosophy of Mathematics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Syllabus; Computer science; Programming language; Mathematics; Mathematics education","score_opus":0.2503053587881075,"score_gpt":0.3023907524221672,"score_spread":0.052085393634059673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391012378","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014007069,0.013137469,0.25382227,0.014890739,0.0007852692,0.00008981518,0.0007195978,0.00057496765,0.7019728],"genre_scores_gemma":[0.7177089,0.00797263,0.14223963,0.0015602,0.001447191,0.00027326355,0.00087271456,0.0006313112,0.12729412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984523,0.0007295127,0.00009324436,0.00019586906,0.000388844,0.00014025938],"domain_scores_gemma":[0.9961488,0.0024589987,0.00018023272,0.00035452665,0.0006871597,0.00017019201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002561313,0.00047857087,0.0006581371,0.003669537,0.003970065,0.0077215657,0.0013690986,0.0011712806,0.01643314],"category_scores_gemma":[0.006579235,0.000841616,0.00059212954,0.003210001,0.015227328,0.009493498,0.0018089681,0.0033415442,0.0024639198],"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.0000023087707,0.0000018290025,0.000018477767,0.000007967671,7.3445767e-7,0.000003995419,0.00017450501,0.00005914521,0.00002515465,0.9961534,0.001117051,0.002435472],"study_design_scores_gemma":[0.0000026195123,0.0000015562455,0.00004559594,0.000013558089,0.0000015293707,0.0000089453915,0.00005771832,0.00037490838,0.00005545769,0.97990054,0.019534439,0.0000030505164],"about_ca_topic_score_codex":0.020508118,"about_ca_topic_score_gemma":0.027681878,"teacher_disagreement_score":0.020508118,"about_ca_system_score_codex":0.008882889,"about_ca_system_score_gemma":0.0058450596,"threshold_uncertainty_score":0.064450204},"labels":[],"label_agreement":null},{"id":"W4391160585","doi":"10.3765/w42dk446","title":"Weakening is external to &lt;i&gt;only&lt;/i&gt;","year":2024,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","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":"McGill University","funders":"","keywords":"Psychology; Computer science","score_opus":0.009376223423466855,"score_gpt":0.23436786676021742,"score_spread":0.22499164333675056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391160585","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.07317534,0.001222091,0.3432075,0.014979575,0.0013935891,0.00038090246,0.0008206069,0.0040597254,0.5607607],"genre_scores_gemma":[0.88621366,0.0008483461,0.059014734,0.0045825476,0.0007708759,0.00031890802,0.0005799945,0.0024782247,0.045192633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950819,0.00075760216,0.00029703116,0.0017554632,0.0013881468,0.0007199341],"domain_scores_gemma":[0.9948067,0.0013797388,0.0003697896,0.001836781,0.0014400391,0.00016692857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044986596,0.0012476952,0.0013623136,0.0018349768,0.0026955493,0.004920628,0.002371955,0.0043199663,0.014715091],"category_scores_gemma":[0.008879547,0.0016025954,0.0021173297,0.0009739459,0.016019803,0.013134566,0.0066324705,0.007048874,0.0036188576],"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.000040490337,0.0000226006,0.0005349133,0.00014101766,0.00004192143,0.0002864881,0.0018664594,0.0002088808,0.003432142,0.9799968,0.003159473,0.010268857],"study_design_scores_gemma":[0.000052266994,0.00007667548,0.0019446594,0.0001582313,0.00016696911,0.0010081013,0.0011133313,0.0028214166,0.013521344,0.84905875,0.12998365,0.00009458979],"about_ca_topic_score_codex":0.004686104,"about_ca_topic_score_gemma":0.0034292568,"teacher_disagreement_score":0.014715091,"about_ca_system_score_codex":0.0041529727,"about_ca_system_score_gemma":0.0024566406,"threshold_uncertainty_score":0.04922694},"labels":[],"label_agreement":null},{"id":"W4391729100","doi":"10.1007/978-3-031-17299-1_3139","title":"Validity, Logical","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Psychology; Computer science","score_opus":0.09890543414084563,"score_gpt":0.2708248911771428,"score_spread":0.17191945703629719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391729100","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.0016495514,0.03628504,0.0585191,0.019887844,0.0026448078,0.00015150855,0.0007370798,0.0003137714,0.8798113],"genre_scores_gemma":[0.3807034,0.051171634,0.09181561,0.023997407,0.013716672,0.00163913,0.0026531771,0.0013749143,0.43292812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99523675,0.0018055071,0.00030374905,0.0009918232,0.001381576,0.00028052897],"domain_scores_gemma":[0.9949809,0.0029395225,0.00021850166,0.00089092454,0.00081133144,0.00015893923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005065047,0.0015264156,0.001513138,0.0037761559,0.0047263275,0.013014922,0.0026804986,0.003920914,0.034206897],"category_scores_gemma":[0.013836868,0.0009766564,0.00088498613,0.0036128843,0.031852305,0.021504715,0.004254492,0.008278768,0.009440814],"study_design_candidate":"not_applicable","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.0000056762588,0.000005284158,0.000028372984,0.00005458078,0.000002760192,0.0000102516315,0.00019132002,0.000056887257,0.000025161271,0.985024,0.009783203,0.004812646],"study_design_scores_gemma":[0.000006065771,0.0000030485228,0.000034940105,0.00005506021,0.0000033540787,0.000039724284,0.00014073559,0.00014975027,0.000037618556,0.9280985,0.07142725,0.00000393345],"about_ca_topic_score_codex":0.0069423816,"about_ca_topic_score_gemma":0.004806987,"teacher_disagreement_score":0.034206897,"about_ca_system_score_codex":0.0064185592,"about_ca_system_score_gemma":0.005534041,"threshold_uncertainty_score":0.11443347},"labels":[],"label_agreement":null},{"id":"W4392839859","doi":"10.2139/ssrn.4747772","title":"A “Logical Intuition” Based on Semantic Associations","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Toronto","funders":"","keywords":"Intuition; Computer science; Artificial intelligence; Natural language processing; Epistemology; Psychology; Cognitive science; Philosophy","score_opus":0.014915799574409295,"score_gpt":0.262321767877074,"score_spread":0.2474059683026647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392839859","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.015091138,0.0005835751,0.8867357,0.014274621,0.0014088317,0.0001192007,0.0006279713,0.0007617056,0.08039731],"genre_scores_gemma":[0.5211457,0.0010805423,0.44911417,0.010085065,0.002134257,0.00035205908,0.0013751101,0.00036295172,0.014350133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960127,0.0014758682,0.00039030454,0.0009485094,0.0009080796,0.00026464227],"domain_scores_gemma":[0.9935256,0.002917719,0.0003484313,0.0016371977,0.0011627743,0.000408148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005359347,0.0009892277,0.0008330664,0.003166307,0.002621638,0.0059446245,0.0030507848,0.003467931,0.015538323],"category_scores_gemma":[0.013365419,0.0011080528,0.002815696,0.0014287117,0.0104402425,0.021058775,0.0059853517,0.007509827,0.0033158958],"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.000036545378,0.000024368395,0.00020229496,0.00008825804,0.00001960623,0.000072324256,0.00024356626,0.0005004342,0.00046638394,0.9874899,0.0037235126,0.007132925],"study_design_scores_gemma":[0.000016295195,0.000013051779,0.00012788472,0.00002837897,0.00001953116,0.000099846446,0.00007753168,0.002568061,0.00039934943,0.98809415,0.008541908,0.000013936809],"about_ca_topic_score_codex":0.0010388567,"about_ca_topic_score_gemma":0.0012001096,"teacher_disagreement_score":0.015538323,"about_ca_system_score_codex":0.0016964677,"about_ca_system_score_gemma":0.001595293,"threshold_uncertainty_score":0.051980913},"labels":[],"label_agreement":null},{"id":"W4393146415","doi":"10.1609/aaai.v38i20.30594","title":"Temporal Logic Explanations for Dynamic Decision Systems Using Anchors and Monte Carlo Tree Search (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reprint; Computer science; Monte Carlo method; Tree (set theory); Computation tree logic; Decision tree; Theoretical computer science; Artificial intelligence; Temporal logic; Mathematics; Statistics; Combinatorics","score_opus":0.1264871103022022,"score_gpt":0.3503657921298592,"score_spread":0.223878681827657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146415","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.02514987,0.00012397187,0.97071046,0.0005047944,0.000027606993,0.000046927766,0.00010999064,0.0002780992,0.0030483005],"genre_scores_gemma":[0.68189996,0.00020423536,0.31526467,0.00013783124,0.0000648549,0.00024648363,0.0002376721,0.0001245881,0.0018196105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00030279442,0.000029599983,0.000051488423,0.0001110377,0.0000402761],"domain_scores_gemma":[0.9932417,0.0058841105,0.00035427394,0.00020178128,0.00020778998,0.00011034054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018681518,0.000530748,0.0006552559,0.0013474307,0.0006700244,0.0012092503,0.0010124433,0.001129973,0.0070223347],"category_scores_gemma":[0.014999219,0.0004364457,0.0011091004,0.00096712646,0.0015094451,0.0018869395,0.0010895914,0.0013955855,0.00034785614],"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.00006152147,0.000034201938,0.0009529281,0.000058183286,0.000029342707,0.00013746048,0.00015258981,0.74391246,0.0003132875,0.23825204,0.00088624714,0.015209846],"study_design_scores_gemma":[0.0000066159864,0.000005505966,0.000047713165,0.0000048134757,0.0000024756746,0.000008071602,0.000009712673,0.93920255,0.000050795777,0.06048424,0.00017439807,0.0000031182906],"about_ca_topic_score_codex":0.006078075,"about_ca_topic_score_gemma":0.007863731,"teacher_disagreement_score":0.0070223347,"about_ca_system_score_codex":0.001485363,"about_ca_system_score_gemma":0.0013128533,"threshold_uncertainty_score":0.023491979},"labels":[],"label_agreement":null},{"id":"W4394855737","doi":"10.3233/ao-230051","title":"From slot mereology to a mereology of slots","year":2024,"lang":"en","type":"article","venue":"Applied Ontology","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Health and Social Services Centre University Institute of Geriatrics of Sherbrooke; Université de Sherbrooke","funders":"","keywords":"Mereology; Computer science; Relation (database); Problem of universals; Core (optical fiber); Epistemology; Mathematical economics; Mathematics; Philosophy; Data mining","score_opus":0.011841549459386426,"score_gpt":0.25526514852083293,"score_spread":0.2434235990614465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394855737","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.04171024,0.017394243,0.61820906,0.01990183,0.0027615523,0.00010061602,0.00039277974,0.0004251381,0.29910457],"genre_scores_gemma":[0.8234664,0.0056655332,0.13661431,0.004110928,0.0021513314,0.0002717603,0.00036240186,0.0004569935,0.026900426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976295,0.001084458,0.0001381749,0.00046198678,0.0005010622,0.00018479074],"domain_scores_gemma":[0.9976567,0.0012208078,0.00017534147,0.0004233222,0.00033482365,0.00018904588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028164817,0.00064417045,0.0007497661,0.002823766,0.002870334,0.005423519,0.0014249465,0.0017548023,0.0065997182],"category_scores_gemma":[0.0054552266,0.0007385954,0.0009829365,0.0023309693,0.019132517,0.022891685,0.004283778,0.004899595,0.0011448631],"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.0000044016665,0.0000017977405,0.00002662447,0.0000146670445,0.0000016651137,0.000016661597,0.0002644671,0.000057337176,0.000057060122,0.99781585,0.00036138677,0.0013781135],"study_design_scores_gemma":[0.0000043074174,0.0000060997777,0.00005338478,0.000023744427,0.0000026226785,0.000054636588,0.00014782736,0.0003834635,0.000085027124,0.98178047,0.017452322,0.000006178965],"about_ca_topic_score_codex":0.0018625009,"about_ca_topic_score_gemma":0.0014166442,"teacher_disagreement_score":0.0065997182,"about_ca_system_score_codex":0.0029439097,"about_ca_system_score_gemma":0.0016009954,"threshold_uncertainty_score":0.022078276},"labels":[],"label_agreement":null},{"id":"W4396512806","doi":"10.1080/01445340.2024.2336404","title":"Ruth Barcan Marcus on the Deduction Theorem in Modal Logic","year":2024,"lang":"en","type":"article","venue":"History and Philosophy of Logic","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":"","keywords":"Modal logic; Normal modal logic; Modal; Mathematics; Sequent calculus; Calculus (dental); Philosophy; Geometry; Medicine; Materials science","score_opus":0.04270484688803463,"score_gpt":0.23177493038561464,"score_spread":0.18907008349758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396512806","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.030021127,0.13396715,0.17941165,0.19789386,0.005535369,0.000086366745,0.00020172639,0.00063909055,0.45224366],"genre_scores_gemma":[0.78152806,0.048358887,0.075466916,0.023078779,0.008364756,0.00019642961,0.0001310719,0.0003401222,0.062534995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982932,0.0007984204,0.000049153146,0.00026355902,0.0004656277,0.00012999128],"domain_scores_gemma":[0.9962225,0.0031163376,0.00011545629,0.00014445641,0.00031351126,0.00008776233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459373,0.00035784254,0.0005325716,0.0015202052,0.003087921,0.0027098814,0.00074322463,0.0014696886,0.003361559],"category_scores_gemma":[0.005366449,0.00039874561,0.0005057872,0.0011426928,0.010769282,0.006529638,0.0020617777,0.003730311,0.0010572069],"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.0000133012,0.000007166391,0.0000468919,0.000040569557,0.0000030716508,0.000048760463,0.00037530946,0.00044457306,0.00012807746,0.9840188,0.007650919,0.007222495],"study_design_scores_gemma":[0.000012514947,0.000012377155,0.00012576871,0.00008603411,0.000006724512,0.00006886714,0.0000833903,0.0015614583,0.00040745467,0.9019929,0.09562179,0.000020758655],"about_ca_topic_score_codex":0.0071035414,"about_ca_topic_score_gemma":0.003736792,"teacher_disagreement_score":0.0071035414,"about_ca_system_score_codex":0.0033943793,"about_ca_system_score_gemma":0.001744115,"threshold_uncertainty_score":0.024628043},"labels":[],"label_agreement":null},{"id":"W4396886716","doi":"10.1109/ieeeconf58110.2023.10520626","title":"Interactions with AI Systems: Trust and Transparency","year":2023,"lang":"en","type":"article","venue":"","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Transparency (behavior); Variety (cybernetics); Trusted Computing; Point (geometry); Training set; Information system; Artificial intelligence; Order (exchange); Data science; Computer security; Machine learning","score_opus":0.01928915303603836,"score_gpt":0.25335289841927305,"score_spread":0.23406374538323468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396886716","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.05338098,0.00080511294,0.8736924,0.023191307,0.00016398002,0.00025777754,0.00014869265,0.00086274254,0.047497],"genre_scores_gemma":[0.93557066,0.00035069426,0.058279015,0.0011826827,0.00013804543,0.00021504365,0.0000888474,0.00023224104,0.0039427946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95435745,0.029281061,0.002307626,0.0033393851,0.008357887,0.00235655],"domain_scores_gemma":[0.85727155,0.09229462,0.013143342,0.024508988,0.009207917,0.0035734547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026085787,0.00094577094,0.0010041164,0.0017491407,0.0045043714,0.01173998,0.0024655717,0.006400818,0.004979025],"category_scores_gemma":[0.09166915,0.0016578994,0.001492234,0.0009667045,0.019213274,0.02313792,0.010870565,0.0085019125,0.0009518394],"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.00014563932,0.000059492122,0.0026924375,0.00017534517,0.000117075055,0.00051534746,0.011833249,0.0150262285,0.0019137623,0.9513817,0.0018364112,0.014303268],"study_design_scores_gemma":[0.00006700182,0.00007514095,0.0007893201,0.00014593847,0.00005668698,0.00033996266,0.0014287236,0.068072334,0.0018960572,0.9100603,0.016983956,0.00008458135],"about_ca_topic_score_codex":0.006675682,"about_ca_topic_score_gemma":0.002346289,"teacher_disagreement_score":0.026085787,"about_ca_system_score_codex":0.0046505453,"about_ca_system_score_gemma":0.004322789,"threshold_uncertainty_score":0.13795644},"labels":[],"label_agreement":null},{"id":"W4399036736","doi":"10.29007/c1jg","title":"A Tool for Reasoning about Trust and Belief","year":2024,"lang":"en","type":"article","venue":"EPiC series in computing","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Trustworthiness; Formalism (music); Belief revision; Focus (optics); Iterated function; Software; Human–computer interaction; Software engineering; Artificial intelligence; Computer security; Programming language; Mathematics","score_opus":0.012455717373192414,"score_gpt":0.2668661751472123,"score_spread":0.2544104577740199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399036736","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.00091959717,0.0000613499,0.9918608,0.00021738028,0.00004323748,0.000097113574,0.00024463926,0.005423148,0.0011327512],"genre_scores_gemma":[0.043533094,0.00014603783,0.95194274,0.00020455073,0.000071995775,0.00032285939,0.00076143164,0.0007701064,0.0022471063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918107,0.0023674478,0.0013886676,0.001340276,0.0025846632,0.0005082823],"domain_scores_gemma":[0.97841966,0.013837209,0.0015454234,0.003619911,0.0019906955,0.000587157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00906287,0.0017203449,0.0017149795,0.0045590536,0.0024099513,0.00831664,0.00462497,0.0034778388,0.013717932],"category_scores_gemma":[0.036075003,0.0021369073,0.00468559,0.0032212392,0.0036896595,0.012079655,0.006099435,0.0049969805,0.003398301],"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.00048733436,0.0002306584,0.0035418419,0.0010707771,0.0003930498,0.0021767665,0.0031518037,0.043300018,0.0047047916,0.68005806,0.02499348,0.23589145],"study_design_scores_gemma":[0.00021366411,0.00014621721,0.00051214045,0.00033550145,0.00026171448,0.0012223403,0.00042648322,0.31797186,0.00951161,0.5510153,0.11822822,0.0001548222],"about_ca_topic_score_codex":0.0057950765,"about_ca_topic_score_gemma":0.00534626,"teacher_disagreement_score":0.013717932,"about_ca_system_score_codex":0.0017601219,"about_ca_system_score_gemma":0.0026411996,"threshold_uncertainty_score":0.047929645},"labels":[],"label_agreement":null},{"id":"W4399127560","doi":"10.1093/oso/9780199277339.002.0005","title":"Preface and Acknowledgements","year":2021,"lang":"en","type":"book-chapter","venue":"","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":"Geography","score_opus":0.020863545486919276,"score_gpt":0.23022099494591577,"score_spread":0.2093574494589965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399127560","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.0021540658,0.013039938,0.0084644705,0.08727661,0.24229799,0.0008506327,0.021809263,0.0021008276,0.6220061],"genre_scores_gemma":[0.019099185,0.007301388,0.004817528,0.022502793,0.04993083,0.0011878426,0.022943923,0.0022072978,0.87000924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968178,0.000717849,0.00032759408,0.0004940328,0.0013601182,0.00028254735],"domain_scores_gemma":[0.98562914,0.003060235,0.0007524599,0.0015758426,0.007889018,0.0010933202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053935,0.0009583155,0.000925701,0.0036895827,0.003562768,0.005087777,0.0021424724,0.0020946166,0.29242352],"category_scores_gemma":[0.033587433,0.0004085725,0.0006755222,0.0029912528,0.0012273121,0.0041854763,0.0044074426,0.004159701,0.22419865],"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.000038948972,0.000016060525,0.00013024747,0.00024655816,0.00000431567,0.00007704554,0.00036680014,0.00004682912,0.00012428121,0.014237021,0.96112424,0.023587678],"study_design_scores_gemma":[0.000003831399,0.000007900634,0.00023789429,0.00019068841,0.0000015807327,0.000044149067,0.00017281086,0.000020619935,0.00004820094,0.0025367986,0.99673057,0.0000050754115],"about_ca_topic_score_codex":0.003721111,"about_ca_topic_score_gemma":0.0024159832,"teacher_disagreement_score":0.29242352,"about_ca_system_score_codex":0.0030644885,"about_ca_system_score_gemma":0.0032157658,"threshold_uncertainty_score":0.97825414},"labels":[],"label_agreement":null},{"id":"W4399157307","doi":"10.1609/icaps.v34i1.31480","title":"JaxPlan and GurobiPlan: Optimization Baselines for Replanning in Discrete and Mixed Discrete-Continuous Probabilistic Domains","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","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 Toronto","funders":"","keywords":"Probabilistic logic; Solver; Computer science; Discrete optimization; Computation; Mathematical optimization; Discrete time and continuous time; Graph; Theoretical computer science; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.025062564619118047,"score_gpt":0.28507919947442417,"score_spread":0.26001663485530613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399157307","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.06075573,0.0025229286,0.85907334,0.0013559924,0.00058047613,0.00039464489,0.0025951972,0.012055766,0.060666062],"genre_scores_gemma":[0.36454663,0.00096788275,0.620433,0.00049399905,0.00006161185,0.00068832067,0.0039745113,0.002639771,0.0061942693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824035,0.0006520956,0.00009045774,0.00026841107,0.00052122585,0.00022749597],"domain_scores_gemma":[0.997447,0.0014522852,0.0001540637,0.0004728501,0.000319653,0.00015418879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022777142,0.0017707716,0.0010063847,0.0009158938,0.0007379766,0.0020140277,0.0019669563,0.0010224875,0.010161357],"category_scores_gemma":[0.007339369,0.0007924802,0.0013201872,0.0012352719,0.0012276056,0.0020210529,0.0021922116,0.003475944,0.0013293618],"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.0002996615,0.00013806559,0.0006604031,0.00039296917,0.0000714238,0.00007585171,0.00007443471,0.8802984,0.0011089201,0.040695515,0.010765041,0.06541933],"study_design_scores_gemma":[0.000074058684,0.00012762178,0.00023185633,0.00006132254,0.000021580337,0.000038001814,0.00005784017,0.97006255,0.0015708703,0.017529698,0.010204511,0.000020075991],"about_ca_topic_score_codex":0.0070692454,"about_ca_topic_score_gemma":0.012358704,"teacher_disagreement_score":0.010161357,"about_ca_system_score_codex":0.0015626462,"about_ca_system_score_gemma":0.003726919,"threshold_uncertainty_score":0.033993185},"labels":[],"label_agreement":null},{"id":"W4399430425","doi":"10.1007/978-3-031-62687-6_3","title":"A Logic of Isolation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Isolation (microbiology)","score_opus":0.01892786101398725,"score_gpt":0.2493618175634031,"score_spread":0.23043395654941584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399430425","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.0073459526,0.00413213,0.20300284,0.008598578,0.00079055363,0.000056829605,0.0003232828,0.0005543642,0.7751955],"genre_scores_gemma":[0.6794052,0.0038695703,0.079905614,0.0059638848,0.001754861,0.00037948313,0.0010295097,0.0009922569,0.22669964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982128,0.00062178413,0.00008903435,0.00052522233,0.00030695813,0.00024412668],"domain_scores_gemma":[0.99859875,0.0006689454,0.00008267028,0.0003502625,0.00018733315,0.00011201428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017060392,0.0009588493,0.0008414095,0.0016142649,0.0038724872,0.0066480213,0.0015704534,0.0018660936,0.02267993],"category_scores_gemma":[0.003653575,0.00084492774,0.0012624586,0.0013011885,0.011848206,0.015736092,0.005618819,0.0063908817,0.0049577854],"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.000007272794,0.0000024933302,0.000019137738,0.000010622256,0.000001751263,0.000010560077,0.00014389734,0.00005672807,0.000054902357,0.99557185,0.0016934081,0.002427315],"study_design_scores_gemma":[0.000006260316,0.000005128384,0.000026620388,0.000015335047,0.000004691864,0.000038346378,0.000098098964,0.00032312836,0.00014278175,0.9690313,0.030304547,0.0000038307394],"about_ca_topic_score_codex":0.0014284219,"about_ca_topic_score_gemma":0.001184935,"teacher_disagreement_score":0.02267993,"about_ca_system_score_codex":0.0021934249,"about_ca_system_score_gemma":0.0011993776,"threshold_uncertainty_score":0.075871885},"labels":[],"label_agreement":null},{"id":"W4400659579","doi":"10.1007/s11225-024-10124-2","title":"A Version of Predicate Logic with Two Variables That has an Incompleteness Property","year":2024,"lang":"en","type":"article","venue":"Studia Logica","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 Prince Edward Island","funders":"İstanbul Medipol Üniversitesi","keywords":"Predicate logic; Predicate (mathematical logic); Computational linguistics; Property (philosophy); Predicate variable; Computer science; Programming language; Mathematics; Theoretical computer science; Natural language processing; Discrete mathematics; Multimodal logic; Description logic; Zeroth-order logic; Philosophy; Epistemology","score_opus":0.055339915041323066,"score_gpt":0.2630611017842904,"score_spread":0.2077211867429673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400659579","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.37636498,0.0005067161,0.54310346,0.0030797096,0.00040703279,0.00024753538,0.0010630491,0.0013935955,0.073833995],"genre_scores_gemma":[0.9419135,0.0001378306,0.051695526,0.0005154936,0.00019303375,0.00007043244,0.00039397553,0.000069806796,0.005010466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974952,0.00055555906,0.00017231156,0.00051721703,0.0007466964,0.0005131783],"domain_scores_gemma":[0.9959472,0.0014782326,0.0003845469,0.0012277263,0.0005904959,0.0003717969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033061474,0.00047677802,0.0008617489,0.0009568836,0.0015511387,0.004737347,0.002004384,0.001374606,0.0036178452],"category_scores_gemma":[0.0039933077,0.0005297874,0.0015922323,0.0013678219,0.0055393893,0.008340206,0.0027166437,0.0034662243,0.00032646907],"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.00007305637,0.00004079588,0.00028450295,0.000041270552,0.000023773255,0.00025979226,0.00018628768,0.0051353704,0.0020322166,0.98929495,0.0005566702,0.0020712414],"study_design_scores_gemma":[0.00016732134,0.0000895335,0.0004946332,0.000020351472,0.00007548967,0.00027908882,0.00014259778,0.04649161,0.004803111,0.9353398,0.012039563,0.000056931098],"about_ca_topic_score_codex":0.0034846228,"about_ca_topic_score_gemma":0.0028997327,"teacher_disagreement_score":0.004737347,"about_ca_system_score_codex":0.0023294452,"about_ca_system_score_gemma":0.0017162054,"threshold_uncertainty_score":0.017484784},"labels":[],"label_agreement":null},{"id":"W4400843283","doi":"10.1007/978-3-031-57785-7_45","title":"Towards Reflective Normative Agents","year":2024,"lang":"en","type":"book-chapter","venue":"Springer proceedings in complexity","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Normative; Sociology; Computer science; Psychology; Epistemology; Philosophy","score_opus":0.07392526747235861,"score_gpt":0.3006956738911295,"score_spread":0.2267704064187709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400843283","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.008452435,0.0017979933,0.7790281,0.008512455,0.0008200413,0.0001085912,0.00011491698,0.0016126448,0.1995529],"genre_scores_gemma":[0.34107178,0.0024907396,0.5101181,0.0020783995,0.0006970728,0.000418148,0.00063674216,0.0012023995,0.1412866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714905,0.0013885308,0.0001274123,0.00040959142,0.00073447387,0.00019092171],"domain_scores_gemma":[0.9953916,0.0020291815,0.00017173482,0.0014303083,0.0007165103,0.00026072655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005201856,0.00083028595,0.0006540402,0.0010436868,0.001839285,0.008255689,0.0017780741,0.0024155555,0.011408283],"category_scores_gemma":[0.01149897,0.0010079526,0.0007630352,0.0010232364,0.0047066207,0.012403343,0.005249663,0.005168089,0.0041228505],"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.000012532975,0.000017507575,0.0000625153,0.000023724011,0.000004410289,0.000027473607,0.0005891291,0.0007831434,0.00029384575,0.9748512,0.0051522106,0.018182335],"study_design_scores_gemma":[0.000007440804,0.0000056997765,0.000021538692,0.00003124723,0.0000051258994,0.000026452875,0.00020824604,0.006222248,0.0006205705,0.9395862,0.053260144,0.0000050546173],"about_ca_topic_score_codex":0.0016735364,"about_ca_topic_score_gemma":0.002363821,"teacher_disagreement_score":0.011408283,"about_ca_system_score_codex":0.0017905494,"about_ca_system_score_gemma":0.0016284945,"threshold_uncertainty_score":0.038164437},"labels":[],"label_agreement":null},{"id":"W4401797277","doi":"10.1093/jos/ffae002","title":"Co-predications and the quantificational force of summative predicates","year":2024,"lang":"en","type":"article","venue":"Journal of Semantics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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 Calgary","funders":"Social Sciences and Humanities Research Council of Canada; University of Calgary","keywords":"Summative assessment; Linguistics; Computer science; Philosophy; Mathematics; Mathematics education; Formative assessment","score_opus":0.015507551855133757,"score_gpt":0.2792327989883482,"score_spread":0.26372524713321444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401797277","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.52543014,0.0018745168,0.27508822,0.006493807,0.00027554913,0.00009227953,0.00038716593,0.0005548018,0.18980354],"genre_scores_gemma":[0.9936603,0.000107934145,0.0043194843,0.00017061066,0.000096067764,0.000020936865,0.00004434634,0.00004233697,0.0015379897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967386,0.0012311992,0.00020697007,0.0006134052,0.0008440172,0.00036580412],"domain_scores_gemma":[0.9899476,0.0068105995,0.0009875863,0.0009336022,0.0010201621,0.00030031323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052159796,0.00047828906,0.0005716831,0.0017686564,0.0028301468,0.002607238,0.0008387483,0.001049653,0.0040928307],"category_scores_gemma":[0.00930741,0.00052122003,0.00068758475,0.0013806275,0.013329386,0.013143538,0.0054982547,0.0020519998,0.00033041282],"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.00007144224,0.000018707286,0.0015022161,0.00006565757,0.000029631747,0.00020880246,0.0036381222,0.00033243792,0.0022123293,0.98511744,0.00057141285,0.006231874],"study_design_scores_gemma":[0.00002645188,0.000037548692,0.0038200058,0.00007087909,0.00008355477,0.00029689056,0.001978462,0.0032157174,0.005336893,0.9720462,0.013047816,0.000039699356],"about_ca_topic_score_codex":0.0016864906,"about_ca_topic_score_gemma":0.0013415624,"teacher_disagreement_score":0.0052159796,"about_ca_system_score_codex":0.0018422665,"about_ca_system_score_gemma":0.00071464956,"threshold_uncertainty_score":0.02758503},"labels":[],"label_agreement":null},{"id":"W4402335827","doi":"10.1093/jigpal/jzae095","title":"Inferential knowledge and epistemic dimensions","year":2024,"lang":"en","type":"article","venue":"Logic Journal of IGPL","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":"Université de Sherbrooke","funders":"","keywords":"Epistemology; Sociology; Computer science; Psychology; Philosophy","score_opus":0.01869178174858316,"score_gpt":0.2747428607044279,"score_spread":0.2560510789558447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402335827","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.08264076,0.0046579232,0.5290675,0.02462836,0.00032606916,0.00012418657,0.00044517266,0.00037599774,0.35773402],"genre_scores_gemma":[0.9571236,0.00092833117,0.036836036,0.00065778964,0.00028146582,0.00009346342,0.00014093256,0.00004559264,0.0038927963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897942,0.0049165115,0.0007741587,0.0015795834,0.0022667525,0.0006687341],"domain_scores_gemma":[0.9821691,0.011804599,0.0012841381,0.0025004677,0.0016113638,0.0006303912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010156639,0.00067422265,0.00081313064,0.0047131567,0.0032777134,0.009614859,0.0018474408,0.0027524987,0.0051155444],"category_scores_gemma":[0.015900988,0.0006625285,0.0011733974,0.003216946,0.03693728,0.024396643,0.0076404423,0.0048698015,0.00040052267],"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.000003383635,0.0000026924208,0.000042385625,0.00001220756,0.0000033335791,0.000015806498,0.00030957142,0.00025219083,0.000023355165,0.99833494,0.00008302993,0.00091703],"study_design_scores_gemma":[0.0000029320545,0.0000016634356,0.00003080755,0.0000119813285,0.000003409342,0.00001226623,0.000109044595,0.00057834253,0.000035956622,0.99736375,0.0018468533,0.0000029280584],"about_ca_topic_score_codex":0.0029436524,"about_ca_topic_score_gemma":0.0015767451,"teacher_disagreement_score":0.010156639,"about_ca_system_score_codex":0.006520571,"about_ca_system_score_gemma":0.0018073707,"threshold_uncertainty_score":0.053714097},"labels":[],"label_agreement":null},{"id":"W4402475555","doi":"10.1109/ccece59415.2024.10667093","title":"Belief Revision for Physical Robots: Opportunities and Challenges","year":2024,"lang":"en","type":"article","venue":"","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":"British Columbia Institute of Technology","funders":"","keywords":"Robot; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.11244263638288064,"score_gpt":0.2967391672280979,"score_spread":0.18429653084521724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475555","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.038914822,0.0047201375,0.9186876,0.024234291,0.0003553767,0.00012906882,0.0000893085,0.0005658034,0.012303717],"genre_scores_gemma":[0.74231905,0.0028650705,0.24816474,0.001446132,0.0005814363,0.0003155955,0.00012217813,0.00012204909,0.0040636775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905868,0.0059844516,0.00028134676,0.0008297332,0.0018056808,0.00051195803],"domain_scores_gemma":[0.9641757,0.028432982,0.0012158223,0.0031388677,0.0020264674,0.0010101596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012826653,0.0006836737,0.0014705313,0.0007242516,0.001282623,0.0051502697,0.0039028986,0.0029920992,0.0038897162],"category_scores_gemma":[0.027590053,0.0006686068,0.0015416536,0.00091469305,0.006930849,0.008041343,0.0035059766,0.005048982,0.0005872924],"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.00016692358,0.00019730137,0.0010694072,0.00055738096,0.00010902836,0.00024103127,0.0013063878,0.06898751,0.001969705,0.8490475,0.003989558,0.07235828],"study_design_scores_gemma":[0.00009575107,0.00012150645,0.00029235825,0.000096750315,0.000025513522,0.00010511566,0.0003879232,0.24955127,0.0010974063,0.7392984,0.008880708,0.00004727783],"about_ca_topic_score_codex":0.0027093338,"about_ca_topic_score_gemma":0.002013128,"teacher_disagreement_score":0.012826653,"about_ca_system_score_codex":0.0026243513,"about_ca_system_score_gemma":0.0022918514,"threshold_uncertainty_score":0.067834616},"labels":[],"label_agreement":null},{"id":"W4402670593","doi":"10.18653/v1/2024.repl4nlp-1.14","title":"QAVSA: Question Answering using Vector Symbolic Algebras","year":2024,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Question answering; Computer science; Vector (molecular biology); Information retrieval; Chemistry","score_opus":0.02093743097716264,"score_gpt":0.2782669546037996,"score_spread":0.2573295236266369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402670593","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.0062080245,0.000744736,0.8994569,0.00092061196,0.0003585537,0.00047087914,0.008594177,0.069899924,0.013346105],"genre_scores_gemma":[0.2537002,0.001645521,0.6834775,0.0011017661,0.0003964187,0.00105281,0.034974664,0.0072955135,0.01635555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99718297,0.0008732769,0.00027260228,0.00053800904,0.0009201577,0.00021299967],"domain_scores_gemma":[0.9970176,0.0015722975,0.000120415665,0.0006900815,0.00046141294,0.00013819581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019929525,0.0012246543,0.001417327,0.0029124026,0.0012631232,0.0052019646,0.0033216765,0.0016295359,0.03809746],"category_scores_gemma":[0.010815959,0.0010062659,0.0031566368,0.0026246533,0.001655435,0.010886106,0.0057482515,0.0028108614,0.011760086],"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.0007985308,0.00033434894,0.0014911961,0.0013684129,0.00025254185,0.0002552249,0.00084545405,0.018452095,0.0076178033,0.44711304,0.11021102,0.4112603],"study_design_scores_gemma":[0.00017738658,0.00008924425,0.00044382756,0.00021578827,0.00011873653,0.00017929707,0.00031972246,0.25109997,0.0098006055,0.6307182,0.1067452,0.00009200395],"about_ca_topic_score_codex":0.007541161,"about_ca_topic_score_gemma":0.00809481,"teacher_disagreement_score":0.03809746,"about_ca_system_score_codex":0.0014379224,"about_ca_system_score_gemma":0.0024384917,"threshold_uncertainty_score":0.12744874},"labels":[],"label_agreement":null},{"id":"W4402811239","doi":"10.1109/tie.2024.3451055","title":"Global Temporal Logic Control Synthesis for Multiagent Systems With Time and Space Margin","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Temporal logic; Computer science; Margin (machine learning); Multi-agent system; Control (management); Control system; Control engineering; Control theory (sociology); Artificial intelligence; Engineering; Theoretical computer science; Machine learning; Electrical engineering","score_opus":0.02125511119863892,"score_gpt":0.23826119813306526,"score_spread":0.21700608693442633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811239","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.0064824824,0.00014179664,0.9892972,0.00007543981,0.000021445096,0.000029880064,0.000024990335,0.00012794948,0.0037988517],"genre_scores_gemma":[0.81619084,0.000344589,0.17964803,0.00009151962,0.00004944379,0.00019374999,0.00012386501,0.00006629865,0.003291701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995079,0.00009322756,0.00002751072,0.00012641952,0.00017142462,0.00007349301],"domain_scores_gemma":[0.999572,0.00018500528,0.0000943931,0.000040996063,0.000078411584,0.000029248704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075567164,0.0010353852,0.0005651305,0.00038924636,0.00049319584,0.0014130359,0.0007780441,0.0005213783,0.0022282838],"category_scores_gemma":[0.0012220761,0.00027140498,0.00071970513,0.00045708907,0.00081672176,0.001004713,0.0011976155,0.0009849693,0.0002633764],"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.000045942685,0.000019546414,0.00017983155,0.000105318526,0.00001794513,0.00011796634,0.00008633845,0.9292654,0.0048137787,0.037208773,0.00043424612,0.027704952],"study_design_scores_gemma":[0.0000070565384,0.000037252554,0.0000392473,0.0000074815543,0.0000066456582,0.000014958279,0.000013444636,0.988118,0.0010283696,0.009776021,0.00094779325,0.0000037291707],"about_ca_topic_score_codex":0.0034539949,"about_ca_topic_score_gemma":0.0032836152,"teacher_disagreement_score":0.0034539949,"about_ca_system_score_codex":0.0009199629,"about_ca_system_score_gemma":0.0012683657,"threshold_uncertainty_score":0.0074543953},"labels":[],"label_agreement":null},{"id":"W4403078881","doi":"10.1007/978-3-031-57635-5_6","title":"Entailment, Mingle and Binary Accessibility","year":2024,"lang":"en","type":"book-chapter","venue":"Outstanding contributions to logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Logical consequence; Binary number; Textual entailment; Computer science; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.02701303931922408,"score_gpt":0.3029527247962412,"score_spread":0.2759396854770171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403078881","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.021160875,0.050626155,0.22524348,0.010059345,0.0011256707,0.000041062893,0.00027470101,0.00046685635,0.69100195],"genre_scores_gemma":[0.65331256,0.02493904,0.080804974,0.0018566183,0.0031185083,0.0001399539,0.00052353065,0.00031126474,0.23499355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.00018284319,0.000031155556,0.00011765063,0.00017802484,0.00005243218],"domain_scores_gemma":[0.9990402,0.00069762423,0.000044627366,0.000110293484,0.00007621272,0.000031012216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073489745,0.0004272755,0.00050769973,0.0010300748,0.0013568896,0.002888864,0.0007382238,0.0011776917,0.011095158],"category_scores_gemma":[0.0027925477,0.00034831424,0.00046452577,0.0014388813,0.004994319,0.008173745,0.001610362,0.0025686047,0.0016457747],"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.000007425868,0.0000043701534,0.000031491767,0.00003815114,0.0000015874388,0.00001686107,0.0001319713,0.000139444,0.00009754015,0.9856221,0.003525241,0.010383848],"study_design_scores_gemma":[0.0000020325394,0.0000022366207,0.00003932911,0.00001563142,0.0000016646536,0.00003541833,0.000026903223,0.00032001562,0.00009531047,0.98089725,0.01856206,0.0000021583182],"about_ca_topic_score_codex":0.0011560847,"about_ca_topic_score_gemma":0.0013512508,"teacher_disagreement_score":0.011095158,"about_ca_system_score_codex":0.0013164011,"about_ca_system_score_gemma":0.00065398443,"threshold_uncertainty_score":0.037117004},"labels":[],"label_agreement":null},{"id":"W4403305186","doi":"10.1017/9781009302180.033","title":"Reductions and NP-Completeness","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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":"York University","funders":"","keywords":"Completeness (order theory); Computer science; Mathematics","score_opus":0.024820149176009155,"score_gpt":0.1991924170989158,"score_spread":0.17437226792290664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305186","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.0025833345,0.013468347,0.21930034,0.011494809,0.0014433679,0.00012805877,0.00088436436,0.0013659714,0.74933136],"genre_scores_gemma":[0.096777946,0.028213203,0.3022824,0.009552594,0.0019814728,0.0010656612,0.004602223,0.0023958131,0.55312866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989793,0.00024062552,0.00006428358,0.00021170847,0.00042724784,0.00007678863],"domain_scores_gemma":[0.9991404,0.00048714827,0.000030471938,0.00014480107,0.0001678972,0.00002919133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009939934,0.00085917115,0.0006200741,0.0010877977,0.0011459428,0.0031363443,0.0012633475,0.00097480416,0.032446988],"category_scores_gemma":[0.003912195,0.00050492736,0.0011212213,0.0012742856,0.0027773,0.0061326087,0.0020803546,0.0050775507,0.014723272],"study_design_candidate":"not_applicable","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.000011293864,0.000019647076,0.00006504087,0.00023787469,0.000012869909,0.000038434766,0.00031041162,0.0012533184,0.00032578918,0.78862435,0.12335153,0.08574941],"study_design_scores_gemma":[0.0000051771704,0.000009499127,0.00015706502,0.00015996915,0.000005265459,0.00011321388,0.000094191804,0.0011607648,0.00035088768,0.67382014,0.32411355,0.000010336014],"about_ca_topic_score_codex":0.0018584171,"about_ca_topic_score_gemma":0.0020015675,"teacher_disagreement_score":0.032446988,"about_ca_system_score_codex":0.002161069,"about_ca_system_score_gemma":0.0013742063,"threshold_uncertainty_score":0.10854596},"labels":[],"label_agreement":null},{"id":"W4403810684","doi":"10.1017/s1471068424000255","title":"On the Foundations of Conflict-Driven Solving for Hybrid MKNF Knowledge Bases","year":2024,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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 Alberta","funders":"","keywords":"Computer science","score_opus":0.05358612368344712,"score_gpt":0.34159100617334537,"score_spread":0.28800488248989825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403810684","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.015328112,0.0001974284,0.97484595,0.0013465438,0.000037675018,0.00018016374,0.0001790048,0.00024353011,0.007641632],"genre_scores_gemma":[0.32972503,0.0003061436,0.66584146,0.0005350933,0.00010859433,0.00039875606,0.00064695865,0.00011156136,0.0023263418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926999,0.0028982053,0.00055634364,0.0008181319,0.0023729193,0.00065448496],"domain_scores_gemma":[0.9758197,0.018758163,0.00095414004,0.0016232203,0.0023426816,0.00050202967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008696602,0.0006638292,0.00094925286,0.0024836631,0.0018835085,0.0048447656,0.00422014,0.0019309875,0.0054976135],"category_scores_gemma":[0.032507356,0.0009958944,0.0024347873,0.0025802352,0.0064557316,0.0066436487,0.0076107658,0.0045328126,0.00063452206],"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.000045899662,0.000081693535,0.0004439411,0.00013739002,0.000043847827,0.00016092096,0.0006104182,0.07516523,0.0005656434,0.90153044,0.001006518,0.020208184],"study_design_scores_gemma":[0.000018786985,0.000012781211,0.00005130997,0.000051701107,0.000015775511,0.000039715535,0.00011592084,0.21463527,0.00053326256,0.7824397,0.0020710474,0.000014725963],"about_ca_topic_score_codex":0.009514403,"about_ca_topic_score_gemma":0.009578245,"teacher_disagreement_score":0.009514403,"about_ca_system_score_codex":0.003183874,"about_ca_system_score_gemma":0.0031612257,"threshold_uncertainty_score":0.045992553},"labels":[],"label_agreement":null},{"id":"W4404342313","doi":"10.1145/3704855","title":"A Demonic Outcome Logic for Randomized Nondeterminism","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Outcome (game theory); Computer science; Psychology; Mathematics; Mathematical economics","score_opus":0.019886649650894858,"score_gpt":0.3124885896815581,"score_spread":0.29260194003066325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404342313","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.010963749,0.00021084421,0.9661065,0.0019253092,0.000112788446,0.00013084986,0.0003308086,0.00078566023,0.0194335],"genre_scores_gemma":[0.52255857,0.0005074151,0.46045986,0.0025513605,0.0003591805,0.000581207,0.000673982,0.00036293577,0.011945398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940895,0.0022142793,0.00045623953,0.0011287499,0.0015004697,0.0006107591],"domain_scores_gemma":[0.9926732,0.0046378304,0.0005077674,0.0009521308,0.00090210093,0.0003269172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072317813,0.0007955768,0.0005940755,0.0018922602,0.0019994646,0.004010438,0.0023424816,0.0017833929,0.0063850344],"category_scores_gemma":[0.013131996,0.0006541693,0.0021843142,0.0012702649,0.0067537935,0.008059536,0.003945536,0.0046991236,0.00091804273],"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.000020748928,0.000012380514,0.00015801677,0.000029102493,0.000007999896,0.00005809,0.000115462535,0.0034260554,0.00037988005,0.9904937,0.0005796264,0.004718916],"study_design_scores_gemma":[0.000019799752,0.000020696287,0.00006665887,0.00003201147,0.00001962088,0.00005903644,0.00004249045,0.035659257,0.0013023515,0.9567988,0.005959263,0.00002002986],"about_ca_topic_score_codex":0.0032850448,"about_ca_topic_score_gemma":0.0035308392,"teacher_disagreement_score":0.0072317813,"about_ca_system_score_codex":0.0036549328,"about_ca_system_score_gemma":0.0023580606,"threshold_uncertainty_score":0.038245797},"labels":[],"label_agreement":null},{"id":"W4404357958","doi":"10.1515/tlr-2024-2022","title":"Proleptic objects as complex-NPs","year":2024,"lang":"en","type":"article","venue":"The Linguistic Review","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":"Linguistics; Computer science; Philosophy","score_opus":0.036985340849780446,"score_gpt":0.31689485942435197,"score_spread":0.2799095185745715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404357958","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.22953245,0.0013755269,0.273226,0.0032865475,0.00020688072,0.00021393324,0.0011823348,0.0016545589,0.48932168],"genre_scores_gemma":[0.9384197,0.00040850646,0.033448894,0.00045307673,0.0001439671,0.00012484362,0.0007859013,0.0005810986,0.025633974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990357,0.00030003424,0.000061336315,0.00024263289,0.0002564379,0.00010386473],"domain_scores_gemma":[0.99863964,0.00072191405,0.00014615741,0.00025728185,0.00016557827,0.000069421156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013420352,0.0005534941,0.0004320516,0.001477677,0.0016129429,0.0063326564,0.0010858492,0.0012741534,0.011080413],"category_scores_gemma":[0.0026358613,0.00064807985,0.0004531937,0.0015137835,0.004691988,0.011970935,0.0035815497,0.0022314016,0.0017655425],"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.00001772287,0.0000058414125,0.00019988454,0.000028521887,0.0000035994042,0.00013111549,0.001941935,0.0001747809,0.00059711793,0.9919154,0.00065209216,0.0043319664],"study_design_scores_gemma":[0.00003988158,0.000030317053,0.0010863069,0.00009339877,0.000023387,0.0003845734,0.0019367067,0.0045967884,0.0022293632,0.89089966,0.0986499,0.00002986525],"about_ca_topic_score_codex":0.001998285,"about_ca_topic_score_gemma":0.0017960115,"teacher_disagreement_score":0.011080413,"about_ca_system_score_codex":0.0027325451,"about_ca_system_score_gemma":0.0007738316,"threshold_uncertainty_score":0.03706765},"labels":[],"label_agreement":null},{"id":"W4406156260","doi":"10.22329/il.v44i4.8801","title":"Arguing About Arguing with Arguments","year":2025,"lang":"fr","type":"article","venue":"Informal Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Epistemology; Sociology; Philosophy; Law and economics","score_opus":0.019011983806611624,"score_gpt":0.2596107137166605,"score_spread":0.24059872991004888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406156260","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.03596884,0.013896189,0.21735221,0.18607618,0.0038760796,0.00022135284,0.00041777827,0.0006675951,0.5415239],"genre_scores_gemma":[0.9005422,0.0046882867,0.04103999,0.01595584,0.002398669,0.0003823409,0.0003805145,0.00043919962,0.03417298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9514408,0.038592227,0.0015597778,0.0027800503,0.0040995404,0.0015276242],"domain_scores_gemma":[0.93437517,0.051555544,0.0034758863,0.004888112,0.004229897,0.0014753663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042320997,0.0010551558,0.0013674977,0.004205947,0.0072980816,0.017518887,0.0033956955,0.0098166,0.018138966],"category_scores_gemma":[0.058319755,0.0007870729,0.0019104787,0.003753689,0.035524264,0.026400672,0.008897375,0.010308149,0.0030190255],"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.000018326975,0.000006352773,0.000117142,0.00008222186,0.000015085685,0.00011057198,0.0032092826,0.00016644203,0.00004606153,0.98992354,0.004541697,0.0017632411],"study_design_scores_gemma":[0.00003556916,0.000010176253,0.00010344095,0.00038177884,0.000021000018,0.000105486266,0.0023371526,0.0010444437,0.00019051757,0.9377816,0.057973087,0.000015821559],"about_ca_topic_score_codex":0.0013743816,"about_ca_topic_score_gemma":0.0010080544,"teacher_disagreement_score":0.042320997,"about_ca_system_score_codex":0.009412336,"about_ca_system_score_gemma":0.003972083,"threshold_uncertainty_score":0.22381747},"labels":[],"label_agreement":null},{"id":"W4406809796","doi":"10.1007/s10472-024-09963-5","title":"Filters-based revision","year":2025,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Complex system; Computer science; Mathematics; Artificial intelligence","score_opus":0.11128949519799006,"score_gpt":0.3573216929110658,"score_spread":0.24603219771307575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406809796","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.06525951,0.0027025512,0.78853506,0.0070557026,0.0019859564,0.00017898284,0.00073640805,0.0019430082,0.13160278],"genre_scores_gemma":[0.8166209,0.0011580688,0.10712546,0.0017595745,0.0020344907,0.00019525607,0.00079237844,0.00079969224,0.0695142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940124,0.0017855316,0.00047052765,0.0015380527,0.0015321295,0.0006613285],"domain_scores_gemma":[0.9754547,0.012008655,0.000991613,0.00567833,0.0047600605,0.0011066252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054831086,0.001052165,0.0023027041,0.0032653396,0.0027585707,0.006155459,0.0025401819,0.0026118837,0.017897334],"category_scores_gemma":[0.02637189,0.0010008052,0.003044348,0.0016369722,0.004567219,0.012419943,0.004587943,0.0046876036,0.0028782866],"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.00014964645,0.000042138206,0.00033117773,0.000064556756,0.00005290242,0.00009278512,0.00023076437,0.0018622399,0.0008655592,0.9700514,0.0052299355,0.021026991],"study_design_scores_gemma":[0.000032066793,0.00002864936,0.00016596948,0.000017529845,0.00003275534,0.00012581423,0.000039183986,0.018739093,0.0006753526,0.97518027,0.0049369647,0.00002641108],"about_ca_topic_score_codex":0.0018089793,"about_ca_topic_score_gemma":0.0016417978,"teacher_disagreement_score":0.017897334,"about_ca_system_score_codex":0.002757945,"about_ca_system_score_gemma":0.0016729851,"threshold_uncertainty_score":0.059872568},"labels":[],"label_agreement":null},{"id":"W4406983107","doi":"10.1073/pnas.2416866122","title":"Errors are robustly tamed in cumulative knowledge processes","year":2025,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Toronto Metropolitan University","funders":"Army Research Office; Office of Naval Research; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Heuristics; Computer science; Simple (philosophy); Probabilistic logic; Adversarial system; Bounded function; Fraction (chemistry); Process (computing); Theoretical computer science; Artificial intelligence; Mathematics; Epistemology; Programming language","score_opus":0.051741606055110814,"score_gpt":0.32887875053537685,"score_spread":0.27713714448026605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406983107","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.13810432,0.0004534505,0.84793115,0.0033380943,0.00008946008,0.00015846286,0.00015286429,0.0014037685,0.008368523],"genre_scores_gemma":[0.9228298,0.00030762807,0.07278021,0.0005207887,0.00013582593,0.00019293383,0.00012219048,0.00023962028,0.0028708824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97094953,0.009187211,0.0017919303,0.0078939665,0.008038759,0.0021384654],"domain_scores_gemma":[0.73207533,0.16080195,0.023895225,0.06876306,0.011275693,0.003188874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030261679,0.001513682,0.0022121798,0.0036038375,0.0030766565,0.0074642003,0.005106895,0.004771793,0.003213173],"category_scores_gemma":[0.20391831,0.0016567996,0.0028805262,0.0019279189,0.015446647,0.02214889,0.013634353,0.0056161713,0.0009362168],"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.00037057314,0.00011570079,0.005211118,0.000254706,0.00027813416,0.0009260818,0.003677958,0.13912395,0.0032809866,0.8033821,0.0013204596,0.04205828],"study_design_scores_gemma":[0.00005531187,0.00007765813,0.00044316542,0.00006279993,0.000122391,0.00022816224,0.00020633373,0.16834766,0.0041572205,0.82416666,0.0020652243,0.000067481364],"about_ca_topic_score_codex":0.0038513879,"about_ca_topic_score_gemma":0.0016224007,"teacher_disagreement_score":0.030261679,"about_ca_system_score_codex":0.004034146,"about_ca_system_score_gemma":0.002712193,"threshold_uncertainty_score":0.16004097},"labels":[],"label_agreement":null},{"id":"W4407806798","doi":"","title":"Projective Unification in Bi-Intuitionistic Logic","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Unification; Projective test; Pure mathematics; Mathematics; Intuitionistic logic; Algebra over a field; Discrete mathematics; Computer science; Programming language; Propositional calculus","score_opus":0.01946749088075536,"score_gpt":0.24979305486360606,"score_spread":0.2303255639828507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407806798","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.17474596,0.0016111159,0.75237656,0.0018338031,0.00027486295,0.00015691596,0.00055417453,0.0013035871,0.06714304],"genre_scores_gemma":[0.8598584,0.0007093763,0.13115878,0.0005648596,0.00021286972,0.00015997319,0.00046751153,0.0001068684,0.0067614093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997241,0.0007045395,0.00022542759,0.00046798814,0.0009748968,0.00038609208],"domain_scores_gemma":[0.9984074,0.00058759423,0.00016602862,0.00034780338,0.00034531238,0.00014584471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024815765,0.0005183146,0.0006528159,0.001399669,0.0019316504,0.0031180067,0.0012818426,0.0009558708,0.0028831393],"category_scores_gemma":[0.0033897706,0.00084505865,0.00153971,0.0016133969,0.004452821,0.00733782,0.0045472835,0.0035172747,0.00061911985],"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.000021895483,0.000013912241,0.00014845231,0.00003696853,0.0000114105505,0.00010876104,0.0002482791,0.0012074205,0.0009220246,0.9932213,0.00033172604,0.003727724],"study_design_scores_gemma":[0.000018753348,0.000019176645,0.00023002703,0.000019754587,0.000021758768,0.00010212616,0.00006553301,0.010537393,0.0013862936,0.9831744,0.0044039683,0.000020787047],"about_ca_topic_score_codex":0.0028840906,"about_ca_topic_score_gemma":0.0018310822,"teacher_disagreement_score":0.0031180067,"about_ca_system_score_codex":0.0019383433,"about_ca_system_score_gemma":0.0013958771,"threshold_uncertainty_score":0.014063716},"labels":[],"label_agreement":null},{"id":"W4407950102","doi":"10.1109/cdc56724.2024.10886233","title":"Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability","year":2024,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":false,"ca_institutions":"Simon Fraser University","funders":"VINNOVA","keywords":"Reachability; Computer science; Temporal logic; Theoretical computer science","score_opus":0.03323454111551459,"score_gpt":0.2719200633502986,"score_spread":0.238685522234784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407950102","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.01233668,0.00007407508,0.98300856,0.00015896656,0.000022550725,0.00010012318,0.00016979275,0.0012754437,0.0028537447],"genre_scores_gemma":[0.49187863,0.00023900026,0.50330424,0.00024334101,0.000037096812,0.00034601023,0.00062576134,0.00047091217,0.0028548676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978079,0.00040043957,0.00012079025,0.0003774726,0.0009665003,0.00032699262],"domain_scores_gemma":[0.99506336,0.003174492,0.00043414396,0.00052498165,0.00064768747,0.00015529101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019744788,0.0010818291,0.00073204626,0.0011459952,0.0009841556,0.0016308321,0.0014919526,0.0010402586,0.0039027708],"category_scores_gemma":[0.009737953,0.00061165274,0.0018731912,0.0007103413,0.0020526424,0.0025882921,0.0019937218,0.0022683137,0.0006449073],"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.00023678112,0.000114453695,0.0014211842,0.00029487538,0.00007384923,0.00034568598,0.00026891977,0.7165583,0.010900854,0.20079422,0.0021126536,0.06687822],"study_design_scores_gemma":[0.000026761687,0.000046285622,0.00012598367,0.000027925134,0.000016249705,0.000044259148,0.000025015748,0.8905689,0.004840533,0.102692336,0.0015681792,0.000017533077],"about_ca_topic_score_codex":0.012281579,"about_ca_topic_score_gemma":0.014382586,"teacher_disagreement_score":0.012281579,"about_ca_system_score_codex":0.0020390092,"about_ca_system_score_gemma":0.005042375,"threshold_uncertainty_score":0.024420142},"labels":[],"label_agreement":null},{"id":"W4409361880","doi":"10.1609/aaai.v39i25.34860","title":"On Shallow Planning Under Partial Observability","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Université Laval","funders":"Canadian Institute for Advanced Research","keywords":"Observability; Geology; Environmental science; Mathematics; Applied mathematics","score_opus":0.10194769705417127,"score_gpt":0.3230137919969241,"score_spread":0.2210660949427528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361880","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.0366607,0.00038364358,0.95704144,0.0011539201,0.000037726855,0.00004723847,0.00011271605,0.0002134396,0.0043491754],"genre_scores_gemma":[0.86276644,0.000705899,0.13287652,0.00036154746,0.00009641868,0.00013167715,0.00015814538,0.00012190532,0.0027815413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984464,0.0006527831,0.00008725545,0.00026723425,0.00028881303,0.00025749614],"domain_scores_gemma":[0.9862716,0.011435331,0.0007316595,0.00060167135,0.00054639496,0.00041339628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032409392,0.000884901,0.0011761793,0.0005741767,0.00047669807,0.0014388821,0.0010932164,0.0012756353,0.0038812025],"category_scores_gemma":[0.021213865,0.00078498345,0.0008514451,0.00062601094,0.002733902,0.0040846677,0.0026220232,0.0026295446,0.00023360692],"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.00013819503,0.000030389745,0.0006660708,0.00013784583,0.00004161073,0.00015802067,0.00016921596,0.7783004,0.00145202,0.1998794,0.0005289535,0.018497916],"study_design_scores_gemma":[0.000018514706,0.000033709315,0.00015754304,0.000022849947,0.000010167839,0.0000147750825,0.000013560189,0.7459998,0.00024733358,0.25317925,0.00029235464,0.0000101207825],"about_ca_topic_score_codex":0.008525495,"about_ca_topic_score_gemma":0.0077427225,"teacher_disagreement_score":0.008525495,"about_ca_system_score_codex":0.002392391,"about_ca_system_score_gemma":0.0025470657,"threshold_uncertainty_score":0.017358124},"labels":[],"label_agreement":null},{"id":"W4409382651","doi":"10.1016/j.jfranklin.2025.107688","title":"Multi-agent control synthesis from global temporal logic tasks with synchronous satisfaction requirements","year":2025,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Control (management); Computer science; Temporal logic; Linear temporal logic; Distributed computing; Artificial intelligence; Theoretical computer science","score_opus":0.01958216101172061,"score_gpt":0.26598155602445417,"score_spread":0.24639939501273356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409382651","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.03630432,0.0000557631,0.9570968,0.00013090072,0.000025450181,0.000114138034,0.00005098064,0.0003680712,0.0058536255],"genre_scores_gemma":[0.8397362,0.00007266686,0.15671751,0.00006619246,0.000020948042,0.00022944447,0.00014593267,0.0001155092,0.0028956656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992555,0.00018389671,0.0000541672,0.00017071806,0.00022140205,0.00011424964],"domain_scores_gemma":[0.9983576,0.0010781294,0.00014815934,0.00014630647,0.00020353054,0.00006622772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012777067,0.0008241876,0.00088953867,0.0005598339,0.0005827797,0.0015167486,0.0008667206,0.00070559117,0.0032168054],"category_scores_gemma":[0.0039572413,0.00050515216,0.0009253184,0.00045425634,0.00090311543,0.001159223,0.0017272516,0.0009533473,0.00030651092],"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.00022269302,0.00009552549,0.00034280267,0.00016368073,0.000048573158,0.0002607939,0.0002298962,0.91001505,0.007772788,0.043205716,0.0007119526,0.036930513],"study_design_scores_gemma":[0.000029675384,0.00004163058,0.000062679464,0.000008160521,0.000014534471,0.000012196397,0.000034023902,0.9835873,0.0019325146,0.013785926,0.00048681835,0.00000454249],"about_ca_topic_score_codex":0.0037568016,"about_ca_topic_score_gemma":0.0056895283,"teacher_disagreement_score":0.0037568016,"about_ca_system_score_codex":0.0008376094,"about_ca_system_score_gemma":0.0016063099,"threshold_uncertainty_score":0.010761261},"labels":[],"label_agreement":null},{"id":"W4409507843","doi":"10.1017/bsl.2025.13","title":"ASSOCIATION FOR SYMBOLIC LOGIC","year":2025,"lang":"en","type":"article","venue":"Bulletin of Symbolic Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nankai University; University of Leeds; Division of Mathematical Sciences; Universiteit van Amsterdam; University of Cambridge; McMaster University; University of Madras; University of Notre Dame; University of Pennsylvania","keywords":"Association (psychology); Computer science; Programming language; Psychology","score_opus":0.013161514271471136,"score_gpt":0.2553855654010436,"score_spread":0.2422240511295725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409507843","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.0027206694,0.10205734,0.19521636,0.029077597,0.021649055,0.00020148685,0.0051738853,0.005538947,0.6383647],"genre_scores_gemma":[0.23685263,0.15841946,0.15146245,0.013839347,0.050941255,0.00182567,0.016371097,0.0052284803,0.36505955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960424,0.0012269722,0.00040840567,0.0010084369,0.0010604234,0.00025335618],"domain_scores_gemma":[0.9927247,0.003773886,0.00041634424,0.0015995975,0.0010802402,0.00040523228],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031152526,0.0016412922,0.0025990435,0.0044735163,0.0025867647,0.008450848,0.0015990142,0.0023373666,0.11014273],"category_scores_gemma":[0.009272139,0.001114993,0.001996347,0.007846388,0.0044405875,0.01022964,0.004645657,0.009051192,0.05164974],"study_design_candidate":"not_applicable","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.000055118846,0.000023197483,0.00031951815,0.0006986389,0.00007789649,0.00017361151,0.0002872014,0.00034383507,0.00034528415,0.7907514,0.14163472,0.065289594],"study_design_scores_gemma":[0.000029996228,0.000012023135,0.00033406614,0.0002240551,0.000029467234,0.00024369497,0.000047104226,0.0010573016,0.0001869986,0.5538381,0.44397813,0.000019085808],"about_ca_topic_score_codex":0.002020275,"about_ca_topic_score_gemma":0.0016365639,"teacher_disagreement_score":0.8898573,"about_ca_system_score_codex":0.0035930357,"about_ca_system_score_gemma":0.0033879008,"threshold_uncertainty_score":0.36846417},"labels":[],"label_agreement":null},{"id":"W4411449866","doi":"10.1007/978-3-031-93930-3_6","title":"A Logic of Actual Cause for Nondeterministic Domains","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Windsor; University of Regina","funders":"","keywords":"Computer science; Nondeterministic algorithm; Programming language; Theoretical computer science","score_opus":0.025048746715879602,"score_gpt":0.2759649340806172,"score_spread":0.2509161873647376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411449866","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.007901048,0.0014983127,0.8299733,0.004991895,0.00054393423,0.000092747934,0.00042476004,0.0008770603,0.15369697],"genre_scores_gemma":[0.60308504,0.0023094798,0.31458935,0.0024667012,0.0011498228,0.00040577402,0.0008862618,0.0006390662,0.07446862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806017,0.00063395046,0.00016348409,0.00041833325,0.00051136495,0.00021266092],"domain_scores_gemma":[0.9959638,0.002801686,0.00014448626,0.0005816797,0.00037177047,0.00013653227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003225063,0.0008472448,0.00081544445,0.002040837,0.0026038836,0.0053232396,0.0022698273,0.0023195215,0.01347855],"category_scores_gemma":[0.006567005,0.0012869488,0.0023684471,0.0014613277,0.0083894925,0.0130558275,0.004490147,0.0067672413,0.0020544308],"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.0000063559673,0.0000035762716,0.000029287794,0.000018512,0.000003345988,0.000027489363,0.00012405851,0.00036388557,0.00010065783,0.9954476,0.00085404515,0.0030212374],"study_design_scores_gemma":[0.0000055880882,0.0000033201889,0.000017645916,0.000010370195,0.0000072059074,0.000038898637,0.000028408494,0.0016439256,0.00018901925,0.99075633,0.0072937245,0.0000056148947],"about_ca_topic_score_codex":0.0016050196,"about_ca_topic_score_gemma":0.002089122,"teacher_disagreement_score":0.01347855,"about_ca_system_score_codex":0.00271161,"about_ca_system_score_gemma":0.0018794423,"threshold_uncertainty_score":0.045090258},"labels":[],"label_agreement":null},{"id":"W4411634444","doi":"10.1017/s1755020325100713","title":"FAILURE OF BETH’S THEOREM IN RELEVANCE LOGICS","year":2025,"lang":"en","type":"article","venue":"The Review of Symbolic Logic","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 Toronto","funders":"","keywords":"Relevance (law); Mathematics; Calculus (dental); Mathematical economics; Discrete mathematics; Political science; Medicine; Law","score_opus":0.012887776347992444,"score_gpt":0.2777501249042412,"score_spread":0.2648623485562488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411634444","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.3457432,0.025294622,0.35136184,0.03341547,0.0007495278,0.0001534696,0.00043751913,0.0011995304,0.24164483],"genre_scores_gemma":[0.98212415,0.0013211583,0.011425834,0.0013468347,0.00038254887,0.00004956018,0.00010107365,0.000054675213,0.0031942604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99029934,0.0029571764,0.0005164778,0.0019586647,0.0033831717,0.00088512816],"domain_scores_gemma":[0.9830353,0.01288308,0.0007167389,0.0016901647,0.0012863136,0.00038835694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009737884,0.00040196622,0.0017062846,0.002574015,0.002601366,0.0043952484,0.0017511452,0.0027026127,0.0032746927],"category_scores_gemma":[0.027320938,0.000909604,0.0012117028,0.0019172819,0.015572496,0.014714959,0.003855336,0.0046023442,0.0005429508],"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.000026791044,0.000012142105,0.00023660551,0.00006449223,0.000016446043,0.00009000862,0.0002498876,0.0005053347,0.00023957476,0.99143773,0.00087900565,0.006241914],"study_design_scores_gemma":[0.0000151647755,0.00000638351,0.00012220905,0.000017370721,0.0000069844336,0.00006047415,0.000031922937,0.0018596724,0.00032800727,0.99579513,0.0017492486,0.0000074449804],"about_ca_topic_score_codex":0.002823974,"about_ca_topic_score_gemma":0.0013031561,"teacher_disagreement_score":0.009737884,"about_ca_system_score_codex":0.004788779,"about_ca_system_score_gemma":0.001265019,"threshold_uncertainty_score":0.051499426},"labels":[],"label_agreement":null},{"id":"W4412373475","doi":"10.1007/978-981-96-6271-5_7","title":"Names Used Twice Over","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"History","score_opus":0.01648537319594107,"score_gpt":0.23797339933473263,"score_spread":0.22148802613879157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412373475","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.004308355,0.0066560297,0.07307369,0.0049899663,0.009666446,0.0001230856,0.0011934174,0.0024624916,0.8975266],"genre_scores_gemma":[0.084668525,0.0038216396,0.023528568,0.0032404587,0.0018747909,0.00020535756,0.0010894986,0.0031122614,0.8784589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996971,0.0008146158,0.00021448875,0.000891234,0.00067606516,0.00043257483],"domain_scores_gemma":[0.9977113,0.0006688546,0.00014921957,0.0006802043,0.00064470083,0.00014558509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020612795,0.0014014642,0.0012944507,0.0026885811,0.005604493,0.010665096,0.0020266492,0.002391946,0.04887259],"category_scores_gemma":[0.00381432,0.0009464569,0.0011709661,0.0041682567,0.0067231203,0.01678435,0.0038056022,0.0067295586,0.040184315],"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.00006221901,0.000013649155,0.00014598515,0.0001346376,0.000023027646,0.00011335341,0.0027286885,0.000076760145,0.0013852667,0.88042134,0.069042206,0.04585288],"study_design_scores_gemma":[0.0000061957753,0.000009891308,0.00010289046,0.00008644355,0.000023676295,0.00018768587,0.00046509487,0.00014657681,0.0014645442,0.07101933,0.92646706,0.000020547617],"about_ca_topic_score_codex":0.005951396,"about_ca_topic_score_gemma":0.007644137,"teacher_disagreement_score":0.04887259,"about_ca_system_score_codex":0.0036575033,"about_ca_system_score_gemma":0.0025031406,"threshold_uncertainty_score":0.16349512},"labels":[],"label_agreement":null},{"id":"W4412376926","doi":"10.1145/3726302.3730287","title":"Accelerating Listwise Reranking: Reproducing and Enhancing FIRST","year":2025,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya","keywords":"Computer science","score_opus":0.01555097952192798,"score_gpt":0.24627464448049602,"score_spread":0.23072366495856805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376926","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.071395494,0.0018545709,0.8872895,0.00088155014,0.0004076295,0.00029187527,0.0011255989,0.029683352,0.007070409],"genre_scores_gemma":[0.46021995,0.00071552343,0.51796085,0.0006583098,0.00039133074,0.00029660887,0.0036260115,0.0021786361,0.013952816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979988,0.0006295465,0.00011666272,0.00040068233,0.0006051243,0.0002492289],"domain_scores_gemma":[0.99220216,0.0037553995,0.0003907104,0.002044628,0.001333083,0.0002740106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033146085,0.0020402642,0.0017062732,0.0022210735,0.0008286676,0.0020969433,0.002463614,0.0015320919,0.006194493],"category_scores_gemma":[0.017402282,0.000567336,0.0009841139,0.0018292058,0.0009778547,0.004943065,0.0018603969,0.0025345725,0.0062627047],"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.0005785336,0.0004385797,0.0047213677,0.0006456302,0.0001657088,0.00031591428,0.0003823518,0.192605,0.020238843,0.02448579,0.043059282,0.712363],"study_design_scores_gemma":[0.00008380672,0.00025777216,0.00041438086,0.000036605466,0.00004196217,0.00021861802,0.00008462447,0.95448244,0.014816451,0.02258225,0.0069371522,0.00004398222],"about_ca_topic_score_codex":0.0060895626,"about_ca_topic_score_gemma":0.016973682,"teacher_disagreement_score":0.006194493,"about_ca_system_score_codex":0.0010939529,"about_ca_system_score_gemma":0.002843594,"threshold_uncertainty_score":0.020722687},"labels":[],"label_agreement":null},{"id":"W4412434879","doi":"10.1016/j.inffus.2025.103468","title":"Trust verification in information fusion-based autonomous monitoring systems using 9-valued logic","year":2025,"lang":"en","type":"article","venue":"Information Fusion","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"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 Alberta; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Khalifa University of Science, Technology and Research; Concordia University","keywords":"Computer science; Information fusion; Fusion; Artificial intelligence","score_opus":0.019284955879767217,"score_gpt":0.2598251304646935,"score_spread":0.2405401745849263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412434879","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.0108258845,0.000051441828,0.9868825,0.0001640212,0.000024891446,0.000085821994,0.000096468604,0.000810308,0.0010585506],"genre_scores_gemma":[0.5799662,0.00019259223,0.41700557,0.0003265402,0.00004963353,0.00029962926,0.0004311897,0.00022019107,0.0015085018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99252105,0.002572284,0.0006183522,0.0011190714,0.0024610348,0.00070828275],"domain_scores_gemma":[0.98991287,0.0062039886,0.0010537866,0.001231999,0.0013928411,0.00020451384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007565639,0.0007658172,0.0006938494,0.0012921916,0.0011175903,0.0037162546,0.0023484507,0.0011178874,0.0018248673],"category_scores_gemma":[0.015871393,0.00061665353,0.0027793664,0.00087650894,0.0036124827,0.0049454556,0.0031922448,0.0027984085,0.0003843131],"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.000548797,0.00018470612,0.002519281,0.0005148661,0.0002030545,0.0010954977,0.0011521861,0.2890418,0.01978889,0.6154732,0.0018126293,0.06766516],"study_design_scores_gemma":[0.00008679486,0.00009383894,0.0001882085,0.00009118857,0.00008357216,0.00013719896,0.00009374994,0.79482573,0.020845225,0.17927663,0.004231099,0.0000467883],"about_ca_topic_score_codex":0.0088527175,"about_ca_topic_score_gemma":0.005332734,"teacher_disagreement_score":0.0088527175,"about_ca_system_score_codex":0.003243823,"about_ca_system_score_gemma":0.0048427363,"threshold_uncertainty_score":0.040011346},"labels":[],"label_agreement":null},{"id":"W4412645737","doi":"10.4153/s000843952510091x","title":"A classification of incompleteness statements","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Mathematics; Pure mathematics","score_opus":0.024697611093093222,"score_gpt":0.28781583497048524,"score_spread":0.26311822387739203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412645737","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.48531902,0.003449,0.4224354,0.010784127,0.00031188087,0.00034259394,0.0028074235,0.0011653304,0.073385224],"genre_scores_gemma":[0.9567595,0.0009297683,0.03390745,0.0006464392,0.00026956966,0.00018757841,0.0020536655,0.0001644198,0.005081621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99311745,0.0015193678,0.00061631104,0.00097290054,0.002983574,0.0007904215],"domain_scores_gemma":[0.9461212,0.033336893,0.0046847444,0.0059517263,0.008552234,0.0013532274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010984058,0.0007690951,0.0010330462,0.0036207114,0.0018885711,0.003590263,0.0017596646,0.0016378929,0.0049793674],"category_scores_gemma":[0.04819688,0.00068293686,0.0011956817,0.0034176025,0.005926643,0.011076902,0.0033792483,0.004197623,0.0006119334],"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.00017182255,0.000064572916,0.0062722773,0.00024977323,0.00004431577,0.0005783266,0.0015695156,0.0056174193,0.0018560314,0.95290905,0.0041767415,0.026490206],"study_design_scores_gemma":[0.00004355223,0.000048450078,0.0021969317,0.00023096788,0.00005059437,0.00064373977,0.000758599,0.019254517,0.0049433955,0.95294815,0.018830523,0.000050609233],"about_ca_topic_score_codex":0.001466443,"about_ca_topic_score_gemma":0.00083802966,"teacher_disagreement_score":0.010984058,"about_ca_system_score_codex":0.002123344,"about_ca_system_score_gemma":0.0020517646,"threshold_uncertainty_score":0.05808997},"labels":[],"label_agreement":null},{"id":"W4412808065","doi":"10.1007/978-3-031-99536-1_14","title":"Insensitive Games: Game Semantics for Modal Insensitivity","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Modal; Semantics (computer science); Combinatorial game theory; Theoretical computer science; Programming language; Game theory; Sequential game; Mathematical economics; Mathematics","score_opus":0.016979666242938698,"score_gpt":0.25112352639241425,"score_spread":0.23414386014947555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412808065","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.012067518,0.00057331746,0.91056544,0.0013150014,0.00027106793,0.00013425863,0.00026413187,0.00073064346,0.0740786],"genre_scores_gemma":[0.72895396,0.0011301596,0.20958708,0.0011064749,0.0004154961,0.000586792,0.00051632064,0.0005867565,0.05711708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845636,0.0005575828,0.000105715764,0.0002544983,0.00039582365,0.00022999152],"domain_scores_gemma":[0.99892455,0.00060227304,0.00006501364,0.00016257574,0.00013396998,0.000111567366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015215665,0.0014498457,0.0008113358,0.0013064382,0.0014500266,0.0041856454,0.0026262165,0.0017706024,0.009048848],"category_scores_gemma":[0.0037447854,0.0008100866,0.001509369,0.001055275,0.0044473726,0.008614746,0.0032814045,0.0054745967,0.0014455492],"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.000016030957,0.000013617447,0.000019955814,0.000020566575,0.000005148405,0.000026553822,0.00015436542,0.0015376934,0.00036165412,0.99375594,0.0009450502,0.0031433282],"study_design_scores_gemma":[0.000008558044,0.000007296067,0.000024888865,0.000009681244,0.0000081589815,0.000027488628,0.000045611163,0.011364864,0.00038216703,0.9828655,0.0052465294,0.000009203024],"about_ca_topic_score_codex":0.002612261,"about_ca_topic_score_gemma":0.0018754211,"teacher_disagreement_score":0.009048848,"about_ca_system_score_codex":0.0022521396,"about_ca_system_score_gemma":0.0008275183,"threshold_uncertainty_score":0.030271411},"labels":[],"label_agreement":null},{"id":"W4413106080","doi":"10.55016/ojs/cdm.v4i1.62036","title":"Computing holes in semi-groups and its applications to transportation problems","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014055370327497355,"score_gpt":0.2799719674900482,"score_spread":0.26591659716255084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106080","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.29433328,0.0002756307,0.7011669,0.0005823866,0.00002831811,0.00010129217,0.00022608334,0.00048449927,0.0028016104],"genre_scores_gemma":[0.7146012,0.00012128284,0.28348473,0.0000636913,0.000030771327,0.000071410985,0.00031689266,0.00007560313,0.0012344716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992655,0.00020564768,0.00006508056,0.00017138322,0.00018711475,0.00010534575],"domain_scores_gemma":[0.9961808,0.0027006823,0.00027134625,0.00040611366,0.00022445509,0.00021668381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014920102,0.0005859874,0.0008200934,0.0014644489,0.0009623065,0.0014162502,0.0011789661,0.0008754865,0.0027029894],"category_scores_gemma":[0.0070097377,0.0004872109,0.0010998385,0.0011785653,0.0023273749,0.005012001,0.00254118,0.001194168,0.0001916923],"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.00059300964,0.00017733156,0.0067667146,0.0003426363,0.00007518923,0.0003617522,0.0022078427,0.22548985,0.008352212,0.6722197,0.0017870425,0.081626736],"study_design_scores_gemma":[0.000035552275,0.000074188945,0.0005221599,0.000026344198,0.000015803,0.00010618201,0.00031004133,0.36265782,0.003551668,0.6305373,0.0021419215,0.000021001004],"about_ca_topic_score_codex":0.002476882,"about_ca_topic_score_gemma":0.0020485285,"teacher_disagreement_score":0.0027029894,"about_ca_system_score_codex":0.0011813416,"about_ca_system_score_gemma":0.0007568399,"threshold_uncertainty_score":0.009042382},"labels":[],"label_agreement":null},{"id":"W4413893098","doi":"10.3390/languages10090221","title":"Case-Dependent Agreement in an Active–Stative Language","year":2025,"lang":"en","type":"article","venue":"Languages","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 Toronto","funders":"","keywords":"Agreement; Linguistics; Psychology; Natural language processing; Computer science; Philosophy","score_opus":0.013090919806843003,"score_gpt":0.30777804300207373,"score_spread":0.2946871231952307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413893098","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.54316676,0.0015650362,0.2962327,0.002261034,0.00012083488,0.0001350673,0.0002581187,0.0011738432,0.15508665],"genre_scores_gemma":[0.9872507,0.00008968946,0.010392652,0.00007707383,0.000020664706,0.000021754833,0.00005112316,0.00006959721,0.0020267528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869007,0.0004975557,0.000104354025,0.0002947245,0.0002519451,0.00016133301],"domain_scores_gemma":[0.9984244,0.00071669376,0.0002721491,0.00033921938,0.00019766783,0.000049769926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017797203,0.00032553764,0.00038826352,0.0014608136,0.0015468053,0.00286395,0.0014141768,0.0008133395,0.0023716232],"category_scores_gemma":[0.0025535733,0.00050293154,0.0004206482,0.001218669,0.0075721582,0.005476713,0.0026966506,0.0011384973,0.00042673087],"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.000022556706,0.0000061462633,0.0007349565,0.000040489973,0.0000074614886,0.0002920866,0.007249224,0.00029593013,0.0029514772,0.98085475,0.00021621947,0.007328775],"study_design_scores_gemma":[0.000051303487,0.000103661696,0.0073102103,0.00014217956,0.00007711723,0.0017607796,0.0074283713,0.010012391,0.015941892,0.8503706,0.106701836,0.000099742116],"about_ca_topic_score_codex":0.0048291306,"about_ca_topic_score_gemma":0.003288622,"teacher_disagreement_score":0.0048291306,"about_ca_system_score_codex":0.002692928,"about_ca_system_score_gemma":0.0006096375,"threshold_uncertainty_score":0.019538641},"labels":[],"label_agreement":null},{"id":"W4413907680","doi":"10.1007/978-3-032-04587-4","title":"Logics in Artificial Intelligence","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Instituto Superior Técnico; École Normale Supérieure de Lyon; Technische Universität Dortmund; Helsingin Yliopisto; Universidade da Madeira; Libera Università di Bolzano; Universität Leipzig; University of Cape Town; Technische Universität Wien; Universität Paderborn; Università degli Studi di Torino; Aix-Marseille Université; Universidade Nova de Lisboa; Birkbeck, University of London; Universidade de Lisboa; Universidad Nacional del Sur; Centre National de la Recherche Scientifique; Universite Angers; Università degli Studi di Udine; Università della Calabria; Université de Toulouse; University of Waterloo; Institut Universitaire de France; Linköpings Universitet; Universitetet i Bergen; Akademie Věd České Republiky; Universidad Politécnica de Madrid; Universitat Politècnica de València; Université de Montpellier; University of Cyprus; Consejo Nacional de Investigaciones Científicas y Técnicas; Technische Universität Dresden; Universiteit van Amsterdam; Università degli Studi di Milano-Bicocca; University of New South Wales; Universiteit Maastricht; KU Leuven; Universiteit Utrecht; British Columbia Institute of Technology; Università degli Studi di Milano; Université du Luxembourg; Universidad de Málaga; Commonwealth Scientific and Industrial Research Organisation; École Normale Supérieure; Universität Zürich; University of Chester; University College London; Imperial College London; Cardiff University","keywords":"Computer science; Artificial intelligence","score_opus":0.026813373060967604,"score_gpt":0.2721947778758663,"score_spread":0.24538140481489873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413907680","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.0017551236,0.19458586,0.07245425,0.012408341,0.0029793084,0.00006020773,0.0005212916,0.00066674495,0.71456885],"genre_scores_gemma":[0.16034748,0.16191375,0.08197945,0.009228179,0.008456402,0.00041839856,0.0028282588,0.0009618409,0.5738663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995697,0.0001613338,0.000020878155,0.000069338465,0.00014802182,0.000030742267],"domain_scores_gemma":[0.99944013,0.0003487274,0.00002635765,0.00008128039,0.00006236432,0.00004125994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072507275,0.0010336979,0.0009427259,0.001669557,0.0010400866,0.0052354108,0.00090668886,0.0010596769,0.022239469],"category_scores_gemma":[0.0013624844,0.00053152133,0.0004964127,0.002331188,0.0035324018,0.0051824995,0.0014295882,0.003144849,0.007610917],"study_design_candidate":"not_applicable","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.000023319912,0.000027641046,0.00009563315,0.00018122957,0.000015755328,0.000030877574,0.00027892864,0.0005915604,0.00014092909,0.8247366,0.0927722,0.08110543],"study_design_scores_gemma":[0.000009405638,0.000007590073,0.00011855198,0.00017375815,0.00000619911,0.00006447331,0.00008953845,0.0007218069,0.00009195492,0.72674394,0.27196762,0.0000051937714],"about_ca_topic_score_codex":0.0015621672,"about_ca_topic_score_gemma":0.0018294888,"teacher_disagreement_score":0.022239469,"about_ca_system_score_codex":0.001850883,"about_ca_system_score_gemma":0.0009845805,"threshold_uncertainty_score":0.07439846},"labels":[],"label_agreement":null},{"id":"W4413965835","doi":"10.70930/tac/ak1jwor1","title":"Cauchy Completions and the Rule of Unique Choice in Relational Doctrines","year":2025,"lang":"en","type":"article","venue":"Theory and applications of categories","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cauchy distribution; Pure mathematics; Statistics","score_opus":0.008485788558494706,"score_gpt":0.2509236833396875,"score_spread":0.2424378947811928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965835","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.2556882,0.001998007,0.61847055,0.0040138005,0.00023568378,0.00014103175,0.00032260205,0.00051820005,0.118611954],"genre_scores_gemma":[0.91376644,0.00050375523,0.07482287,0.00038255614,0.00017423533,0.000104082246,0.00023349955,0.00010502721,0.009907438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99547714,0.0014825118,0.0003542761,0.0009444791,0.0013419382,0.0003997275],"domain_scores_gemma":[0.9944218,0.0023205013,0.00033616764,0.0011092649,0.0011742313,0.00063802657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063868104,0.0003595167,0.0007691695,0.0016498177,0.0025289839,0.00341226,0.00093138125,0.0011643764,0.0029303785],"category_scores_gemma":[0.008193434,0.00041781095,0.0013170406,0.0007694095,0.013280242,0.010015131,0.0052253134,0.0032708007,0.00041792387],"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.0000036942497,0.0000042099705,0.00006909383,0.000008345136,0.0000022998574,0.000035011108,0.00031860007,0.0001873078,0.00021673305,0.99750143,0.000133045,0.0015203668],"study_design_scores_gemma":[0.000010220402,0.000016236847,0.00022050389,0.000010834872,0.0000046072932,0.000104666295,0.00020208924,0.0014051942,0.00069163635,0.9899595,0.007361494,0.000012989799],"about_ca_topic_score_codex":0.002144711,"about_ca_topic_score_gemma":0.0017575393,"teacher_disagreement_score":0.0063868104,"about_ca_system_score_codex":0.0019825376,"about_ca_system_score_gemma":0.0015993027,"threshold_uncertainty_score":0.033777118},"labels":[],"label_agreement":null},{"id":"W4413965840","doi":"10.70930/tac/bsjpp8a4","title":"Classical Distributive Restriction Categories","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Distributive property; Computer science; Mathematics; Pure mathematics","score_opus":0.008995886674870914,"score_gpt":0.2512302419638929,"score_spread":0.24223435528902196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965840","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.06938089,0.00358501,0.46843562,0.002509898,0.00048804886,0.000138721,0.0010510696,0.0011553731,0.45325541],"genre_scores_gemma":[0.84374005,0.0014239292,0.09082568,0.0014404207,0.0009196753,0.00025975687,0.0010968833,0.00019529619,0.060098235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996962,0.0006425722,0.0001635227,0.000732255,0.0011724714,0.00032720057],"domain_scores_gemma":[0.9978994,0.00057147926,0.0001305464,0.00045745904,0.0007299467,0.00021122342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002211723,0.00038530419,0.00036112274,0.0015355729,0.0019457362,0.0034744397,0.0011166363,0.00076113763,0.009742589],"category_scores_gemma":[0.0022563064,0.00036826317,0.0006410427,0.0012672486,0.0063780234,0.007406957,0.0031634835,0.0017626825,0.0014705629],"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.0000037559041,0.000002816626,0.00005887023,0.00001681391,0.000002542436,0.000021611922,0.00016681547,0.000054770986,0.00016539372,0.9947072,0.00069436844,0.0041049477],"study_design_scores_gemma":[0.000008372047,0.000014860762,0.00040223982,0.000017566808,0.00000798076,0.00023171728,0.00017980744,0.0010583623,0.0006865118,0.92352575,0.0738545,0.000012361007],"about_ca_topic_score_codex":0.0012197224,"about_ca_topic_score_gemma":0.0010455815,"teacher_disagreement_score":0.009742589,"about_ca_system_score_codex":0.0016544139,"about_ca_system_score_gemma":0.0010880304,"threshold_uncertainty_score":0.032592177},"labels":[],"label_agreement":null},{"id":"W4413966107","doi":"10.70930/tac/uvh4tpso","title":"Right Delocalization of Model Categories","year":2016,"lang":"en","type":"article","venue":"Theory and applications of categories","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":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.009571378100634822,"score_gpt":0.2363121490437836,"score_spread":0.22674077094314876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966107","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.24429993,0.0007779023,0.72746295,0.0010657663,0.0001050689,0.00008224238,0.000210564,0.00047573983,0.02551989],"genre_scores_gemma":[0.9295669,0.00033403264,0.061839715,0.00028009433,0.000090252695,0.00009125266,0.0002704411,0.00016756202,0.007359758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731773,0.000542961,0.00015753007,0.00085358106,0.00074356754,0.00038461844],"domain_scores_gemma":[0.99614763,0.00094286184,0.0003985669,0.0009971753,0.0009940088,0.00051979406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025800108,0.00046148576,0.0005570464,0.0020534717,0.0015334032,0.002326435,0.00096605084,0.00076728547,0.0041862694],"category_scores_gemma":[0.004768852,0.00047244376,0.00097282283,0.0006405596,0.0052799215,0.00887445,0.006252552,0.0022992264,0.00030922476],"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.00003837707,0.000014205394,0.0006622027,0.000039995793,0.00001113616,0.000083304585,0.00053448393,0.0012405791,0.0034054525,0.9849476,0.00027918915,0.00874346],"study_design_scores_gemma":[0.00001568245,0.00005842891,0.0007017326,0.000035027984,0.000021590036,0.00029854706,0.0005362763,0.012391485,0.00894928,0.9620667,0.014894378,0.00003088421],"about_ca_topic_score_codex":0.0020562997,"about_ca_topic_score_gemma":0.0016048431,"teacher_disagreement_score":0.0041862694,"about_ca_system_score_codex":0.002082835,"about_ca_system_score_gemma":0.00077286555,"threshold_uncertainty_score":0.015112102},"labels":[],"label_agreement":null},{"id":"W4414055490","doi":"10.36227/techrxiv.175735299.97215847/v1","title":"Responsible Agentic Reasoning and AI Agents: A Critical Survey","year":2025,"lang":"en","type":"article","venue":"","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":"Vector Institute","funders":"HORIZON EUROPE Framework Programme","keywords":"Trustworthiness; Audit; Perception; Knowledge representation and reasoning; Automated reasoning","score_opus":0.025803183714012915,"score_gpt":0.3263356991621448,"score_spread":0.30053251544813187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414055490","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004530649,0.83035934,0.11877696,0.020482728,0.0008264777,0.0001597683,0.00017048103,0.0004929564,0.024200734],"genre_scores_gemma":[0.081262335,0.81289864,0.0953626,0.0035913913,0.0027397792,0.00030134653,0.0004165524,0.00029129788,0.0031360674],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9877506,0.0047845617,0.0013629012,0.0012089316,0.00435683,0.0005361394],"domain_scores_gemma":[0.96281385,0.027297182,0.0012576231,0.002241359,0.0057388097,0.00065116084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013161833,0.0011809849,0.0015597779,0.008222314,0.001346102,0.007906203,0.002738025,0.00386378,0.0029599848],"category_scores_gemma":[0.024147624,0.0013649812,0.0010426925,0.008400484,0.00474843,0.015044607,0.0030162511,0.0047182795,0.0013403645],"study_design_candidate":"not_applicable","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.00008535142,0.00014006117,0.0030378227,0.0056867995,0.00010931563,0.00012991695,0.0011669734,0.00777287,0.00044224854,0.44090784,0.018451426,0.5220694],"study_design_scores_gemma":[0.000023311939,0.00019562435,0.002168184,0.0067373556,0.00011396736,0.0006314121,0.0017894352,0.021523997,0.0014565942,0.37831405,0.5869342,0.00011184472],"about_ca_topic_score_codex":0.003794634,"about_ca_topic_score_gemma":0.0019074995,"teacher_disagreement_score":0.013161833,"about_ca_system_score_codex":0.0044161472,"about_ca_system_score_gemma":0.004352064,"threshold_uncertainty_score":0.06960726},"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":"W4415158403","doi":"10.48550/arxiv.2504.09858","title":"Reasoning Models Can Be Effective Without Thinking","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Simple (philosophy); Thinking processes; Set (abstract data type); Latency (audio); Process (computing); Scaling; Automated reasoning; Analytic reasoning","score_opus":0.03665691938393383,"score_gpt":0.2781942094752528,"score_spread":0.24153729009131897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415158403","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.09059335,0.0015775756,0.83275115,0.0048885043,0.00044076226,0.00038405563,0.0013230506,0.04894798,0.019093528],"genre_scores_gemma":[0.52749556,0.0005910281,0.45895466,0.0015344282,0.00017152837,0.00030620612,0.0026294542,0.0016839699,0.006633122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664503,0.0011153679,0.0002516684,0.00089854206,0.0008314785,0.00025798785],"domain_scores_gemma":[0.98779196,0.0060422537,0.00047238817,0.0049269185,0.00050042314,0.0002659129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032890127,0.0015094292,0.0008485035,0.00072981033,0.00066506123,0.003426973,0.0021318274,0.0012632621,0.0122513],"category_scores_gemma":[0.022640213,0.000837336,0.0016270725,0.00081262755,0.0019074804,0.010161905,0.0044787284,0.003796035,0.0049718674],"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.001048712,0.00040869103,0.0041737803,0.0010770332,0.0001970773,0.00028813037,0.00073214725,0.079869956,0.028062018,0.074523635,0.032752387,0.7768664],"study_design_scores_gemma":[0.00025731468,0.0002725717,0.00096124934,0.00012738572,0.00015194227,0.0003100559,0.00029267787,0.5767156,0.034465034,0.34748498,0.038892154,0.00006903005],"about_ca_topic_score_codex":0.001746397,"about_ca_topic_score_gemma":0.0038666278,"teacher_disagreement_score":0.0122513,"about_ca_system_score_codex":0.0013319871,"about_ca_system_score_gemma":0.002281473,"threshold_uncertainty_score":0.04098463},"labels":[],"label_agreement":null},{"id":"W4415233743","doi":"10.70777/si.v2i6.16169","title":"Responsible Agentic Reasoning and AI Agents: A Critical Survey","year":2025,"lang":"en","type":"article","venue":"SuperIntelligence - Robotics - Safety & Alignment","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":"Vector Institute","funders":"","keywords":"Operationalization; Intersection (aeronautics); Audit; Trustworthiness; Automated reasoning; Soundness; Class (philosophy)","score_opus":0.028270621759054662,"score_gpt":0.32028397629638267,"score_spread":0.292013354537328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415233743","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004585958,0.7534716,0.18065545,0.023482954,0.0009331069,0.00017963364,0.00019368427,0.00065268215,0.035844896],"genre_scores_gemma":[0.09555238,0.7500976,0.14211573,0.004090615,0.0025299366,0.00037861004,0.0005433662,0.00040890454,0.0042829257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98797417,0.0046585877,0.0012043301,0.0011868437,0.0044760844,0.00049996225],"domain_scores_gemma":[0.96345115,0.02633042,0.001229813,0.0023368038,0.005956921,0.0006949232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0136323795,0.0010906975,0.0012442986,0.007408735,0.0014538331,0.007524652,0.002625566,0.0035303128,0.0032719886],"category_scores_gemma":[0.025212757,0.00121054,0.0009302225,0.0074243406,0.005161513,0.014824384,0.0032077604,0.004763539,0.0015339734],"study_design_candidate":"not_applicable","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.000060693154,0.00010958147,0.0024383322,0.0045182644,0.00008203111,0.000107473665,0.0012470034,0.0055805626,0.00037277053,0.50764555,0.015887454,0.46195024],"study_design_scores_gemma":[0.000016870863,0.00012631362,0.0015010661,0.005656178,0.0000828799,0.00050650886,0.0015129092,0.01575899,0.0013293547,0.40898746,0.56444216,0.00007932968],"about_ca_topic_score_codex":0.0041643237,"about_ca_topic_score_gemma":0.0023142935,"teacher_disagreement_score":0.0136323795,"about_ca_system_score_codex":0.0046506887,"about_ca_system_score_gemma":0.0049163555,"threshold_uncertainty_score":0.07209575},"labels":[],"label_agreement":null},{"id":"W4415903221","doi":"10.24963/kr.2025/25","title":"Belief Revision in a Probabilistic Setting","year":2025,"lang":"","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Belief revision; Probabilistic logic; Iterated function; Belief structure; Connection (principal bundle); Imprecise probability; Probabilistic logic network; Possible world","score_opus":0.011825033467610574,"score_gpt":0.2674428025071385,"score_spread":0.25561776903952793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415903221","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.010928135,0.00062618154,0.9701461,0.0026340825,0.00012933274,0.00008063882,0.00006556646,0.00012586726,0.015264102],"genre_scores_gemma":[0.80813605,0.00073505053,0.1852858,0.00062996655,0.000387323,0.00024033475,0.000068206886,0.000048313646,0.004469122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907093,0.0052531785,0.0004140984,0.00091351,0.0022724026,0.00043751442],"domain_scores_gemma":[0.9840099,0.010185001,0.0011429903,0.0018483072,0.0022633844,0.0005504292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009834266,0.00062780344,0.0007747134,0.0017845648,0.0011159383,0.0038773334,0.0019950848,0.0012496522,0.003619862],"category_scores_gemma":[0.021784823,0.00048117773,0.0015292931,0.0009255559,0.005652782,0.0060916524,0.002755698,0.003103461,0.00036296202],"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.000017656306,0.000017681667,0.00023782386,0.000084954765,0.000039699655,0.00007655228,0.0005588522,0.013167385,0.0004064624,0.9772027,0.00040300324,0.0077872532],"study_design_scores_gemma":[0.000017154905,0.000031689855,0.00021359249,0.00003241034,0.000019923473,0.000063310574,0.00011530267,0.05801669,0.00029234806,0.93800783,0.0031625184,0.0000272492],"about_ca_topic_score_codex":0.001957248,"about_ca_topic_score_gemma":0.0015007013,"teacher_disagreement_score":0.009834266,"about_ca_system_score_codex":0.00323429,"about_ca_system_score_gemma":0.0015983469,"threshold_uncertainty_score":0.052009165},"labels":[],"label_agreement":null},{"id":"W4416035455","doi":"10.18653/v1/2025.emnlp-main.1556","title":"Improving Rule-based Reasoning in LLMs using Neurosymbolic Representations","year":2025,"lang":"","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Representation (politics); Process (computing); Key (lock); Frame (networking); Normative; Case-based reasoning","score_opus":0.023187874944921007,"score_gpt":0.2958163936077655,"score_spread":0.2726285186628445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416035455","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.031876873,0.00028509344,0.9518341,0.00049312535,0.00008515779,0.00012531193,0.00047265465,0.011698443,0.0031292345],"genre_scores_gemma":[0.3819647,0.00026078543,0.6117647,0.00042767744,0.000060020328,0.00023039729,0.0011347675,0.000624799,0.0035320292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.00016285999,0.000047787,0.00018991371,0.00014956166,0.000040643114],"domain_scores_gemma":[0.99797803,0.0011878227,0.00017446755,0.00038560384,0.00019087135,0.00008325418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043705,0.0009776857,0.00066802395,0.0007805575,0.00040659614,0.0018141562,0.0017491233,0.0009088542,0.0059044017],"category_scores_gemma":[0.0077892435,0.00044312383,0.0012163862,0.0005362897,0.0008896166,0.0029939176,0.0016621636,0.0020367894,0.0017176445],"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.0003189299,0.00027271832,0.0024217702,0.00043809492,0.00018297207,0.0002799669,0.0003269931,0.2958839,0.025051486,0.029444946,0.007999563,0.63737863],"study_design_scores_gemma":[0.000022216649,0.000034278317,0.00017358728,0.00002080771,0.00001775448,0.00004172234,0.000025691153,0.9565435,0.009144173,0.032175064,0.0017896506,0.00001158149],"about_ca_topic_score_codex":0.003325208,"about_ca_topic_score_gemma":0.007867237,"teacher_disagreement_score":0.0059044017,"about_ca_system_score_codex":0.0011469775,"about_ca_system_score_gemma":0.0015343686,"threshold_uncertainty_score":0.019752204},"labels":[],"label_agreement":null},{"id":"W4416132934","doi":"10.1007/s11229-025-05354-3","title":"Logical nihilism and dealing with counterexamples in logic with proofs and refutations","year":2025,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Counterexample; Philosophy of science; Mathematical proof; Philosophy of language; Nihilism; Proposition; Metaphysics; Logical consequence; Calculus (dental)","score_opus":0.011688403714275401,"score_gpt":0.2422737405302538,"score_spread":0.2305853368159784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416132934","genre_codex":"methods","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.06874014,0.004734222,0.8612945,0.023863876,0.00067848916,0.00021259642,0.00021205698,0.0010881086,0.039176054],"genre_scores_gemma":[0.72018015,0.0015215324,0.2686244,0.0016135767,0.0006606522,0.00025239345,0.00028200517,0.00031033263,0.006554963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97789556,0.0134075,0.0018213934,0.0022267497,0.0034119259,0.0012369073],"domain_scores_gemma":[0.8862515,0.09672711,0.0030627064,0.009795455,0.0030966904,0.001066537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026663309,0.0012886395,0.0020448607,0.0066950833,0.004320075,0.009580099,0.0046160244,0.006245273,0.0073922435],"category_scores_gemma":[0.10156217,0.0020565179,0.0031109597,0.0038224694,0.022371178,0.033040382,0.011664115,0.009326643,0.0007026001],"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.000059638664,0.000028310416,0.0003658607,0.00015483792,0.000029166942,0.00023162205,0.0010355347,0.002169949,0.0002320667,0.98401755,0.00078847725,0.010886878],"study_design_scores_gemma":[0.000015895463,0.000009186516,0.00003523799,0.000053258645,0.000021488107,0.000094370305,0.000156255,0.005696101,0.0005833183,0.9916558,0.0016639868,0.000015092482],"about_ca_topic_score_codex":0.0016092951,"about_ca_topic_score_gemma":0.0016888935,"teacher_disagreement_score":0.026663309,"about_ca_system_score_codex":0.0036390733,"about_ca_system_score_gemma":0.0031656101,"threshold_uncertainty_score":0.1410107},"labels":[],"label_agreement":null},{"id":"W44477046","doi":"10.1609/aaai.v26i1.8213","title":"A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Alberta","funders":"State Key Laboratory of Computer Science; National Natural Science Foundation of China","keywords":"Programming language; Axiomatic semantics; Higher-order logic; Computer science; Stable model semantics; Theoretical computer science; Well-founded semantics; Constraint (computer-aided design); Set (abstract data type); Logic programming; Multimodal logic; Intermediate logic; Logic program; Semantics (computer science); Description logic; Mathematics; Operational semantics; Denotational semantics","score_opus":0.08219916397020502,"score_gpt":0.2885253281602842,"score_spread":0.20632616419007918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44477046","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.011715822,0.00020098552,0.9836912,0.00047850533,0.000057001096,0.000117827876,0.00012260505,0.0006753389,0.0029406138],"genre_scores_gemma":[0.274331,0.00051358267,0.71858525,0.00053910026,0.000115898736,0.0003255831,0.00044077166,0.00027440346,0.0048745167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971258,0.00058460195,0.0002954422,0.0005695472,0.0011069985,0.000317708],"domain_scores_gemma":[0.99722075,0.0008483314,0.0002362093,0.0005696953,0.00087544805,0.000249645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032699818,0.0008634149,0.0005935081,0.0013634462,0.0011834849,0.0029192094,0.0020546447,0.0014664953,0.0022941781],"category_scores_gemma":[0.0033138082,0.00096255913,0.0017065728,0.0009005286,0.0042532175,0.008233395,0.0026265276,0.003555375,0.00042835195],"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.00003761865,0.000077479854,0.00033193137,0.00010521674,0.000030131763,0.0001258983,0.00058286166,0.0090070665,0.0053326897,0.9620196,0.00094880204,0.021400586],"study_design_scores_gemma":[0.00009647278,0.00016344614,0.00027404545,0.00006782518,0.00011100762,0.00037233336,0.0002625778,0.10854203,0.017077126,0.83323133,0.039708514,0.0000933091],"about_ca_topic_score_codex":0.002644812,"about_ca_topic_score_gemma":0.0042959256,"teacher_disagreement_score":0.0032699818,"about_ca_system_score_codex":0.0017561528,"about_ca_system_score_gemma":0.0032541088,"threshold_uncertainty_score":0.017293513},"labels":[],"label_agreement":null},{"id":"W46479431","doi":"","title":"On the equivalence between answer sets and models of completion for nested logic programs","year":2003,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"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 Alberta","funders":"","keywords":"Equivalence (formal languages); Computer science; Logic program; Answer set programming; Class (philosophy); Set (abstract data type); Theoretical computer science; Logic programming; Mathematics; Discrete mathematics; Programming language; Artificial intelligence","score_opus":0.10589067706285005,"score_gpt":0.2874992129907615,"score_spread":0.18160853592791143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46479431","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.12758733,0.0003530544,0.8489233,0.0026142613,0.00009914822,0.00037441388,0.0011646452,0.0019041952,0.016979666],"genre_scores_gemma":[0.7685166,0.000360657,0.21907511,0.0008301894,0.00038706267,0.0006202912,0.0034614902,0.0006975185,0.0060510593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907477,0.0023758279,0.00068293157,0.0018715092,0.0030564226,0.0012656606],"domain_scores_gemma":[0.9568764,0.03284345,0.0018171702,0.003925127,0.002933269,0.001604487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006649246,0.0011290665,0.0018331889,0.0023490633,0.0019972906,0.006091669,0.0031462335,0.0025896686,0.00797569],"category_scores_gemma":[0.036063597,0.0012006894,0.0041691433,0.0017664067,0.0073275045,0.019162137,0.0074078403,0.0071881814,0.0010062582],"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.00034939122,0.00033805397,0.0012816571,0.0002188295,0.00006756819,0.0003333884,0.0017085667,0.018056639,0.003580734,0.9510777,0.0021162636,0.020871054],"study_design_scores_gemma":[0.000077212775,0.0000796697,0.00036012527,0.000034045024,0.00004150245,0.00013233714,0.00015256685,0.060874056,0.00253738,0.93382233,0.0018458301,0.000042840715],"about_ca_topic_score_codex":0.004778471,"about_ca_topic_score_gemma":0.0032994198,"teacher_disagreement_score":0.00797569,"about_ca_system_score_codex":0.0033807887,"about_ca_system_score_gemma":0.002663151,"threshold_uncertainty_score":0.035164952},"labels":[],"label_agreement":null},{"id":"W48073604","doi":"","title":"Situations, Si! situation terms, No!","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":40,"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 Toronto","funders":"","keywords":"Situation calculus; Determinacy; Action (physics); Computer science; Calculus (dental); Expressive power; Knowledge representation and reasoning; Algebra over a field; Mathematics; Artificial intelligence; Theoretical computer science; Pure mathematics","score_opus":0.013466692461218892,"score_gpt":0.23558736075589282,"score_spread":0.22212066829467392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48073604","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.009052118,0.0045425603,0.6876891,0.010945655,0.004570044,0.00034158374,0.002018186,0.006563902,0.27427688],"genre_scores_gemma":[0.37151363,0.006322474,0.4223703,0.003561201,0.0020129182,0.000993258,0.004781372,0.0045148265,0.18393002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848723,0.0005244761,0.00015965215,0.00038673164,0.00028169382,0.00016016424],"domain_scores_gemma":[0.9990189,0.00030729652,0.000111678295,0.00028049827,0.00018975389,0.00009192339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963679,0.0015591333,0.0009416169,0.0017991473,0.0025751598,0.005822126,0.0021212203,0.0015150728,0.021781655],"category_scores_gemma":[0.0031614043,0.0010971281,0.0013718636,0.00230417,0.0056204763,0.018399326,0.004125643,0.0045771175,0.012083655],"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.00002668173,0.00000764451,0.000053678516,0.00008052561,0.000006256105,0.00004877836,0.00042748562,0.00019599652,0.0003814246,0.9785945,0.009803822,0.010373146],"study_design_scores_gemma":[0.000015996555,0.000024772922,0.00011238706,0.00007668942,0.000025320667,0.00023602616,0.0004363298,0.0030057656,0.0011514894,0.6709659,0.32391608,0.000033168395],"about_ca_topic_score_codex":0.0025295443,"about_ca_topic_score_gemma":0.004269706,"teacher_disagreement_score":0.021781655,"about_ca_system_score_codex":0.0020864129,"about_ca_system_score_gemma":0.0014163596,"threshold_uncertainty_score":0.07286692},"labels":[],"label_agreement":null},{"id":"W48296306","doi":"","title":"A logic of limited belief for reasoning with disjunctive information","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"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 Toronto","funders":"","keywords":"Decidability; Computer science; Belief revision; Deductive reasoning; Propositional calculus; Non-monotonic logic; Circumscription; Artificial intelligence; Theoretical computer science; Propositional variable; Point (geometry); Description logic; Mathematics; Intermediate logic; Programming language","score_opus":0.010828458245610842,"score_gpt":0.2206466398951868,"score_spread":0.20981818164957594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48296306","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.006315865,0.0005810958,0.97572255,0.0038959242,0.00011623945,0.000115460214,0.00027968103,0.00058016885,0.012392975],"genre_scores_gemma":[0.32834223,0.00083334313,0.6633346,0.0019903053,0.00040897846,0.00035228,0.0006056222,0.0001198266,0.00401272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959591,0.0015402436,0.00030588006,0.00069338,0.0011881711,0.0003132007],"domain_scores_gemma":[0.99324715,0.004716634,0.0004494308,0.0008213558,0.00048763864,0.00027779894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062135234,0.0007867298,0.00075835816,0.0016272981,0.001800422,0.006525794,0.002640289,0.0023024706,0.004124832],"category_scores_gemma":[0.011510482,0.0007432746,0.0023593565,0.0019625318,0.007022564,0.012327673,0.005110555,0.0056586983,0.0008760168],"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.000034725606,0.00002462757,0.00013828675,0.00008953849,0.000017428889,0.00010094107,0.0003816112,0.0023666304,0.000848463,0.98191684,0.0015355366,0.012545367],"study_design_scores_gemma":[0.000038360846,0.00004038604,0.00009739373,0.000055949316,0.00004813024,0.00019368612,0.00013729374,0.046607185,0.0015099748,0.9395555,0.0116817765,0.00003436021],"about_ca_topic_score_codex":0.0020979284,"about_ca_topic_score_gemma":0.0024135157,"teacher_disagreement_score":0.006525794,"about_ca_system_score_codex":0.0032875328,"about_ca_system_score_gemma":0.0020820769,"threshold_uncertainty_score":0.032860696},"labels":[],"label_agreement":null},{"id":"W50198451","doi":"","title":"Declarative programming of search problems with built-in arithmetic","year":2009,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"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":"Computer science; Arithmetic function; Natural number; Programming language; Class (philosophy); Declarative programming; Extension (predicate logic); Theoretical computer science; Aggregate (composite); Domain (mathematical analysis); Set (abstract data type); Expressive power; Finite set; Arithmetic; Mathematics; Programming paradigm; Discrete mathematics; Inductive programming; Artificial intelligence","score_opus":0.024949600341829307,"score_gpt":0.26785021713758544,"score_spread":0.24290061679575614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50198451","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.025480041,0.00019453371,0.966275,0.0010002704,0.000049353992,0.00009514864,0.00018471503,0.0006980113,0.006022995],"genre_scores_gemma":[0.4593513,0.0003855534,0.53431845,0.00036558823,0.000107373686,0.0002838773,0.0004560264,0.00015962284,0.0045723007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843615,0.00060982513,0.00015031773,0.00024034292,0.0003934848,0.0001698157],"domain_scores_gemma":[0.99654645,0.002566066,0.00023880972,0.00033660998,0.00019221246,0.00011991787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030609071,0.00061077334,0.00062104885,0.00063999667,0.000625153,0.0033464243,0.0025923413,0.0009159048,0.0037571837],"category_scores_gemma":[0.005465707,0.00058924925,0.001551618,0.0009222461,0.0033058566,0.0064559886,0.0026883078,0.0029235485,0.0003773342],"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.000047141944,0.00004991548,0.00031377218,0.00013308549,0.000026484619,0.000110629175,0.00034610118,0.05167482,0.0014707855,0.93262154,0.0011367686,0.012068891],"study_design_scores_gemma":[0.0000481464,0.00004328271,0.00010049042,0.00006145849,0.000039671282,0.000115478026,0.00015176696,0.29111412,0.003102874,0.6976393,0.0075644003,0.000019061083],"about_ca_topic_score_codex":0.0019294745,"about_ca_topic_score_gemma":0.003688431,"teacher_disagreement_score":0.0037571837,"about_ca_system_score_codex":0.0015876747,"about_ca_system_score_gemma":0.0013861042,"threshold_uncertainty_score":0.016187847},"labels":[],"label_agreement":null},{"id":"W52798415","doi":"10.1007/978-3-642-41524-1_12","title":"Solving Modular Model Expansion: Case Studies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Modulo; Integer programming; Task (project management); Scheduling (production processes); Linear programming; Set (abstract data type); Satisfiability; Theoretical computer science; Mathematical optimization; Algorithm; Programming language; Mathematics; Engineering; Systems engineering","score_opus":0.03585422246829713,"score_gpt":0.26820216789040535,"score_spread":0.23234794542210824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52798415","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.24199444,0.0013393234,0.69691944,0.0023356122,0.00009223827,0.0007447316,0.00025014568,0.0013089995,0.05501514],"genre_scores_gemma":[0.4986687,0.00060726615,0.49415362,0.00022278074,0.00006914091,0.0002682412,0.00047941355,0.00033314092,0.005197656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962387,0.002361882,0.00014427895,0.00032403317,0.00067138736,0.0002596744],"domain_scores_gemma":[0.96864754,0.027420618,0.0005321467,0.0024047208,0.00073053944,0.0002644373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051284833,0.0013895757,0.000916123,0.0008763244,0.0012804546,0.0018362978,0.0030351474,0.0031003128,0.01005031],"category_scores_gemma":[0.03681996,0.00067675323,0.0016614777,0.0016165044,0.002451705,0.007913473,0.0042638695,0.004136311,0.00090853556],"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.0014196533,0.0025185049,0.003396535,0.0017176004,0.00019782965,0.0017694548,0.0038655486,0.18229637,0.006321933,0.36489078,0.017090192,0.41451558],"study_design_scores_gemma":[0.00045301154,0.0003612274,0.000600101,0.00019542346,0.00016590404,0.00087021815,0.001204842,0.6445699,0.010281186,0.32855594,0.012700421,0.00004188228],"about_ca_topic_score_codex":0.0020577514,"about_ca_topic_score_gemma":0.0043658693,"teacher_disagreement_score":0.01005031,"about_ca_system_score_codex":0.001098392,"about_ca_system_score_gemma":0.0010139622,"threshold_uncertainty_score":0.03362161},"labels":[],"label_agreement":null},{"id":"W52985456","doi":"","title":"Towards an axiom system for default logic","year":2006,"lang":"en","type":"article","venue":"RWTH Publications (RWTH Aachen)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"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 Toronto","funders":"","keywords":"Default logic; Non-monotonic logic; Autoepistemic logic; Axiom; Mathematics; Zeroth-order logic; Dynamic logic (digital electronics); Intermediate logic; Second-order logic; Deductive reasoning; Computer science; Artificial intelligence; Multimodal logic; Theoretical computer science; Algebra over a field; Description logic; Higher-order logic; Pure mathematics","score_opus":0.02823441366545953,"score_gpt":0.27409929595100807,"score_spread":0.24586488228554854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52985456","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.0081222085,0.0006256942,0.9742387,0.004129171,0.00034487483,0.000109250934,0.0002792631,0.0006467853,0.0115040215],"genre_scores_gemma":[0.12363788,0.00058459153,0.8675691,0.0018041822,0.00030354425,0.0002600594,0.0005882204,0.00014556838,0.0051068324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658537,0.0015153765,0.00032521138,0.00053898705,0.0008288036,0.00020637165],"domain_scores_gemma":[0.9952928,0.0023794917,0.00020706026,0.0007188043,0.0012271315,0.00017467495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008571255,0.0005123863,0.0009041452,0.0019997319,0.0017090003,0.0029161063,0.002129125,0.0025785004,0.004515739],"category_scores_gemma":[0.0067897965,0.0010049739,0.0018212463,0.0013978007,0.0049844924,0.007982385,0.003943333,0.007173478,0.0015708406],"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.00000903793,0.00001258511,0.0000974021,0.000041863725,0.000008599439,0.000051017894,0.00017633238,0.0009005348,0.00067203026,0.98956174,0.0018326428,0.006636222],"study_design_scores_gemma":[0.000036343026,0.000019513722,0.0001004614,0.0000403661,0.000013380361,0.0000899501,0.000052187923,0.012163612,0.0012866892,0.96243674,0.023742918,0.000017887136],"about_ca_topic_score_codex":0.002086682,"about_ca_topic_score_gemma":0.0022993213,"teacher_disagreement_score":0.008571255,"about_ca_system_score_codex":0.0027517225,"about_ca_system_score_gemma":0.0027946557,"threshold_uncertainty_score":0.04532963},"labels":[],"label_agreement":null},{"id":"W561904017","doi":"","title":"4th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2009) : Montreal, Canada, 2 August 2009","year":2009,"lang":"en","type":"book","venue":"Association for Computing Machinery eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Political science; Linguistics; Computer science; Philosophy","score_opus":0.01615411347494554,"score_gpt":0.27366562713526016,"score_spread":0.2575115136603146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W561904017","genre_codex":"methods","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.010576636,0.05420541,0.48316655,0.04431318,0.015512158,0.0007445185,0.008107536,0.01570384,0.3676702],"genre_scores_gemma":[0.03017166,0.023380827,0.17144497,0.0021875494,0.0016624834,0.0003184376,0.00983142,0.0041130125,0.7568897],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988933,0.00022732587,0.000050107505,0.00017235213,0.00041425994,0.00024258952],"domain_scores_gemma":[0.99828464,0.0002577082,0.00003992949,0.00027816577,0.0008001549,0.00033934013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030214349,0.001382074,0.0014472012,0.001819452,0.0025591857,0.008587945,0.0032094168,0.0018328687,0.11036858],"category_scores_gemma":[0.003124002,0.0009480733,0.0016664506,0.002965333,0.0019400241,0.005837185,0.0031523183,0.0029834744,0.028387476],"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.000115209135,0.000109315144,0.00039379302,0.00031873546,0.000029952464,0.00014023618,0.00065655424,0.0013549183,0.002219535,0.04581011,0.69005454,0.25879714],"study_design_scores_gemma":[0.000027680173,0.000028416398,0.00080926006,0.00032633342,0.000031866828,0.00016009419,0.00030063558,0.0037297779,0.0016801369,0.021239098,0.97162545,0.00004110465],"about_ca_topic_score_codex":0.2276511,"about_ca_topic_score_gemma":0.37509573,"teacher_disagreement_score":0.2276511,"about_ca_system_score_codex":0.008717044,"about_ca_system_score_gemma":0.015872383,"threshold_uncertainty_score":0.4526521},"labels":[],"label_agreement":null},{"id":"W561957468","doi":"10.1007/978-3-642-20895-9","title":"Logic programming and nonmonotonic reasoning : 11th international conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011 : proceedings","year":2011,"lang":"en","type":"book","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Non-monotonic logic; Logic programming; Knowledge representation and reasoning; Computer science; Representation (politics); Belief revision; Deductive reasoning; Programming language; Description logic; Artificial intelligence; Political science","score_opus":0.022132998518609604,"score_gpt":0.22716811646817708,"score_spread":0.20503511794956747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W561957468","genre_codex":"methods","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.0054298164,0.30449346,0.38177803,0.018137783,0.015648538,0.00026371822,0.0022684082,0.00557753,0.2664027],"genre_scores_gemma":[0.023015514,0.17506996,0.17812422,0.002296201,0.00460036,0.00022199984,0.0052349833,0.0018280444,0.60960865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991142,0.0001498794,0.00005271512,0.00017531133,0.00043674812,0.000071098366],"domain_scores_gemma":[0.99853194,0.0006028502,0.00004111581,0.00016891905,0.00051813887,0.00013704276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019690897,0.001133954,0.001454894,0.0012367077,0.0010493991,0.0062007695,0.0016512807,0.0009934703,0.04457631],"category_scores_gemma":[0.0020066155,0.0011225904,0.0008201075,0.003302201,0.0017975577,0.004589326,0.0018088922,0.0030111207,0.011716579],"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.00012321946,0.00013507236,0.00022627505,0.00093088625,0.00004583989,0.000095628224,0.00020777665,0.0020667105,0.001855304,0.05270543,0.5171998,0.42440805],"study_design_scores_gemma":[0.000034740642,0.000028706918,0.0008241968,0.0005568119,0.000048682294,0.0002985,0.00015090259,0.008209558,0.001421549,0.05284875,0.9355479,0.00002981329],"about_ca_topic_score_codex":0.031180477,"about_ca_topic_score_gemma":0.061074793,"teacher_disagreement_score":0.04457631,"about_ca_system_score_codex":0.0044369865,"about_ca_system_score_gemma":0.006471364,"threshold_uncertainty_score":0.14912266},"labels":[],"label_agreement":null},{"id":"W56552273","doi":"10.1007/978-3-540-39451-8_8","title":"Optimality Theory through Default Logic","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Default logic; Computer science; Artificial intelligence; Autoepistemic logic; Multimodal logic; Description logic","score_opus":0.021874402639700145,"score_gpt":0.2745501081635801,"score_spread":0.25267570552387997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56552273","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.026289782,0.004644459,0.6897546,0.015197318,0.0006773214,0.000066563705,0.000588623,0.0005732544,0.262208],"genre_scores_gemma":[0.8067766,0.0030228882,0.15016669,0.0019823422,0.0014438512,0.000176876,0.00090915733,0.00047086936,0.03505074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972696,0.0010128972,0.00017377002,0.00061842013,0.0006526753,0.00027263266],"domain_scores_gemma":[0.99664706,0.0020401536,0.00018033214,0.00052353326,0.00045969087,0.00014924473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003615867,0.00079537666,0.0014888658,0.0021670815,0.001947591,0.005339233,0.0020289836,0.0020975033,0.014383815],"category_scores_gemma":[0.0076907217,0.000979186,0.0015962023,0.0015276137,0.0066092634,0.015700584,0.0033321164,0.005412886,0.0016331372],"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.000008384866,0.0000049984164,0.000032503005,0.000012464566,0.000004854556,0.000009337514,0.000031879903,0.0004184183,0.000033858203,0.9965413,0.00076017994,0.0021418028],"study_design_scores_gemma":[0.0000034757177,0.0000010242816,0.000013744789,0.0000042418224,0.0000024114747,0.0000053009335,0.0000051094657,0.0009685403,0.000023750565,0.99805284,0.0009177913,0.0000016424548],"about_ca_topic_score_codex":0.0025770406,"about_ca_topic_score_gemma":0.0029036314,"teacher_disagreement_score":0.014383815,"about_ca_system_score_codex":0.0040199403,"about_ca_system_score_gemma":0.0016424224,"threshold_uncertainty_score":0.04811865},"labels":[],"label_agreement":null},{"id":"W58214528","doi":"10.1007/978-3-642-21043-3_2","title":"Grounding Formulas with Complex Terms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Solver; Extension (predicate logic); Relational calculus; Theoretical computer science; Domain (mathematical analysis); Field (mathematics); Ground; Sentence; Variety (cybernetics); Algebra over a field; Relational database; Relational model; Artificial intelligence; Programming language; Mathematics; Database; Pure mathematics","score_opus":0.034303486990457224,"score_gpt":0.24145064354896023,"score_spread":0.20714715655850302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58214528","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.032973688,0.005962004,0.72341365,0.0031514505,0.0007452422,0.00015167498,0.0008111862,0.0013665793,0.23142456],"genre_scores_gemma":[0.55776393,0.007409688,0.35411444,0.0009772019,0.0008808096,0.00032583586,0.0023659205,0.0007487791,0.07541343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912375,0.00020350733,0.0001069426,0.00015863591,0.000319625,0.000087426124],"domain_scores_gemma":[0.9989041,0.00060776895,0.00006594624,0.00024070473,0.00014030545,0.000041152714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010994143,0.000999198,0.00091951556,0.0014606328,0.0012074796,0.004322373,0.0016566134,0.001143388,0.010897232],"category_scores_gemma":[0.0032392778,0.00081395434,0.0009450907,0.002673745,0.0027637188,0.009117854,0.0026522104,0.0037071065,0.0023595325],"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.0000142351255,0.000012478179,0.000071169794,0.00008226415,0.000009164761,0.000060267525,0.00018264331,0.0007628959,0.00054779125,0.96667963,0.0030563003,0.02852116],"study_design_scores_gemma":[0.00000828204,0.000006001707,0.000037687518,0.000044402215,0.000008429624,0.000039658175,0.000032755943,0.0018813207,0.0006413388,0.9784923,0.018802073,0.0000057916236],"about_ca_topic_score_codex":0.0010549497,"about_ca_topic_score_gemma":0.0014745438,"teacher_disagreement_score":0.010897232,"about_ca_system_score_codex":0.0012167367,"about_ca_system_score_gemma":0.00072676624,"threshold_uncertainty_score":0.036454856},"labels":[],"label_agreement":null},{"id":"W58787838","doi":"","title":"Proceedings of the 14th symposium on Principles and practice of declarative programming","year":2012,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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; Programming language; Concurrency; Semantics (computer science); Declarative programming; Rotation formalisms in three dimensions; Library science; Programming paradigm; Mathematics; Inductive programming","score_opus":0.030717708131769838,"score_gpt":0.2689145262220885,"score_spread":0.23819681809031867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58787838","genre_codex":"methods","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.0023936415,0.088649906,0.6514137,0.03520194,0.037559148,0.0006214261,0.0016104684,0.005179203,0.17737061],"genre_scores_gemma":[0.038148176,0.08332357,0.6295751,0.017116928,0.023388,0.0019712015,0.0057127583,0.005545493,0.19521886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9898543,0.0035982374,0.0015957119,0.0015102645,0.002951169,0.0004903473],"domain_scores_gemma":[0.98850226,0.006081062,0.00033376442,0.0023163413,0.0020740198,0.00069254247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010965927,0.0014050639,0.0018873967,0.0017370287,0.0014345694,0.0103733055,0.0031418276,0.0033136508,0.05355286],"category_scores_gemma":[0.01604254,0.0013918828,0.0031019638,0.0018674264,0.0041373065,0.008139108,0.0047130943,0.010657326,0.027448038],"study_design_candidate":"not_applicable","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.000125587,0.00013774238,0.0005260738,0.001436165,0.00014471114,0.00026763137,0.0014452571,0.0017875244,0.0025404887,0.43325996,0.28563124,0.27269763],"study_design_scores_gemma":[0.0000190219,0.000037320406,0.0002005978,0.0005704957,0.00002440253,0.00027160818,0.00008018645,0.001593944,0.00040386454,0.06705998,0.9297137,0.000024756248],"about_ca_topic_score_codex":0.0021347122,"about_ca_topic_score_gemma":0.0012597884,"teacher_disagreement_score":0.05355286,"about_ca_system_score_codex":0.0025493526,"about_ca_system_score_gemma":0.00409459,"threshold_uncertainty_score":0.17915219},"labels":[],"label_agreement":null},{"id":"W65369927","doi":"","title":"Iterated revision as prioritized merging","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":84,"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":"Iterated function; Sequence (biology); Interpretation (philosophy); Belief revision; Computer science; Operator (biology); Pearl; Mathematical economics; Epistemology; Artificial intelligence; Theoretical computer science; Mathematics; Philosophy; Programming language","score_opus":0.015665263540944396,"score_gpt":0.2693463618526725,"score_spread":0.25368109831172814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65369927","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.12704806,0.0025178117,0.7817591,0.006207284,0.0002804268,0.00036340105,0.00021154848,0.0009762361,0.08063614],"genre_scores_gemma":[0.8853615,0.00056260865,0.10539843,0.00063156756,0.00027369536,0.00020684843,0.000094144525,0.00008884705,0.0073824776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98910743,0.004399828,0.00078945374,0.0017012219,0.0032377483,0.0007644701],"domain_scores_gemma":[0.9816451,0.009230178,0.0017983143,0.0041028475,0.0025392808,0.0006843167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011439415,0.0006201799,0.0008339921,0.0022080147,0.0018044156,0.0051544174,0.0024314346,0.002067663,0.0038235537],"category_scores_gemma":[0.026447082,0.00061163784,0.0019303582,0.0014386176,0.0067755124,0.009948829,0.0044486397,0.0027330688,0.0004486529],"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.0000527184,0.000025005596,0.0005204742,0.00007939566,0.000047195754,0.00022680184,0.0016557287,0.0051483163,0.00090134575,0.97100765,0.00068166264,0.019653806],"study_design_scores_gemma":[0.000041424162,0.000035327164,0.00032932084,0.000026246586,0.000033428274,0.00017738364,0.00013562448,0.022418577,0.0006443361,0.9722262,0.0039054223,0.000026626216],"about_ca_topic_score_codex":0.0026130378,"about_ca_topic_score_gemma":0.0018180591,"teacher_disagreement_score":0.011439415,"about_ca_system_score_codex":0.0037484628,"about_ca_system_score_gemma":0.0019234391,"threshold_uncertainty_score":0.06049812},"labels":[],"label_agreement":null},{"id":"W67032368","doi":"","title":"Peer-to-peer query answering with inconsistent knowledge","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Soundness; Computer science; Exploit; Logical consequence; Completeness (order theory); Web query classification; Question answering; Web search query; Relation (database); Information retrieval; Theoretical computer science; Data mining; Artificial intelligence; Search engine; Programming language; Mathematics","score_opus":0.026656280182577773,"score_gpt":0.24608662898898315,"score_spread":0.21943034880640538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67032368","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.040652834,0.0003626301,0.9551996,0.00079807924,0.00003178496,0.00021069864,0.00008042588,0.00047932265,0.002184633],"genre_scores_gemma":[0.5766576,0.00043669032,0.42063594,0.00019475874,0.00016133723,0.00021545579,0.0003490342,0.00008015577,0.0012690338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9847739,0.006668614,0.0010378856,0.002488196,0.0042888317,0.00074262556],"domain_scores_gemma":[0.9588699,0.031839058,0.0022947246,0.003874302,0.002669844,0.00045221223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011718728,0.0008675473,0.0021890802,0.0015110781,0.0024398747,0.0037760162,0.0043155565,0.0028769646,0.001678455],"category_scores_gemma":[0.039824124,0.0008777781,0.0012922401,0.002838223,0.0027847148,0.0065719034,0.0041330983,0.002408874,0.00033557546],"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.00082054205,0.0006144474,0.0053487797,0.0010160645,0.0005165833,0.001832891,0.00227266,0.43838543,0.014479831,0.3280722,0.004830186,0.20181027],"study_design_scores_gemma":[0.00015714123,0.000098153105,0.00038294488,0.000030121833,0.00013722476,0.00030243292,0.0003141524,0.76391447,0.004238096,0.22717196,0.0032216865,0.000031586864],"about_ca_topic_score_codex":0.0037941835,"about_ca_topic_score_gemma":0.0040602437,"teacher_disagreement_score":0.011718728,"about_ca_system_score_codex":0.0016680626,"about_ca_system_score_gemma":0.0027811711,"threshold_uncertainty_score":0.06197536},"labels":[],"label_agreement":null},{"id":"W6891626384","doi":"10.4230/lipics.opodis.2022.6","title":"The Step Complexity of Multidimensional Approximate Agreement","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"","keywords":"Convex hull; Computational complexity theory; Upper and lower bounds; Set (abstract data type); Time complexity; Measure (data warehouse); Regular polygon; Approximation algorithm","score_opus":0.03932867486288999,"score_gpt":0.27307863806881294,"score_spread":0.23374996320592295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891626384","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.10754571,0.0003466902,0.8812029,0.00095631345,0.000044661778,0.00018586,0.00037615412,0.0012775701,0.0080641685],"genre_scores_gemma":[0.7131525,0.00025651837,0.28049308,0.0002443713,0.000043583357,0.0004981278,0.0006339265,0.00019998872,0.0044778343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926146,0.0015567432,0.00076453417,0.0013745627,0.0029577003,0.00073178066],"domain_scores_gemma":[0.96573514,0.024144066,0.0016682529,0.0057486785,0.0020791038,0.00062470685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003384975,0.0006590067,0.0012578411,0.0008624898,0.0010556998,0.0038883605,0.0027248156,0.0019155708,0.0056567965],"category_scores_gemma":[0.026349733,0.00057295273,0.0013310557,0.0014041422,0.0021295373,0.009295795,0.004908826,0.0033801575,0.0013892157],"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.0023473497,0.00036829736,0.005920145,0.00075269566,0.00022172538,0.00031448144,0.0010236363,0.4489114,0.034291055,0.2981278,0.004281398,0.20344],"study_design_scores_gemma":[0.00008230347,0.00016749957,0.00067745335,0.000036311485,0.000039631006,0.00015075946,0.00012926638,0.8202931,0.019060493,0.15718804,0.002135583,0.00003954191],"about_ca_topic_score_codex":0.0013748097,"about_ca_topic_score_gemma":0.0010772444,"teacher_disagreement_score":0.0056567965,"about_ca_system_score_codex":0.0020884562,"about_ca_system_score_gemma":0.0020780496,"threshold_uncertainty_score":0.018923938},"labels":[],"label_agreement":null},{"id":"W6950610959","doi":"10.5683/sp3/djsgwi","title":"Enquête sur les services aux victimes [Canada] [B2020]","year":2018,"lang":"fr","type":"dataset","venue":"Borealis","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":"Information center; Service (business); Poison control","score_opus":0.02391055334300722,"score_gpt":0.24438662242585935,"score_spread":0.2204760690828521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950610959","genre_codex":"other","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0225896,0.012805829,0.0029725695,0.08760069,0.0058371713,0.002499095,0.11580966,0.0010981519,0.7487872],"genre_scores_gemma":[0.043476302,0.011124804,0.0057213097,0.025892057,0.00056537776,0.0009767902,0.03869949,0.00040583994,0.8731381],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948719,0.00036236143,0.00016392404,0.00024514357,0.002613566,0.0017430978],"domain_scores_gemma":[0.98345286,0.00039590945,0.00037600312,0.00022609651,0.011865159,0.003684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034580429,0.000759739,0.0004328852,0.0029131284,0.0076967245,0.005060308,0.0023755254,0.0024186417,0.060129322],"category_scores_gemma":[0.0071826163,0.00061033573,0.0007312601,0.0048552444,0.0011613955,0.001068464,0.0021446866,0.0028011615,0.01040171],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056197277,0.000050409133,0.0056662704,0.0002690055,0.0000218616,0.00011215701,0.0008960594,0.00017817761,0.0003401024,0.0075453245,0.94805396,0.036810398],"study_design_scores_gemma":[0.000017045482,0.00002488604,0.029124303,0.00025967238,0.000014918948,0.000030044468,0.0011671853,0.00009844272,0.00018239784,0.00027828506,0.9687771,0.000025736093],"about_ca_topic_score_codex":0.9919824,"about_ca_topic_score_gemma":0.99514115,"teacher_disagreement_score":0.060129322,"about_ca_system_score_codex":0.05815981,"about_ca_system_score_gemma":0.30440167,"threshold_uncertainty_score":0.42198098},"labels":[],"label_agreement":null},{"id":"W6958229184","doi":"10.6084/m9.figshare.22606658.v1","title":"Additional file 3 of The effect of guselkumab on inhibiting radiographic progression in patients with active psoriatic arthritis: study protocol for APEX, a Phase 3b, multicenter, randomized, double-blind, placebo-controlled trial","year":2023,"lang":"en","type":"article","venue":"Figshare","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":"Memorial University of Newfoundland","funders":"","keywords":"Protocol (science); Radiography; Clinical trial; Randomized controlled trial; Clinical endpoint","score_opus":0.023585354933705602,"score_gpt":0.3129842324257971,"score_spread":0.2893988774920915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958229184","genre_codex":"dataset","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003641723,0.0009274891,0.0021736496,0.0016974473,0.0005992776,0.05750624,0.9169019,0.0012084723,0.015343796],"genre_scores_gemma":[0.07585181,0.0022686701,0.020935895,0.0071122423,0.0013777143,0.47532943,0.3310389,0.0010315953,0.08505381],"study_design_codex":"not_applicable","study_design_gemma":"randomized_trial","domain_scores_codex":[0.9986656,0.0005237819,0.00023620775,0.00017587368,0.00022133868,0.00017725273],"domain_scores_gemma":[0.98632556,0.008588664,0.0019154061,0.0007874752,0.0016683161,0.00071467843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004048408,0.0013674559,0.00272152,0.0006964945,0.0010334079,0.0014770179,0.0015585826,0.0017246349,0.7806438],"category_scores_gemma":[0.018547932,0.0009931164,0.0020171152,0.0013794886,0.0005193734,0.0015646203,0.0006734488,0.0019754807,0.058663122],"study_design_candidate":"randomized_trial","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.11280777,0.0020692858,0.0009214111,0.033508953,0.0008790645,0.00013601396,0.00014472839,0.00086904014,0.0008113167,0.0027450784,0.8042316,0.040875793],"study_design_scores_gemma":[0.7382914,0.008058877,0.007939873,0.004366171,0.0014350876,0.0002801055,0.00008940364,0.0015888473,0.0012712318,0.007828131,0.2287182,0.00013264564],"about_ca_topic_score_codex":0.0015846126,"about_ca_topic_score_gemma":0.004170498,"teacher_disagreement_score":0.7806438,"about_ca_system_score_codex":0.0012202709,"about_ca_system_score_gemma":0.0025227088,"threshold_uncertainty_score":0.31288493},"labels":[],"label_agreement":null},{"id":"W6966900749","doi":"10.48550/arxiv.1910.14217","title":"Towards A Logical Account of Epistemic Causality","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Toronto Metropolitan University","funders":"","keywords":"Causality (physics); Dimension (graph theory); Point (geometry); Causal reasoning; Logical consequence; Work (physics)","score_opus":0.08886660171890474,"score_gpt":0.2079827110153487,"score_spread":0.11911610929644396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966900749","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.007781424,0.00089127733,0.9438897,0.012842101,0.00035572247,0.0000577212,0.00018429947,0.00029937472,0.033698432],"genre_scores_gemma":[0.6189232,0.0023708863,0.36116385,0.0043428065,0.001518266,0.00046895375,0.0005962878,0.000313067,0.010302609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931726,0.0037612615,0.00051020755,0.0008523924,0.0013435667,0.00036003476],"domain_scores_gemma":[0.9817931,0.012218488,0.0014381316,0.0021335734,0.0019477801,0.0004689745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012947313,0.00096422184,0.00082015287,0.0030425785,0.0028368211,0.00828134,0.0026777491,0.003766854,0.00648897],"category_scores_gemma":[0.01823654,0.0010415234,0.002454368,0.002044635,0.011100688,0.020073755,0.0072310623,0.0077174082,0.0009702663],"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.0000040809923,0.000007698847,0.00008003308,0.000020797039,0.000006986521,0.000037193655,0.00010823088,0.0009645887,0.00005934795,0.99716103,0.00033559167,0.0012144506],"study_design_scores_gemma":[0.0000061742844,0.000003181688,0.000026701298,0.000012671249,0.0000066890702,0.000023409286,0.000037480244,0.0046110237,0.00009416962,0.9924447,0.0027289505,0.0000047968483],"about_ca_topic_score_codex":0.0017152505,"about_ca_topic_score_gemma":0.0018955168,"teacher_disagreement_score":0.012947313,"about_ca_system_score_codex":0.0029970563,"about_ca_system_score_gemma":0.0032985557,"threshold_uncertainty_score":0.06847274},"labels":[],"label_agreement":null},{"id":"W6982016933","doi":"","title":"Global Weather Forecasting Services Market Analysis &amp;amp; Trends - Special Focus has Been Made on 23 Countries Such as US, Canada, Mexico, UK, Germany, Spain, France, Italy, China &amp;amp; Brazil - ResearchAndMarkets.com - Industrial Goods (INDUSGDS) News","year":2020,"lang":"en","type":"other","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"China; Focus (optics); Market analysis; Economic forecasting; Market research; Trend analysis","score_opus":0.03472145774348298,"score_gpt":0.2731719906934566,"score_spread":0.23845053294997362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982016933","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.0010319006,0.0025110112,0.0018821155,0.019165024,0.007628597,0.000058843914,0.023762178,0.0031886091,0.94077176],"genre_scores_gemma":[0.0062645837,0.0036644342,0.0015033308,0.00175798,0.0021504944,0.000025387077,0.016336897,0.0011937533,0.9671031],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959415,0.000025697487,0.000014124612,0.00004588628,0.0002685207,0.00005165829],"domain_scores_gemma":[0.9979722,0.00032302394,0.00011209869,0.0001495638,0.0010304649,0.000412605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084106287,0.0006914021,0.00032490757,0.0018548719,0.0008136964,0.004808625,0.00053962134,0.0010771711,0.25185248],"category_scores_gemma":[0.0022036259,0.0002472442,0.00037386085,0.0032819894,0.0005156059,0.0034690022,0.0011645505,0.0014427333,0.17048304],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010702057,0.0000062168306,0.00012869215,0.000030083811,0.0000010842309,0.000012764773,0.000010006829,0.00004340294,0.00008341295,0.0024460254,0.96599936,0.031228175],"study_design_scores_gemma":[0.0000030544693,0.0000039833462,0.0006683168,0.000026283367,0.0000012358073,0.000010663382,0.000029135017,0.00012724973,0.00013518317,0.0010103676,0.99798167,0.0000027589308],"about_ca_topic_score_codex":0.015452038,"about_ca_topic_score_gemma":0.030887961,"teacher_disagreement_score":0.984548,"about_ca_system_score_codex":0.001362252,"about_ca_system_score_gemma":0.0021379886,"threshold_uncertainty_score":0.8425305},"labels":[],"label_agreement":null},{"id":"W6992480192","doi":"","title":"Lincx: a linear logical framework with first-class contexts","year":2017,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; McGill University","keywords":"Decidability; Context (archaeology); Linear logic; Generalization; Joins; Logical framework; Set (abstract data type); Venn diagram","score_opus":0.019249873388503966,"score_gpt":0.2586196191335533,"score_spread":0.23936974574504932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992480192","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.004759318,0.00076516636,0.9664639,0.0022564714,0.00013645201,0.00009752447,0.0005385125,0.0017020181,0.023280745],"genre_scores_gemma":[0.2919932,0.0013168544,0.684803,0.0015177238,0.00047044945,0.00041374686,0.00090209686,0.00067951554,0.017903397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971027,0.0011639136,0.00019948355,0.00060369965,0.0005797001,0.0003505472],"domain_scores_gemma":[0.99787426,0.0009891076,0.0002205043,0.00038860406,0.00035842348,0.00016908796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043449495,0.0010199419,0.00068024505,0.0021104228,0.0021654065,0.0067801983,0.0030947807,0.0014756079,0.009985903],"category_scores_gemma":[0.004094503,0.0010963827,0.0020406593,0.0015647865,0.0070176115,0.013009514,0.004396678,0.0052152104,0.0019307286],"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.000009645444,0.000005994701,0.000070581744,0.00003726327,0.00000430505,0.00003197962,0.00017640211,0.0009269354,0.0002537941,0.9924666,0.0009682402,0.0050482494],"study_design_scores_gemma":[0.000021739406,0.00002426967,0.00013489844,0.000098868375,0.00003159673,0.00010377475,0.00021591541,0.015309164,0.002048619,0.9106307,0.071346454,0.000033918914],"about_ca_topic_score_codex":0.009443998,"about_ca_topic_score_gemma":0.0084010875,"teacher_disagreement_score":0.009985903,"about_ca_system_score_codex":0.0051871585,"about_ca_system_score_gemma":0.0034862775,"threshold_uncertainty_score":0.037635624},"labels":[],"label_agreement":null},{"id":"W6992685885","doi":"","title":"Media and Climate Change Observatory Monthly Summary: The new normal - Issue 34, October 2019","year":2019,"lang":"en","type":"article","venue":"CU Scholar (University of Colorado Boulder)","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":"Nucleofection; Gestational period; TSG101; Diafiltration; Dysgeusia; Proteogenomics; Liquation; Hyporeflexia; Triacetin","score_opus":0.017849271157283127,"score_gpt":0.20895292747415362,"score_spread":0.19110365631687048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992685885","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067270924,0.013299497,0.0009577283,0.12230362,0.18027258,0.00073930906,0.171501,0.0029588074,0.5012404],"genre_scores_gemma":[0.020253114,0.008047073,0.00086700346,0.015951876,0.061717838,0.00057883805,0.06035872,0.0008123733,0.83141315],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987232,0.00009503244,0.00012268849,0.00013845903,0.0007171486,0.00020330548],"domain_scores_gemma":[0.9921096,0.00092804834,0.0007404488,0.0003716713,0.0044683563,0.001381879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016178256,0.0010755915,0.00052391796,0.003770259,0.0014655336,0.0056997826,0.0010334364,0.0029758487,0.17829758],"category_scores_gemma":[0.0075440668,0.00043560835,0.00040688677,0.003280227,0.0004909023,0.0030047742,0.0019472361,0.00265145,0.11929404],"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.00003082975,0.0000107770975,0.0005574423,0.00008058809,0.0000016426836,0.00002343767,0.000017826886,0.000012686311,0.00010311897,0.00014737129,0.9904541,0.008560325],"study_design_scores_gemma":[0.000012155322,0.000016327147,0.0061222077,0.00017174226,0.0000045880074,0.000026665375,0.00006976331,0.00005970252,0.00015086519,0.00011878405,0.9932347,0.00001241011],"about_ca_topic_score_codex":0.016982093,"about_ca_topic_score_gemma":0.04012712,"teacher_disagreement_score":0.17829758,"about_ca_system_score_codex":0.0024645797,"about_ca_system_score_gemma":0.0027824687,"threshold_uncertainty_score":0.5964648},"labels":[],"label_agreement":null},{"id":"W6993006989","doi":"","title":"NEXPTIME-Completeness of Provability in Continuous Quantitative Equational Logic","year":2023,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Logic, Reasoning, and Knowledge","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebra over a field; Equational logic; Calculus (dental); Sequence (biology); Term (time)","score_opus":0.0437105543704389,"score_gpt":0.28589765922517,"score_spread":0.2421871048547311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6993006989","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.0601115,0.0017095512,0.901502,0.0062026894,0.00016807453,0.00021411965,0.0010975902,0.0008239541,0.028170565],"genre_scores_gemma":[0.77798927,0.001323897,0.20358391,0.001618466,0.0005236346,0.0003296987,0.001618463,0.00031593835,0.01269677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99274325,0.0018376795,0.00059351634,0.0019365592,0.0022416306,0.0006473504],"domain_scores_gemma":[0.95743096,0.035004374,0.001104665,0.0025742496,0.0032214138,0.0006642855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072715837,0.00080249406,0.0009779675,0.0015938386,0.0015751161,0.004086327,0.0019544407,0.0012522265,0.005938051],"category_scores_gemma":[0.021753494,0.0009568156,0.002849346,0.0014716365,0.005761025,0.0130225625,0.00393949,0.008936599,0.00058101164],"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.00019169471,0.00011461437,0.0010673566,0.00043564945,0.00007584453,0.0001532217,0.0008648573,0.0139457565,0.0026063607,0.9491597,0.0025867005,0.028798295],"study_design_scores_gemma":[0.00007267233,0.00007777829,0.000673212,0.00008118403,0.000050037786,0.00017095753,0.00015112049,0.062388115,0.0059193857,0.9213564,0.009012752,0.00004637635],"about_ca_topic_score_codex":0.0030316345,"about_ca_topic_score_gemma":0.0025017895,"teacher_disagreement_score":0.0072715837,"about_ca_system_score_codex":0.0038300212,"about_ca_system_score_gemma":0.0030078285,"threshold_uncertainty_score":0.03845632},"labels":[],"label_agreement":null},{"id":"W7015644646","doi":"","title":"Theorem Proving In Higher Order Logics","year":2002,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Correctness; Proof assistant; Unification; Abstract syntax; Algebra over a field; Semantics (computer science); Syntax","score_opus":0.04425048212213209,"score_gpt":0.22750247003031776,"score_spread":0.18325198790818567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015644646","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.015366211,0.0022685968,0.93471885,0.0026747647,0.000405124,0.00014942147,0.00072642666,0.014159555,0.029531045],"genre_scores_gemma":[0.2715207,0.002458907,0.694754,0.0018430753,0.0005255515,0.0005916143,0.0023756344,0.0048078094,0.021122646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992254,0.003957682,0.0006363923,0.0008092853,0.0018843554,0.00045823236],"domain_scores_gemma":[0.98891836,0.007840487,0.00047329883,0.0015965081,0.0009422884,0.00022898962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009039028,0.0011347958,0.0015477181,0.003062849,0.001716189,0.009136229,0.0023960993,0.0014936008,0.018479057],"category_scores_gemma":[0.014289723,0.0018817746,0.002671335,0.0032640626,0.004639703,0.013349174,0.0064592715,0.005243806,0.005082571],"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.00013029971,0.00007408198,0.00029825987,0.0004044456,0.00004718873,0.00011920289,0.00075543876,0.014910378,0.0016193466,0.8926932,0.015367127,0.07358103],"study_design_scores_gemma":[0.000060727838,0.000021567052,0.00013074749,0.00019745313,0.00002731718,0.00007822113,0.00011402139,0.046196103,0.0030901642,0.8977785,0.052263513,0.00004164098],"about_ca_topic_score_codex":0.0022146346,"about_ca_topic_score_gemma":0.0025237831,"teacher_disagreement_score":0.018479057,"about_ca_system_score_codex":0.004736016,"about_ca_system_score_gemma":0.0025733942,"threshold_uncertainty_score":0.0618186},"labels":[],"label_agreement":null},{"id":"W7017242398","doi":"","title":"Ácidos Graxos Trans: Alimentos e Efeitos na Saúde Trans fatty acids: foods and effects on health","year":2006,"lang":"pt","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"Polyunsaturated fatty acid; Human health; Milk fat; Milk production; Docosahexaenoic acid","score_opus":0.14157687040377476,"score_gpt":0.4836570134510298,"score_spread":0.34208014304725504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017242398","genre_codex":"review","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.18459235,0.78435236,0.0018106148,0.006482055,0.00066877215,0.000050881943,0.0009552861,0.0000659175,0.021021735],"genre_scores_gemma":[0.5032335,0.4694934,0.004276688,0.0029153621,0.0007212553,0.00008958947,0.000597979,0.00002684362,0.018645443],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996785,0.00012354189,0.0000293774,0.000050464056,0.00008239976,0.00003577779],"domain_scores_gemma":[0.9996313,0.00010671647,0.00009291038,0.000016122383,0.00010577669,0.00004708172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067516754,0.00044818353,0.00043843657,0.0008775979,0.00038813677,0.001963068,0.00027080686,0.0010699262,0.006196918],"category_scores_gemma":[0.0008246641,0.00018898062,0.00032757214,0.0012734678,0.00036628929,0.00075392844,0.0006234682,0.00083016726,0.001024161],"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.0045404257,0.00085506664,0.10629813,0.009954868,0.00095153163,0.0014470323,0.0019526936,0.0005115033,0.09172158,0.010595361,0.009255271,0.7619165],"study_design_scores_gemma":[0.00029426537,0.0049277586,0.45903853,0.0072351377,0.0014753903,0.007768264,0.0044042943,0.0010645542,0.036451265,0.013382192,0.4637949,0.00016346983],"about_ca_topic_score_codex":0.006492005,"about_ca_topic_score_gemma":0.0054867184,"teacher_disagreement_score":0.006492005,"about_ca_system_score_codex":0.0005816563,"about_ca_system_score_gemma":0.00055545877,"threshold_uncertainty_score":0.020730734},"labels":[],"label_agreement":null},{"id":"W7018124439","doi":"","title":"Deontic Logic and Normative Systems - 16th International Conference, DEON 2023, Trois-Rivieres, QC, Canada, July 5-7, 2023","year":2023,"lang":"en","type":"article","venue":"Open Repository and Bibliography (University of Luxembourg)","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":"Deontic logic; Normative","score_opus":0.02059331945961617,"score_gpt":0.21933655169248575,"score_spread":0.19874323223286958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018124439","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.011135894,0.17061228,0.1546739,0.045499146,0.018626688,0.00027557844,0.0031687848,0.0017663202,0.5942413],"genre_scores_gemma":[0.05828122,0.060990594,0.045169637,0.001329169,0.0028035264,0.00016276377,0.0033449805,0.0009951945,0.82692295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985336,0.00034352537,0.00007845558,0.00021579329,0.00069323194,0.00013538997],"domain_scores_gemma":[0.9974322,0.00097239244,0.000047481437,0.0002541594,0.0010936176,0.0002002134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047782166,0.00074762,0.001195105,0.001858657,0.0020783946,0.009187254,0.0011724572,0.001168094,0.0685552],"category_scores_gemma":[0.004040395,0.0008238562,0.0006832331,0.003326713,0.0036381327,0.0043167453,0.0013271676,0.0024645668,0.008074398],"study_design_candidate":"not_applicable","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.00010280922,0.00006791834,0.00033170424,0.00037400005,0.000023713894,0.000091006645,0.00062982156,0.0021963709,0.0008519767,0.48004824,0.36319476,0.15208761],"study_design_scores_gemma":[0.00002980034,0.000016280741,0.00066073507,0.0003793123,0.000013631223,0.00009699953,0.00031015277,0.0034501948,0.0006058689,0.10202541,0.89239246,0.000019182487],"about_ca_topic_score_codex":0.15409659,"about_ca_topic_score_gemma":0.17067866,"teacher_disagreement_score":0.15409659,"about_ca_system_score_codex":0.013140179,"about_ca_system_score_gemma":0.015141399,"threshold_uncertainty_score":0.30639935},"labels":[],"label_agreement":null},{"id":"W7022116565","doi":"","title":"The Law of Options","year":2002,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","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":"Supreme court; Common law; Judicial review; Certainty; Statutory law; Precedent; Choice of law; Judicial opinion","score_opus":0.02041712215978135,"score_gpt":0.23693597499856495,"score_spread":0.21651885283878358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022116565","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.008929571,0.018923605,0.036988482,0.027418813,0.00037168618,0.000049596758,0.00033855034,0.00006496909,0.90691465],"genre_scores_gemma":[0.82966924,0.0220556,0.018729227,0.0116987815,0.001251425,0.00019904567,0.0002820139,0.00010595964,0.11600872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995605,0.0007962571,0.0001700138,0.0005475179,0.002188989,0.0006923256],"domain_scores_gemma":[0.9981998,0.0008618537,0.0001244046,0.00022702792,0.00045092878,0.0001360557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032220874,0.0004828695,0.0006041943,0.0018023709,0.0064768884,0.009856843,0.0015815768,0.004181968,0.008142327],"category_scores_gemma":[0.005549922,0.0003932251,0.000693657,0.0020225344,0.035755854,0.006312414,0.0030450688,0.004848248,0.001165374],"study_design_candidate":"not_applicable","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":[7.0726344e-7,4.401423e-7,0.00001652561,0.0000042482575,6.2348136e-7,0.000010411752,0.00009150994,0.000059028738,0.000010006916,0.99794775,0.0008220029,0.0010367037],"study_design_scores_gemma":[0.000003736357,0.000002775325,0.00011577058,0.00006787574,0.0000040398227,0.000044652606,0.00012188387,0.00030613036,0.00004294445,0.91999114,0.07929147,0.000007671407],"about_ca_topic_score_codex":0.21600994,"about_ca_topic_score_gemma":0.1626689,"teacher_disagreement_score":0.21600994,"about_ca_system_score_codex":0.017337425,"about_ca_system_score_gemma":0.014675517,"threshold_uncertainty_score":0.42950523},"labels":[],"label_agreement":null},{"id":"W7024539990","doi":"","title":"S7 E7 - The Bachelorette Canada Week 7 - Squeeze the Teet!","year":2016,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","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":"Girl; Beauty; Bachelor; Work (physics)","score_opus":0.005367217599032685,"score_gpt":0.16983568194041623,"score_spread":0.16446846434138354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024539990","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.00036475234,0.0001588937,0.00018740652,0.0014425842,0.0013277396,0.0000768318,0.00630984,0.0008898482,0.989242],"genre_scores_gemma":[0.0009946228,0.00008670755,0.000087192806,0.00028349116,0.00006975597,0.000015768586,0.0012052751,0.00034165767,0.99691546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926573,0.00004384577,0.000015571672,0.000066931396,0.00035782685,0.00024999215],"domain_scores_gemma":[0.99679416,0.000092700415,0.000045700053,0.00013807922,0.0011972935,0.0017320577],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006840175,0.0007447465,0.0005985458,0.0012387991,0.00573775,0.0076468075,0.0010531442,0.0021249389,0.874847],"category_scores_gemma":[0.0025599306,0.00039584812,0.00061169086,0.0023357524,0.0007835888,0.0029984415,0.0036290176,0.0018812759,0.76372266],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148838935,0.000011143312,0.0001306759,0.000020293817,6.343055e-7,0.000022621929,0.000054434455,0.0000072357834,0.00005701842,0.0010713266,0.9899115,0.008698236],"study_design_scores_gemma":[0.0000026519783,0.000004281911,0.00033661426,0.000019369574,4.4314777e-7,0.000009769375,0.0001491317,0.000011500437,0.00004602742,0.00013217023,0.9992847,0.0000033440965],"about_ca_topic_score_codex":0.18897542,"about_ca_topic_score_gemma":0.49297914,"teacher_disagreement_score":0.81102455,"about_ca_system_score_codex":0.004762915,"about_ca_system_score_gemma":0.008987004,"threshold_uncertainty_score":0.3757509},"labels":[],"label_agreement":null},{"id":"W7034666830","doi":"","title":"What are the attitudes and practices regarding seeing and finding nutritional information on social media in the University of Saskatchewan community?","year":2020,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","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":"Social media; Perception; Nutrition information; Information seeking; Qualitative research; Mass media","score_opus":0.03334205948815879,"score_gpt":0.2654500955056185,"score_spread":0.2321080360174597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034666830","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.9930402,0.00025032347,0.000071967654,0.002283089,0.000012809333,0.000017364793,0.000089645946,0.000004153651,0.0042304094],"genre_scores_gemma":[0.99483645,0.0009798524,0.0001708949,0.00094481814,0.000008362446,0.00002880196,0.00009114942,0.0000057168177,0.0029339388],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9966376,0.0014578799,0.00016624277,0.00030247684,0.00079786556,0.0006379361],"domain_scores_gemma":[0.9846576,0.0058630924,0.002609996,0.00048590498,0.0024792498,0.003904144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037286866,0.00026083196,0.00042198139,0.0027983033,0.004958439,0.006534382,0.00090181915,0.0011488354,0.0061558913],"category_scores_gemma":[0.01186618,0.0006450625,0.0003819149,0.002769298,0.004257307,0.0025428014,0.003247221,0.0017378655,0.0009470888],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012468468,0.00041737378,0.6524522,0.00016706626,0.00007777687,0.0006327085,0.29934722,0.000072923576,0.0020984903,0.00076759653,0.002108775,0.04173326],"study_design_scores_gemma":[0.000011542707,0.000102141035,0.3268814,0.0002359103,0.00003074869,0.00016866713,0.66585946,0.0001843933,0.00027900396,0.00044801566,0.0057296096,0.000069046],"about_ca_topic_score_codex":0.54980767,"about_ca_topic_score_gemma":0.7423751,"teacher_disagreement_score":0.45019233,"about_ca_system_score_codex":0.008012957,"about_ca_system_score_gemma":0.012370453,"threshold_uncertainty_score":0.9056872},"labels":[],"label_agreement":null},{"id":"W7035382257","doi":"","title":"ماض جهاد المؤمنين | ولاية شرق آسيا","year":2021,"lang":"ar","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","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":"Brother; Islam; State (computer science); Supporter; Spanish Civil War","score_opus":0.008763000745769755,"score_gpt":0.191490669014414,"score_spread":0.18272766826864426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035382257","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.002051726,0.0015518318,0.0035997618,0.0052868025,0.008064776,0.00023431054,0.0015796185,0.001960175,0.97567105],"genre_scores_gemma":[0.008667247,0.0022304638,0.003287176,0.00169345,0.0013483674,0.00024299877,0.0016477862,0.002135592,0.97874695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986243,0.00018044295,0.00009015023,0.00016499535,0.00073334295,0.00020675837],"domain_scores_gemma":[0.9970529,0.00036486553,0.00014833249,0.00030871542,0.0015994118,0.00052577554],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015331234,0.0008373321,0.00053969666,0.0017763865,0.0029687763,0.008527583,0.00083952234,0.0013572172,0.69376385],"category_scores_gemma":[0.0058424915,0.0005635032,0.00060774974,0.002151721,0.0017830441,0.0033007842,0.002881907,0.003612613,0.6732368],"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.00013083708,0.00005156585,0.0004947162,0.00044432966,0.000009222406,0.0003201794,0.0012625434,0.000076060984,0.0019971272,0.02425099,0.8137648,0.15719756],"study_design_scores_gemma":[0.0000061443916,0.00000885738,0.00035131114,0.000096757685,0.0000023350235,0.00010607789,0.00051242404,0.000019292847,0.00038321692,0.00065175333,0.99785346,0.000008324977],"about_ca_topic_score_codex":0.0037258659,"about_ca_topic_score_gemma":0.005712612,"teacher_disagreement_score":0.30623615,"about_ca_system_score_codex":0.0020969412,"about_ca_system_score_gemma":0.0029214185,"threshold_uncertainty_score":0.43680865},"labels":[],"label_agreement":null},{"id":"W7037672289","doi":"","title":"Energy Savings from Retrofitting Residential Buildings with Phase Change Material Integrated Panel","year":2022,"lang":"en","type":"dissertation","venue":"Scholarship at UWindsor (University of Windsor)","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":"Building envelope; Retrofitting; Phase-change material; Latent heat; Solar gain; Thermal energy storage; Thermal mass; Efficient energy use; Parametric statistics; Thermal conductivity","score_opus":0.026575009302542217,"score_gpt":0.2359216542300616,"score_spread":0.20934664492751937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037672289","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.996497,0.000077782184,0.0016357928,0.000011070739,0.000004144703,0.000007812821,0.000074147196,0.000039605522,0.0016527981],"genre_scores_gemma":[0.9970782,0.00008949554,0.002108809,0.0000047221297,6.5434875e-7,0.000004453868,0.00009649625,0.000009546608,0.0006076728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988484,0.0000147141045,0.0000046088876,0.000014182272,0.000050318224,0.000031250212],"domain_scores_gemma":[0.9999348,0.000022367203,0.00001112038,0.000008906804,0.000017607796,0.000005222939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018517542,0.00044895476,0.00027338156,0.0003262407,0.0003081879,0.00055823725,0.0005892029,0.00026964597,0.0015035041],"category_scores_gemma":[0.0002405465,0.00015610586,0.00044756752,0.000503517,0.00018695966,0.0003724844,0.0003037966,0.00023123622,0.00019323823],"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.00085566187,0.00044443549,0.022005377,0.00028729357,0.000073225674,0.0004889775,0.00014998461,0.59103715,0.28311488,0.0009883341,0.0005357573,0.100019],"study_design_scores_gemma":[0.00008514399,0.0036825337,0.0921211,0.000069951086,0.0003408952,0.00034130117,0.0014753522,0.5145583,0.38059726,0.0007520931,0.0058932113,0.000082790815],"about_ca_topic_score_codex":0.009564096,"about_ca_topic_score_gemma":0.036086977,"teacher_disagreement_score":0.009564096,"about_ca_system_score_codex":0.00081966026,"about_ca_system_score_gemma":0.0003557868,"threshold_uncertainty_score":0.019016862},"labels":[],"label_agreement":null},{"id":"W7043875619","doi":"","title":"Twenty-sixth Annual IEEE Symposium on Logic in Computer Science 21-24 June 2011, Ontario, Canada .","year":2011,"lang":"en","type":"other","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer Applications; History of computing; Computer design","score_opus":0.013224074464839685,"score_gpt":0.20980746864015623,"score_spread":0.19658339417531653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043875619","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.0051609087,0.03364183,0.07208219,0.023148758,0.0125347255,0.0002838443,0.009357794,0.0073672114,0.8364226],"genre_scores_gemma":[0.008618673,0.013273598,0.009905375,0.0006331902,0.0005763984,0.00003720539,0.0037543501,0.000784076,0.96241707],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992399,0.00007681285,0.000037704995,0.00010678727,0.00039589635,0.00014280302],"domain_scores_gemma":[0.99743086,0.00029049168,0.000050301114,0.00029121892,0.0014720875,0.000465048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015621047,0.00091076223,0.0010469486,0.0018290065,0.0028471535,0.006644596,0.0015665978,0.0010794413,0.28908506],"category_scores_gemma":[0.0026118364,0.00049312646,0.0006057742,0.0022769102,0.001629018,0.003007654,0.002126619,0.0018335135,0.1220909],"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.00008796588,0.000039460036,0.0005874498,0.00027215923,0.000021260454,0.00011997315,0.00027002042,0.00033463645,0.0012212079,0.01397849,0.8366001,0.14646724],"study_design_scores_gemma":[0.000009080976,0.000014561557,0.0007841278,0.00016248426,0.000018157649,0.000098712815,0.00026856147,0.0008565586,0.0007259739,0.006700096,0.9903438,0.000017914437],"about_ca_topic_score_codex":0.21946475,"about_ca_topic_score_gemma":0.5860141,"teacher_disagreement_score":0.28908506,"about_ca_system_score_codex":0.008442952,"about_ca_system_score_gemma":0.013788691,"threshold_uncertainty_score":0.96708584},"labels":[],"label_agreement":null},{"id":"W7045963298","doi":"","title":"Conditional irrelevance in belief change","year":2021,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Hyporeflexia; Articular cartilage damage; TSG101; Gestational period; Circumstantial evidence","score_opus":0.0190047443188632,"score_gpt":0.22889948419030687,"score_spread":0.20989473987144366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045963298","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.05069665,0.0003032536,0.9305283,0.0017300476,0.0000920145,0.0001311049,0.00007413526,0.00036868016,0.016075984],"genre_scores_gemma":[0.85378915,0.00019653268,0.1414869,0.00037856048,0.00009995369,0.0001830728,0.00008992577,0.00007945902,0.0036964111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98624945,0.0060289362,0.0009961473,0.002185093,0.0037581173,0.00078216946],"domain_scores_gemma":[0.9553222,0.027450414,0.0037984364,0.006505002,0.005977027,0.00094682927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015881123,0.00062553026,0.00059380464,0.0016367915,0.001451451,0.0031886294,0.0017022111,0.0011479547,0.0035162806],"category_scores_gemma":[0.044685315,0.000579549,0.0018525699,0.0009801941,0.008217645,0.008770797,0.0043742824,0.0039905095,0.00036797926],"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.00009278007,0.000061895524,0.0013637105,0.00017508763,0.00006624916,0.00016861763,0.0030759694,0.011391139,0.003080937,0.945202,0.000483564,0.03483812],"study_design_scores_gemma":[0.000040273506,0.00014967061,0.0012122852,0.000115026196,0.00008803071,0.00016629363,0.0006363695,0.050444122,0.0058792545,0.93178886,0.009403411,0.00007644544],"about_ca_topic_score_codex":0.002678246,"about_ca_topic_score_gemma":0.0018981817,"teacher_disagreement_score":0.015881123,"about_ca_system_score_codex":0.0028162797,"about_ca_system_score_gemma":0.0023178933,"threshold_uncertainty_score":0.08398843},"labels":[],"label_agreement":null},{"id":"W7093366356","doi":"10.1007/978-3-032-08887-1_2","title":"Specifying an Obligation Taxonomy in the Non-Markovian Situation Calculus","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Correctness; Situation calculus; Formalism (music); Event calculus; Action (physics); Obligation; Calculus (dental); Rotation formalisms in three dimensions","score_opus":0.026055996173328252,"score_gpt":0.25225613478204045,"score_spread":0.2262001386087122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093366356","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.01194678,0.00011346593,0.97240645,0.00045711553,0.00008802906,0.00019654389,0.00036790757,0.0012275557,0.013196234],"genre_scores_gemma":[0.17732851,0.00026321114,0.81337714,0.00019759398,0.00006042418,0.0002601863,0.0006806848,0.00041765752,0.007414691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637103,0.0011829347,0.0004988772,0.00050333684,0.0010253959,0.0004184609],"domain_scores_gemma":[0.996236,0.0023215113,0.0002150468,0.0005120234,0.00048627984,0.00022905985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053590396,0.00078315515,0.0007858257,0.0014625605,0.0027713317,0.0061185,0.0024810666,0.0017576346,0.008113265],"category_scores_gemma":[0.007681139,0.0016877387,0.0023600974,0.0014134909,0.0025449635,0.012467412,0.004548501,0.003378911,0.001725212],"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.00002984886,0.000043485532,0.00040050576,0.00007704773,0.000015425365,0.0002896464,0.000859348,0.0055192783,0.0014649897,0.9754676,0.0014422889,0.014390431],"study_design_scores_gemma":[0.000028883116,0.000020412344,0.00018481749,0.0001151532,0.00003987604,0.00026877737,0.0004194063,0.09442071,0.0036710943,0.8594346,0.041344818,0.000051401166],"about_ca_topic_score_codex":0.0060529504,"about_ca_topic_score_gemma":0.014087138,"teacher_disagreement_score":0.008113265,"about_ca_system_score_codex":0.0024213907,"about_ca_system_score_gemma":0.0038217178,"threshold_uncertainty_score":0.028341651},"labels":[],"label_agreement":null},{"id":"W7095473400","doi":"","title":"School of Health Science,","year":2004,"lang":"en","type":"article","venue":"","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":"Quality (philosophy); Quarter (Canadian coin); Qualitative research; Health care; Public health","score_opus":0.021955859050207843,"score_gpt":0.282245537755767,"score_spread":0.26028967870555914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095473400","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.0018943117,0.07709041,0.004446626,0.21990255,0.017255595,0.00012359874,0.0032955096,0.0004676978,0.67552376],"genre_scores_gemma":[0.10498981,0.14272094,0.0058915704,0.07575312,0.01619246,0.0007815107,0.002709418,0.00049824535,0.650463],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971609,0.0009263672,0.00012384163,0.00080319773,0.00073201,0.0002536644],"domain_scores_gemma":[0.9935427,0.0034785508,0.00029681565,0.00051199895,0.0011874187,0.0009825261],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003011623,0.0008699707,0.0011287782,0.0018163112,0.0017617632,0.0062658065,0.0011340874,0.0050009675,0.29212144],"category_scores_gemma":[0.013716539,0.00031258483,0.00035760112,0.0033221547,0.0028744354,0.0035976036,0.0024627235,0.0051314984,0.0787973],"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.000078687066,0.00007020378,0.0009198752,0.001106299,0.000023745815,0.00015445414,0.0008537849,0.00019671608,0.00011639735,0.21793532,0.5057342,0.27281025],"study_design_scores_gemma":[0.000031629505,0.000040103732,0.0019457683,0.00096253084,0.000010434939,0.00019067773,0.0005169913,0.00018967497,0.000034398294,0.10927352,0.886789,0.000015350002],"about_ca_topic_score_codex":0.006609971,"about_ca_topic_score_gemma":0.005009692,"teacher_disagreement_score":0.7078786,"about_ca_system_score_codex":0.00433144,"about_ca_system_score_gemma":0.0053855893,"threshold_uncertainty_score":0.97724354},"labels":[],"label_agreement":null},{"id":"W7096126049","doi":"","title":"URL:http://www.cs.toronto.edu/~yilan Summary","year":2008,"lang":"en","type":"article","venue":"","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":"Knowledge representation and reasoning; Representation (politics); Modular design; Action (physics); Operator (biology); Expert system","score_opus":0.02066538608891614,"score_gpt":0.23114313284296142,"score_spread":0.2104777467540453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096126049","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.014773682,0.0030122725,0.31349957,0.011237201,0.000759535,0.00042577926,0.12273922,0.16972585,0.36382696],"genre_scores_gemma":[0.21005115,0.0053129,0.19642575,0.0015390534,0.00031545266,0.00093804504,0.19252715,0.02039605,0.37249452],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971086,0.000027179343,0.000014473133,0.00006961331,0.000116085976,0.00006185621],"domain_scores_gemma":[0.99910694,0.00019070988,0.000042450374,0.00029786144,0.0001875726,0.0001745114],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045909145,0.00096425123,0.00083966635,0.0016102868,0.0012012549,0.0026762483,0.0018060387,0.000860132,0.34745646],"category_scores_gemma":[0.0017876677,0.0007868973,0.00043860025,0.005002059,0.0010019405,0.0035622956,0.0014995356,0.0014592459,0.14533448],"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.00015130822,0.000062154955,0.0009853446,0.00027290627,0.000014436672,0.00014342279,0.00032859843,0.0046027713,0.0014842965,0.04877814,0.8193775,0.12379909],"study_design_scores_gemma":[0.00016103055,0.00002924641,0.0011979957,0.00012354873,0.00002413615,0.00011172274,0.00025029754,0.031527128,0.004510708,0.052939378,0.90906656,0.00005821487],"about_ca_topic_score_codex":0.14595689,"about_ca_topic_score_gemma":0.1863966,"teacher_disagreement_score":0.65254354,"about_ca_system_score_codex":0.0062618856,"about_ca_system_score_gemma":0.002976044,"threshold_uncertainty_score":0.93077415},"labels":[],"label_agreement":null},{"id":"W7096518375","doi":"","title":"Accessibility Relation and Nonmonotonic Reasoning (Extended Abstract)","year":2007,"lang":"en","type":"article","venue":"","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":"Kripke semantics; Kripke structure; Non-monotonic logic; Accessibility relation; Relation (database); Epistemic modal logic; Belief revision; Semantics (computer science); Possible world","score_opus":0.0154124200111978,"score_gpt":0.2754439439620948,"score_spread":0.260031523950897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096518375","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.038923692,0.03628384,0.7604678,0.015079187,0.0045634913,0.00023000584,0.0013513354,0.0013178984,0.14178273],"genre_scores_gemma":[0.7467808,0.017548135,0.17086844,0.0030028708,0.006056382,0.00053457083,0.0018625619,0.00022271845,0.053123523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907553,0.0003139537,0.00008141161,0.00026419657,0.00018589685,0.000078961035],"domain_scores_gemma":[0.9984957,0.0009712858,0.00014809746,0.000103710525,0.0002297417,0.00005155391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001061502,0.00062517804,0.00044074384,0.001599066,0.0008303714,0.0018677464,0.0008220875,0.0009929152,0.020346338],"category_scores_gemma":[0.0026424357,0.00041935258,0.0010320044,0.0021030498,0.0021526755,0.0040489887,0.0015135601,0.00122475,0.0030151142],"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.00009372713,0.00008401733,0.00058586884,0.0005946332,0.00007511245,0.0011597837,0.0010143481,0.0037060482,0.0025865962,0.89770895,0.024301736,0.068089105],"study_design_scores_gemma":[0.000038883394,0.000051835013,0.0008794795,0.00009456549,0.00005959435,0.00062378537,0.000112234426,0.010709693,0.0009321427,0.9325136,0.05395776,0.000026488977],"about_ca_topic_score_codex":0.0018888472,"about_ca_topic_score_gemma":0.0016275839,"teacher_disagreement_score":0.020346338,"about_ca_system_score_codex":0.0011185,"about_ca_system_score_gemma":0.00032935926,"threshold_uncertainty_score":0.068065286},"labels":[],"label_agreement":null},{"id":"W7097951496","doi":"","title":"On the Semantics of Deliberation in IndiGolog - From Theory to Implementation (Extended Abstract)","year":2002,"lang":"en","type":"article","venue":"","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":"Deliberation; Semantics (computer science); Mathematical proof; Argument (complex analysis)","score_opus":0.025141845627138934,"score_gpt":0.2655709375655526,"score_spread":0.24042909193841366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097951496","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.020448081,0.0042618117,0.8139162,0.011613628,0.0005098613,0.00019435193,0.00032084284,0.0010988642,0.14763638],"genre_scores_gemma":[0.76873666,0.0024768705,0.20429504,0.0023360138,0.00044470592,0.0005680589,0.00042136366,0.0005958273,0.020125447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952553,0.0026820991,0.00034654795,0.00052341225,0.00070983235,0.00048278933],"domain_scores_gemma":[0.9958488,0.0024778305,0.00021829468,0.00074978324,0.00048354227,0.00022169469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040106783,0.0007080724,0.00072594325,0.0015174688,0.0022704406,0.006378585,0.0017674934,0.002405692,0.008522513],"category_scores_gemma":[0.0077166716,0.0008372579,0.0016863429,0.00151607,0.01124244,0.011990279,0.0059784367,0.0038138437,0.0013685465],"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.0000147976,0.000010424844,0.000075968426,0.000039397208,0.000006063125,0.00005788783,0.00048018218,0.0010008338,0.000120509,0.99403316,0.0007758011,0.003384936],"study_design_scores_gemma":[0.00001918956,0.000016852176,0.00008078052,0.00005694492,0.000012061224,0.000058604248,0.00023003471,0.0044139065,0.0002713808,0.98197687,0.012854343,0.000008961166],"about_ca_topic_score_codex":0.0046284087,"about_ca_topic_score_gemma":0.0038708579,"teacher_disagreement_score":0.008522513,"about_ca_system_score_codex":0.0041181757,"about_ca_system_score_gemma":0.0020002534,"threshold_uncertainty_score":0.02987957},"labels":[],"label_agreement":null},{"id":"W7099069076","doi":"","title":"Presidential Essay INSIGHT FROM HINDSIGHT: THE NEW EDUCATION FINANCE OF THE NEXT DECADE","year":2006,"lang":"en","type":"article","venue":"","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":"Thriving; Presidential system; Presidential address; Quarter (Canadian coin); Education policy; Public finance","score_opus":0.010633649077908472,"score_gpt":0.221838616972341,"score_spread":0.21120496789443252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099069076","genre_codex":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013664416,0.00901953,0.00050540385,0.89561415,0.025101054,0.0000063561947,0.000118096184,0.000029995705,0.06823893],"genre_scores_gemma":[0.13570037,0.013879254,0.0009446896,0.610106,0.060251694,0.00005754406,0.00018325087,0.00018483879,0.1786924],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981774,0.0005432814,0.00007894063,0.00022761118,0.0005913534,0.0003814683],"domain_scores_gemma":[0.9934822,0.003557036,0.0003926574,0.00023989026,0.0015643168,0.0007638514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003617725,0.00040962445,0.00039360972,0.0007360865,0.003906697,0.009321516,0.000692681,0.008644624,0.011745359],"category_scores_gemma":[0.01691891,0.00021075501,0.00039019858,0.000991385,0.002848402,0.0058844457,0.0019109406,0.01263083,0.0031706793],"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.000018813455,0.000009163404,0.00015658686,0.000023832112,0.0000034493241,0.000055699544,0.00023621191,0.0000587826,0.000025613273,0.11716484,0.87741256,0.00483444],"study_design_scores_gemma":[0.000014886762,0.0000082116285,0.0004450964,0.00013596816,0.000005937972,0.000063421,0.00041400042,0.0002014034,0.00008539553,0.03969371,0.9589173,0.000014546072],"about_ca_topic_score_codex":0.008109318,"about_ca_topic_score_gemma":0.011631185,"teacher_disagreement_score":0.011745359,"about_ca_system_score_codex":0.004448515,"about_ca_system_score_gemma":0.0045757513,"threshold_uncertainty_score":0.039292157},"labels":[],"label_agreement":null},{"id":"W7099553382","doi":"","title":"School Competition and Efficiency with Publicly Funded Catholic Schools.” NBER Working Paper 14176","year":2008,"lang":"en","type":"article","venue":"","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":"Competition (biology); Incentive; Test (biology); Quality (philosophy); School choice; Face (sociological concept)","score_opus":0.01890903215009821,"score_gpt":0.2077492853108273,"score_spread":0.18884025316072908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099553382","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.7749144,0.02138523,0.009121604,0.067003466,0.00027440165,0.00028814175,0.04222219,0.00022737667,0.08456329],"genre_scores_gemma":[0.9653957,0.0028258727,0.0011726307,0.0009147924,0.00019135076,0.00010522531,0.00828,0.00004357857,0.02107071],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99665076,0.00089881546,0.00016810437,0.0005098864,0.00074119016,0.0010312968],"domain_scores_gemma":[0.97958994,0.006432399,0.008762704,0.00085515314,0.0021937795,0.0021660852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058560786,0.00034396682,0.0010361504,0.0013585815,0.0013758582,0.0026541536,0.0010642406,0.0017457346,0.011860965],"category_scores_gemma":[0.017074576,0.00057561265,0.0011178108,0.003466112,0.00185316,0.0016341124,0.0013107605,0.0011470006,0.0007462153],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006731678,0.00023163561,0.71320873,0.0004116321,0.0010047259,0.00055116613,0.001002878,0.0331149,0.0004529592,0.08324568,0.12081014,0.045292318],"study_design_scores_gemma":[0.0007634918,0.00015511758,0.8409937,0.0003224405,0.0005308809,0.00015683443,0.0012067517,0.029951632,0.0009104532,0.026478337,0.098449014,0.0000813956],"about_ca_topic_score_codex":0.6116092,"about_ca_topic_score_gemma":0.73077404,"teacher_disagreement_score":0.6116092,"about_ca_system_score_codex":0.016941044,"about_ca_system_score_gemma":0.010077658,"threshold_uncertainty_score":0.78135616},"labels":[],"label_agreement":null},{"id":"W7099892144","doi":"","title":"RECOMMENDATIONS","year":2008,"lang":"en","type":"article","venue":"","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":"Lease; Landlord; Capital (architecture); Unit (ring theory); Capital city","score_opus":0.04468670811846728,"score_gpt":0.25525389492911993,"score_spread":0.21056718681065265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099892144","genre_codex":"commentary","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.0011866356,0.0074216095,0.0052033663,0.5515988,0.049541585,0.0024815467,0.021845184,0.0015715044,0.35914984],"genre_scores_gemma":[0.013408988,0.011850941,0.024652084,0.27432403,0.008172506,0.0032256558,0.019563118,0.0006516749,0.644151],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926824,0.0019649935,0.00057684956,0.000644623,0.0026983346,0.0014327277],"domain_scores_gemma":[0.96296966,0.0031697997,0.0012323852,0.0018606854,0.023751307,0.007016079],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009276879,0.00089527864,0.0006281123,0.0022917783,0.0017333283,0.005226902,0.0042041377,0.010978774,0.2938031],"category_scores_gemma":[0.04818332,0.00048365127,0.0016862851,0.0020098982,0.0008113806,0.005499384,0.0026806886,0.006051682,0.13564445],"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.000038326703,0.00004535861,0.00028756543,0.00024667953,0.000008670259,0.000047166304,0.000044225388,0.00006839984,0.00004492385,0.0026977367,0.96043617,0.036034733],"study_design_scores_gemma":[0.00005050306,0.000024412859,0.0009516691,0.0010253586,0.000019109224,0.00006435085,0.00031853325,0.000056431865,0.00010156263,0.0031571717,0.99421364,0.00001714074],"about_ca_topic_score_codex":0.028424976,"about_ca_topic_score_gemma":0.03521952,"teacher_disagreement_score":0.7061969,"about_ca_system_score_codex":0.004473998,"about_ca_system_score_gemma":0.030566094,"threshold_uncertainty_score":0.98286927},"labels":[],"label_agreement":null},{"id":"W7104636795","doi":"10.1109/acsos-c66519.2025.00037","title":"Multi-Perspective Explanations for Multi-Agent Systems","year":2025,"lang":"","type":"article","venue":"","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":"Ontario Tech University","funders":"","keywords":"Event calculus; Abductive reasoning; Event (particle physics); Set (abstract data type); Non-monotonic logic; Work (physics)","score_opus":0.07071193973713187,"score_gpt":0.33966024662083405,"score_spread":0.2689483068837022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104636795","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.0059301313,0.0017621017,0.96896297,0.0044544563,0.00022457798,0.00012960493,0.0002898082,0.0007179025,0.01752839],"genre_scores_gemma":[0.42130795,0.0017255088,0.5653986,0.0005974774,0.00031325602,0.0003958783,0.0006698243,0.00012156412,0.00947007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984919,0.0007095728,0.00010684857,0.00018454577,0.0004216774,0.00008534934],"domain_scores_gemma":[0.9968539,0.0021813316,0.00020008434,0.00036706086,0.00025313854,0.0001445131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024106633,0.00082663714,0.0006010148,0.0014140031,0.0014716947,0.002974819,0.0016921633,0.002052415,0.0115453005],"category_scores_gemma":[0.006844241,0.0005111261,0.0013385211,0.0009854124,0.0023475694,0.004331212,0.0035224513,0.0026468968,0.00091584196],"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.000019028495,0.000016101325,0.00019554018,0.00010187916,0.000027068247,0.00021875916,0.00029105134,0.02671427,0.00019720242,0.95399266,0.0019178817,0.016308496],"study_design_scores_gemma":[0.000023393999,0.000008928074,0.000069084796,0.00003316271,0.000018030734,0.00007948488,0.000086835316,0.14440396,0.00021565324,0.83903396,0.016014311,0.000013165525],"about_ca_topic_score_codex":0.0039089336,"about_ca_topic_score_gemma":0.006303899,"teacher_disagreement_score":0.0115453005,"about_ca_system_score_codex":0.0019142602,"about_ca_system_score_gemma":0.0011931435,"threshold_uncertainty_score":0.038622856},"labels":[],"label_agreement":null},{"id":"W7106267332","doi":"10.1108/978-1-64802-224-120251007","title":"Prerequisite Structure Finding using the Conjunctive Root Causes Model","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lab_Bell (Canada)","funders":"","keywords":"Root (linguistics); Class (philosophy); Sequence (biology); Identification (biology)","score_opus":0.05213537658857401,"score_gpt":0.2597680261190813,"score_spread":0.20763264953050728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106267332","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.0029582619,0.00064922567,0.9675286,0.000670656,0.000118901386,0.00021041582,0.00074721925,0.0015225641,0.02559419],"genre_scores_gemma":[0.10231537,0.0013124725,0.8745713,0.000325116,0.000113880364,0.0002029144,0.0020336949,0.0005115171,0.01861366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834347,0.00034351533,0.000106310086,0.0004311677,0.00066305307,0.000112517904],"domain_scores_gemma":[0.99737906,0.0017937811,0.00013119479,0.00035236572,0.0002938146,0.000049853035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014265677,0.0010931585,0.001088807,0.0031283337,0.0012616863,0.0033309797,0.0038724616,0.0013563456,0.032206733],"category_scores_gemma":[0.0072564,0.0010160286,0.0030439065,0.0032433574,0.001911633,0.0059946016,0.0026279269,0.0024668234,0.003999752],"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.00011433005,0.00015209569,0.0014635919,0.00078697246,0.00015911485,0.0010997378,0.00047479526,0.035314914,0.003750608,0.67928904,0.027535876,0.24985899],"study_design_scores_gemma":[0.00004623031,0.000039631825,0.0006221366,0.00019162902,0.000194791,0.0006813154,0.00025761576,0.26338446,0.006503951,0.68829787,0.039722852,0.00005755826],"about_ca_topic_score_codex":0.011578138,"about_ca_topic_score_gemma":0.025071453,"teacher_disagreement_score":0.032206733,"about_ca_system_score_codex":0.0021319573,"about_ca_system_score_gemma":0.0031043005,"threshold_uncertainty_score":0.10774231},"labels":[],"label_agreement":null},{"id":"W7106476572","doi":"","title":"Sufficient Explanations in Databases and their Connections to Database Repairs","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relational database; Work (physics); Relational model; Database theory; View; Relational algebra","score_opus":0.054401144757928496,"score_gpt":0.2963877121187679,"score_spread":0.2419865673608394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106476572","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.09670177,0.002487884,0.8904759,0.0035681047,0.000073563424,0.00011121949,0.0005057331,0.00056873576,0.005507135],"genre_scores_gemma":[0.8884976,0.0014870629,0.1070164,0.00028143157,0.00014904668,0.00022407403,0.0006549751,0.0001255264,0.0015638479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911958,0.004064435,0.00083853636,0.0012272898,0.0020316727,0.0006422871],"domain_scores_gemma":[0.9180631,0.06829051,0.0047530397,0.004512551,0.0033345732,0.0010462389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008520584,0.00070148753,0.0014064079,0.0059544076,0.0019109087,0.0039384365,0.002204553,0.002863664,0.004815165],"category_scores_gemma":[0.058803756,0.0010698829,0.0027847798,0.0041277986,0.006174113,0.013267232,0.004078132,0.0031064453,0.00027776018],"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.000089583715,0.000041549756,0.003188206,0.00026963803,0.00008740801,0.0003120285,0.0013656148,0.023072196,0.0004456697,0.95337385,0.0008269285,0.016927317],"study_design_scores_gemma":[0.00001653884,0.000016207723,0.00048495704,0.00004913104,0.000040194845,0.000117603806,0.00026915697,0.030222686,0.00038149193,0.9672674,0.0011139082,0.000020650436],"about_ca_topic_score_codex":0.0026457529,"about_ca_topic_score_gemma":0.0024545232,"teacher_disagreement_score":0.008520584,"about_ca_system_score_codex":0.0020766389,"about_ca_system_score_gemma":0.002302075,"threshold_uncertainty_score":0.045061707},"labels":[],"label_agreement":null},{"id":"W7110048490","doi":"10.4230/lipics.cp.2025.17","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Trap (plumbing); Fixed point; Set (abstract data type); Probabilistic logic; Scalability; Enumeration; State space; Dynamical systems theory","score_opus":0.009202968421726498,"score_gpt":0.23954454680366546,"score_spread":0.23034157838193897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110048490","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.068189085,0.0012859374,0.92343205,0.001013548,0.00008438556,0.00014872986,0.0010572774,0.0019084301,0.0028806324],"genre_scores_gemma":[0.48590645,0.0007261297,0.5078661,0.0002915493,0.00010105266,0.00030371404,0.0024739152,0.00048685784,0.001844177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557257,0.0015825074,0.00030879374,0.00097205426,0.0012341847,0.0003298331],"domain_scores_gemma":[0.9791555,0.01580254,0.0016258872,0.0016594989,0.0011933286,0.0005634021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037709358,0.0012380506,0.0019463365,0.0027466998,0.0010588503,0.0039863023,0.002709009,0.0016921398,0.0035820024],"category_scores_gemma":[0.033070773,0.0007317973,0.0015932528,0.0025514744,0.0014606168,0.007710467,0.0030722984,0.0026848924,0.00054629496],"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.00044580727,0.00022803943,0.0080636665,0.00078746444,0.00017537076,0.00018090811,0.00051087345,0.5976925,0.004281854,0.12894051,0.006584543,0.25210845],"study_design_scores_gemma":[0.000015915122,0.000025325677,0.00025159054,0.000030838353,0.00001913793,0.000048617392,0.00005059335,0.91874605,0.0009817536,0.07885266,0.00096645515,0.000011121443],"about_ca_topic_score_codex":0.004593153,"about_ca_topic_score_gemma":0.0075382423,"teacher_disagreement_score":0.004593153,"about_ca_system_score_codex":0.0026381,"about_ca_system_score_gemma":0.0021618037,"threshold_uncertainty_score":0.01994282},"labels":[],"label_agreement":null},{"id":"W7124134446","doi":"10.65109/bnwt6293","title":"Representing and reasoning about communicative conditional commitments","year":2013,"lang":"","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Formalism (music); Semantics (computer science); Set (abstract data type); Representation (politics); Frame (networking); Natural language","score_opus":0.022730469723533545,"score_gpt":0.2693787596346302,"score_spread":0.24664828991109666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124134446","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.03566058,0.00023379855,0.94989294,0.0019956632,0.00014124168,0.0002004958,0.0004905835,0.0015115293,0.00987323],"genre_scores_gemma":[0.5517741,0.0004904185,0.439491,0.0005148357,0.00016750509,0.00049148954,0.0013021197,0.00028599516,0.0054823975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952501,0.001903499,0.0005498895,0.00059905765,0.0011892678,0.0005081752],"domain_scores_gemma":[0.9929404,0.0039230916,0.00072007073,0.001148527,0.00097409583,0.0002938499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005561907,0.00092819246,0.0007109288,0.0024527933,0.002170333,0.0056014806,0.0026487845,0.0021184294,0.0032367415],"category_scores_gemma":[0.014450148,0.00080031535,0.0020843758,0.0014338762,0.004138358,0.011030084,0.0051159738,0.00385257,0.0006160702],"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.00008620271,0.000056119818,0.00082434836,0.000143597,0.000050841656,0.00069468917,0.0014249835,0.02709876,0.0024178766,0.9430697,0.002766655,0.021366302],"study_design_scores_gemma":[0.00005492314,0.000037668284,0.00018572692,0.0001008345,0.00009751698,0.0002507212,0.0008552348,0.19789805,0.008573139,0.77107584,0.020800976,0.000069320646],"about_ca_topic_score_codex":0.0080844825,"about_ca_topic_score_gemma":0.007519248,"teacher_disagreement_score":0.0080844825,"about_ca_system_score_codex":0.0023785604,"about_ca_system_score_gemma":0.0033500604,"threshold_uncertainty_score":0.029414535},"labels":[],"label_agreement":null},{"id":"W7124175548","doi":"10.65109/wsam9881","title":"A logical framework for prioritized goal change","year":2010,"lang":"","type":"article","venue":"","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":"York University","funders":"","keywords":"Work (physics); Logical framework; Goal orientation; Logical consequence; Logical conjunction","score_opus":0.05388989146152597,"score_gpt":0.31127605323088625,"score_spread":0.2573861617693603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124175548","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.011106446,0.0009222647,0.90257454,0.009820332,0.00040798463,0.00024784642,0.00022733213,0.0007271181,0.073966116],"genre_scores_gemma":[0.6355287,0.0007824015,0.34320307,0.0031067282,0.00077151804,0.00081621815,0.00034087975,0.00027418294,0.015176304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99260324,0.0032072742,0.0006160236,0.0013340213,0.0015208038,0.0007187205],"domain_scores_gemma":[0.9904225,0.0045682485,0.0010362609,0.0016446572,0.0017342143,0.00059421203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012632708,0.001004567,0.0007632432,0.0027830165,0.0037396722,0.0056623267,0.003458845,0.0033392408,0.007467737],"category_scores_gemma":[0.011727136,0.0009627838,0.0026794295,0.0015702395,0.013598072,0.016558899,0.0058698086,0.006277254,0.0010546604],"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.000008817901,0.000010892748,0.00009233634,0.00002409222,0.000006688605,0.000049242004,0.0003163782,0.000863827,0.00013177983,0.9956462,0.0004942208,0.002355514],"study_design_scores_gemma":[0.000034132976,0.000025354035,0.00009598527,0.000026609398,0.000020262307,0.0000980868,0.00015078414,0.0078912545,0.00035730467,0.9809991,0.010280693,0.00002035673],"about_ca_topic_score_codex":0.0037017444,"about_ca_topic_score_gemma":0.0028393273,"teacher_disagreement_score":0.012632708,"about_ca_system_score_codex":0.0045313365,"about_ca_system_score_gemma":0.0032767553,"threshold_uncertainty_score":0.066809},"labels":[],"label_agreement":null},{"id":"W7124176885","doi":"10.65109/tpeg1413","title":"On supervising agents in situation-determined ConGolog","year":2012,"lang":"","type":"article","venue":"","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 Toronto; York University","funders":"","keywords":"Supervisor; Intersection (aeronautics); Action (physics); Set (abstract data type); Remainder","score_opus":0.05686054684826477,"score_gpt":0.2966528136110415,"score_spread":0.23979226676277673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124176885","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.12562262,0.00012484488,0.8639798,0.00033186105,0.000015658448,0.000092402166,0.000053358457,0.0007072896,0.009072101],"genre_scores_gemma":[0.74556166,0.00013755464,0.25022504,0.00015919667,0.000028289012,0.00018773145,0.00013509777,0.00016718933,0.0033983227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980946,0.00079951674,0.00009863506,0.0003863529,0.00038973772,0.0002310404],"domain_scores_gemma":[0.9956423,0.0024843586,0.0005134955,0.00074218214,0.00035884965,0.00025891326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800397,0.00041134917,0.0003925165,0.0005622135,0.00073571975,0.0012310346,0.0011858935,0.0007580691,0.0014821586],"category_scores_gemma":[0.00693608,0.00047563165,0.00069879723,0.00037765017,0.004130781,0.0027349228,0.0024684644,0.0016486243,0.00022444825],"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.00032224148,0.0002033441,0.0038458316,0.00016967171,0.0000591201,0.0008866809,0.0035093117,0.14217716,0.016642604,0.7890793,0.00070246734,0.04240227],"study_design_scores_gemma":[0.000077111756,0.00019124443,0.0009087836,0.000049702317,0.000059732432,0.000187468,0.00049823883,0.4489745,0.014924702,0.5258967,0.008176437,0.00005538257],"about_ca_topic_score_codex":0.0025036503,"about_ca_topic_score_gemma":0.0031594262,"teacher_disagreement_score":0.002800397,"about_ca_system_score_codex":0.0011578541,"about_ca_system_score_gemma":0.0010492752,"threshold_uncertainty_score":0.014810085},"labels":[],"label_agreement":null},{"id":"W7124179088","doi":"10.65109/njwk3515","title":"Synchronous Games in the Situation Calculus","year":2015,"lang":"","type":"article","venue":"","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":"York University","funders":"","keywords":"Action (physics); Situation calculus; Calculus (dental); Algebra over a field; Process calculus","score_opus":0.03843662768846192,"score_gpt":0.2708997087274918,"score_spread":0.23246308103902988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124179088","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.016505668,0.0019764947,0.86436766,0.0030487168,0.00034315893,0.00018112882,0.0003243173,0.0005419987,0.11271089],"genre_scores_gemma":[0.6209955,0.0019574321,0.34375334,0.0007992913,0.0006673083,0.0005785328,0.00040075995,0.00018814579,0.03065969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798226,0.0007693799,0.00014814516,0.00027963807,0.0005426729,0.00027793754],"domain_scores_gemma":[0.9987091,0.00062418025,0.000115798684,0.00019807201,0.00020434624,0.00014851116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024975757,0.00094004377,0.0007429701,0.0013536388,0.0017608913,0.004420552,0.001731477,0.0012838367,0.005896662],"category_scores_gemma":[0.0028197637,0.0006529419,0.0019262698,0.0012344151,0.0044950903,0.0068968716,0.002414246,0.002810137,0.0011179098],"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.0000028988552,0.0000036407712,0.000023843573,0.00000706165,0.0000023516293,0.000030210656,0.00010567276,0.0016323375,0.000069004986,0.9970732,0.00021096121,0.0008388641],"study_design_scores_gemma":[0.00001320315,0.000010814024,0.000043748085,0.000016574395,0.000011421995,0.000046584293,0.0000550359,0.022273209,0.00020710124,0.96104234,0.016269134,0.000010751799],"about_ca_topic_score_codex":0.0054928316,"about_ca_topic_score_gemma":0.003858258,"teacher_disagreement_score":0.005896662,"about_ca_system_score_codex":0.0028131478,"about_ca_system_score_gemma":0.002211535,"threshold_uncertainty_score":0.020410895},"labels":[],"label_agreement":null},{"id":"W7124200998","doi":"10.65109/knrx9231","title":"Progression and verification of situation calculus agents with bounded beliefs","year":2014,"lang":"","type":"article","venue":"","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":"York University","funders":"","keywords":"Decidability; Bounded function; Situation calculus; Action (physics); Object (grammar); Point (geometry); Calculus (dental)","score_opus":0.016070135919861644,"score_gpt":0.2613658978452233,"score_spread":0.24529576192536165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124200998","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.1120755,0.00026359456,0.87813807,0.00093224685,0.00005793209,0.00020965903,0.00037627615,0.0019217886,0.0060249045],"genre_scores_gemma":[0.7889462,0.00029331274,0.20566449,0.00022142752,0.000076987824,0.00029066636,0.00076660444,0.00017212819,0.0035680213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99181914,0.0020330397,0.000543424,0.0015033315,0.0029388573,0.0011622674],"domain_scores_gemma":[0.97965735,0.014077563,0.0016663624,0.0019124936,0.001956842,0.00072936446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007992383,0.0010519936,0.0010082672,0.0018049867,0.001675916,0.0036069623,0.0025705772,0.0015124321,0.0038399713],"category_scores_gemma":[0.031216918,0.0008595584,0.0028991369,0.0011051686,0.005421171,0.009309674,0.0043546227,0.00419683,0.00052502356],"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.00034292162,0.00013842594,0.0024881314,0.00024223508,0.00013039132,0.001133035,0.0020053776,0.08852504,0.009833508,0.8730575,0.0007451421,0.021358252],"study_design_scores_gemma":[0.000118697855,0.000098628625,0.0003470741,0.0000689796,0.00008495323,0.00014565205,0.00020336393,0.37587547,0.009298306,0.6100867,0.0036139765,0.00005825185],"about_ca_topic_score_codex":0.011562972,"about_ca_topic_score_gemma":0.0061428878,"teacher_disagreement_score":0.011562972,"about_ca_system_score_codex":0.0031885325,"about_ca_system_score_gemma":0.00481046,"threshold_uncertainty_score":0.042268276},"labels":[],"label_agreement":null},{"id":"W7124249030","doi":"10.65109/ikhz8061","title":"Translating Multi-Agent Modal Logics of Knowledge and Belief into Decidable First-Order Fragments","year":2025,"lang":"en","type":"article","venue":"","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 Regina","funders":"","keywords":"Decidability; Accessibility relation; Modal logic; Normal modal logic; Modal; Satisfiability; Translation (biology); Transitive relation; Modal operator","score_opus":0.018063759381527454,"score_gpt":0.2745310301110216,"score_spread":0.25646727072949416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124249030","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.0145368455,0.0002093607,0.9753018,0.000777774,0.00010042783,0.0002013141,0.00022145355,0.00093695987,0.007714005],"genre_scores_gemma":[0.4064589,0.0005379376,0.5851509,0.0007510466,0.00016911016,0.0004195662,0.0009561872,0.00036395347,0.0051923646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976987,0.0005267432,0.0001891895,0.00042526776,0.0008857232,0.00027434132],"domain_scores_gemma":[0.9958598,0.0026170008,0.00031953142,0.00068204873,0.00044393967,0.00007753329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002524412,0.0008603664,0.0006367784,0.0011046396,0.0010034838,0.0022486653,0.0020828103,0.0010755244,0.004224998],"category_scores_gemma":[0.008024791,0.00069464603,0.0030231732,0.00096577476,0.0035229865,0.004322428,0.0030355672,0.0036805158,0.00064023706],"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.00010107922,0.00015305038,0.0003661065,0.00028884507,0.00008947551,0.0006722744,0.0013531223,0.037454374,0.0068507963,0.9034816,0.0024758899,0.046713337],"study_design_scores_gemma":[0.00008326793,0.00006131659,0.00019150811,0.000066822846,0.00009299358,0.0002093569,0.00020049274,0.17603168,0.01777275,0.7942695,0.010983755,0.00003655756],"about_ca_topic_score_codex":0.0032341797,"about_ca_topic_score_gemma":0.0031736253,"teacher_disagreement_score":0.004224998,"about_ca_system_score_codex":0.0028805854,"about_ca_system_score_gemma":0.0022214456,"threshold_uncertainty_score":0.02090025},"labels":[],"label_agreement":null},{"id":"W7124255152","doi":"10.65109/lgbu6441","title":"Epistemic Reasoning in Jason","year":2022,"lang":"","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Extension (predicate logic); Semantic reasoner; Epistemic modal logic; CONTEST; Class (philosophy); Abductive reasoning; Non-monotonic logic; Scalability; Circumscription","score_opus":0.01655710567611436,"score_gpt":0.2399918177700902,"score_spread":0.22343471209397586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124255152","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.01160388,0.00020390599,0.9641011,0.001174447,0.00022151397,0.00017584435,0.00052329275,0.006979007,0.015017051],"genre_scores_gemma":[0.21207169,0.00034531063,0.7745954,0.0010292834,0.0001614897,0.0003381833,0.0009470002,0.0008549582,0.009656606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967539,0.0008492638,0.00032883196,0.0004914562,0.0012614761,0.00031515496],"domain_scores_gemma":[0.9962203,0.0019823117,0.00026115318,0.00066348293,0.00071053684,0.00016220042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046768123,0.00079975586,0.00071035005,0.0013509793,0.0015419591,0.0040344335,0.0023101622,0.0011838485,0.008631789],"category_scores_gemma":[0.0069516287,0.00085431954,0.0023105731,0.0008864521,0.0028679506,0.00838722,0.0051084794,0.0032334232,0.0015056438],"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.00039746048,0.00015108238,0.0009934779,0.00043865808,0.00006150208,0.0004097016,0.0014221858,0.031071069,0.0067505357,0.88802534,0.008294836,0.061984118],"study_design_scores_gemma":[0.00012965022,0.00010385083,0.00032410963,0.0002641968,0.00011794063,0.00038438168,0.00031450953,0.31341976,0.014987171,0.5358493,0.13401039,0.00009476768],"about_ca_topic_score_codex":0.004167744,"about_ca_topic_score_gemma":0.0066220956,"teacher_disagreement_score":0.008631789,"about_ca_system_score_codex":0.0019333499,"about_ca_system_score_gemma":0.0023555995,"threshold_uncertainty_score":0.028876245},"labels":[],"label_agreement":null},{"id":"W7124273970","doi":"10.65109/xumi1907","title":"Reasoning about Uncertainty in AgentSpeak using Dynamic Epistemic Logic","year":2023,"lang":"","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Extension (predicate logic); Expressivity; Non-monotonic logic; Calculus (dental); Automated reasoning","score_opus":0.041138142474901926,"score_gpt":0.3086363934524421,"score_spread":0.26749825097754015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124273970","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.020323379,0.00014916877,0.96916705,0.0006256967,0.00005701188,0.000113251015,0.00022006604,0.0038662609,0.005478091],"genre_scores_gemma":[0.4489804,0.00033390475,0.5452666,0.00052405946,0.00006989939,0.00017340899,0.0007057922,0.00042148694,0.0035243954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977627,0.00067853864,0.00017509372,0.000386002,0.0007821418,0.00021548381],"domain_scores_gemma":[0.9948259,0.0032930376,0.00036636266,0.0007319169,0.0005716022,0.00021116209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031385515,0.0010207809,0.0007229614,0.0008760022,0.0012731992,0.0039620553,0.002283255,0.0010468359,0.0041233967],"category_scores_gemma":[0.009267518,0.0007096214,0.0016767324,0.00049864687,0.0020179027,0.0058494224,0.0055559683,0.0029351835,0.00086847943],"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.0011296478,0.000445685,0.003583482,0.0007824626,0.00036915316,0.0016176391,0.0013073588,0.43669787,0.015129204,0.32378668,0.009038211,0.20611262],"study_design_scores_gemma":[0.000077305995,0.000061728126,0.00016893251,0.00008967319,0.00009507576,0.00022771845,0.0002023451,0.7507755,0.012215394,0.21949047,0.016542645,0.000053238862],"about_ca_topic_score_codex":0.006713182,"about_ca_topic_score_gemma":0.011213637,"teacher_disagreement_score":0.006713182,"about_ca_system_score_codex":0.0011839523,"about_ca_system_score_gemma":0.0017749639,"threshold_uncertainty_score":0.016598463},"labels":[],"label_agreement":null},{"id":"W7124284345","doi":"10.65109/lzuo9750","title":"Quantitative Group Trust: A Two-Stage Verification Approach","year":2022,"lang":"","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Model checking; Completeness (order theory); Temporal logic; Formal verification; Computation tree logic; Transformation (genetics); Linear temporal logic","score_opus":0.046029226725295434,"score_gpt":0.28257083421490803,"score_spread":0.2365416074896126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124284345","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.0032842876,0.000023633453,0.99461305,0.00014820027,0.000014294635,0.00014853335,0.000028229812,0.00028935404,0.0014505301],"genre_scores_gemma":[0.29741555,0.0000752022,0.6990271,0.00016717578,0.000024961635,0.00033312332,0.00013185716,0.00016250617,0.002662506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894748,0.0042253775,0.00047777419,0.0011920491,0.0039566737,0.0006734153],"domain_scores_gemma":[0.9877238,0.006759229,0.0007825029,0.0030762074,0.0013425535,0.00031562484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010408162,0.00097445364,0.00084782625,0.001510451,0.0009605986,0.002953239,0.0030166984,0.0015735937,0.0045864955],"category_scores_gemma":[0.019086098,0.0008057829,0.0026172278,0.00083128584,0.0039609023,0.0068131275,0.0046622055,0.003096055,0.0007795625],"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.00027852357,0.00019165112,0.0013260337,0.00024069841,0.00012422394,0.00047068796,0.0014563297,0.066474535,0.014076637,0.8513363,0.0009666702,0.06305774],"study_design_scores_gemma":[0.0001183703,0.0002554018,0.0003493616,0.000071892646,0.00010440545,0.00018551962,0.00020767494,0.5025517,0.021221677,0.4649951,0.009867848,0.000071069844],"about_ca_topic_score_codex":0.003002621,"about_ca_topic_score_gemma":0.0018953561,"teacher_disagreement_score":0.010408162,"about_ca_system_score_codex":0.0024611028,"about_ca_system_score_gemma":0.004080455,"threshold_uncertainty_score":0.055044293},"labels":[],"label_agreement":null},{"id":"W7125819337","doi":"10.21428/594757db.2243aae3","title":"On the Semantics of Actual Causality in Situation Calculus Concurrent Game Structures","year":2025,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","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":"York University; University of Regina","funders":"York University; University of Regina","keywords":"Action (physics); Semantics (computer science); Causation; Causality (physics); Preemption; Rationality; Key (lock); Situation calculus","score_opus":0.0197935032495521,"score_gpt":0.283379489656914,"score_spread":0.2635859864073619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125819337","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.0321115,0.0007349836,0.9228099,0.0037104052,0.00020709072,0.00017165707,0.00019051567,0.00044682014,0.03961709],"genre_scores_gemma":[0.79209083,0.0008053002,0.1989107,0.000695821,0.00029849476,0.00047342302,0.00018224368,0.00021886016,0.0063243797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99339193,0.0028839186,0.00053336646,0.0008358602,0.0016660069,0.00068899244],"domain_scores_gemma":[0.9881627,0.007735807,0.0007883237,0.0013212406,0.0014161924,0.0005757992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007053475,0.00084425893,0.00087344553,0.0018221732,0.0031982043,0.005272726,0.0026655812,0.0022070413,0.005376244],"category_scores_gemma":[0.014997819,0.0009405391,0.001931007,0.001980533,0.013321506,0.013736209,0.0042058052,0.0050247866,0.00058311585],"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.000005619238,0.0000080209875,0.000038777805,0.000011409465,0.000002742293,0.000035322144,0.00030475028,0.002162729,0.00011196818,0.9963741,0.000090843634,0.000853743],"study_design_scores_gemma":[0.00001142997,0.000009707486,0.000030265861,0.000013833945,0.0000063962293,0.00002649263,0.000075906166,0.012066418,0.00017074702,0.98511523,0.0024637757,0.000009713228],"about_ca_topic_score_codex":0.0068740537,"about_ca_topic_score_gemma":0.0043853815,"teacher_disagreement_score":0.007053475,"about_ca_system_score_codex":0.004443576,"about_ca_system_score_gemma":0.0037878337,"threshold_uncertainty_score":0.037302792},"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},{"id":"W7132955156","doi":"","title":"Model-Theoretic Analysis of Asher and Vieu&apos;s Mereotopology","year":2008,"lang":"en","type":"dissertation","venue":"TSpace","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 Toronto","funders":"","keywords":"Soundness; Mathematical proof; Axiom; Completeness (order theory); Cartesian product; Algebra over a field; Translation (biology)","score_opus":0.030358063254244293,"score_gpt":0.34223116644620555,"score_spread":0.31187310319196127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132955156","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.33179206,0.0019299655,0.4972978,0.010762634,0.00022996895,0.000111336354,0.00042022706,0.0003805766,0.15707545],"genre_scores_gemma":[0.9472059,0.00049635663,0.04067864,0.0003554941,0.00013378906,0.00008164941,0.00015407015,0.000052869873,0.010841307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988121,0.00032684443,0.00004827208,0.00019293885,0.00047492655,0.00014495848],"domain_scores_gemma":[0.99840146,0.0007903086,0.00017172562,0.00026182283,0.00022340116,0.00015123215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016352462,0.0003291257,0.0006040849,0.0013611361,0.0015842264,0.0032899636,0.0011778056,0.0010072471,0.0036741025],"category_scores_gemma":[0.0028676987,0.0004156188,0.0013976636,0.001106244,0.0057160174,0.006229771,0.002163985,0.002281711,0.00033946356],"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.0000028630816,0.0000046956925,0.000062325795,0.0000060456264,0.0000016446721,0.000019077794,0.00009884501,0.0008154574,0.000073779105,0.99832183,0.00012541478,0.00046812798],"study_design_scores_gemma":[0.000006108262,0.000009700155,0.0000815863,0.000008414294,0.0000047767035,0.000048006175,0.00008455064,0.012133691,0.00028019535,0.9838664,0.003469568,0.0000070497013],"about_ca_topic_score_codex":0.0039764587,"about_ca_topic_score_gemma":0.003831721,"teacher_disagreement_score":0.0039764587,"about_ca_system_score_codex":0.0034548498,"about_ca_system_score_gemma":0.0018221455,"threshold_uncertainty_score":0.025066793},"labels":[],"label_agreement":null},{"id":"W7165114067","doi":"10.34727/2021/isbn.978-3-85448-046-4_16</div","title":"Logical Characterization of Coherent Uninterpreted Programs","year":2021,"lang":"en","type":"article","venue":"Open MIND","topic":"Logic, Reasoning, and Knowledge","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation; European Commission","keywords":"Characterization (materials science); Algebra over a field; Logical conjunction; Component (thermodynamics); Scheme (mathematics); Context (archaeology); Mathematical logic","score_opus":0.0481781168457096,"score_gpt":0.2918628117642725,"score_spread":0.24368469491856287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7165114067","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.16031289,0.00031337765,0.8262791,0.0011220232,0.00006329449,0.00016169225,0.0002725721,0.0010296019,0.010445404],"genre_scores_gemma":[0.8125998,0.00028796,0.1823155,0.00050846697,0.00010731747,0.0002477085,0.0003781874,0.00020249178,0.0033525235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753976,0.0006828059,0.00018904464,0.00055033475,0.00068677845,0.0003512873],"domain_scores_gemma":[0.9933373,0.003765999,0.0007237023,0.0008292786,0.0011027809,0.00024087835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025098622,0.00047559108,0.0004220888,0.0014537838,0.00081399234,0.002974945,0.0012928538,0.000910164,0.002361035],"category_scores_gemma":[0.0068364865,0.000585895,0.0010774877,0.0007108553,0.0051270234,0.0046549905,0.0020971417,0.0024231789,0.00024088504],"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.0000766175,0.00008879,0.0011573235,0.00009325269,0.000026445847,0.0003225004,0.0010499741,0.0085855415,0.009456999,0.9687819,0.0005142377,0.0098464005],"study_design_scores_gemma":[0.00007150813,0.00016383336,0.00087267905,0.00008900859,0.00012098034,0.00031368068,0.000441411,0.14494814,0.03788349,0.8049099,0.010128663,0.00005685098],"about_ca_topic_score_codex":0.0012438098,"about_ca_topic_score_gemma":0.0011630025,"teacher_disagreement_score":0.002974945,"about_ca_system_score_codex":0.0014740399,"about_ca_system_score_gemma":0.0015457018,"threshold_uncertainty_score":0.013273597},"labels":[],"label_agreement":null},{"id":"W76933806","doi":"10.1007/978-1-4020-9374-6_1","title":"Why Play Logical Games?","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Notice; Argument (complex analysis); Epistemology; Foundation (evidence); Focus (optics); Computer science; Philosophy; Cognitive science; Psychology; Political science; Law","score_opus":0.025420193618724496,"score_gpt":0.23547369294322434,"score_spread":0.21005349932449985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76933806","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.009076653,0.013732117,0.14588268,0.06496006,0.0017643018,0.0001197125,0.0003012159,0.0004083606,0.7637549],"genre_scores_gemma":[0.56372327,0.016301142,0.109039776,0.012569143,0.0010511867,0.0006947685,0.0005267359,0.0005115764,0.2955824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871707,0.0006484597,0.000058208654,0.00018227968,0.0002192433,0.00017466486],"domain_scores_gemma":[0.99800295,0.0014335534,0.00010632746,0.00010551852,0.00020438315,0.0001472163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023680844,0.0013878867,0.00070161826,0.0007572612,0.002024675,0.0072552767,0.0016313298,0.002653944,0.017445786],"category_scores_gemma":[0.0068529914,0.0007152703,0.00061408966,0.0007840179,0.011707207,0.013230613,0.0017612735,0.0048863976,0.0049070516],"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.000013949237,0.0000120726345,0.0000900953,0.000059900558,0.000008389284,0.000019947773,0.0005790566,0.00020787327,0.00006883606,0.97657096,0.013432217,0.00893669],"study_design_scores_gemma":[0.000011528515,0.0000073388933,0.000069997805,0.00009741793,0.0000059280746,0.000042455245,0.0005414071,0.00074269227,0.00010613928,0.94339615,0.054971483,0.0000074159198],"about_ca_topic_score_codex":0.003133343,"about_ca_topic_score_gemma":0.0057030837,"teacher_disagreement_score":0.017445786,"about_ca_system_score_codex":0.0026032,"about_ca_system_score_gemma":0.0018948169,"threshold_uncertainty_score":0.058361948},"labels":[],"label_agreement":null},{"id":"W79246384","doi":"10.1007/3-540-44469-6_70","title":"Extending Datalog with Declarative Updates","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Datalog; Deductive database; Computer science; Programming language; Logic programming; Semantics (computer science); Declarative programming; Simple (philosophy); Set (abstract data type); Extension (predicate logic); Stable model semantics; Answer set programming; Theoretical computer science; Operational semantics; Database; Programming paradigm; Inductive programming","score_opus":0.016560458609192162,"score_gpt":0.2406037956524794,"score_spread":0.22404333704328724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79246384","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.01105467,0.0005115807,0.97128445,0.0005245663,0.00024035343,0.00008600081,0.00029936325,0.006412877,0.009586241],"genre_scores_gemma":[0.2826999,0.0017787515,0.6968067,0.00096273044,0.00043188632,0.00020988284,0.0013666635,0.0023111769,0.013432214],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978934,0.0005959429,0.0003370399,0.00027448306,0.00073508313,0.00016417698],"domain_scores_gemma":[0.99272925,0.00368586,0.00022873729,0.0026299437,0.0005902164,0.00013603631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003957388,0.0008412452,0.00077633257,0.0010520592,0.0006789422,0.0029572125,0.00260857,0.00084029906,0.0040478525],"category_scores_gemma":[0.011965912,0.0013746507,0.0014669528,0.0012708277,0.001843369,0.010392222,0.0051485305,0.0025202802,0.0014513237],"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.00029534523,0.0003108023,0.0023928361,0.00085663336,0.00010615285,0.00081431173,0.0014039631,0.029973267,0.0075935726,0.4427628,0.01590861,0.49758166],"study_design_scores_gemma":[0.000096298856,0.00013397803,0.0003059963,0.00019677274,0.0001782899,0.0006960662,0.00021764229,0.12501857,0.018340731,0.74041945,0.11431614,0.00008005536],"about_ca_topic_score_codex":0.0013005444,"about_ca_topic_score_gemma":0.0020097988,"teacher_disagreement_score":0.0040478525,"about_ca_system_score_codex":0.0005297869,"about_ca_system_score_gemma":0.00085232104,"threshold_uncertainty_score":0.02092892},"labels":[],"label_agreement":null},{"id":"W83659058","doi":"10.1609/aaai.v25i1.7851","title":"Causal Theories of Actions Revisited","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Successor cardinal; Axiom; Causal theory of reference; Theory; Computer science; Causality (physics); Representation (politics); Action (physics); Causal structure; Semantics (computer science); Mathematics; Theoretical computer science; Epistemology; Programming language","score_opus":0.13105901636841177,"score_gpt":0.3014871308080306,"score_spread":0.1704281144396188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83659058","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.024688335,0.009235762,0.6650368,0.018404616,0.0009617274,0.000089792746,0.00030361494,0.00053600036,0.28074342],"genre_scores_gemma":[0.8507358,0.004938336,0.098454624,0.0030913455,0.00093266985,0.00019309737,0.00030259497,0.00021914023,0.041132376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773324,0.0009916729,0.00012548255,0.0003692241,0.0005841765,0.00019611364],"domain_scores_gemma":[0.997223,0.0016063079,0.00016867927,0.00039568153,0.000475093,0.00013125558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027274496,0.00060481083,0.00047554917,0.0017174026,0.0015535044,0.0027043393,0.0013915303,0.0017918556,0.007894314],"category_scores_gemma":[0.004706898,0.00039564326,0.0012982875,0.001249763,0.0071726358,0.006749624,0.0016816565,0.003974502,0.0008301779],"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.000002025547,0.0000015206163,0.000024520637,0.000009559949,0.000001917126,0.000016917342,0.00009728149,0.0004887107,0.000042443324,0.9974189,0.00030424903,0.0015920369],"study_design_scores_gemma":[0.000005150866,0.0000035152864,0.000042366333,0.000016565471,0.0000068022237,0.00002893484,0.000044398606,0.002679561,0.00011390229,0.9858834,0.01117167,0.000003722196],"about_ca_topic_score_codex":0.0056849634,"about_ca_topic_score_gemma":0.0044048824,"teacher_disagreement_score":0.007894314,"about_ca_system_score_codex":0.003334976,"about_ca_system_score_gemma":0.002124762,"threshold_uncertainty_score":0.02640909},"labels":[],"label_agreement":null},{"id":"W85843916","doi":"10.1007/978-3-642-28717-6_4","title":"Enfragmo: A System for Modelling and Solving Search Problems with Logic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Propositional calculus; Specification language; Programming language; Extension (predicate logic); Solver; Problem solver; Boolean satisfiability problem; Theoretical computer science; Software engineering","score_opus":0.036109215693184635,"score_gpt":0.2413221561729942,"score_spread":0.2052129404798096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85843916","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.005660109,0.00042640988,0.8625774,0.00032209832,0.00009452151,0.00026840117,0.0040725414,0.1165624,0.010016081],"genre_scores_gemma":[0.08566088,0.000836158,0.88327986,0.00051818806,0.000063079235,0.0007722186,0.008625499,0.008738913,0.011505214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993261,0.00019058022,0.00007668663,0.00016687014,0.00017382126,0.000065903034],"domain_scores_gemma":[0.9991327,0.00051308726,0.000050858318,0.00017270312,0.0000861435,0.00004451265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281859,0.0014218565,0.00079018966,0.0015110048,0.0007618092,0.0025859638,0.0036043802,0.0016541957,0.024168488],"category_scores_gemma":[0.0041234377,0.0010876035,0.002158233,0.0008239449,0.00082888006,0.004871757,0.002620738,0.0020928106,0.0056482763],"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.0018696635,0.00041427248,0.0038367743,0.0030836228,0.00035664614,0.00071049924,0.0012085538,0.121303834,0.019092487,0.2571978,0.12583585,0.46509],"study_design_scores_gemma":[0.00033114752,0.000120100915,0.0006327144,0.0002567048,0.00018873185,0.00051826943,0.000104826024,0.6213712,0.017229965,0.12430027,0.23482342,0.00012265927],"about_ca_topic_score_codex":0.005609582,"about_ca_topic_score_gemma":0.008561601,"teacher_disagreement_score":0.024168488,"about_ca_system_score_codex":0.001240718,"about_ca_system_score_gemma":0.0016652225,"threshold_uncertainty_score":0.080851674},"labels":[],"label_agreement":null},{"id":"W89866622","doi":"","title":"Who chooses the assumptions","year":2007,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"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":"Probabilistic logic; Non-monotonic logic; Adversary; Computer science; Mathematical economics; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.017955225663113136,"score_gpt":0.26251587488849515,"score_spread":0.244560649225382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89866622","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.01882121,0.003025091,0.6486669,0.05672674,0.001588786,0.00034256466,0.0008379379,0.0006388748,0.26935187],"genre_scores_gemma":[0.7338713,0.0048866505,0.18489088,0.015546732,0.0012955128,0.00056621997,0.0011175668,0.0007927245,0.05703239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97985864,0.009702403,0.0012238891,0.003455092,0.00420818,0.0015518471],"domain_scores_gemma":[0.9760448,0.011390682,0.002221611,0.006129966,0.0030270496,0.0011858994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019950718,0.0010718681,0.0010844066,0.001245549,0.003228247,0.008148591,0.0035276448,0.0040381965,0.01506021],"category_scores_gemma":[0.030128505,0.0011854696,0.0014406665,0.0008415186,0.008234447,0.019053604,0.0055638268,0.006428112,0.0058748997],"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.000090735826,0.000031489977,0.0011260924,0.00014622758,0.00007085381,0.0002919211,0.0021557116,0.0014022922,0.00072417076,0.96804696,0.0072650476,0.018648464],"study_design_scores_gemma":[0.000027459064,0.00004355443,0.00034904425,0.0003199481,0.00009365138,0.00025574566,0.0017750881,0.0047679357,0.0026861336,0.8322922,0.15732148,0.000067769026],"about_ca_topic_score_codex":0.003236043,"about_ca_topic_score_gemma":0.0023255055,"teacher_disagreement_score":0.019950718,"about_ca_system_score_codex":0.0030835015,"about_ca_system_score_gemma":0.0041956645,"threshold_uncertainty_score":0.10551071},"labels":[],"label_agreement":null},{"id":"W900043438","doi":"","title":"Enfragmo: A System for Grounding Extended First-Order Logic to SAT","year":2014,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Computer science; Constraint programming; Solver; Axiom; Theoretical computer science; Logic programming; Programming language; Mathematical optimization; Mathematics","score_opus":0.014629767401478068,"score_gpt":0.22945809127070368,"score_spread":0.21482832386922562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W900043438","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.0026146993,0.0004964608,0.886562,0.00084278,0.00029846895,0.0004854753,0.00424427,0.08526999,0.019185876],"genre_scores_gemma":[0.05490347,0.001080447,0.9066468,0.0015414823,0.00020568624,0.0016610572,0.0139562795,0.008912413,0.011092455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996793,0.0010754433,0.0003397122,0.00059199415,0.0008514949,0.00034838036],"domain_scores_gemma":[0.99668366,0.002029079,0.00022178788,0.00068317173,0.00028777844,0.00009443917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037839743,0.002025772,0.0013395669,0.0029333227,0.001544227,0.005160942,0.004985204,0.0023048501,0.031011267],"category_scores_gemma":[0.012598893,0.0023108392,0.005588796,0.0020057687,0.0027120474,0.0077805654,0.008285833,0.0059828707,0.0097160805],"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.0005293582,0.00023671743,0.0015241337,0.0016548425,0.00028955832,0.00086744304,0.0010221578,0.05337097,0.0047473814,0.7006551,0.080151,0.15495135],"study_design_scores_gemma":[0.00029299647,0.00012981963,0.00041712093,0.0004901131,0.00013128227,0.00049206824,0.00013384758,0.19806226,0.00801262,0.42116138,0.3705576,0.00011893666],"about_ca_topic_score_codex":0.006741119,"about_ca_topic_score_gemma":0.011797312,"teacher_disagreement_score":0.031011267,"about_ca_system_score_codex":0.0025671415,"about_ca_system_score_gemma":0.0034086911,"threshold_uncertainty_score":0.10374296},"labels":[],"label_agreement":null},{"id":"W94026528","doi":"10.4324/9781315789354-45","title":"The Effect of Syntactic Form on Simple Belief Revisions and Updates","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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 Alberta","funders":"","keywords":"Simple (philosophy); Computer science; Linguistics; Natural language processing; Epistemology; Philosophy","score_opus":0.008593124110604393,"score_gpt":0.2336535980140159,"score_spread":0.2250604739034115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94026528","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.9007424,0.00065778114,0.018956266,0.00091705786,0.00009395635,0.00020741377,0.00017412072,0.00031941972,0.077931605],"genre_scores_gemma":[0.987961,0.0001970127,0.008010069,0.00019238799,0.00004572658,0.000074431955,0.00010878986,0.00011013555,0.0033004673],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926239,0.0046136295,0.0003176405,0.00075236213,0.0014812672,0.00021126974],"domain_scores_gemma":[0.84155315,0.13982913,0.007983195,0.007226364,0.002490655,0.0009174626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052820276,0.0004916462,0.00039716292,0.0005172054,0.00053604663,0.0026830495,0.0009549946,0.0010648317,0.011548349],"category_scores_gemma":[0.09988403,0.00048066248,0.00054796116,0.00049413694,0.0019771934,0.0056391726,0.0015259738,0.0018603251,0.0007269778],"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.010014754,0.0028058533,0.08418327,0.0022525557,0.00053215533,0.0010397972,0.026768954,0.023914834,0.08288125,0.21569504,0.0047707716,0.54514074],"study_design_scores_gemma":[0.0017350831,0.0054170596,0.27764043,0.00041302328,0.0013055854,0.0023306692,0.0048944163,0.105299585,0.043200087,0.54038227,0.016974926,0.00040677938],"about_ca_topic_score_codex":0.0006133541,"about_ca_topic_score_gemma":0.0005698313,"teacher_disagreement_score":0.011548349,"about_ca_system_score_codex":0.00071456714,"about_ca_system_score_gemma":0.0003785529,"threshold_uncertainty_score":0.03863305},"labels":[],"label_agreement":null},{"id":"W953240217","doi":"","title":"The Frame Problem in Artificial Intelligence and Philosophy","year":2013,"lang":"en","type":"article","venue":"PhilPapers (PhilPapers Foundation)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"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","funders":"","keywords":"Frame problem; Frame (networking); Artificial intelligence; Computer science; Relevance (law); Field (mathematics); Holism; Commonsense reasoning; Epistemology; Artificial general intelligence; Theme (computing); Philosophy; Mathematics; Political science","score_opus":0.02434624462529476,"score_gpt":0.24005594107611677,"score_spread":0.21570969645082202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W953240217","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.015582642,0.08691306,0.3637322,0.1343691,0.0044512264,0.00012425939,0.00042613692,0.0003418351,0.3940595],"genre_scores_gemma":[0.73406875,0.040088985,0.14785172,0.019998634,0.0076918365,0.0006340436,0.0006689226,0.00029989224,0.04869724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956623,0.0023710541,0.00019123794,0.0006623257,0.000816796,0.00029626433],"domain_scores_gemma":[0.9964664,0.002439362,0.00018030548,0.0003886161,0.00035096722,0.00017426893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006229564,0.0007980019,0.0009774747,0.0020565044,0.005082366,0.006768722,0.0015902679,0.0049917884,0.0059292703],"category_scores_gemma":[0.0069666943,0.0006053587,0.0012287765,0.00234847,0.030078197,0.016021546,0.003259686,0.009081848,0.0013020043],"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.0000023021832,0.0000013265768,0.000012888394,0.000012078993,0.0000011892865,0.0000069013454,0.00015475332,0.00004542057,0.000009089971,0.9976041,0.0009861836,0.0011638821],"study_design_scores_gemma":[0.0000034943425,0.0000029910423,0.000018246086,0.000021980033,0.0000013783504,0.000015649657,0.00007443958,0.0001898126,0.00001643833,0.98610526,0.013547366,0.0000029934909],"about_ca_topic_score_codex":0.0053760093,"about_ca_topic_score_gemma":0.0024997757,"teacher_disagreement_score":0.006768722,"about_ca_system_score_codex":0.0065201484,"about_ca_system_score_gemma":0.0030224922,"threshold_uncertainty_score":0.047307253},"labels":[],"label_agreement":null},{"id":"W972909139","doi":"10.1609/aaai.v27i1.8612","title":"Progression of Decomposed Situation Calculus Theories","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Russian Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Forgetting; Decomposition; Situation calculus; Computer science; Scope (computer science); Subject (documents); Theory; Signature (topology); Action (physics); Calculus (dental); Theoretical computer science; Artificial intelligence; Mathematics; Cognitive psychology; Programming language; Psychology","score_opus":0.04310182647796734,"score_gpt":0.29605306193335074,"score_spread":0.2529512354553834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W972909139","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.104642294,0.0008602451,0.86401665,0.0010129028,0.00016174067,0.00033923885,0.0005564299,0.001378772,0.027031759],"genre_scores_gemma":[0.6766508,0.0010394811,0.30575517,0.0003483375,0.00019949455,0.00036629554,0.0011611178,0.0003625778,0.0141167585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610823,0.00079069217,0.00031238783,0.00080744526,0.0014542722,0.0005268944],"domain_scores_gemma":[0.9950047,0.0019342575,0.0004292244,0.0010072846,0.0011088138,0.00051571266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048924694,0.00087367353,0.00082163204,0.0032435006,0.0019714884,0.004511647,0.0018949385,0.0011869057,0.0072610797],"category_scores_gemma":[0.0113274595,0.0009912768,0.0032523088,0.0017864505,0.0049913744,0.01043415,0.0048357667,0.004542363,0.0010813047],"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.000083402636,0.000026572332,0.0005395373,0.00009139891,0.000029402683,0.00048190422,0.0014881953,0.005193341,0.0020574105,0.978613,0.00055219175,0.010843637],"study_design_scores_gemma":[0.000043105203,0.000045034194,0.00021976703,0.000050173727,0.000041285795,0.00018525787,0.00017610057,0.020615373,0.0015058644,0.9711112,0.005979924,0.000026964695],"about_ca_topic_score_codex":0.0038953847,"about_ca_topic_score_gemma":0.0024059755,"teacher_disagreement_score":0.0072610797,"about_ca_system_score_codex":0.0029995395,"about_ca_system_score_gemma":0.0021174024,"threshold_uncertainty_score":0.025874138},"labels":[],"label_agreement":null},{"id":"W98645773","doi":"","title":"Consistency-based approaches to merging knowledge bases: preliminary report.","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"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":"Belief revision; Merge (version control); Consistency (knowledge bases); Computer science; Knowledge base; Operator (biology); Logical consequence; Belief structure; Data integrity; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Information retrieval","score_opus":0.0793133561411651,"score_gpt":0.25931479510787375,"score_spread":0.18000143896670867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98645773","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.0051677194,0.0021336551,0.98359734,0.0009725203,0.00007482584,0.00023295435,0.00010535584,0.00032857092,0.0073869796],"genre_scores_gemma":[0.08974691,0.0015807061,0.90365475,0.00031918247,0.00021370244,0.0002911852,0.00044916192,0.00011985186,0.0036245068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898201,0.0042394944,0.0008675675,0.0012738402,0.0034068637,0.00039202048],"domain_scores_gemma":[0.95901555,0.026934447,0.0018682504,0.006244141,0.005136692,0.0008009435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021355381,0.000695357,0.0007154789,0.0026437063,0.0018391554,0.0054218853,0.0048569404,0.0019530822,0.011970907],"category_scores_gemma":[0.053643826,0.0013724202,0.0027934376,0.0035654723,0.0030668161,0.014055384,0.004753174,0.0047599776,0.0015507842],"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.00014949698,0.00020460607,0.0021743106,0.0006945142,0.000233051,0.0002506685,0.0024286404,0.012233122,0.0027967466,0.6898627,0.0067798137,0.28219226],"study_design_scores_gemma":[0.000102367856,0.0003217847,0.0021391637,0.0003977315,0.00032246253,0.0013072169,0.0012171152,0.16340314,0.012653511,0.7341133,0.08387116,0.00015108212],"about_ca_topic_score_codex":0.0050131995,"about_ca_topic_score_gemma":0.004993778,"teacher_disagreement_score":0.021355381,"about_ca_system_score_codex":0.002693056,"about_ca_system_score_gemma":0.0027231043,"threshold_uncertainty_score":0.11293936},"labels":[],"label_agreement":null},{"id":"W987632048","doi":"","title":"WHAT IS WRONG WITH NEGATIVE PROPERTIES","year":2004,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","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":"Université de Moncton","funders":"","keywords":"Negation; Predicate (mathematical logic); Metaphysics; Linguistics; Negation as failure; Computer science; Scope (computer science); Natural language processing; Artificial intelligence; Epistemology; Philosophy; Autoepistemic logic; Programming language","score_opus":0.02301858966356074,"score_gpt":0.2310777661210998,"score_spread":0.20805917645753905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W987632048","genre_codex":"commentary","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.024427429,0.013912014,0.041694324,0.65800214,0.008107673,0.000050441624,0.00026524777,0.0003837907,0.2531569],"genre_scores_gemma":[0.7916945,0.012669507,0.017311255,0.14841257,0.008608116,0.00016272067,0.00031053592,0.00067905104,0.020151746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916746,0.0037958976,0.0005237387,0.0013415416,0.0020161648,0.0006481495],"domain_scores_gemma":[0.9762997,0.013422251,0.0013854606,0.0031853563,0.0048741596,0.0008330898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0125324335,0.00069140905,0.0011859162,0.0018856487,0.0056807953,0.0070084594,0.0023699766,0.00843224,0.007885371],"category_scores_gemma":[0.03439329,0.0005611085,0.0013342706,0.0014168338,0.04405629,0.03244561,0.0036757484,0.0094687035,0.0025909534],"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.000031962245,0.000020508109,0.0004412698,0.0001502442,0.000033330194,0.00017559364,0.001550846,0.00015970763,0.00018686749,0.9614714,0.022383826,0.013394473],"study_design_scores_gemma":[0.000012600022,0.000005447951,0.00014463387,0.00010920901,0.000011054518,0.00014685324,0.00071734766,0.00015275273,0.0001237892,0.96912676,0.02943619,0.000013502725],"about_ca_topic_score_codex":0.0042050504,"about_ca_topic_score_gemma":0.0026089575,"teacher_disagreement_score":0.0125324335,"about_ca_system_score_codex":0.0037266305,"about_ca_system_score_gemma":0.0017163008,"threshold_uncertainty_score":0.06627858},"labels":[],"label_agreement":null},{"id":"W99348081","doi":"","title":"Special Track on Uncertain Reasoning","year":2009,"lang":"en","type":"article","venue":"The Florida AI Research Society","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 Lethbridge","funders":"","keywords":"Computer science; Track (disk drive); Artificial intelligence","score_opus":0.06587527145134546,"score_gpt":0.36321731745724745,"score_spread":0.29734204600590197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99348081","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.0012960046,0.05484634,0.019419929,0.081984304,0.64675283,0.00050807477,0.0023234433,0.0014182648,0.19145079],"genre_scores_gemma":[0.0106469765,0.035141617,0.0059184344,0.014455386,0.51947606,0.00048782286,0.004578745,0.0017082545,0.4075867],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.993838,0.0010856031,0.0003498806,0.0012956855,0.0027673994,0.00066333404],"domain_scores_gemma":[0.9749717,0.0069442247,0.0007030853,0.0019166444,0.008654367,0.0068099047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008517716,0.0028351976,0.0044662124,0.0051708845,0.0054985206,0.017636118,0.004025094,0.006840648,0.17542209],"category_scores_gemma":[0.021416958,0.0010870011,0.0037890465,0.006361023,0.0018797624,0.014945983,0.007855046,0.012317656,0.08274214],"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.000059674694,0.000059252274,0.00012458525,0.00020519487,0.000022462958,0.000059669568,0.00004035289,0.00019849894,0.00013401336,0.0068183662,0.95467913,0.037598774],"study_design_scores_gemma":[0.00003504286,0.00011067756,0.00038671974,0.00038203193,0.000036012225,0.00014557465,0.00007949691,0.00093410036,0.00022155419,0.01500086,0.982631,0.00003688554],"about_ca_topic_score_codex":0.0033012377,"about_ca_topic_score_gemma":0.006041111,"teacher_disagreement_score":0.17542209,"about_ca_system_score_codex":0.0058439346,"about_ca_system_score_gemma":0.00500139,"threshold_uncertainty_score":0.58684534},"labels":[],"label_agreement":null},{"id":"W99925727","doi":"10.1007/978-3-642-30743-0_12","title":"Considerations on Belief Revision in an Action Theory","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Belief revision; Action (physics); Cognitive science; Artificial intelligence; Psychology","score_opus":0.04010382273079914,"score_gpt":0.28847243365819664,"score_spread":0.24836861092739748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99925727","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.022741787,0.0064694565,0.5174105,0.04581775,0.001671363,0.00020021717,0.00033914825,0.0002586028,0.40509123],"genre_scores_gemma":[0.82060087,0.0027152933,0.13708496,0.004552246,0.0035337028,0.0007535468,0.00029372732,0.0002215605,0.030244105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901962,0.005563703,0.0006874929,0.0009841544,0.0017826189,0.00078579545],"domain_scores_gemma":[0.97772837,0.01764492,0.00055020535,0.0019147983,0.0014857599,0.0006760055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012634475,0.0012072329,0.0016521999,0.002307146,0.0038156756,0.008373157,0.0045481534,0.008461115,0.0137156295],"category_scores_gemma":[0.022990113,0.0012630335,0.0027955156,0.0018177233,0.013186009,0.01660202,0.0034398085,0.01068769,0.0012445641],"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.000010455294,0.000005511928,0.000015727543,0.000016400665,0.0000054942157,0.00001521988,0.00007259689,0.0005318178,0.000027837157,0.99765563,0.00043812694,0.001205165],"study_design_scores_gemma":[0.000007852648,0.0000064145624,0.000019332416,0.000011585071,0.0000041090566,0.000014995113,0.000020252624,0.0014301446,0.00003313307,0.9973923,0.001055039,0.0000047737585],"about_ca_topic_score_codex":0.0031883218,"about_ca_topic_score_gemma":0.0028808822,"teacher_disagreement_score":0.0137156295,"about_ca_system_score_codex":0.0052593704,"about_ca_system_score_gemma":0.0019525943,"threshold_uncertainty_score":0.0668183},"labels":[],"label_agreement":null}]}